On the construction of a new generalization of Runge–Kutta methods
✍ Scribed by Mark Sofroniou; Giulia Spaletta
- Publisher
- Elsevier Science
- Year
- 2003
- Tongue
- English
- Weight
- 409 KB
- Volume
- 74
- Category
- Article
- ISSN
- 1571-0661
No coin nor oath required. For personal study only.
✦ Synopsis
We give an overview of the construction of algebraic conditions for determining the order of Runge-Kutta methods and describe a novel extension for numerically solving systems of differential equations. The new schemes, called Elementary Differential Runge-Kutta methods, include as a subset Runge-Kutta methods, Taylor series methods, Multiderivative Runge-Kutta methods. We outline how order conditions have been constructed for the new schemes using B-series and their composition and give details relating to a Mathematica implementation.
📜 SIMILAR VOLUMES
For implicit Runge-Kutta methods intended for stiff ODEs or DAEs, it is often difficult to embed a local error estimating method which gives realistic error estimates for stiff/algebraic components. If the embedded method's stability function is unbounded at z = o0, stiff error components are grossl
Mono-implicit Runge-Kutta methods can be used to generate implicit Runge-Kutta-Nystr6m (IRKN) methods for the numerical solution of systems of second-order differential equations. The paper is concerned with the investigation of the conditions to be fulfilled by the mono-implicit Runge-Kutta (MIRK)