Related papers: High precision Symplectic Integrators for the Sola…
In this paper, we study symplectic integration of canonical Hamiltonian systems with Jacobi polynomials. The relevant theoretical results of continuous-stage Runge-Kutta methods are revisited firstly and then symplectic methods with Jacobi…
This article reviews some integrators particularly suitable for the numerical resolution of differential equations on a large time interval. Symplectic integrators are presented. Their stability on exponentially large time is shown through…
Symplectic integrators are the preferred method of solving conservative $N$-body problems in cosmological, stellar cluster, and planetary system simulations because of their superior error properties and ability to compute orbital…
We present a symplectic integrator, based on the canonical midpoint rule, for classical spin systems in which each spin is a unit vector in $\mathbb{R}^3$. Unlike splitting methods, it is defined for all Hamiltonians, and is…
We present a family of modified Hermite integrators of arbitrary order possessing superior behaviour for the integration of Keplerian and near-Keplerian orbits. After recounting the derivation of Hermite N-body integrators of arbitrary…
The main features of 1P/Halley chaotic dynamics can be described by a two dimensional symplectic map. Using Mel'nikov integral we semi-analytically determine such a map for 1P/Halley taking into account gravitational interactions from the…
We present a new symplectic integrator designed for collisional gravitational $N$-body problems which makes use of Kepler solvers. The integrator is also reversible and conserves 9 integrals of motion of the $N$-body problem to machine…
Dependable numerical results from long-time simulations require stable numerical integration schemes. For Hamiltonian systems, this is achieved with symplectic integrators, which conserve the symplectic condition and exactly solve for the…
We present a simple choice of integration variables that can be used to exploit the near-integrable character of problems in celestial mechanics. The approach is based on the well-known principle of variation of parameters: instead of…
We show that when time-reversible symplectic algorithms are used to solve periodic motions, the energy error after one period is generally two orders higher than that of the algorithm. By use of correctable algorithms, we show that the…
Time-reversible symplectic methods, which are precisely compatible with Liouville's phase-volume-conservation theorem, are often recommended for computational simulations of Hamiltonian mechanics. Lack of energy drift is an apparent…
We propose new linear combinations of compositions of a basic second-order scheme with appropriately chosen coefficients to construct higher order numerical integrators for differential equations. They can be considered as a generalization…
We construct symplectic integrators for Lie-Poisson systems. The integrators are standard symplectic (partitioned) Runge--Kutta methods. Their phase space is a symplectic vector space with a Hamiltonian action with momentum map $J$ whose…
We study the structure of the set of all possible affine hyperplane sections of a convex polytope. We present two different cell decompositions of this set, induced by hyperplane arrangements. Using our decomposition, we bound the number of…
We present a multiscale integrator for Hamiltonian systems with slowly varying quadratic stiff potentials that uses coarse timesteps (analogous to what the impulse method uses for constant quadratic stiff potentials). This method is based…
Iterative methods for solving large sparse systems of linear equations are widely used in many HPC applications. Extreme scaling of these methods can be difficult, however, since global communication to form dot products is typically…
Exponential integrators are time stepping schemes which exactly solve the linear part of a semilinear ODE system. This class of schemes requires the approxima- tion of a matrix exponential in every step, and one successful modern method is…
An optimization program is used to re-adjust the initial conditions, in order to reproduce as closely as possible the predictions of a complete ephemeris by using simplified equations of motion in the numerical integration. The adjustment…
We study the efficiency of algorithms simulating a system evolving with Hamiltonian $H=\sum_{j=1}^m H_j$. We consider high order splitting methods that play a key role in quantum Hamiltonian simulation. We obtain upper bounds on the number…
In this paper, we are concerned with the construction and analysis of a new class of methods obtained as double jump compositions with complex coefficients and projection on the real axis. It is shown in particular that the new integrators…