Reducible Runge-Kutta methods (Q1072352)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Reducible Runge-Kutta methods
scientific article

    Statements

    Reducible Runge-Kutta methods (English)
    0 references
    0 references
    0 references
    1985
    0 references
    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)].
    0 references
    0 references
    system
    0 references
    reducible methods
    0 references
    Runge-Kutta method
    0 references
    algebraic stability
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references