An analysis of the order of Runge-Kutta methods that use an iterative scheme to compute their internal stage values
- 1 December 1996
- journal article
- research article
- Published by Springer Nature in BIT Numerical Mathematics
- Vol. 36 (4) , 713-765
- https://doi.org/10.1007/bf01733789
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- The use of Butcher series in the analysis of Newton-like iterations in Runge–Kutta formulasApplied Numerical Mathematics, 1994
- The error committed by stopping the Newton iteration in the numerical solution of stiff initial value problemsIMA Journal of Numerical Analysis, 1994
- Efficient block predictor-corrector methods with a small number of correctionsJournal of Computational and Applied Mathematics, 1993
- Embedded Diagonally Implicit Runge-Kutta Algorithms on Parallel ComputersMathematics of Computation, 1992
- The error behaviour of a general class of predictorndash;corrector methodsApplied Numerical Mathematics, 1991
- A survey of parallel numerical methods for initial value problems for ordinary differential equationsIEEE Transactions on Magnetics, 1991
- Nonlinear coupled-mode equations on a finite interval: a numerical procedureJournal of the Optical Society of America B, 1991
- Aspects of parallel Runge-Kutta methodsPublished by Springer Nature ,1989
- An implementation of singly-implicit Runge-Kutta methodsBIT Numerical Mathematics, 1980
- Order conditions for Rosenbrock type methodsNumerische Mathematik, 1979