Remote Access Mathematics of Computation
Green Open Access

Mathematics of Computation

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

 

 

Continuous explicit Runge-Kutta methods of order $ 5$


Authors: J. H. Verner and M. Zennaro
Journal: Math. Comp. 64 (1995), 1123-1146
MSC: Primary 65L06; Secondary 65Y20
DOI: https://doi.org/10.1090/S0025-5718-1995-1284672-4
MathSciNet review: 1284672
Full-text PDF Free Access

Abstract | References | Similar Articles | Additional Information

Abstract: A continuous explicit Runge-Kutta (CERK) method provides a continuous approximation to an initial value problem. Such a method may be obtained by appending additional stages to a discrete method, or alternatively by solving the appropriate order conditions directly. Owren and Zennaro have shown for order 5 that the latter approach yields some CERK methods that require fewer derivative evaluations than methods obtained by appending stages. In contrast, continuous methods of order 6 that require the minimum number of stages can be obtained by appending additional stages to certain discrete methods. This article begins a study to understand why this occurs. By making no assumptions to simplify solution of the order conditions, the existence of other types of CERK methods of order 5 is established. While methods of the new families may not be as good for implementation as the Owren-Zennaro methods, the structure is expected to lead to a better understanding of how to construct families of methods of higher order.


References [Enhancements On Off] (What's this?)


Similar Articles

Retrieve articles in Mathematics of Computation with MSC: 65L06, 65Y20

Retrieve articles in all journals with MSC: 65L06, 65Y20


Additional Information

DOI: https://doi.org/10.1090/S0025-5718-1995-1284672-4
Keywords: Interpolants, continuous explicit Runge-Kutta methods
Article copyright: © Copyright 1995 American Mathematical Society