A comparison of symplectic and Hamilton's principle algorithms for autonomous and non-autonomous systems of ordinary differential equations

DOI10.1016/S0168-9274(00)00037-4zbMath0990.65138OpenAlexW1995788168MaRDI QIDQ5954979

Begoña Cano, H. Ralph Lewis

Publication date: 7 February 2002

Published in: Applied Numerical Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0168-9274(00)00037-4

zbMATH Keywords

symmetryvariational methodsinitial value problemscomputational methodsorderHamiltonian systemtest problemsHamilton's principle

Mathematics Subject Classification ID

Numerical methods for initial value problems involving ordinary differential equations (65L05) Numerical methods for Hamiltonian systems including symplectic integrators (65P10) Discretization methods and integrators (symplectic, variational, geometric, etc.) for dynamical systems (37M15)

Related Items (3)

The averaged Lagrangian method ⋮ Symplecticness conditions of some low order partitioned methods for non-autonomous Hamiltonian systems ⋮ Relaxation Runge-Kutta methods for Hamiltonian problems

Cites Work

• A symplectic integration algorithm for separable Hamiltonian functions
• Intervals of periodicity and absolute stability of explicit Nyström methods for y=f(x,y)
• The use of Hamilton's principle to derive time-advance algorithms for ordinary differential equations
• Mechanical integrators derived from a discrete variational principle
• Solving Ordinary Differential Equations I
• Error Growth in the Numerical Integration of Periodic Orbits, with Application to Hamiltonian and Reversible Systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A comparison of symplectic and Hamilton's principle algorithms for autonomous and non-autonomous systems of ordinary differential equations