The effective order of singly-implicit Runge-Kutta methods
From MaRDI portal
Nonlinear ordinary differential equations and systems (34A34) Multistep, Runge-Kutta and extrapolation methods for ordinary differential equations (65L06) Stability and convergence of numerical methods for ordinary differential equations (65L20) Mesh generation, refinement, and adaptive methods for ordinary differential equations (65L50) Error bounds for numerical methods for ordinary differential equations (65L70) Numerical methods for initial value problems involving ordinary differential equations (65L05)
Recommendations
Cited in
(18)- Symplectic effective order methods
- The number of conditions for a Runge-Kutta method to have effective order \(p\)
- Symplectic effective order numerical methods for separable Hamiltonian systems
- The Hilber-Hughes-Taylor-\(\alpha \) (HHT-\(\alpha \)) method compared with an implicit Runge-Kutta for second-order systems
- An Efficient Fourth Order Implicit Runge-Kutta Algorithm for Second Order Systems
- Generalized singly-implicit Runge-Kutta methods with arbitrary knots
- Applications of doubly companion matrices
- ESIRK methods and variable stepsize
- Order and effective order
- A generalization of singly-implicit Runge-Kutta methods
- Inverse maximal eigenvalues problems for Leslie and doubly Leslie matrices
- The efficiency of singly-implicit Runge-Kutta methods for stiff differential equations
- Towards efficient implementation of singly-implicit methods
- Effective order of partitioned Runge-Kutta methods
- An efficient implicit Runge-Kutta method for second order systems
- The orders of embedded continuous explicit Runge-Kutta methods
- Hyman's method revisited
- Order Barriers and Characterizations for Continuous Mono-Implicit Runge- Kutta Schemes
This page was built for publication: The effective order of singly-implicit Runge-Kutta methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1805902)