A block 6(4) Runge-Kutta formula for nonstiff initial value problems
- 1 March 1989
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Mathematical Software
- Vol. 15 (1) , 15-28
- https://doi.org/10.1145/62038.62042
Abstract
A new selection is made for an efficient two-step block Runge-Kutta formula of order 6. The new formula is developed using some of the efficiency criteria recently investigated by Shampine, and as a result, a block formula with much improved performance is obtained. An important property of this new formula is that there is a “natural” interpolating polynomial available. This can be used to compute approximate solution values at off-step points without the need to compute any additional function evaluations. The quality of this interpolant is examined, and it is shown to have certain desirable properties. The performance of the new block Runge-Kutta formula is evaluated using the DETEST test set and is shown to be more efficient than certain other standard Runge-Kutta formulas for this particular test set.Keywords
This publication has 9 references indexed in Scilit:
- A family of embedded Runge-Kutta formulaePublished by Elsevier ,2006
- Practical Aspects of Interpolation in Runge-Kutta CodesSIAM Journal on Scientific and Statistical Computing, 1987
- Some Practical Runge-Kutta FormulasMathematics of Computation, 1986
- Interpolation for Runge–Kutta MethodsSIAM Journal on Numerical Analysis, 1985
- Block embedded explicit runge-kutta methodsComputers & Mathematics with Applications, 1985
- High order embedded Runge-Kutta formulaeJournal of Computational and Applied Mathematics, 1981
- Error estimates for Runge-Kutta type solutions to systems of ordinary differential equationsThe Computer Journal, 1969
- Implicit Runge-Kutta processesMathematics of Computation, 1964
- Coefficients for the study of Runge-Kutta integration processesJournal of the Australian Mathematical Society, 1963