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) Error bounds for numerical methods for ordinary differential equations (65L70)
Singly implicit Runge-Kutta methods (SIRK) have been introduced in order to reduce the implementation costs. Many of them, however, have the disadvantage that certain internal stages approximate the solution outside the integration interval. The idea of effective order permits to overcome this difficulty, but leads to a less straightforward implementation with variable stepsizes. This article discusses step changing strategies, and analyzes local truncation errors and stability properties of the new procedures.
- On the implementation of ESIRK methods for stiff IVPs
- Variable-order ESIRK methods for stiff differential equations
- The effective order of singly-implicit Runge-Kutta methods
- Towards Efficient Runge–Kutta Methods for Stiff Systems
- DESIRE: Diagonally extended singly implicit Runge-Kutta effective order methods
- Local error control in SDIRK-methods
- Variable-order ESIRK methods for stiff differential equations
- Variable step size destabilizes the Störmer/leapfrog/Verlet method
- The efficiency of singly-implicit Runge-Kutta methods for stiff differential equations
- Applications of doubly companion matrices
- Practical Runge-Kutta methods for scientific computation
- scientific article; zbMATH DE number 4123194 (Why is no real title available?)
- On the implementation of ESIRK methods for stiff IVPs
- ``Rescale and modify implementation of IRKS methods
This page was built for publication: ESIRK methods and variable stepsize
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1294524)
