论文信息 - Order bound for a family of parallel Runge-Kutta-Nyström methods through computer algebra - 字舞流文

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

Abstract We prove a bound on the obtainable order of consistency for a family of parallel Runge-Kutta-Nystrom methods, using computer algebra.

Beatrice Paternoster | B. Paternoster

[1] Beatrice Paternoster,et al. Computation of the Interval of Stability of Runge-Kutta-Nyström Methods , 1998, J. Symb. Comput..

[2] R. Fateman,et al. A System for Doing Mathematics by Computer. , 1992 .

[3] Beatrice Paternoster,et al. Fully parallel Runge-Kutta-Nystro¨m methods for ODEs with oscillating solutions , 1993 .

[4] Mark Sofroniou,et al. Symbolic Derivation of Runge-Kutta Methods , 1994, J. Symb. Comput..

[5] A. Iserles,et al. On the Theory of Parallel Runge—Kutta Methods , 1990 .

[6] Nguyen Huu Cong,et al. Stability of collocation-based Runge-Kutta-Nyström methods , 1991 .

[7] Kenneth R. Jackson,et al. The potential for parallelism in Runge-Kutta methods. Part 1: RK formulas in standard form , 1995 .

[8] Ernst Hairer,et al. Solving Ordinary Differential Equations I: Nonstiff Problems , 2009 .