A comparison of symplectic and Hamilton's principle algorithms for autonomous and non-autonomous systems of ordinary differential equations
From MaRDI portal
Publication:5954979
Recommendations
- Symplectic algorithms for Hamiltonian dynamical systems based on a new variational principle. I: The variational principle and the algorithms
- scientific article; zbMATH DE number 6311463
- scientific article; zbMATH DE number 6311464
- The variational discrete method for Hamiltonian equation
- Hidden symplecticity in Hamilton's principle algorithms
Cites work
- scientific article; zbMATH DE number 3773010 (Why is no real title available?)
- scientific article; zbMATH DE number 702482 (Why is no real title available?)
- scientific article; zbMATH DE number 194356 (Why is no real title available?)
- scientific article; zbMATH DE number 194875 (Why is no real title available?)
- scientific article; zbMATH DE number 775665 (Why is no real title available?)
- scientific article; zbMATH DE number 3247704 (Why is no real title available?)
- A symplectic integration algorithm for separable Hamiltonian functions
- Error Growth in the Numerical Integration of Periodic Orbits, with Application to Hamiltonian and Reversible Systems
- Intervals of periodicity and absolute stability of explicit Nyström methods for y=f(x,y)
- Mechanical integrators derived from a discrete variational principle
- Solving Ordinary Differential Equations I
- The use of Hamilton's principle to derive time-advance algorithms for ordinary differential equations
Cited in
(9)- The averaged Lagrangian method
- Symplectic algorithms for Hamiltonian dynamical systems based on a new variational principle. I: The variational principle and the algorithms
- scientific article; zbMATH DE number 6311464 (Why is no real title available?)
- Relaxation Runge-Kutta methods for Hamiltonian problems
- Symplecticness conditions of some low order partitioned methods for non-autonomous Hamiltonian systems
- Unconventional Hamilton-type variational principle in phase space and symplectic algorithm
- Symplectic algorithms based on the principle of least action and generating functions
- Comparing the efficiency of numerical techniques for the integration of variational equations
- Hidden symplecticity in Hamilton's principle algorithms
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
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5954979)