Performance of two methods for solving separable Hamiltonian systems

DOI10.1016/S0377-0427(00)00460-XzbMath0971.65114WikidataQ127778759 ScholiaQ127778759MaRDI QIDQ1841946

V. Antohe, Ian Gladwell

Publication date: 26 October 2001

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

performanceRunge-Kutta methodHamiltonian systemHénon-Heiles systemsymplectic integratorvariable step sizeRunge-Kutta-Nyström methodchaotic trajectoryerror estiamtequasi-periodic trajectory

Mathematics Subject Classification ID

Multistep, Runge-Kutta and extrapolation methods for ordinary differential equations (65L06) Strange attractors, chaotic dynamics of systems with hyperbolic behavior (37D45) Numerical methods for Hamiltonian systems including symplectic integrators (65P10) Numerical chaos (65P20) Mesh generation, refinement, and adaptive methods for ordinary differential equations (65L50) Discretization methods and integrators (symplectic, variational, geometric, etc.) for dynamical systems (37M15)

Related Items (2)

Performance of Gauss implicit Runge-Kutta methods on separable Hamiltonian systems. ⋮ Performance of variable step size methods for solving model separable Hamiltonian systems

Uses Software

• rksuite_90
• Algorithm 670

Cites Work

• Unnamed Item
• Fourth-order symplectic integration
• A symplectic integration algorithm for separable Hamiltonian functions
• A Fortran 90 separable Hamiltonian system solver
• Algorithm 670: a Runge-Kutta-Nyström code

This page was built for publication: Performance of two methods for solving separable Hamiltonian systems