Efficient symplectic algorithms for numerical simulations of Hamiltonian flows
- 1 January 1995
- journal article
- research article
- Published by IOP Publishing in Physica Scripta
- Vol. 51 (1), 29-34
- https://doi.org/10.1088/0031-8949/51/1/005
Abstract
A quite general approach to numerical simulations of Hamiltonian hows is presented, which is suitable to the development of efficient symplectic algorithms. Explicit schemes up to fourth order are worked out. These algorithms show a very good performance if implemented in typical molecular dynamics problems, i.e. in long-time simulations of Hamiltonian systems with a large number of degrees of freedom and steep potential functions.This publication has 13 references indexed in Scilit:
- Canonical numerical methods for molecular dynamics simulationsJournal of Computational Chemistry, 1994
- Analytic computation of the strong stochasticity threshold in Hamiltonian dynamics using Riemannian geometryPhysical Review E, 1993
- The accuracy of symplectic integratorsNonlinearity, 1992
- Symplectic integrators for Hamiltonian problems: an overviewActa Numerica, 1992
- Classical ?freezing? of fast rotations. A numerical test of the Boltzmann-Jeans conjectureJournal of Statistical Physics, 1991
- A symplectic integration algorithm for separable Hamiltonian functionsJournal of Computational Physics, 1991
- Construction of higher order symplectic integratorsPhysics Letters A, 1990
- Fourth-order symplectic integrationPhysica D: Nonlinear Phenomena, 1990
- Symplectic integration of Hamiltonian systemsNonlinearity, 1990
- Computer "Experiments" on Classical Fluids. I. Thermodynamical Properties of Lennard-Jones MoleculesPhysical Review B, 1967