Reducible Runge-Kutta methods
A Runge-Kutta method (for the numerical solution of ordinary differential equations) is called reducible if there exists a method with \(r<s\) stages such that any solution for the r stage method is also a solution for the original method. By means of special matrices a criterion for reducibility is presented which incorporates some previous results. This criterion is suitable for the study of algebraic stability. The results of this note are strongly related to Theorem 2.2 of \textit{W. H. Hundsdorfer} and \textit{M. N. Spijker} [Numer. Math. 36, 319-331 (1981; Zbl 0441.65065)].
- A Generalization of Algebraic Stability for Runge--Kutta Methods
- scientific article; zbMATH DE number 3296351 (Why is no real title available?)
- On the Algebraic Equations in Implicit Runge–Kutta Methods
- On the existence of solutions to the algebraic equations in implicit Runge-Kutta methods
- Reducibility and contractivity of Runge-Kutta methods revisited
- Stability Criteria for Implicit Runge–Kutta Methods
- The equivalence of B-stability and A-stability
This page was built for publication: Reducible Runge-Kutta methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1072352)