Performance of variable step size methods for solving model separable Hamiltonian systems
numerical examplessymplectic methodscomparison of methodsRunge-Kutta methodsthree body problemVerlet methodSeparable Hamiltonian systemsVariable step methodsHénon-Heiles problemRunge-Kutta Nyström methods
Mesh generation, refinement, and adaptive methods for ordinary differential equations (65L50) Numerical methods for Hamiltonian systems including symplectic integrators (65P10) Discretization methods and integrators (symplectic, variational, geometric, etc.) for dynamical systems (37M15) Three-body problems (70F07)
- Variable step size does not harm second-order integrators for Hamiltonian systems
- Performance of two methods for solving separable Hamiltonian systems
- scientific article; zbMATH DE number 556480
- Performance of Gauss implicit Runge-Kutta methods on separable Hamiltonian systems.
- Variable step implementation of geometric integrators
- scientific article; zbMATH DE number 702482 (Why is no real title available?)
- scientific article; zbMATH DE number 979834 (Why is no real title available?)
- A Fortran 90 separable Hamiltonian system solver
- Algorithm 670: a Runge-Kutta-Nyström code
- Backward Error Analysis for Numerical Integrators
- Performance of Gauss implicit Runge-Kutta methods on separable Hamiltonian systems.
- Performance of two methods for solving separable Hamiltonian systems
- Reversible adaptive regularization: perturbed Kepler motion and classical atomic trajectories
- The Adaptive Verlet Method
- Variable step implementation of geometric integrators
- Variable time step integration with symplectic methods
This page was built for publication: Performance of variable step size methods for solving model separable Hamiltonian systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2486767)