Related papers: Tuning symplectic integrators is easy and worthwhi…
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…
Splitting the exponential-like $\varphi$ functions, which typically appear in exponential integrators, is attractive in many situations since it can dramatically reduce the computational cost of the procedure. However, depending on the…
Retractions maps are used to define a discretization of the tangent bundle of the configuration manifold as two copies of the configuration manifold where the dynamics take place. Such discretization maps can be conveniently lifted to the…
We consider Arnoldi like processes to obtain symplectic subspaces for Hamiltonian systems. Large systems are locally approximated by ones living in low dimensional subspaces; we especially consider Krylov subspaces and some extensions. This…
Incremental computation aims to compute more efficiently on changed input by reusing previously computed results. We give a high-level overview of works on incremental computation, and highlight the essence underlying all of them, which we…
Symplectic integrators with long-term preservation of integrals of motion are introduced for the guiding-center model of plasma particles in toroidal magnetic fields of general topology. An efficient transformation to canonical coordinates…
Algorithms for numerical computation of symmetric elliptic integrals of all three kinds are improved in several ways and extended to complex values of the variables (with some restrictions in the case of the integral of the third kind).…
Integral transformations are used to estimate high order derivatives of various special functions. Applications are given to numerical integration, where estimates of high order derivatives of the integrand are needed to achieve bounds on…
I show that the basic structure of symplectic integrators is governed by a theorem which states {\it precisely}, how symplectic integrators with positive coefficients cannot be corrected beyond second order. All previous known results can…
The advantages of evolutionary algorithms with respect to traditional methods have been greatly discussed in the literature. While particle swarm optimizers share such advantages, they outperform evolutionary algorithms in that they require…
A new approach is developed to integrate numerically the equations of motion for systems of interacting rigid polyatomic molecules. With the aid of a leapfrog framework, we directly involve principal angular velocities into the integration,…
Optimization time integrators are effective at solving complex multi-physics problems including deformable solids with non-linear material models, contact with friction, strain limiting, etc. For challenging problems, Newton-type optimizers…
Symplectic integrators for Hamiltonian systems have been quite successful for studying few-body dynamical systems. These integrators are frequently derived using a formalism built on symplectic maps. There have been recent efforts to extend…
In this paper we propose some very promissing results in interval arithmetics which permit to build well-defined arithmetics including distributivity of multiplication and division according addition and substraction. Thus, it allows to…
We show that symplectic Runge-Kutta methods provide effective symplectic integrators for Hamiltonian systems with index one constraints. These include the Hamiltonian description of variational problems subject to position and velocity…
By combining a standard symmetric, symplectic integrator with a new step size controller, we provide an integration scheme that is symmetric, reversible and conserves the values of the constants of motion. This new scheme is appropriate for…
Symplectic integrator plays a pivotal role in the long-term tracking of charged particles within accelerators. To get symplectic maps in accurate simulation of single-particle trajectories, two key components are addressed: precise…
Many combinatorial optimization problems can be mapped to finding the ground states of the corresponding Ising Hamiltonians. The physical systems that can solve optimization problems in this way, namely Ising machines, have been attracting…
Symplectic tracking of beam particles using point magnets is achieved using a reference orbit made of circular arcs and straight lines that join smoothly with each other. For this choice of the reference orbit, results are given for the…
The simulation of systems that act on multiple time scales is challenging. A stable integration of the fast dynamics requires a highly accurate approximation whereas for the simulation of the slow part, a coarser approximation is accurate…