compact schemes
This repository exemplifies the most clean and minimalistic way to program conservative compact schemes for solving systems of equations such as Navier-Stokes or Euler-Equations.
This short and extremely versatile implementation of conservative compact schemes is possible thanks to three ingredients:
1. A Taylor Table algorithm (see: Easy build compact schemes).
2. An ingenious spare technique to produce highly performing discrete finite-difference operations in higher-dimensions. (see: Easy build finite-difference operators).
3. The conservative boundary schemes by Brady and Livescu (2019).
Here we reproduce some of the invicid benchmark tests proposed by Brady and Livescu (2019).
Cite As
Manuel A. Diaz (2024). compact schemes (https://github.com/wme7/compact_schemes/releases/tag/v1.0.0), GitHub. Retrieved .
MATLAB Release Compatibility
Platform Compatibility
Windows macOS LinuxTags
Acknowledgements
Inspired by: Easy build compact schemes, Easy build finite-difference operators
Inspired: Compact Filters with Holes, Order of accuracy & Stability
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!Discover Live Editor
Create scripts with code, output, and formatted text in a single executable document.
BradyLivescu2019/E4
BradyLivescu2019/E6
BradyLivescu2019/E8
BradyLivescu2019/T4
BradyLivescu2019/T6
BradyLivescu2019/T8
Version | Published | Release Notes | |
---|---|---|---|
1.0.0 |