The use of Butcher series in the analysis of Newton-like iterations in Runge-Kutta formulas
B-seriesButcher seriesdifferential-algebraic systems of index 1implicit Runge-Kutta algorithmmodified Newton iterationnumerical examplesorder of accuracyorder of errorsimple iteration
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) Error bounds for numerical methods for ordinary differential equations (65L70)
A study is made of the order of error commited when an implicit Runge- Kutta (RK) algorithm is used together with \(k\)-iterations of Newton's iterative formula in numerical approximation to the solution of an ordinary differential equation. The key to the analysis of the order of error is that the iterated RK method may be viewed as a generalized RK method and the approximation which it generates may be written as a B- series (Butcher series). The order of accuracy is determined both for inverse RK algorithms and for algorithms applicable to differential-algebraic systems of index 1. Results are given for three different iteration schemes: Simple iteration, modified Newton iteration, and full Newton iteration. Results of numerical computations are presented, applied to two examples, in which the observed order of error is compared with the predicted order of error.
- An analysis of the order of Runge-Kutta methods that use an iterative scheme to compute their internal stage values
- On the iterative solution of the algebraic equations in fully implicit Runge--Kutta methods
- scientific article; zbMATH DE number 775671
- Some linear stability results for iterative schemes for implicit Runge-Kutta methods
- Butcher algebras for Butcher systems
- A method for constructing generalized Runge-Kutta methods
- A stopping criterion for the Newton-Raphson method in implicit multistep integration algorithms for nonlinear systems of ordinary differential equations
- An analysis of the order of Runge-Kutta methods that use an iterative scheme to compute their internal stage values
- Embedded Diagonally Implicit Runge-Kutta Algorithms on Parallel Computers
- Error of Runge-Kutta methods for stiff problems studied via differential algebraic equations
- scientific article; zbMATH DE number 4041188 (Why is no real title available?)
- scientific article; zbMATH DE number 3999169 (Why is no real title available?)
- Implicit Runge–Kutta Methods for Differential Algebraic Equations
- The error committed by stopping the Newton iteration in the numerical solution of stiff initial value problems
- The Modified Newton Method in the Solution of Stiff Ordinary Differential Equations
- The numerical solution of differential-algebraic systems by Runge-Kutta methods
- Construction of starting algorithms for the RK-Gauss methods
- Are high order variable step equistage initializers better than standard starting algorithms?
- IRK methods for DAE: Starting algorithms
- An analysis of the order of Runge-Kutta methods that use an iterative scheme to compute their internal stage values
- Runge-Kutta research at Toronto
- CWI contributions to the development of parallel Runge-Kutta methods
- Parallelizing spectral deferred corrections across the method
- PFASST-ER: combining the parallel full approximation scheme in space and time with parallelization across the method
- B-series analysis of iterated Taylor methods
This page was built for publication: The use of Butcher series in the analysis of Newton-like iterations in Runge-Kutta formulas
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1339338)
