scientific article; zbMATH DE number 2160991
Cauchy problemexplicit interpolation methodsorder controlRunge-Kutta methodsstepsize control algorithm
Nonlinear ordinary differential equations and systems (34A34) Numerical methods for initial value problems involving ordinary differential equations (65L05) Multistep, Runge-Kutta and extrapolation methods for ordinary differential equations (65L06) Mesh generation, refinement, and adaptive methods for ordinary differential equations (65L50)
In the work of \textit{E. Hairer, S. P. Nørsett}, and \textit{G. Wanner} [Solving ordinary differential equations. I: Nonstiff problems. Springer-Verlag (1987; Zbl 0638.65058)] an algorithm of control of order and stepsize for explicit interpolation methods is suggested, based on the minimization of computational work expended on every step, together with a modification of the algorithm. As the measure of this work the machine time expended on the unit step is considered. In the present article the effectivity of this modification is demonstrated on the example of the Cauchy problem \(x'(t) = g(t,x(t))\), \(x(t_0) = x^0\), \(x(t)\in \mathbb R^n\), \(t\in [t_0,t_0+T]\), which is solved by an \(l\)-staged symmetric Runge-Kutta method of order \(2s\) with variable step of integration. For the entire collection see [Zbl 1058.00009].
- Automatic step size and order control in explicit one-step extrapolation methods
- On the internal stepsize of an extrapolation algorithm for IVP in ODE
- scientific article; zbMATH DE number 6514927
- Order and stepsize control in extrapolation methods
- Control of step size and order in extrapolation codes
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4670997)