The use of Butcher series in the analysis of Newton-like iterations in Runge-Kutta formulas
DOI10.1016/0168-9274(94)00031-XzbMATH Open0817.65060OpenAlexW2040434486MaRDI QIDQ1339338FDOQ1339338
Authors: Syvert P. Nørsett, Kenneth R. Jackson, Anne Kværnø
Publication date: 1 December 1994
Published in: Applied Numerical Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0168-9274(94)00031-x
Recommendations
- 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
numerical examplesB-seriesorder of accuracyButcher seriesmodified Newton iterationorder of errorsimple iterationdifferential-algebraic systems of index 1implicit Runge-Kutta algorithm
Nonlinear ordinary differential equations and systems (34A34) Multistep, Runge-Kutta and extrapolation methods for ordinary differential equations (65L06) Error bounds for numerical methods for ordinary differential equations (65L70) Numerical methods for initial value problems involving ordinary differential equations (65L05)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- The numerical solution of differential-algebraic systems by Runge-Kutta methods
- A method for constructing generalized Runge-Kutta methods
- Error of Runge-Kutta methods for stiff problems studied via differential algebraic equations
- Embedded Diagonally Implicit Runge-Kutta Algorithms on Parallel Computers
- The error committed by stopping the Newton iteration in the numerical solution of stiff initial value problems
- An analysis of the order of Runge-Kutta methods that use an iterative scheme to compute their internal stage values
- Implicit Runge–Kutta Methods for Differential Algebraic Equations
- The Modified Newton Method in the Solution of Stiff Ordinary Differential Equations
- A stopping criterion for the Newton-Raphson method in implicit multistep integration algorithms for nonlinear systems of ordinary differential equations
Cited In (9)
- Construction of starting algorithms for the RK-Gauss methods
- An analysis of the order of Runge-Kutta methods that use an iterative scheme to compute their internal stage values
- Are high order variable step equistage initializers better than standard starting algorithms?
- IRK methods for DAE: Starting algorithms
- Parallelizing spectral deferred corrections across the method
- CWI contributions to the development of parallel Runge-Kutta methods
- B-series analysis of iterated Taylor methods
- Runge-Kutta research at Toronto
- PFASST-ER: combining the parallel full approximation scheme in space and time with parallelization across the method
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)