The non-existence of ten stage eighth order explicit Runge-Kutta methods
Part II Numerical Mathematics
Received:
- 96 Downloads
- 12 Citations
Abstract
It is shown that forn a non-negative integer, there does not exist an explicit Runge-Kutta method with 10 +n stages and order 8 +n. It follows that for order 8, the minimum number of stages is 11.
Keywords
Computational Mathematic Eighth Order
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Preview
Unable to display preview. Download preview PDF.
References
- 1.M. Abramowitz and I. A. Stegun,Handbook of Mathematical Functions, Dover Publications, New York (1964).Google Scholar
- 2.J. C. Butcher,On Runge-Kutta processes of high order, J. Austral. Math. Soc.4 (1964), 179–194.Google Scholar
- 3.J. C. Butcher,On the attainable order of Runge-Kutta methods, Math. Comp.19 (1965), 408–417.Google Scholar
- 4.J. C. Butcher,An order bound for Runge-Kutta methods, SIAM J. Numer. Anal.12 (1975), 304–315.CrossRefGoogle Scholar
- 5.G. J. Cooper and J. H. Verner,Some explicit Runge-Kutta methods of high order, SIAM J. Numer. Anal.9 (1972), 389–405.CrossRefGoogle Scholar
- 6.A. R. Curtis,An eighth order Runge-Kutta process with eleven function evaluations per step, Numer. Math.16 (1970), 268–277.Google Scholar
- 7.A. R. Curtis,High-order explicit Runge-Kutta formulae, their uses, and limitations, J. Inst. Math. Applics.16 (1975), 35–55.Google Scholar
- 8.E. Hairer,A Runge-Kutta method of order 10, J. Inst. Math. Applics.21 (1978), 47–59.Google Scholar
Copyright information
© BIT Foundations 1985