Local error estimation for singly-implicit formulas by two-step Runge- Kutta methods
DOI10.1007/BF01995111zbMath0783.65062OpenAlexW2055752607MaRDI QIDQ688737
Alfredo Bellen, Marino Zennaro, Zdzisław Jackiewicz
Publication date: 5 April 1994
Published in: BIT (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01995111
numerical examples\(s\)-stage singly-implicity Runge-Kutta methods\(s\)-stage two-step Runge-Kutta methodslocal discretization error
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)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A class of pseudo Runge-Kutta methods
- A Performance Evaluation of Some FORTRAN Subroutines for the Solution of Stiff Oscillatory Ordinary Differential Equations
- Two-Step Runge–Kutta Methods
- Towards Efficient Runge–Kutta Methods for Stiff Systems
- Towards efficient implementation of singly-implicit methods
- A Transformed implicit Runge-Kutta Method
- An implementation of singly-implicit Runge-Kutta methods
- Efficiently Implementable Algebraically Stable Runge–Kutta Methods
- Variable-Stepsize Explicit Two-Step Runge-Kutta Methods
- On the implementation of implicit Runge-Kutta methods
- A note on a recent result of rational approximations to the exponential function
- A special family of Runge-Kutta methods for solving stiff differential equations