Abstract
Harten, Lax, and van Leer showed how to construct a simple approximate Riemann solution which contains only one intermediate step. This construction assumes that you have a priori bounds on the smallest and largest signal velocities in the exact Riemann solution.Here we propose a number of algorithms for obtaining these bounds. Heuristic arguments are presented to support our choice of bounds. We derive first-order schemes which use these approximate Riemann solutions and show their relationship to known finite difference schemes.Next, we use the approach of van Leer et al. [1] to construct second-order schemes based on these approximate Riemann solutions. Of particular interest is a central difference scheme requiring no upwind switches. This scheme is only slightly more complex than standard predictor–corrector finite difference schemes. Preliminary numerical results are presented which show that these schemes are nonoscillatory, have good shock resolution and produce results which are competitive with those produced by more complex second order Godunov-type schemes.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: SIAM Journal on Scientific and Statistical Computing
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
