Fer's factorization as a symplectic integrator (Q1923304): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 14:58, 1 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Fer's factorization as a symplectic integrator |
scientific article |
Statements
Fer's factorization as a symplectic integrator (English)
0 references
25 May 1997
0 references
The author presents the Fer expansion as a possible explicit symplectic integrator for time-dependent Hamiltonian systems. When this iterative procedure is applied to an arbitrary Hamiltonian, a factorization of the time-evolution map is obtained as an infinite product of Lie transformations. The author shows that, at least for quadratic Hamiltonians, very few iterations are sufficient to achieve accurate results both for the orbits and conserved quantities. Numerical experiments presented in this paper show the performance of the proposed method. The third- and fourth-order Fer expansions are compared with other numerical integration schemes, including symplectic ones. It appears that the performance of the Fer factorization is comparable to that of the Gragg-Bulirsch-Stoer extrapolation algorithm, and it is better than other symplectic integration methods such as the explicit Runge-Kutta-Nyström and Gauss-Legendre Runge-Kutta algorithms.
0 references
Runge-Kutta-Nyström algorithm
0 references
numerical experiments
0 references
Fer expansion
0 references
symplectic integrator
0 references
time-dependent Hamiltonian systems
0 references
performance
0 references
Gragg-Bulirsch-Stoer extrapolation algorithm
0 references
Gauss-Legendre Runge-Kutta algorithms
0 references