An Order Bound for Runge–Kutta Methods
- 1 June 1975
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Numerical Analysis
- Vol. 12 (3) , 304-315
- https://doi.org/10.1137/0712025
Abstract
Let $u_0 ,u_1 , \cdots $ be defined by $u_0 = 5,u_{n + 1} = [{{(4u_n + 2n + 3)} / 3}]$, $(n = 0,1,2, \cdots )$ so that $u_1 = 7$, $u_2 = 11$, $u_3 = 17$, $u_4 = 25, \cdots $. The main result of this paper is that there does not exist an explicit Runge–Kutta method with s stages and order $p \geqq u_n $ unless $s > p + n$.
Keywords
This publication has 3 references indexed in Scilit:
- Some Explicit Runge”Kutta Methods of High OrderSIAM Journal on Numerical Analysis, 1972
- On the attainable order of Runge-Kutta methodsMathematics of Computation, 1965
- Coefficients for the study of Runge-Kutta integration processesJournal of the Australian Mathematical Society, 1963