Reducible Runge-Kutta methods

From MaRDI portal





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)].











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)