Global optimization of explicit strong-stability-preserving Runge-Kutta methods
Open Access
- 16 September 2005
- journal article
- Published by American Mathematical Society (AMS) in Mathematics of Computation
- Vol. 75 (253) , 183-207
- https://doi.org/10.1090/s0025-5718-05-01772-2
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.Keywords
This publication has 26 references indexed in Scilit:
- On Strong Stability Preserving Time Discretization MethodsJournal of Scientific Computing, 2004
- An extension and analysis of the Shu-Osher representation of Runge-Kutta methodsMathematics of Computation, 2004
- Stepsize Restrictions for the Total-Variation-Diminishing Property in General Runge--Kutta MethodsSIAM Journal on Numerical Analysis, 2004
- Monotonicity-Preserving Linear Multistep MethodsSIAM Journal on Numerical Analysis, 2003
- Strong Stability Preserving Properties of Runge–Kutta Time Discretization Methods for Linear Constant Coefficient OperatorsJournal of Scientific Computing, 2003
- Strong Stability-Preserving High-Order Time Discretization MethodsSIAM Review, 2001
- Low-storage, explicit Runge–Kutta schemes for the compressible Navier–Stokes equationsApplied Numerical Mathematics, 2000
- Total variation diminishing Runge-Kutta schemesMathematics of Computation, 1998
- Global OptimizationPublished by Springer Nature ,1993
- Practical optimization, by P. E. Gill, W. Murray and M. H. Wright. Pp 402. £19·20. 1981. ISBN 0-12-283-950-1 (Academic Press)The Mathematical Gazette, 1982