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.

 

Order barriers for continuous explicit Runge-Kutta methods
HTML articles powered by AMS MathViewer

by Brynjulf Owren and Marino Zennaro PDF
Math. Comp. 56 (1991), 645-661 Request permission

Abstract:

In this paper we deal with continuous numerical methods for solving initial value problems for ordinary differential equations, the need for which occurs frequently in applications. Whereas most of the commonly used multi-step methods provide continuous extensions by means of an interpolant which is available without making extra function evaluations, this is not always the case for one-step methods. We consider the class of explicit Runge-Kutta methods and provide theorems used to obtain lower bounds for the number of stages required to construct methods of a given uniform order p. These bounds are similar to the Butcher barriers known for the discrete case, and are derived up to order $p = 5$. As far as we know, the examples we present of 8-stage continuous Runge-Kutta methods of uniform order 5 are the first of their kind.
References
Similar Articles
  • Retrieve articles in Mathematics of Computation with MSC: 65L06
  • Retrieve articles in all journals with MSC: 65L06
Additional Information
  • © Copyright 1991 American Mathematical Society
  • Journal: Math. Comp. 56 (1991), 645-661
  • MSC: Primary 65L06
  • DOI: https://doi.org/10.1090/S0025-5718-1991-1068811-2
  • MathSciNet review: 1068811