Skip to Main Content

Mathematics of Computation

Published by the American Mathematical Society since 1960 (published as Mathematical Tables and other Aids to Computation 1943-1959), Mathematics of Computation is devoted to research articles of the highest quality in computational mathematics.

ISSN 1088-6842 (online) ISSN 0025-5718 (print)

The 2020 MCQ for Mathematics of Computation is 1.78.

What is MCQ? The Mathematical Citation Quotient (MCQ) measures journal impact by looking at citations over a five-year period. Subscribers to MathSciNet may click through for more detailed information.

 

Global optimization of explicit strong-stability-preserving Runge-Kutta methods
HTML articles powered by AMS MathViewer

by Steven J. Ruuth PDF
Math. Comp. 75 (2006), 183-207 Request permission

Abstract:

Strong-stability-preserving Runge-Kutta (SSPRK) methods are a type of time discretization method that are widely used, especially for the time evolution of hyperbolic partial differential equations (PDEs). Under a suitable stepsize restriction, these methods share a desirable nonlinear stability property with the underlying PDE; e.g., positivity or stability with respect to total variation. This is of particular interest when the solution exhibits shock-like or other nonsmooth behaviour. A variety of optimality results have been proven for simple SSPRK methods. However, the scope of these results has been limited to low-order methods due to the detailed nature of the proofs. In this article, global optimization software, BARON, is applied to an appropriate mathematical formulation to obtain optimality results for general explicit SSPRK methods up to fifth-order and explicit low-storage SSPRK methods up to fourth-order. Throughout, our studies allow for the possibility of negative coefficients which correspond to downwind-biased spatial discretizations. Guarantees of optimality are obtained for a variety of third- and fourth-order schemes. Where optimality is impractical to guarantee (specifically, for fifth-order methods and certain low-storage methods), extensive numerical optimizations are carried out to derive numerically optimal schemes. As a part of these studies, several new schemes arise which have theoretically improved time-stepping restrictions over schemes appearing in the recent literature.
References
Similar Articles
  • Retrieve articles in Mathematics of Computation with MSC (2000): 65L06, 65M20
  • Retrieve articles in all journals with MSC (2000): 65L06, 65M20
Additional Information
  • Steven J. Ruuth
  • Affiliation: Department of Mathematics and Statistics, Simon Fraser University, Burnaby, British Columbia, Canada V5A 1S6
  • Email: sruuth@sfu.ca
  • Received by editor(s): July 2, 2003
  • Received by editor(s) in revised form: August 31, 2004
  • Published electronically: September 16, 2005
  • Additional Notes: This work was partially supported by a grant from NSERC Canada.
  • © Copyright 2005 American Mathematical Society
  • Journal: Math. Comp. 75 (2006), 183-207
  • MSC (2000): Primary 65L06, 65M20
  • DOI: https://doi.org/10.1090/S0025-5718-05-01772-2
  • MathSciNet review: 2176394