A uniformly accurate scheme for the numerical integration of penalized Langevin dynamics

In molecular dynamics, penalized overdamped Langevin dynamics are used to model the motion of a set of particles that follow constraints up to a parameter ε. The most used schemes for simulating these dynamics are the Euler integrator in Rd and the constrained Euler integrator. Both have weak order one of accuracy, but work properly only in specific regimes depending on the size of the parameter ε. We propose in this paper a new consistent method with an accuracy independent of ε for solving penalized dynamics on a manifold of any dimension. Moreover, this method converges to the constrained Euler scheme when ε goes to zero. The numerical experiments confirm the theoretical findings, in the context of weak convergence and for the invariant measure, on a torus and on the orthogonal group in high dimension and high codimension.publishedVersio

A uniformly accurate scheme for the numerical integration of penalized Langevin dynamics

In molecular dynamics, penalized overdamped Langevin dynamics are used to model the motion of a set of particles that follow constraints up to a parameter $\varepsilon$. The most used schemes for simulating these dynamics are the Euler integrator in $\mathbb{R}^d$ and the constrained Euler integrator. Both have weak order one of accuracy, but work properly only in specific regimes depending on the size of the parameter $\varepsilon$. We propose in this paper a new consistent method with an accuracy independent of $\varepsilon$ for solving penalized dynamics on a manifold of any dimension. Moreover, this method converges to the constrained Euler scheme when $\varepsilon$ goes to zero. The numerical experiments confirm the theoretical findings, in the context of weak convergence and for the invariant measure, on a torus and on the orthogonal group in high dimension and high codimension.Comment: 27 page

Multi-revolution composition methods for highly oscillatory differential equations

We introduce a new class of multi-revolution composition methods for the approximation of the $$N$$ N th-iterate of a given near-identity map. When applied to the numerical integration of highly oscillatory systems of differential equations, the technique benefits from the properties of standard composition methods: it is intrinsically geometric and well-suited for Hamiltonian or divergence-free equations for instance. We prove error estimates with error constants that are independent of the oscillatory frequency. Numerical experiments, in particular for the nonlinear Schrödinger equation, illustrate the theoretical results, as well as the efficiency and versatility of the methods