A New Recurrence for Computing Runge–Kutta Truncation Error Coefficients
From MaRDI portal
DOI10.1137/0732089zbMATH Open0841.65071OpenAlexW2044869171MaRDI QIDQ4862813FDOQ4862813
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)
Recommendations
- Implicit Runge-Kutta formulae with built-in estimates of the accumulated truncation error
- scientific article; zbMATH DE number 3874517
- scientific article; zbMATH DE number 1066201
- Validated computation of the local truncation error of Runge-Kutta methods with automatic differentiation
- Derivation of Efficient, Continuous, Explicit Runge–Kutta Methods
Cited in
(10)- Estimating the error of the classic Runge-Kutta formula
- Analysis of high order fast interface tracking methods
- Efficiency comparisons of methods for integrating ODEs
- An alternative approach for order conditions of Runge-Kutta-Nyström methods
- Symbolic derivation of Runge-Kutta-Nyström order conditions
- Analysis and implementation of TR-BDF2
- Error estimation and step size control for delay differential equation solvers based on continuously embedded Runge-Kutta-Sarafyan methods
- Estimation of the truncation error in Runge-Kutta and allied processes
- Symbolic derivation of Runge-Kutta order conditions
- Symbolic derivation of order conditions for hybrid Numerov-type methods solving \(y^{\prime\prime} =f(x,y)\)
This page was built for publication: A New Recurrence for Computing Runge–Kutta Truncation Error Coefficients
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4862813)
