articleSIAM Journal on Numerical AnalysisJan 1, 2002Closed access

A New Class of Optimal High-Order Strong-Stability-Preserving Time Discretization Methods

Acadia University · Simon Fraser University

Indexed incrossref

Abstract

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…

Citation impact

860
total citations
FWCI
24.01
Percentile
100%
References
22
Citations per year

Authors

2

Topics & keywords

Keywords
  • Discretization
  • Conservation law
  • Mathematics
  • Stability (learning theory)
  • Scalar (mathematics)
  • Applied mathematics
  • Class (philosophy)
  • Nonlinear system
UN Sustainable Development Goals
  • Life in Land
No related works found for this paper.