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.
[1]
J. Verner.
Explicit Runge–Kutta Methods with Estimates of the Local Truncation Error
,
1978
.
[2]
J. Dormand,et al.
A family of embedded Runge-Kutta formulae
,
1980
.
[3]
J. Dormand,et al.
High order embedded Runge-Kutta formulae
,
1981
.
[4]
Marino Zennaro,et al.
Derivation of Efficient, Continuous, Explicit Runge-Kutta Methods
,
1992,
SIAM J. Sci. Comput..
[5]
J. H. Verner,et al.
Differentiable interpolants for high-order Runge-Kutta methods
,
1993
.
[6]
Marino Zennaro,et al.
Order barriers for continuous explicit Runge-Kutta methods
,
1991
.
[7]
Wayne H. Enright,et al.
Interpolants for Runge-Kutta formulas
,
1986,
TOMS.