A lower bound for the number of stages of an explicit continuous Runge- Kutta method to obtain convergence of given order

DOI10.1007/BF01931296MaRDI QIDQ808631zbMATH OpenFDO

Authors J. M. Carnicer

Publication date 1991

Published in BIT (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF01931296

zbMATH Keywords

convergenceexplicit continuous Runge- Kutta methodinterpolationorder conditionstrees

Mathematics Subject Classification ID

Nonlinear ordinary differential equations and systems (34A34) Numerical methods for initial value problems involving ordinary differential equations (65L05) Multistep, Runge-Kutta and extrapolation methods for ordinary differential equations (65L06)

Recommendations

• The orders of embedded continuous explicit Runge-Kutta methods
• Order Barriers for Continuous Explicit Runge-Kutta Methods
• scientific article; zbMATH DE number 176988
• Derivation of Efficient, Continuous, Explicit Runge–Kutta Methods
• The non-existence of ten stage eighth order explicit Runge-Kutta methods

Cited in

(2)

• The orders of embedded continuous explicit Runge-Kutta methods
• Runge-Kutta research in Trondheim

This page was built for publication: A lower bound for the number of stages of an explicit continuous Runge- Kutta method to obtain convergence of given order

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q808631)