Conjugate-symplecticity properties of Euler--Maclaurin methods and their implementation on the Infinity Computer
arXiv:1807.10952
Abstract
Multi-derivative one-step methods based upon Euler-Maclaurin integration formulae are considered for the solution of canonical Hamiltonian dynamical systems. Despite the negative result that simplecticity may not be attained by any multi-derivative Runge--Kutta methods, we show that the Euler-MacLaurin method of order p is conjugate-symplectic up to order p+2. This feature entitles them to play a role in the context of geometric integration and, to make their implementation competitive with the existing integrators, we explore the possibility of computing the underlying higher order derivatives with the aid of the Infinity Computer.
arXiv comment21 pages, 24 figures
References in corpus (4)
- On strong homogeneity of a class of global optimization algorithms working with infinite and infinitesimal scales
- Usage of infinitesimals in the Menger's Sponge model of porosity
- The exact (up to infinitesimals) infinite perimeter of the Koch snowflake and its finite area
- Cellular Automata Using Infinite Computations