Symplectic integrators for Hamiltonian problems: an overview
- 1 January 1992
- journal article
- research article
- Published by Cambridge University Press (CUP) in Acta Numerica
- Vol. 1, 243-286
- https://doi.org/10.1017/s0962492900002282
Abstract
In the sciences, situations where dissipation is not significant may invariably be modelled by Hamiltonian systems of ordinary, or partial, differential equations. Symplectic integrators are numerical methods specifically aimed at advancing in time the solution of Hamiltonian systems. Roughly speaking, ‘symplecticness’ is a characteristic property possessed by the solutions of Hamiltonian problems. A numerical method is called symplectic if, when applied to Hamiltonian problems, it generates numerical solutions which inherit the property of symplecticness.Keywords
This publication has 37 references indexed in Scilit:
- A New Class of Results for the Algebraic Equations of Implicit Runge-Kutta ProcessesIMA Journal of Numerical Analysis, 1991
- Long-time symplectic integration: the example of four-vortex motionProceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences, 1991
- Multi-stage symplectic schemes of two kinds of Hamiltonian systems for wave equationsComputers & Mathematics with Applications, 1990
- Dynamical Systems IVPublished by Springer Nature ,1990
- The generating function for the solution of ODEs and its discrete methodsComputers & Mathematics with Applications, 1988
- The separation of motions in systems with rapidly rotating phaseJournal of Applied Mathematics and Mechanics, 1984
- Some properties of the discrete Hamiltonian methodPhysica D: Nonlinear Phenomena, 1984
- A Can0nical Integrati0n TechniqueIEEE Transactions on Nuclear Science, 1983
- Stability Criteria for Implicit Runge–Kutta MethodsSIAM Journal on Numerical Analysis, 1979
- The modified equation approach to the stability and accuracy analysis of finite-difference methodsJournal of Computational Physics, 1974