Order bound for a family of parallel Runge-Kutta-Nyström methods through computer algebra

DOI10.1016/S0898-1221(98)00062-5zbMath0999.65068MaRDI QIDQ1608461

Beatrice Paternoster

Publication date: 6 August 2002

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

zbMATH Keywords

parallel computationRunge-Kutta-Nyström methodscomputer algebraorder boundorder of consistency

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Nonlinear ordinary differential equations and systems (34A34) Stability and convergence of numerical methods for ordinary differential equations (65L20) Parallel numerical computation (65Y05) Numerical methods for initial value problems involving ordinary differential equations (65L05) Multistep, Runge-Kutta and extrapolation methods for ordinary differential equations (65L06)

Related Items (2)

A family of explicit parallel Runge-Kutta-Nyström methods ⋮ Some procedures for the construction of high-order exponentially fitted Runge-Kutta-Nyström methods of explicit type

Uses Software

• Mathematica

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fully parallel Runge-Kutta-Nyström methods for ODEs with oscillating solutions
• Stability of collocation-based Runge-Kutta-Nyström methods
• Compuation of the interval of stability of Runge-Kutta-Nyström methods
• Symbolic derivation of Runge-Kutta methods
• On the Theory of Parallel Runge—Kutta Methods
• Explicit Canonical Methods for Hamiltonian Systems
• The Potential for Parallelism in Runge–Kutta Methods. Part 1: RK Formulas in Standard Form

This page was built for publication: Order bound for a family of parallel Runge-Kutta-Nyström methods through computer algebra