Related papers: Forward and non-forward symplectic integrators in …
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…
We introduce a class of fourth order symplectic algorithms that are ideal for doing long time integration of gravitational few-body problems. These algorithms have only positive time steps, but require computing the force gradient in…
We suggest a numerical integration procedure for solving the equations of motion of certain classical spin systems which preserves the underlying symplectic structure of the phase space. Such symplectic integrators have been successfully…
Symplectic integration algorithms have become popular in recent years in long-term orbital integrations because these algorithms enforce certain conservation laws that are intrinsic to Hamiltonian systems. For problems with large variations…
In recent decades, there have been many attempts to construct symplectic integrators with variable time steps, with rather disappointing results. In this paper we identify the causes for this lack of performance, and find that they fall…
Calculating the long term solution of ordinary differential equations, such as those of the $N$-body problem, is central to understanding a wide range of dynamics in astrophysics, from galaxy formation to planetary chaos. Because generally…
The solution of many physical evolution equations can be expressed as an exponential of two or more operators acting on initial data. Accurate solutions can be systematically derived by decomposing the exponential in a product form. For…
We have proposed new algorithms for the numerical integration of the equations of motion for classical spin systems. In close analogy to symplectic integrators for Hamiltonian equations of motion used in Molecular Dynamics these algorithms…
Symplectic integration algorithms are well-suited for long-term integrations of Hamiltonian systems because they preserve the geometric structure of the Hamiltonian flow. However, this desirable property is generally lost when adaptive…
We present two types of meta-algorithm that can greatly improve the accuracy of existing algorithms for integrating the equations of motion of dynamical systems. The first meta-algorithm takes an integrator that is time-symmetric only for…
Symplectic N-body integrators are widely used to study problems in celestial mechanics. The most popular algorithms are of 2nd and 4th order, requiring 2 and 6 substeps per timestep, respectively. The number of substeps increases rapidly…
We show that the method of splitting the operator ${\rm e}^{\epsilon(T+V)}$ to fourth order with purely positive coefficients produces excellent algorithms for solving the time-dependent Schr\"odinger equation. These algorithms require…
The evolution of any factorized time-reversible symplectic integrators, when applied to the harmonic oscillator, can be exactly solved in a closed form. The resulting modified Hamiltonians demonstrate the convergence of the Lie series…
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…
Symplectic integrators evolve dynamical systems according to modified Hamiltonians whose error terms are also well-defined Hamiltonians. The error of the algorithm is the sum of each error Hamiltonian's perturbation on the exact solution.…
Recently a new class of numerical integration methods -- ``mixed variable symplectic integrators'' -- has been introduced for studying long-term evolution in the conservative gravitational few-body problem. These integrators are an order of…
We present a simple algorithm to switch between $N$-body time integrators in a reversible way. We apply it to planetary systems undergoing arbitrarily close encounters and highly eccentric orbits, but the potential applications are broader.…
We propose a forward-backward splitting dynamical system for solving inclusion problems of the form $0\in A(x)+B(x)$ in Hilbert spaces, where $A$ is a maximal operator and $B$ is a single-valued operator. Involved operators are assumed to…
Many applications in computational physics that use numerical integrators based on splitting and composition can benefit from the development of optimized algorithms and from choosing the best ordering of terms. The cost in programming and…
The forward-backward splitting technique is a popular method for solving monotone inclusions that has applications in optimization. In this paper we explore the behaviour of the algorithm when the inclusion problem has no solution. We…