Multi-value Numerical Methods for Hamiltonian Systems
From MaRDI portal
Publication:5264842
DOI10.1007/978-3-319-10705-9_18zbMath1328.65264OpenAlexW154232531MaRDI QIDQ5264842
Publication date: 28 July 2015
Published in: Lecture Notes in Computational Science and Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-10705-9_18
Related Items (1)
Cites Work
- Search for highly stable two-step Runge-Kutta methods
- Numerical integration of Hamiltonian problems by G-symplectic methods
- Long-term stability of multi-value methods for ordinary differential equations
- General linear methods for \(y^{\prime\prime} = f(y(t))\)
- The existence of symplectic general linear methods
- Canonical Runge-Kutta methods
- Symmetric multistep methods over long times
- Numerical search for algebraically stable two-step almost collocation methods
- The symplecticity of multi-step methods
- G-symplecticity implies conjugate-symplecticity of the underlying one-step method
- Linear multistep methods as irreducible general linear methods
- Dealing with Parasitic Behaviour in G-Symplectic Integrators
- The Control of Parasitism in $G$-symplectic Methods
- Geometric integrators for ODEs
- Geometric Numerical Integration
- Numerical Methods for Ordinary Differential Equations
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Multi-value Numerical Methods for Hamiltonian Systems