Order bound for a family of parallel Runge-Kutta-Nyström methods through computer algebra
✍ Scribed by B. Paternoster
- Publisher
- Elsevier Science
- Year
- 1998
- Tongue
- English
- Weight
- 634 KB
- Volume
- 35
- Category
- Article
- ISSN
- 0898-1221
No coin nor oath required. For personal study only.
✦ Synopsis
We prove a bound on the obtainable order of consistency for a family of parallel Runge-Kutta-Nystr6m methods, using computer algebra.
Keywords--Numerical methods for ODEs, Runge-Kutta-NystrSm methods, Parallel methods, Computer algebra.
📜 SIMILAR VOLUMES
New Runge-Kutta-Nyström methods especially designed for the numerical integration of periodic initial value problems are presented in this paper. They are able to integrate exactly the harmonic oscillator. Here we analyze the construction of an embedded 5(3) RKN pair with four stages. Numerical expe
A symplectic exponentially fitted modified Runge-Kutta-Nystro ¨m method is derived in this paper. It is a two-stage second-order method with FSAL-property. An application to some well known orbital problems shows the properties of the developed method.