Log In Sign Up

Uniform minorization condition and convergence bounds for discretizations of kinetic Langevin dynamics

by   Alain Durmus, et al.

We study the convergence in total variation and V-norm of discretization schemes of the underdamped Langevin dynamics. Such algorithms are very popular and commonly used in molecular dynamics and computational statistics to approximatively sample from a target distribution of interest. We show first that, for a very large class of schemes, a minorization condition uniform in the stepsize holds. This class encompasses popular methods such as the Euler-Maruyama scheme and the schemes based on splitting strategies. Second, we provide mild conditions ensuring that the class of schemes that we consider satisfies a geometric Foster–Lyapunov drift condition, again uniform in the stepsize. This allows us to derive geometric convergence bounds, with a convergence rate scaling linearly with the stepsize. This kind of result is of prime interest to obtain estimates on norms of solutions to Poisson equations associated with a given numerical method.


page 1

page 2

page 3

page 4


A Strongly Monotonic Polygonal Euler Scheme

Rate of convergence results are presented for a new class of explicit Eu...

Convergence of diffusions and their discretizations: from continuous to discrete processes and back

In this paper, we establish new quantitative convergence bounds for a cl...

Error estimates of the Godunov method for the multidimensional compressible Euler system

We derive a priori error of the Godunov method for the multidimensional ...

The Green's function of the Lax-Wendroff and Beam-Warming schemes

We prove a sharp uniform generalized Gaussian bound for the Green's func...

On the geometric convergence for MALA under verifiable conditions

While the Metropolis Adjusted Langevin Algorithm (MALA) is a popular and...

Temperature expressions and ergodicity of the Nosé-Hoover deterministic schemes

Thermostats are dynamic equations used to model thermodynamic variables ...