Journal
SIAM JOURNAL ON NUMERICAL ANALYSIS
Volume 40, Issue 2, Pages 469-491Publisher
SIAM PUBLICATIONS
DOI: 10.1137/S0036142901389025
Keywords
strong stability preserving; total variation diminishing; Runge-Kutta methods; high-order accuracy; time discretization
Categories
Ask authors/readers for more resources
Strong-stability-preserving (SSP) time discretization methods have a nonlinear stability property that makes them particularly suitable for the integration of hyperbolic conservation laws where discontinuous behavior is present. Optimal SSP schemes have been previously found for methods of order 1, 2, and 3, where the number of stages s equals the order p. An optimal low-storage SSP scheme with s = p = 3 is also known. In this paper, we present a new class of optimal high-order SSP and low-storage SSP Runge-Kutta schemes with s > p. We find that these schemes are ultimately more efficient than the known schemes with s = p because the increase in the allowable time step more than offsets the added computational expense per step. We demonstrate these efficiencies on a set of scalar conservation laws.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available