HIGH-ORDER SYMPLECTIC RUNGE-KUTTA-NYSTROM METHODS

Citation
Mp. Calvo et Jm. Sanzserna, HIGH-ORDER SYMPLECTIC RUNGE-KUTTA-NYSTROM METHODS, SIAM journal on scientific computing, 14(5), 1993, pp. 1237-1252
Citations number
21
Categorie Soggetti
Computer Sciences",Mathematics
ISSN journal
10648275
Volume
14
Issue
5
Year of publication
1993
Pages
1237 - 1252
Database
ISI
SICI code
1064-8275(1993)14:5<1237:HSRM>2.0.ZU;2-D
Abstract
A numerical method for ordinary differential equations is called sympl ectic if, when applied to Hamiltonian problems, it preserves the sympl ectic structure in phase space, thus reproducing the main qualitative property of solutions of Hamiltonian systems. The authors construct an d test symplectic, explicit Runge-Kutta-Nystrom (RKN) methods of order 8. The outcome of the investigation is that existing high-order, symp lectic RKN formulae require so many evaluations per step that they are much less efficient than conventional eighth-order nonsymplectic, var iable-step-size integrators even for low accuracy. However, symplectic integration is of use in the study of qualitative features of the sys tems being integrated.