A class of ENO schemes with adaptive order for solving hyperbolic conservation laws
Hua Shen

TL;DR
This paper introduces ENO schemes with adaptive order that select optimal stencils based on novel smoothness indicators, improving accuracy and robustness in solving hyperbolic conservation laws.
Contribution
The paper presents a new class of ENO schemes with adaptive order using innovative smoothness indicators for stencil selection, enhancing solution accuracy.
Findings
Demonstrated high accuracy on benchmark tests
Schemes are robust across various test cases
Adaptive order improves computational efficiency
Abstract
We propose a class of essentially non-oscillatory schemes with adaptive order (ENO-AO) for solving hyperbolic conservation laws. The new schemes select candidate stencils by novel smoothness indicators which are the measurements of the minimum discrepancy between the reconstructed polynomials and the neighboring cell averages. The new smoothness indicators measure the smoothness of candidate stencils with unequal sizes in a uniform way, so that we can directly use them to select the optimal stencil from candidates that range from first-order all the way up to the designed high-order. Some benchmark test cases are carried out to demonstrate the accuracy and robustness of the proposed schemes.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputational Fluid Dynamics and Aerodynamics · Fluid Dynamics and Turbulent Flows · Advanced Numerical Methods in Computational Mathematics
