Almost symplectic Runge-Kutta schemes for Hamiltonian systems
DOI10.1016/j.jcp.2004.08.012zbMath1069.65140OpenAlexW2170800503MaRDI QIDQ706836
Publication date: 9 February 2005
Published in: Journal of Computational Physics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcp.2004.08.012
Newton's methodHamiltonian structureConvergenceNumerical examplesError boundsNumerical comparisonsFixed-point iterationGeometric integratorsPseudo-symplecticitySymplectic Runge-Kutta methods
Multistep, Runge-Kutta and extrapolation methods for ordinary differential equations (65L06) Error bounds for numerical methods for ordinary differential equations (65L70) Numerical methods for Hamiltonian systems including symplectic integrators (65P10) Discretization methods and integrators (symplectic, variational, geometric, etc.) for dynamical systems (37M15)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fourth-order symplectic integration
- A symplectic integration algorithm for separable Hamiltonian functions
- Runge-Kutta schemes for Hamiltonian systems
- Almost Poisson integration of rigid body systems
- Pseudo-symplectic Runge-Kutta methods
- Discrete mechanics and variational integrators
- The accuracy of symplectic integrators
- Geometric integration: numerical solution of differential equations on manifolds