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.

 

An extension and analysis of the Shu-Osher representation of Runge-Kutta methods
HTML articles powered by AMS MathViewer

by L. Ferracina and M. N. Spijker PDF
Math. Comp. 74 (2005), 201-219 Request permission

Abstract:

In the context of solving nonlinear partial differential equations, Shu and Osher introduced representations of explicit Runge-Kutta methods, which lead to stepsize conditions under which the numerical process is total-variation-diminishing (TVD). Much attention has been paid to these representations in the literature. In general, a Shu-Osher representation of a given Runge-Kutta method is not unique. Therefore, of special importance are representations of a given method which are best possible with regard to the stepsize condition that can be derived from them. Several basic questions are still open, notably regarding the following issues: (1) the formulation of a simple and general strategy for finding a best possible Shu-Osher representation for any given Runge-Kutta method; (2) the question of whether the TVD property of a given Runge-Kutta method can still be guaranteed when the stepsize condition, corresponding to a best possible Shu-Osher representation of the method, is violated; (3) the generalization of the Shu-Osher approach to general (possibly implicit) Runge-Kutta methods. In this paper we give an extension and analysis of the original Shu-Osher representation, by means of which the above questions can be settled. Moreover, we clarify analogous questions regarding properties which are referred to, in the literature, by the terms monotonicity and strong-stability-preserving (SSP).
References
Similar Articles
  • Retrieve articles in Mathematics of Computation with MSC (2000): 65M20, 65L05, 65L06
  • Retrieve articles in all journals with MSC (2000): 65M20, 65L05, 65L06
Additional Information
  • L. Ferracina
  • Affiliation: Mathematical Institute, Leiden University, Niels Bohrweg 1, 2333 CA Leiden, The Netherlands
  • Email: ferra@math.leidenuniv.nl
  • M. N. Spijker
  • Affiliation: Mathematical Institute, Leiden University, Niels Bohrweg 1, 2333 CA Leiden, The Netherlands
  • Email: spijker@math.leidenuniv.nl
  • Received by editor(s): May 7, 2003
  • Received by editor(s) in revised form: August 3, 2003
  • Published electronically: June 11, 2004
  • © Copyright 2004 American Mathematical Society
  • Journal: Math. Comp. 74 (2005), 201-219
  • MSC (2000): Primary 65M20; Secondary 65L05, 65L06
  • DOI: https://doi.org/10.1090/S0025-5718-04-01664-3
  • MathSciNet review: 2085408