A method for constructing generalized Runge-Kutta methods
accuracyCauchy problemerror estimationgeneralized Runge-Kutta methodsimplicit Runge-Kutta formulalinear equationsNewton iteration processnumerical testsstability
Nonlinear ordinary differential equations and systems (34A34) Numerical computation of solutions to systems of equations (65H10) 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)
The authors develop an approach which allows in a uniform way to construct various generalized Runge-Kutta methods for solving the Cauchy problem \(y'=f(x,y)\), \(y(x_ 0)=y_ 0\), \(y,f\in\mathbb{R}^ m\). Only a fixed finite numbers iterations are taken in the Newton iteration process and in the modified Newton iteration process, in order to solve systems of nonlinear equations arising by the implementation of an implicit Runge- Kutta formula. Hence one needs to solve three systems of linear equations of dimension at most 3m. Three methods of order five imbedding a fourth-order formula for error estimation are constructed and their accuracy and stability are analyzed. Salient properties of the methods are illustrated by 25 numerical tests.
- A stopping criterion for the Newton-Raphson method in implicit multistep integration algorithms for nonlinear systems of ordinary differential equations
- An Efficient Solution Process for Implicit Runge–Kutta Methods
- Comparing numerical methods for stiff systems of O.D.E:s
- scientific article; zbMATH DE number 3884755 (Why is no real title available?)
- scientific article; zbMATH DE number 3911612 (Why is no real title available?)
- scientific article; zbMATH DE number 3999169 (Why is no real title available?)
- Implicit Runge-Kutta Processes
- On the Efficient Implementation of Implicit Runge-Kutta Methods
- On the implementation of implicit Runge-Kutta methods
- On the Stability and Accuracy of One-Step Methods for Solving Stiff Systems of Ordinary Differential Equations
- Order Results for Implicit Runge–Kutta Methods Applied to Stiff Systems
- Stability and B-convergence of linearly implicit Runge-Kutta methods
- Stability Criteria for Implicit Runge–Kutta Methods
- The Concept of B-Convergence
- The implementation of Runge-Kutta implicit processes
- The numerical solution of differential-algebraic systems by Runge-Kutta methods
- The use of Butcher series in the analysis of Newton-like iterations in Runge-Kutta formulas
- New charge simulation method for numerical conformal mapping of ring domains
- On the construction of a new generalization of Runge-Kutta methods
- Generalized Runge-Kutta method with respect to the non-Newtonian calculus
- scientific article; zbMATH DE number 464779 (Why is no real title available?)
- scientific article; zbMATH DE number 1160360 (Why is no real title available?)
- Construction of Runge-Kutta type methods for solving ordinary differential equations
- scientific article; zbMATH DE number 2219904 (Why is no real title available?)
- An efficient and unconditionally stable numerical algorithm for nonlinear structural dynamics
This page was built for publication: A method for constructing generalized Runge-Kutta methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1184137)
