Abstract
Embedded pairs of explicit Runge-Kutta formulae have been widely used for the numerical integration of non-stiff systems of first order ordinary differential equations. Because explicit Runge-Kutta formulae do not in general have a natural underlying interpolant, most implementations of these formulae restrict the steplength of integration so as to "hit" all output points exactly. Clearly this will normally lead to gross inefficiency when output is requested at many points and this is widely recognised as being a major disadvantage of explicit Runge-Kutta formulae. In addition there are some classes of problems for which an interpolation capability is indispensible. Recently the present author has proposed the use of block explicit Runge-Kutta formulae which advance the integration by more than one step at a time. One of the advantages of these block formulae is that they require less function evaluations per step than standard explicit Runge-Kutta formulae of the same order. In this paper we analyse completely the 5(4) two step Runge-Kutta formula with the minimum number of stages and show that it is possible to obtain a Runge-Kutta formula of this class with "free" interpolation capabilities. Some numerical results are given to compare the performance of a particular block 5(4) Runge-Kutta method with that of the widely used code RKF45 of Shampine and Watts.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
J.C. Butcher, Coefficients for the study of Runge-Kutta integration processes, J. Austral.Math.Soc., 3, 1963, pp185–201.
J.R. Cash, Block Runge-Kutta methods for the numerical integration of initial value problems in ordinary differential equations, Part 1 — the non-stiff case, Math. Comp. 40, 1983, pp175–192.
J.R. Cash, Block embedded explicit Runge-Kutta methods, J. Comp. and Math. with Applics., to appear.
R. England, Error estimates for Runge-Kutta type solutions to systems of ordinary differential equations, Computer J., 12, 1969, pp166–170.
M.K. Horn, Scaled Runge-Kutta algorithms for handling dense output, Rep. DFVLR-FB81-13, DFVLR, Oberpfaffenhofen, F.R.G., 1981.
M.K. Horn, Scaled Runge-Kutta algorithms for treating the problem of dense output Rep NASA TMX-58239, L.B. Johnson Space Center, Houston, Tx., 1982.
M.K. Horn, Fourth-and fifth order, scaled Runge-Kutta algorithms for treating dense output, SIAM J. Numer.Anal. 20, 1983, pp558–568.
T.E. Hull, W.H. Enright, B.M. Fellen and A.E. Sedgewick, Comparing numerical methods for ordinary differential equations, SIAM J.Numer.Anal.,9, 1972, pp603–637.
T.E. Hull, W.H. Enright and K.R. Jackson, User's guide for DVERK — a subroutine for solving non-stiff ODE's, Rep 100, Dept. Computer Science, University of Toronto, Canada, 1976.
J.D. Lambert, Computational Methods in Ordinary Differential Equations, London, Wiley 1973.
L.F. Shampine, Interpolation for Runge-Kutta methods, Rep SAND83-25 60, Sandia National Laboratories, January 1984
L.F. Shampine, Some practical Runge-Kutta formulas, Rep. SAND84-0812, Sandia National Laboratories, April 1984.
L.F. Shampine and H.A. Watts, DEPAC — design of a user oriented package of ODE solvers, Rep SAND 79–2374, Sandia National Laboratories, 1980.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1986 Springer-Verlag
About this paper
Cite this paper
Cash, J.R. (1986). A block 5(4) explicit runge-kutta formula with "free" interpolation. In: Hennart, JP. (eds) Numerical Analysis. Lecture Notes in Mathematics, vol 1230. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0072683
Download citation
DOI: https://doi.org/10.1007/BFb0072683
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-17200-0
Online ISBN: 978-3-540-47379-4
eBook Packages: Springer Book Archive