The computation of averages from equilibrium and nonequilibrium Langevin molecular dynamics
Benedict Leimkuhler, Charles Matthews, Gabriel Stoltz
Introduction
A fundamental purpose of molecular simulation is the computation of macroscopic quantities, typically through averages of functions of the variables of the system with respect to a given probability measure which defines the macroscopic state of the system. We consider systems described by a separable Hamiltonian
where and respectively are the vectors of positions and momenta of particles in dimension , is a potential energy function and is a positive definite mass matrix, typically a diagonal matrix.
The Hamiltonian (1) represents a fully classical molecular dynamics model. For instance, a fluid of argon atoms is well described by pairwise interactions among the nuclei, where the potential The distance based potential may be fitted to Buckingham or Lennard-Jones forms (for instance, see Frenkel & Smit (2001) or Allen & Tildesley (1989)). These short-ranged potentials model van der Waals type interactions including both Pauli repulsion (the inability of the populated electron shells to interpenetrate) and dispersion due to temporary dipoles forming in the charge clouds surrounding the nuclei. In more complicated molecular systems, other potential energy functions are used to capture local covalent bond structure and Coulombic interactions due to charges on the atoms. Coarse-grained classical models may amalgamate several degrees of freedom, as for example when a molecule is replaced by a rigid body description. Classical molecular dynamics models are now a standard and widespread tool in almost every field of science and engineering. For example, see Schulz et al. (2004) for some applications in engineering, Durrant & McCammon (2011) for a discussion of the use of molecular dynamics in drug discovery and see also the motivation provided in classical textbooks on molecular simulation such as Allen & Tildesley (1989); Frenkel & Smit (2001); Schlick (2002); Tuckerman (2010).
being the physical volume of the box occupied by the fluid. By studying the variation in pressure with changes in a thermodynamic parameter (temperature or density), one may obtain part of the phase diagram of the material. Other observables may be used to model the determination of molecular form (shape and size) or structural rearrangement under different ambient conditions. It is for instance increasingly common to use molecular dynamics in biology to reveal allosteric mechanisms related to protein function or drug binding; in such cases the observable may measure the distance between two particular groups of atoms or their relative alignment; see Durrant & McCammon (2011) for examples and further references contained therein.
One of the most popular choices of SDE system for sampling purposes is Langevin dynamics, which is given by:
We will also be interested in nonequilibrium situations where a given system is subject to nonconservative driving and dissipative perturbations. In this case, the averages may be taken with respect to a stationary distribution which has no simple functional form. The simulation of nonequilibrium systems in their steady-states is one popular way to compute transport coefficients such as the thermal conductivity or the shear viscosity, as the linear response of an appropriate average property (see for instance Evans & Morriss (2008); Tuckerman (2010)). We discuss a specific example in Section 3: the computation of the mobility of a particle, which measures the tendency of the particle to flow in the direction of an external forcing. The mobility is related to the self-diffusion through Einstein’s relation (see (50) below).
The aim of this work is to provide a numerical analysis of the perfect sampling bias in Langevin dynamics arising from numerical schemes obtained by a splitting strategy, building on studies such as Talay (2002) or Bou-Rabee & Owhadi (2010), and clarifying the sampling properties of recently proposed schemes (see Skeel & Izaguirre (2002); Melchionna (2007); Bussi & Parrinello (2007); Thalmann & Farago (2007); Leimkuhler & Matthews (2013a)). Of particular interest is the behavior of methods in the overdamped limit and variations of Langevin dynamics incorporating nonequilibrium forcings such as the addition of non-gradient forces (in which case the invariant measure is unknown). The idea behind splitting schemes for stochastic differential equations is to decompose the generator of the dynamics into a sum of generators associated with dynamics which are analytically integrable, or at least very simple to integrate. We refer to the individual splitting terms of the dynamics as “elementary dynamics” in the sequel. One example in the context of Langevin dynamics is the splitting scheme based on a symplectic integration of the Hamiltonian part of the dynamics combined with an exact treatment of the fluctuation-dissipation part. Such methods are more convenient to implement in molecular simulation codes than the implicit schemes proposed in Talay (2002) or Mattingly et al. (2002), and are also efficient in practice (see Leimkuhler & Matthews (2013b)). Some essential elements of the numerical analysis on the accuracy of such splitting schemes have been provided in Bou-Rabee & Owhadi (2010).
Let us emphasize that we expect our results to hold for unbounded position spaces, under appropriate assumptions on the potential energy function. Our proofs may however require non-trivial modifications, using in particular the tools and the results from Mattingly et al. (2002); Talay (2002); Bou-Rabee & Owhadi (2010); Kopec (2013). Generalizations to other dynamics similar to Langevin dynamics such as Generalized Langevin Dynamics (see Mori (1965); Zwanzig (1973)), Dissipative Particle Dynamics (see Hoogerbrugge & Koelman (1992); Espanol & Warren (1995)) or Nosé-Hoover-Langevin dynamics (see Samoletov et al. (2007); Leimkuhler et al. (2009)) are also possible, although a rigorous extension would require substantial work in view of the estimates needed involving the generator of the dynamics for instance (see the discussion in Remark 4.6).
In practice, since Langevin dynamics is discretized, averages computed along a single trajectory converge to averages with respect to a measure , which is an approximation to in the sense that there exists a function for which
see Section 2.4 for precise statements. Of course, the momenta are usually trivial to sample since they are distributed according to a Gaussian measure. The primary issue is therefore to sample positions according to the marginal of the canonical measure:
the partial average of a function with respect to the momentum variable, the error estimate (4) becomes, for observables which depend only on the position variable,
Let us conclude this introduction by noting that alternative sampling strategies are available: the bias in the invariant measure sampled by discretization of Langevin dynamics could in principle be eliminated by employing a Metropolis-Hastings procedure (see Metropolis et al. (1953); Hastings (1970) and the discussion in Section 2.2 of Lelièvre et al. (2010)). Another advantage of superimposing a Metropolis-Hastings procedure upon a discretization of Langevin dynamics is that it stabilizes the numerical scheme even for forces which are not globally Lipschitz. The numerical analysis of Langevin-based Metropolis integrators has been performed in Bou-Rabee & Vanden-Eijnden (2009) and Bou-Rabee & Vanden-Eijnden (2012), where strong error estimates are provided. On the other hand, it is not always possible or desirable to use a Metropolis correction. First, the average acceptance probability in the Metropolis step for Langevin-like dynamics in general decreases exponentially with the dimension of the system for a fixed timestep (see for instance Kennedy & Pendleton (1991)). In fact, the timestep should be reduced as some inverse power of the system size in order to maintain a constant acceptance rate (see the recent works on Metropolization of Hamiltonian dynamics by Beskos et al. (2013), following the strategy pioneered in Roberts et al. (1997); Roberts & Rosenthal (1998)). There are ways to limit the decrease of the ratio, by either changing the dynamics or the measure used to compute the Metropolis ratio (see for instance Izaguirre & Hampton (2004) in the context of Hamiltonian dynamics), or by evolving only parts of the system (see Bou-Rabee & Vanden-Eijnden (2012)). The latter strategy may however complicate the implementation of parallel algorithms for the simulation of very large systems, especially if long-range potentials are used (as acknowledged in Remark 2.5 of Bou-Rabee & Vanden-Eijnden (2012)). This may be a reason why Metropolis corrections are not often implemented in popular molecular dynamics packages such as NAMD. Second, the variance of the computed averages may increase since rejections occur, and the numerical trajectory is therefore more correlated in general than for rejection-free dynamics. Lastly, the Metropolis procedure requires that the invariant measure of the system be known. This is the case for equilibrium systems, but no longer is the case for nonequilibrium systems subjected to external forcings such as a temperature gradient or a non-gradient force (this is the framework considered in Section 3 of this article, see for instance the dynamics (45)).
We focus in this article on first- and second-order splitting schemes, relying on Lie-Trotter decompositions of the evolution. This restriction is motivated both by pedagogical purposes and by the dominant role in applications played by second-order splitting schemes. Let us however emphasize that most of our results could, in principle, be extended to higher-order decompositions.
Results corresponding to discretizations of the equilibrium Langevin dynamics and computation of static average properties are gathered in Section 2, while nonequilibrium systems and the computation of transport properties are discussed in Section 3 (relying on the computation of the mobility or autodiffusion coefficient as an illustration). The proofs of all our results can be found in Section 4.
Let us now highlight some of our contributions.
In the equilibrium setting, we rigorously ground in Section 2.4 the results presented in Leimkuhler & Matthews (2013a) giving the leading order correction to the invariant measure with respect to for general splitting schemes, via a Talay-Tubaro expansion (see Talay & Tubaro (1990)). We carefully study all possible splitting schemes, taking advantage of what we call the “TU lemma” (Lemma 2.11) to relate invariant measures of various splitting schemes where the elementary dynamics are integrated in different orders. From a technical viewpoint, our proofs are a variation on the standard way of establishing similar results since we use the specific structure of splitting schemes to conveniently write evolution operators as compositions of the semigroups of the elementary dynamics (working at the level of generators, as in Debussche & Faou (2012); see also Mattingly et al. (2010) for a related approach based on solution of appropriate Poisson equations). The structure of the proof is highlighted in Section 4.4, see Remark 4.6.
We show in Section 2.5 how the leading order correction to equilibrium averages can be estimated on-the-fly by approximating a time-integrated correlation function. This can be seen as a practical way of numerically solving a Poisson equation (a standard way of proceeding when studying linear response of nonequilibrium systems) and is an alternative to Romberg extrapolation to eliminate the leading order correction as done in Talay & Tubaro (1990).
We carefully study the overdamped regime in Section 2.6, making use in particular of uniform resolvent estimates obtained in Theorem 2.4 thanks to a uniform hypocoercivity property;
We provide error estimates for the computation of transport coefficients, by assessing the bias arising in the numerical discretization of either (i) the computation of integrated time-correlation functions expressing transport coefficients via Green-Kubo formulae; or (ii) ergodic averages of steady-state nonequilibrium dynamics where the equilibrium evolution (3) is perturbed by a non-gradient force and the transport coefficient is extracted from the linear response of some quantity of interest (see Section 3). The latter approach is illustrated by the study of the mobility, which measures the response in the average velocity arising from a constant external force exerted on the system. We also study the consistency of the numerical estimations in the overdamped limit.
Some numerical simulations are provided to illustrate the most important results (see Section 2.5.3 and 3.3).
Error estimates for the invariant measure for equilibrium dynamics
We start by giving some properties of Langevin dynamics in Section 2.1 (most results are well-known, except for the material on the overdamped limit presented in Section 2.1.3). The numerical schemes we consider are then described in Section 2.2, their ergodic properties being discussed in Section 2.3. Error estimates for the invariant measure are provided in Section 2.4. We then show in Section 2.5 how to estimate the leading order correction term through an appropriate integrated correlation function. An important side result of this section is the development error estimates for Green-Kubo type formulas. Finally, we study the errors on the invariant measures in the overdamped limit in Section 2.6. Let us emphasize that we will make use of the following assumption throughout this work:
The above assumption is quite restrictive since typical potentials used in molecular simulation, such as the Lennard-Jones potential, have singularities. Although ergodicity for Langevin dynamics with singular potentials has been recently proved in Conrad & Grothaus (2010), there are still many issues with singular potentials, including the existence and uniqueness of an invariant measure for numerical schemes (see Mattingly et al. (2002)), and the derivation of appropriate bounds or estimates on the resolvent of the generator of Langevin dynamics (all the results presented in Section 2.1.1 below are obtained under the assumption of smooth potentials). Since the latter estimates are fundamental for our work, we have to restrict ourselves to smooth potentials. Of course, from a more practical viewpoint, it could also be argued that the potential energy function could be smoothed out by appropriate high energy truncations and regularizations, and that such regularizations should not affect too much the average properties of the system since high energy states are quite unlikely under the canonical measure.
The reference Hilbert space for our analysis is the Hilbert space . As in Talay (2002) for instance, we will consider errors in the average of smooth functions whose derivatives grow at most polynomially (the space defined below). In fact, since the position space is compact, only the growth in the momentum variable has to be controlled.
The polynomial growth of a function can be characterized by the Lyapunov functions:
To characterize the growth of the derivatives, we introduce the spaces defined as
where , and stands for .
The set of smooth functions is the set of functions such that, for any , there exists (depending on and ) so that . The subset is composed of the functions with average zero with respect to :
Some of our results will be stated in the weighted Sobolev spaces defined as
Note that since the function is in . We will also occasionally need the Sobolev spaces of functions of the variable only whose derivatives up to order are square-integrable with respect to the probability measure .
Unless stated otherwise, all the operators appearing below are by default considered as operators defined on the core , with range contained in . Some results are stated on extensions of the operators under consideration to (sub)spaces of or . With some abuse of notation, we will denote the extension of operators by the same letter. The appropriate domain of the operators should always be clear from the context. When an operator is defined on the core , we denote by its formal adjoint, which is the operator defined on such that, for all ,
When is a differential operator with smooth coefficient (which will be the case in many situations here), the action of the formal adjoint is found using integration by parts.
1 Properties of equilibrium Langevin dynamics
Langevin dynamics can be seen as Hamiltonian dynamics perturbed by an Ornstein-Uhlenbeck process in the momenta with friction coefficient :
The existence and uniqueness of strong solutions is guaranteed when the position space is compact since the kinetic energy function is a Lyapunov function, see for instance Theorem 5.9 in Rey-Bellet (2006). We will sometimes denote by the solution of this equation to emphasize the dependence on the friction coefficient.
In order to describe more conveniently splitting schemes, it is useful to introduce the elementary dynamics with generators (defined on the core )
The generator for equilibrium Langevin dynamics (7), defined on the core , is the sum of the generators of the elementary dynamics:
where is the generator associated with the Hamiltonian part of the dynamics. The invariance of the canonical measure defined in (2) for Langevin dynamics can be rewritten in terms of the generator : for any test function ,
In fact, the operators and separately preserve . Recall also that, thanks to the compact embedding of
where, we recall, the adjoints are formally defined as operators on through integration by parts. Note that the formal adjoint
defined on has an action quite similar to the action of the generator defined on . Functional estimates valid for (extensions of) will therefore also hold for (extensions of) the formal adjoint of this operator. The equality (10) expresses the reversibility up to momentum reversal of Langevin dynamics with respect to the invariant measure (see the discussion in Section 2.2.3 of Lelièvre et al. (2010)). In particular, introducing the bounded, unitary operator on
(10) can be reformulated .
Note also that the same bound holds for .
Before presenting these asymptotic estimates, let us first recall that a careful analysis of the proof presented in Talay (2002), as provided by Kopec (2013), allows to prove the following result.
The space is stable under and .
This result is of fundamental importance in our proofs. It allows to state that, if the operators are well defined operators from to , then the operator also is a well defined operator from to .
1.2 Hamiltonian limit γ→0→𝛾0\gamma\to 0
Denote by the operator norm on the subspace
of the Hilbert space . There exists two constants such that, for any ,
We state the result with the upper bound , but it holds in fact for for any finite value . Note also that the same bound holds for .
1.3 Overdamped limit γ→+∞→𝛾\gamma\to+\infty
\gamma\to+\infty The overdamped limit can be obtained by either letting the friction go to infinity in (7) together with an appropriate rescaling of time; or by letting masses go to 0. When discussing overdamped limits in this article, we will always set the mass matrix to identity and consider the limit . Since we restrict our attention to the invariant measure of the system, the time rescaling is not relevant.
Let us describe more precisely the convergence result. It is shown in Section 2.2.4 of Lelièvre et al. (2010) for instance that the solutions of (7) observed over long times, namely , converge pathwise on finite time intervals to the solutions of overdamped Langevin dynamics
to . Let us finally mention that the set of functions with average zero with respect to is of course stable with respect to .
The following result gives bounds on the resolvent of the Langevin generator in the overdamped regime, and in fact quantifies the difference between the resolvent and the resolvent appropriately rescaled by a factor .
There exist two constants such that, for any ,
More precisely, there exists a constant such that, for any ,
where the operator is defined in (6), and is understood as applying the operator to the function for all values of .
Consider the following subspace of :
There exists a constant such that, for any ,
The proofs of Theorem 2.4 and Lemma 2.5 are provided in Section 4.1.
2 Splitting schemes for equilibrium Langevin dynamics
We present in this section the splitting schemes to be examined in this article. These schemes can be described by evolution operators defined on the core (but which can be extended to bounded operators on ), and which are such that the Markov chain generated by the discretization satisfies
We also briefly give some ergodicity results obtained by minor extensions or variations of existing results in the literature (see in particular Mattingly et al. (2002); Talay (2002); Bou-Rabee & Owhadi (2010); Bou-Rabee & Hairer (2013)). Since these ergodicity issues are by now a rather standard and well-understood matter, especially for compact position spaces, we provide only elements of proofs in Section 4.2.
First-order schemes are obtained by a Lie-Trotter splitting of the elementary evolutions generated by . The motivation for this splitting is that all elementary evolutions are analytically integrable (see the expressions of the associated semigroups in (65)). There are 6 possible schemes, whose evolution operators (defined on the core ) are of the general form
with all possible permutations of . For instance, the numerical scheme associated with is
The iterations of the three schemes associated with share a common sequence of update operations, as for . More precisely, we mean that equalities of the following form hold:
It is therefore not surprising that the invariant measures of the schemes with operators composed in the same order have very similar properties, as made precise in Theorem 2.13, relying on Lemma 2.11.
2.2 Second-order schemes
Second-order schemes are obtained by a Strang splitting of the elementary evolutions generated by . There are also 6 possible schemes, which are of the general form
with the same possible orderings as for first-order schemes. Again, these schemes can be classified into three groups depending on the ordering of the operators once the elementary one-step evolution is iterated: (i) , (ii) , and (iii) . We discard the latter category since the invariant measures of the associated numerical schemes are not consistent with in the overdamped limit (see Section 2.6).
2.3 Geometric Langevin Algorithms
In fact, as already proved in Bou-Rabee & Owhadi (2010) (see also Corollary 2.17 below), second order accuracy of the invariant measure can be obtained by resorting to a first-order splitting between the Hamiltonian and the Ornstein-Uhlenbeck parts, and discretizing the Hamiltonian part with a second-order scheme. This corresponds to the following evolution operators of Geometric Langevin Algorithm (GLA) type:
3 Ergodicity results for splitting schemes
Let us now give some technical results on the ergodic behavior of the splitting schemes presented in Section 2.2.In this section we denote the evolution operator by (supressing the dependence on the friction parameter although the constants appearing in the results below a priori depend on this parameter). Ergodicity results for a fixed value of are obtained with techniques similar to the ones presented in Meyn & Tweedie (2009), by mimicking the proofs presented for certain discretization schemes of the Langevin equation in Mattingly et al. (2002); Talay (2002); Bou-Rabee & Owhadi (2010). A more subtle point is to obtain rates of convergence which are uniform in the timestep , as done in Bou-Rabee & Hairer (2013) for a class of Metropolis-Hastings schemes based on a discretization of overdamped Langevin dynamics in unbounded spaces as the proposal. We are able here to prove such results by relying on the fact that the position space is compact.
The proof is based on two preliminary results, namely a uniform drift inequality or Lyapunov condition and a uniform minorization condition (see Section 4.2 for the proofs). The term uniform refers to estimates which are independent of the timestep . To obtain such estimates, we have to consider evolutions over fixed times , which amounts to iterating the elementary evolution over timesteps (where denotes the smallest integer larger than ).
Consider sufficiently large, and fix any . There exist and a probability measure such that, for any bounded, measurable non-negative function , and any ,
Lemma 2.7 ensures that Assumption 2 in Hairer & Mattingly (2011) holds for any choice of Lyapunov function (), provided is chosen to be sufficiently large. The uniform minorization condition can formally be rewritten as
We present a direct proof of Lemma 2.7 in Section 4.2. Extending this result to unbounded position spaces is much more difficult in general, see for instance the recent works Klokov & Veretennikov (2006, 2013) and Bou-Rabee & Hairer (2013) where non-degeneracy of the noise is assumed.
Let us now precisely state the ergodicity result.
uniformly in the timestep . There also exist (depending on and but not on ) such that, and for all functions , the following holds for almost all :
Let us again emphasize that, compared to the results of Mattingly et al. (2002); Talay (2002); Bou-Rabee & Owhadi (2010), the only new estimate is the uniform-in- decay rate in (24) as obtained in Bou-Rabee & Hairer (2013) for Metropolis schemes. These uniform estimates follow from an application of the results of Hairer & Mattingly (2011) to the sampled chain (see Section 4.2 for more detail). Recall also that the convergence rates we obtain of course depend on the friction parameter .
The Banach space depends both on and through , although the dependence on is not explicitly written. This proves that the series
provided is sufficiently small. Let us summarize this result as follows.
4 Error estimates for finite frictions
In this section we study the error of the average of sufficiently smooth functions, which allows us to characterize the corrections to the invariant measure. In Theorems 2.13 and 2.16, below, we characterize all the first- and second-order splittings; the technique of proof allows us to provide a rigorous study of the error estimates in the overdamped regime (see Section 2.6) and for nonequilibrium systems (see Section 3).
If only the order of magnitude of the correction is of interest, and not the expression of the correction in itself, no regularity result with regard to the derivatives is required (see Bou-Rabee & Owhadi (2010)), in contrast to situations where such corrections are explicitly considered, as in Talay (2002) for instance.
We classified in Section 2.2 the numerical schemes according to the order of appearance of the elementary operators. More precisely, we considered schemes to be similar when the global ordering of the operators is the same but the operations are started and ended differently, as in (19) above (see also (26) below for an abstract definition). This choice of classification is motivated by the following lemma which demonstrates how we may straightforwardly obtain the expression of the invariant measure of one scheme when the expression for another one is given.
We state the result in an abstract fashion for two schemes and (which implies the condition (26) below). See (19) for a concrete example.
Consider two numerical schemes with associated evolution operators bounded on , for which there exist bounded operators on such that, for all ,
We also assume that both schemes are ergodic with associated invariant measures denoted respectively by , : For almost all and ,
Then, for all ,
Ergodicity results such as (27) are implied by conditions such as (24).
The proof of this result relies on the simple observation that, for a given initial measure with a smooth density with respect to the Lebesgue measure, the ergodicity assumption ensures that, for a bounded measurable function ,
Now, we use the ergodicity property (27) with replaced by to obtain the following convergence for almost all :
Since preserves constant functions, there holds
Let us now show how we will use Lemma 2.11 in the sequel. Assume that a weak error estimate holds on the invariant measure : there exist and a function such that
with for sufficiently small. Combining this equality and (28), the following expansion is obtained for :
In general, for an evolution operator preserving the measure at order , we can write
where all the operators on the right hand side are defined on the core , and the operators preserve the measure :
while the operator does not. Typically, is a composition of the operators and . In addition, for a given function , the remainder is uniformly bounded for sufficiently small. Three cases should then be distinguished:
When , the weak error in the invariant measure is of the same order as for since
For , the weak error in the invariant measure arises at dominant order from the operator :
The interesting case corresponds to . In this situation,
An increase in the order of the error on the invariant measure is obtained when the leading order correction vanishes for all admissible observables , that is, if and only if .
4.2 First-order schemes
The following result characterizes at leading order the invariant measure of the schemes based on a first-order splitting (see Section 2.2.1). We first study the error estimates in the invariant measure of the schemes , (which can be interpreted as GLA schemes with a symplectic Euler discretization of the Hamiltonian part, see Bou-Rabee & Owhadi (2010)), and then deduce error estimates for the four remaining schemes introduced in Section 2.2.1 by making use of Lemma 2.11. The proof can be read in Section 4.4.
where the remainder is uniformly bounded for sufficiently small. The expressions of the correction functions depend on the numerical scheme at hand. They are defined as
It would in fact possible to obtain bounds on the the remainder with respect to , thanks to functional inequalities given in Appendix A of Kopec (2013).
The equations (31) could be analytically solved if, instead of the fluctuation/dissipation operator , we were using the mass-weighted differential operator as in Leimkuhler & Matthews (2013a):
The corresponding generator defined on the core is associated with Langevin dynamics where the friction force is proportional to the momenta rather than velocities. A simple computation shows that
The condition (31) would be replaced by , so that where is a constant ensuring that has a vanishing average with respect to .
4.3 Hamiltonian limit of the correction term
For first order splitting schemes, the limit of the leading order correction term in (30) can be studied in the limit when . Not surprisingly, it turns out that the leading order correction is the first term in the expansion of the modified Hamiltonian of the symplectic Euler method in powers of . In contrast to the more complete proof we are able to present for the overdamped limit (see Section 2.6), we were not able to study the behavior of the remainder terms in (30). There is a technical obstruction to controlling these remainders from the way we prove our results since the limiting operator is not invertible. Let us also mention that studying the corresponding Hamiltonian limit for second order schemes turns out to be a much more difficult question (see Remark 2.18).
There exists a constant such that, for all ,
with similar estimates for and ; and
with similar estimates for and .
The proof of this result is provided in Section 4.5.
4.4 Second-order schemes
The following result characterizes at leading order the invariant measure of the schemes based on a second-order splitting (see Section 2.2.2).
where the remainder is uniformly bounded for sufficiently small. The expressions of the correction functions depend on the numerical scheme at hand. They are defined as
It can be checked that the expressions of and agree with the ones presented in Leimkuhler & Matthews (2013a). Let us emphasize that no correction term appears in (32) after the term. In fact, a more careful treatment would allow us to write an error expansion in terms of higher orders of , with only even powers of appearing.
The proof of this result is given in Section 4.6. We use as reference schemes for the proofs the schemes , . These schemes indeed turn out to be particularly convenient to study the overdamped limit.
The results from Theorem 2.16 allow us to obtain error estimates for the so-called Geometric Langevin Algorithms (GLA) introduced in Bou-Rabee & Owhadi (2010). Recall the somewhat surprising result that the error in the invariant measure of the GLA schemes is of order for a discretization of order of the Hamiltonian part, even though the weak and strong orders of the scheme are only one. The following result complements the estimate given in Bou-Rabee & Owhadi (2010) by making precise the leading order corrections to the invariant measure of the numerical scheme with respect to the canonical measure (see the proof in Section 4.7).
where the remainder is uniformly bounded for sufficiently small. The expressions of the correction functions and are
Note that the leading order term of the error is the same as for the corresponding second order splitting schemes. The next order correction (of order ) vanishes for functions depending only on the position variable .
Proving a result similar to Proposition 2.15 for second order splitting schemes or GLA schemes turns out to be much more difficult, although we formally expect that the limit of as is the first order correction of the modified Hamiltonian constructed by backward analysis. From (33), it should indeed be the case that converges to
Moreover, as we already mentioned before Proposition 2.15, we are not able to uniformly control remainder terms in the error expansion (32) as .
5 Numerical estimation of the correction term
The results of Section 2.4 show that the leading order correction terms for the average of an observable can be written as
where the function is the solution of a Poisson equation
the function depending on the numerical scheme at hand (the fact that is a consequence of Theorem 2.2). It is in general impossible to analytically solve (36), and very difficult to numerically approximate its solution since it is a high-dimensional partial differential equation. It is however possible to rewrite (35) as an integrated correlation function, a quantity which is amenable to numerical approximation. This is a standard way of computing transport coefficients based on Green-Kubo formulae, see the summary provided in Section 3.1. It provides here a way to compute the first order correction in the perfect sampling bias with a single simulation (as an alternative to Romberg extrapolation, which requires at least two simulations at different timesteps, see Talay & Tubaro (1990)).
The approach we follow is based on the following operator identity (which makes sense in for instance, in view of (12))
where the expectation is taken over all initial conditions distributed according to and over all realizations of equilibrium Langevin dynamics (7), the leading order correction term (35) can be rewritten as
Consider a numerical method with an invariant measure having bounded moments at all orders (i.e. (23) is satisfied) and such that, for ,
where the remainder is uniformly bounded for small enough. Suppose in addition that its evolution operator is such that, for any ,
where and there exists such that the remainder is uniformly bounded in for sufficiently small. Assume finally that satisfies the uniform ergodicity condition (24) (hence (25) holds). Then, the integrated correlation of two observables can be approximated by a Riemann sum up to an error of order :
The assumptions of this theorem are satisfied for the splitting schemes considered in this article (see the comment after (70) for the boundedness of the remainder ).
In the particular case , which is in fact the most relevant one from a practical viewpoint, it is possible not to modify the observable when the discrete generator is correct at order (see (41) below for a precise statement), upon considering a time discretization of the integral which leads to errors of order , for instance a trapezoidal rule. The following result is obtained by an appropriate application of Theorem 2.19 (see Section 4.8 for the proof).
Consider a numerical scheme satisfying the assumptions of Theorem 2.19, and whose discrete generator is in addition correct at order 2: for any ,
Then, for two observables ,
where is bounded for sufficiently small and
5.2 Numerical approximation
There are two principal ways to estimate the expectations in (40) or (42), using either several independent realizations of the nonequilibrium dynamics or a single, long trajectory, see for instance the discussion in Section 13.4 of Tuckerman (2010). When independent realizations are generated for timesteps each, starting from initial conditions distributed according to , the expectation in (40) may be approximated using empirical averages of the correlation functions as
where and for first order splittings; while and for second order ones since for the schemes presented in Section 2.2.2 (see for instance (77)). The empirical average reads
This formula highlights the other errors arising from the discretization: (i) a statistical error related to the finiteness of and to the fact that initial conditions are obtained in practice by subsampling a single, long trajectory; (ii) a truncation error related to the finiteness of .
5.3 Numerical illustration
Let us now numerically confirm the error estimates (30)-(32)-(34). More precisely, we show that, provided the leading correction term (35) is estimated by discretizing (37) using (42) and subtracted from the estimated result, canonical averages are estimated up to errors of order for second order splittings instead of without the correction. We use the same trajectory data as above to approximate the canonical average of the total system energy . We test the effectiveness of the correction both in practice and principle, by computing the observed average and correction term in the same simulation in the former case, while computing a more accurate correction term independently in the latter case (using a smaller timestep ). The results are shown in the right panel of Figure 1.
6 Overdamped limit
where are independent and identically distributed Gaussian random vectors with identity covariance. This is indeed a consistent discretization of the overdamped process (15) with an effective timestep , and the invariant measure of this numerical scheme is close to . Other schemes may have non-trivial large friction limits and invariant measures close to . This is the case for the scheme associated with the evolution operator , for which the limiting discrete dynamics reads (see Leimkuhler & Matthews (2013a))
Note that is not a Markov chain due to the correlations in the random noises.
On the other hand, the limits of the invariant measures associated with certain schemes are not consistent with the canonical measure . This is the case for the first-order schemes, as well as the second order splittings listed in item (iii) in Section 2.2.2. For instance, the limit of the scheme associated with reads
The invariant measure of this Markov chain is the uniform measure on , and is therefore very different from the invariant measure of the continuous dynamics (15) (it amounts to setting ). As another example, consider the limit of the scheme associated with :
This is the Euler-Maruyama discretization of (15) with an effective timestep but an inverse temperature rather than .
6.2 Rigorous error estimates
The following result quantifies the errors of the invariant measure of second order splitting schemes of Langevin dynamics, for large values of . We restrict ourselves to the second order splittings where the Ornstein-Uhlenbeck part is either at the ends or in the middle (categories (i) and (ii) in Section 2.2.2). From a technical viewpoint, we are able here to bound remainder terms uniformly in by relying on the properties of the limiting operator . The result we obtain is the following (see Section 4.9 for the proof).
where the remainder is of order up to terms exponentially small in . More precisely, there exist constants and (all depending on ) such that
The expression of depends on the numerical scheme at hand:
The real number ensures that all functions are of average zero with respect to . Two comments are in order. Note first that the result is stated for observables which depend only on the position variable since the limiting case corresponds to a dynamics on the positions only. There is anyway no restriction in stating the result using such observables since, as already discussed in the introduction, the error on the marginal in the position variables is the relevant error, momenta being trivial to sample exactly under the canonical measure. Secondly, let us emphasize that the correction term vanishes for the method associated with (as already noted in Leimkuhler & Matthews (2013a)). This means that the corresponding discretization of overdamped Langevin dynamics (formally obtained by setting ) has an invariant measure which is correct at second-order in the effective timestep .
6.3 Overdamped limit of the correction terms
In order to relate the convergence result from Theorem 2.21 to the error estimates from Theorem 2.16, we prove that the limits of the correction functions as agree with the functions defined in (43) (see Section 4.10 for the proof). This can be seen as a statement regarding the permutation of the limits and for the leading correction term, namely, for a smooth function ,
There exists a constant such that, for all ,
where the constant is defined in (43).
Let us also mention that the overdamped limit of the correction function for first order splittings is not well defined. This is not surprising since the invariant measures of the corresponding numerical schemes are not consistent with , as discussed in Section 2.6.1. For instance, combining (17) and the expressions of the correction functions (31), we see that there exists a constant such that
defined on , is the generator of the overdamped Langevin dynamics with non-trivial mass matrix:
Nonequilibrium dynamics and the computation of transport coefficients
We discuss in this section the numerical estimation of transport properties such as the thermal conductivity, the shear stress, etc. (see Evans & Morriss (2008); Tuckerman (2010) for general physical presentations of the computation of transport coefficients, and Section 3.1 of Stoltz (2012) for a mathematically oriented introduction).
the generator of the perturbation (considered as an operator on , with core ). Note that the constant force does not derive from the gradient of a smooth function defined on . (It would indeed seem that this force derives from , but this potential is not periodic.) Therefore, the expression of the invariant measure is unknown, but can be nonetheless obtained as an expansion in powers of when the magnitude of the forcing is sufficiently small (see Section 3.1). The effect of the force is to create a non-zero average velocity in the direction of . The magnitude of the average velocity is a property of the system under consideration. For small forcings, it is linear in , with a constant of proportionality called the mobility (see the definition (47) below), related to the autodiffusion coefficient through (50).
As shown in Joubaud et al. (2015), it is possible to consider more general forcing terms which do not derive from the gradient of a periodic function. A popular example is provided by shearing forces where the particles experience a force in some direction, whose intensity depends on the coordinates of the system in another direction.
We will also be interested in the overdamped limit of the nonequilibrium dynamics (45), which reads
The generator of this dynamics is with (all operators being defined on the core ). In this case the physically relevant response turns out to be the average force exerted in the direction .
From linear response theory (see for example the presentation in (Stoltz, 2012, Section 3.1), and the short summary provided in Section 4.11), it can be shown that
The mobility can therefore be rewritten as the integrated autocorrelation function of the velocity in the direction :
where the expectation is over all initial conditions distributed according to and over all realizations of the equilibrium Langevin dynamics (7). From this relation, it is easily seen that the mobility in the direction is related to the autodiffusion coefficient
In practice, the two most popular ways of estimating a transport coefficient rely on the Green-Kubo formula (49) and the linear response of nonequilibrium dynamics in their steady-states (47). Since the error estimates for Green-Kubo type formulas have already been discussed in Theorem 2.19, we will restrict ourselves in the sequel to the analysis of the numerical errors introduced by nonequilibrium methods.
The derivation of this formula is very similar to that leading to (47). The following result summarizes the limiting behavior of the mobility as the friction increases (recall that we set mass matrices to identity when studying overdamped limits).
There exists such that, for any ,
This result is already contained in Hairer & Pavliotis (2008), but we nonetheless provide a short alternative proof in Section 4.11.2 (see Remark 4.13 for a more precise comparison of the results). It shows that, in the overdamped regime ,
which suggests to estimate using the linear response of for large frictions since this quantity is expected to be a good approximation of – instead of relying on the standard linear response result (47), for which the response is of order and is hence difficult to reliably estimate. Error estimates on the numerical approximation are deduced from (55) below.
2 Numerical schemes for the nonequilibrium Langevin dynamics
We present in this section numerical schemes approximating solutions of (45). These schemes reduce to the schemes presented in Section 2.2 when . Since the aim is to decompose the evolution generated by into analytically integrable parts, there are two principal options: either replace by
where is defined after (18), and is a sequence of independent and identically distributed Gaussian random vectors with identity covariance. As , a standard Euler-Maruyama discretization of the equilibrium overdamped Langevin dynamics (i.e. ) is obtained, whereas we would like to obtain a consistent discretization of nonequilibrium overdamped Langevin dynamics (46). We therefore instead consider schemes obtained by replacing with , such as the first order splitting
The numerical scheme associated with the first order splitting scheme
indeed is, in the limit as , a consistent discretization of the nonequilibrium Langevin dynamics (46), and its invariant measure turns out to converge to the invariant measure of (46) in the limit .
uniformly in the timestep and the forcing magnitude . There also exist (depending on , and but not on ) such that, for all functions , the following holds for almost all :
Let us emphasize that we do not have any control on the convergence rate in terms of , and it could well be that goes to 0 as increases.
3 Error estimates on transport coefficients from nonequilibrium methods
The following result provides error estimates for the invariant measure of the first order or second order splittings schemes of Section 2.2.2 when is replaced by .
Denote by the order of the splitting scheme, by the leading order correction function in the case as given by Theorem 2.13 for and by Theorem 2.16 for . Then, there exists a function such that, for any smooth function , there exist and a constant for which, for all and ,
where is defined in (48), and
The proof of this result can be found in Section 4.12. Note that the remainder term now collects higher order terms both as powers of the timestep and the nonequilibrium parameter . The estimates we obtain on the remainder are however compatible with taking the linear response limit, as made precise by the following error estimate on the transport coefficient (which is an immediate consequence of Theorem 3.4). In order to state the result, we introduce the reference linear response for an observable
It is often the case that has a vanishing average with respect to , as is the case for the function in (47). In general, it however has a non-zero average with respect to the invariant measure of the numerical scheme associated with a discretization of the equilibrium dynamics.
There exist and a constant such that, for all and ,
where is uniformly bounded.
In particular, we obtain the following estimate on the numerically computed mobility:
where the reference mobility is defined in (48).
We consider the same system as in Section 2.5.3, with an external force and forcing strengths uniformly spaced in the interval with (so that ). We fix the friction to and the inverse temperature to . We use a coupling strategy to reduce the statistical noise in the computation of the linear response (53). The replicas of the system are started at the same position , with the same velocity (sampled according to the canonical measure ). Each replica experiences the force (Note that the first replica experiences the reference force corresponding to a discretization of the equilibrium dynamics). Most importantly, the same Gaussian random numbers are used for all replicas to discretize the Brownian motion. Although not carefully documented here, this coupling strategy tremendously decreases the statistical error in the computed linear response. Such a coupling strategy was already proposed for exclusion processes in Goodman & Lin (2009). However, our experience shows that it fails for higher dimensional systems with more complex potentials (such as Lennard-Jones fluids).
For a given value of the timestep , we denote by the discrete trajectory of the th replica. The linear response in the projected average velocity is approximated over integration steps as
We then estimate the mobility by a linear fit on the first values of considered as a function of (see Figure 2, left). The value is the estimated slope in the fit. The behavior of the mobility as a function of the timestep is presented in Figure 2 (right) for the numerical schemes associated with the first order splitting and the second order splitting . We used for the first order scheme, and for the second order one. The statistical error is very small and error bars are therefore not reported. The computed mobilities can be fitted for small as
for the second order splitting scheme, in agreement with the theoretical prediction (54).
4 Error estimates in the overdamped limit
We now study the numerical errors arising in the simulation of nonequilibrium systems in the large friction limit. We restrict ourselves to the second order splittings where the Ornstein-Uhlenbeck part is either at the ends or in the middle (categories (i) and (ii) in Section 2.2.2). To state the result, we introduce the first order correction to the invariant measure in terms of the magnitude of the nonequilibrium forcing, namely (recall )
The proof is presented in Section 4.13. This result allows us to estimate the error in the computation of the transport coefficient based on (51) and Lemma 3.2. Indeed, studying the linear response of the observable and defining
In the latter expression, can be numerically estimated, in a manner similar to that presented at the end of Section 3.3.
Proofs of the results
Unless otherwise stated, the default norm and scalar product are the ones associated with the Hilbert space . Recall that, unless otherwise mentioned, all operators are defined on , and that formal adjoint operators are by default considered on . Recall also that
with since .
The proof of Lemma 2.5 follows the same lines as the proof of uniform hypocoercive estimates in the corrected version of Theorem 3 in Joubaud & Stoltz (2012a) (see the erratum Joubaud & Stoltz (2013) or the updated preprint version Joubaud & Stoltz (2012b)). We provide a simplified version of it for completeness.
We show that the operator is uniformly hypocoercive for . The aim is to obtain bounds on the inverse extended to . To this end, we decompose for as
The proof of Theorem 6.2 in Hairer & Pavliotis (2008) shows that there exists such that, for all ,
where the norm induced by is equivalent to the norm. More precisely, is the bilinear form defined by
with appropriate coefficients . It follows that there exists independent of such that
Using the rewriting (56) of the operator , and the commutation relations , a simple computation shows
for functions . Therefore,
Summing (59) on and , the quantity (58) is seen to be non-negative for an appropriate choice of constants .
From (57), we then deduce that there exists a constant such that, for any and for any , it holds . Taking inverses and passing to the limit in gives
We are now in position to give the proof of Theorem 2.4.
We write the proof for . The estimates for are obtained by using (the momentum reversal operator being defined in (11)), and the fact that , and .
The lower bound in (16) could be obtained directly provided is not constant, by considering the special case
where is a constant chosen such that has a vanishing average with respect to . This example is also useful to motivate the fact that, in general, solutions of the Poisson equation have divergent parts of order as .
Let us now turn to the refined upper and lower bounds (17), which we prove using techniques from asymptotic analysis. Consider , and the unique solution of the following Poisson equation . The above example suggests the following expansion in inverse powers of :
To rigorously prove this expansion, we first proceed formally, taking (60) as an ansatz, plugging it into and identifying terms according to powers of . This leads to
The first equality implies that since satisfies a Poincaré inequality on (where is defined in (6)). The second then reduces to , from which we deduce . Inserting this expression in the third equality gives
The solvability condition for this equation is that the right-hand side has a vanishing average with respect to , i.e. belongs to the kernel of . This condition reads
Coming back to (60), we see that the proposed approximate solution is such that
We now choose such that belongs to , which amounts to
It is easily checked that is a well defined element in for : first, , so . Finally, the image under of any function in is a function of average zero with respect to , depending only on the position variable and belonging to ; hence to .
Combining (61) and Lemma 2.5, we see that there exists a constant , such that, for all , it holds for the above choices of functions . This gives (17).
2 Ergodicity results for numerical schemes
We write the proof for the scheme associated with the evolution operator , starting by the case , before turning to the general case . The proofs for other schemes are very similar, and we therefore skip them.
The numerical scheme corresponding to is (18). We introduce such that (in the sense of symmetric matrices). A simple computation shows that
We choose for instance , in which case
for sufficiently small. Finally, since ,
for sufficiently small. This gives (21). To obtain (22), we iterate the bound (21):
The computations are similar for a general power . We write with . Note that is of order because of the random term. We work componentwise, using the assumption that is diagonal, so that, denoting by the mass of the th degree of freedom,
where the remainder is uniformly bounded as . Distinguishing between and , we have
The proof is then concluded as in the case by choosing sufficiently small (independently of ).
for a well chosen probability measure and a constant . The idea of the proof is to explicitly rewrite and as perturbations of the reference evolution corresponding to and . Since we consider smooth potentials and the position space is compact, the perturbation can be uniformly controlled when the initial momenta are within a compact set.
We write the proof for the scheme associated with the evolution operator , as in the proof of Lemma 2.6. A simple computation shows that, for ,
Denote by the centered Gaussian random variable
is a centered Gaussian random variable. Now,
Note that is uniformly bounded: using in the sense of symmetric, positive matrices (with ),
provided is sufficiently small. Therefore, there exists a constant (depending on ) and such that, for all timesteps and corresponding integration steps ,
A lengthy but straightforward computation shows that the variance of the centered Gaussian vector is
To check that this expression is appropriate, we note that it converges as with to the variance of the limiting continuous process
starting from , which reads
The result follows by combining (62)-(63)-(64) and introducing the probability measure
We only prove (24) and (23) since the other results are standard. To obtain the bound (24), we first note that, by the results of Hairer & Mattingly (2011), there exists such that, for any function and (the critical timestep being given by Lemmas 2.6 and 2.7), the following holds for almost all :
so that, using the contractivity property ,
Introducing , the argument of the exponent reads
when is sufficiently small. This gives (24).
The moment estimate (23) is obtained by averaging (21) with respect to the invariant measure:
Since is invariant,
which gives the desired result with for instance, provided is sufficiently small.
3 Some useful results
We give in this section an expression for the evolution operator
It is easy to check that the operators defined in (8) map to itself. It is in fact possible to analytically write down the action of the associated semigroups:
Coming back to the general case, the key building block for the subsequent numerical analysis is the following equality:
where is a notation indicating that the operators with the smallest indices (or their associated semigroups) are farthest to the right. In fact, simple computations show that
Therefore, the following equality holds when applied to functions :
3.2 Baker-Campbell-Hausdorff (BCH) formula
It is important to rewrite the various terms in the right-hand side of (66) in a form more amenable to analytical computations. More precisely, it is convenient to write the following equality in terms of operators defined on :
where the operator involves commutators , which can also be defined as operators on with values in . In fact, the algebraic expressions of the operators can be formally obtained from the BCH formula for first order splittings (see for instance (Hairer et al., 2006, Section III.4.2)): for ,
and from the symmetric BCH formula for second order involving 3 operators (obtained by composition of the standard BCH formula involving 2 operators):
where we do not write down the expressions of the higher order terms (for ). Let us insist that these formulas are only formal (since the operators appearing the argument of the exponential on the right-hand side involve more and more derivatives), but nonetheless allow us to find the algebraic expressions of upon formally expanding the exponential as
and identifying terms with the same powers of in (66).
3.3 Approximate inverse operators
Consider an operator defined on some core (typically some subspace of ), and whose inverse is also defined on in the following sense: for any , there exist such that . We denote by the element . At this stage, we do not assume any boundedness in an appropriate operator norm for or some extension of it. We next consider a perturbation for some exponent , where is also defined on and has values in . In the typical situations encountered in this article, is not bounded with respect to in an appropriate operator norm since it may involve higher order derivatives than does. It is therefore impossible in general to properly define the inverse of .
However, it is possible to introduce an approximate inverse, which we define as an operator from to such that there exists an operator from to for which the following equality holds for any function :
4 Proof of Theorem 2.13
First, note that, by definition of the invariant measure , it holds that, for any ,
The next step is to choose the correction function . Using the results of Section 4.3, a simple computation shows that
The dominant term on the right-hand side can be written, using integration by parts,
In view of (69), we choose the correction function in order to eliminate the dominant term:
We would like, at this stage, to replace the observable appearing on the left hand side by the function
However, we do not have any control on the derivatives of this function (Corollary 2.9 allows to control the norm of the function, not of its derivatives), whereas such a control is required to bound the remainder terms. In order to use an approximate inverse operator involving iterated powers of (see Section 4.3.3), we first need to make sure that all operators are defined on , with values in . This is the case for and its inverse, but not for the other operators appearing in (70), which have values in . We therefore project out averages with respect to . Define to this end the projector
which maps to . Then, for a function (for which ), (72) can be rewritten as
where we have used the fact that is of average zero with respect to . On the other hand, (69) may be rewritten
As a consequence of the presence of the projection , all of the operators in (70) are restricted to the range of , i.e. the following equality holds on :
which is a well defined operator from to such that
where maps to . We finally replace by in (74). This gives (recall that by assumption)
where the functions belong to when does. The integral on the right-hand side is uniformly bounded for small (using the fact that the functions appearing in the integral are in and relying on Proposition 2.8). This gives (30) for the splitting scheme .
The function (denoted by above) is uniquely determined by the equation
where we have used to simplify the right-hand side. Now, since and . Therefore, . In addition,
since and . Therefore,
The expressions for the first order corrections when the operators and are exchanged are obtained by noting that the sign of is changed and that .
Let us highlight the structure of the proof, in order to make clear which technical extensions are required in order to state error estimates for other dynamics:
first, an expansion of the evolution operator in powers of has to be written out. This step is usually quite simple although sometimes algebraically involved. The expansion of is the same as the one used to prove weak error estimates;
second, good control on the resolvent has to be established, such as the stability result provided by Theorem 2.2. This step may already be quite complicated since it involves proving that is the unique invariant measure, and that the resolvent can be inverted for functions with average zero with respect to . A typical way to do so is to establish decay properties of the semigroup. Such decay estimates may be hard to obtain for degenerate noises;
the existence of an invariant measure for the numerical scheme has to be demonstrated (uniqueness is not required), typically by finding a Lyapunov function. Again, this may be difficult if the dynamics is highly degenerate.
5 Proof of Proposition 2.15
We use a very standard strategy: first, we propose an ansatz for the correction term as
then identify the two leading order terms in this expression, and finally use the resolvent estimate of Theorem 2.3 to conclude. Note that our ansatz is not obvious since the estimate of Theorem 2.3 shows that, in general, a leading order correction term of order should be considered. It turns out however that, due to the specific structure of the right-hand side of (31) (namely the fact that the right-hand is at leading order in the image under the Hamiltonian operator of some function), such a divergent leading order term is not necessary.
Consider for instance the case when is . This function solves
so that we consider the ansatz . Identifying terms with same powers of , we see that the correction term should satisfy
Possible solutions are defined up to elements of the kernel of (which contains function of the form ). One possible choice is to set , where the constant is chosen in order for to have a vanishing average with respect to . Then,
In view of Theorem 2.3, this implies that there exists a constant such that
for , which gives the desired estimate on . Similar computations give the estimate on , while the estimates on the remaining functions are obtained from (31).
6 Proof of Theorem 2.16
The proof follows the same lines as the proof for the first order splitting schemes (see Section 4.4). We present only the required modifications. We write the proof for since the correction term has a much simpler right-hand side than .
Expanding up to terms of order the formal expression of given by the BCH expansion (67), we obtain the following equality (as operators on )
We choose as the unique solution of the Poisson equation (which is indeed well posed since the right hand side has a vanishing average with respect to since it is in the image of , and is regular as shown by (78) below). Then, for a function ,
where many terms cancel by the invariance of by (for integer powers ). The leading order term on the right-hand side in fact vanishes since it can be rewritten as
We then restrict the above equality to functions , project out the average with respect to of the first factor in the integral on the left using the projector introduced in (73), and finally replace by where is an approximate inverse satisfying
The proof is concluded as in Section 4.4.
To evaluate the expression , we need to compute the actions of the formal adjoints of the various commutators. Using and
straightforward computations show that . In addition, since
where we have used (as can be checked by a direct computation). A similar computation shows that \big{(}[B,[B,A]]\big{)}^{*}\mathbf{1}=(-AB+2BA+B^{2})g=(A+B)Bg=ABg (since by a direct verification). Finally,
To obtain the expression of , we use the TU lemma with the operator
In fact, it can be shown that the term does not pollute the remainder since the next order correction in the invariant measure has to be of order (see (32)). The expressions for and are obtained in a similar manner.
7 Proof of Corollary 2.17
where we have used the invariance of by . The comparison with (32)-(33) gives the desired result.
8 Approximation of integrated correlation functions
The proof makes use of the projection operator defined on as (compare (73))
The range of is contained in the set of functions with average zero with respect to the invariant measure of the numerical scheme. We first introduce the invariant measure for the numerical scheme, using the fact that has zero average with respect to :
where is uniformly bounded for sufficiently small by (38). In addition, by (39),
Note that the sum on the right hand side is well defined in view of the decay estimates (24). Plugging the above equality in (79) leads to
The second term on the right hand side is uniformly bounded in view of the moment estimates on , the resolvent bounds provided by Corollary 2.9 and the uniform boundedness of the remainder for a given, smooth function . Since
The idea is to start from (40) and to appropriately rewrite the first order correction term. We use to this end (40) with replaced by its first order correction , and discard terms of order :
where is uniformly bounded for sufficiently small and . On the other hand, using ,
9 Proof of Theorem 2.21
We write the proof for the evolution operator first, and mention then how to extend the result to using the TU lemma. The proofs for and are very similar, so we only briefly mention the required modifications. By default, all operators appearing in this section are defined on the core .
This suggests to consider the limiting operator and write
For a given smooth function which depends only on the position variable ,
The idea is that the remainders and are exponentially small when the function is sufficiently smooth (see below for a more precise discussion, once has been replaced by with an appropriate approximate inverse). Therefore, the leading order terms in the error estimate are obtained by considering the limiting operator only.
We now study the error estimates associated with , following the strategy used in Section 4.4. We first use the results of Section 4.3.1 with , and to expand , so that
with . To give more precise expressions of the operators appearing on the right-hand side of the above equality, we use the following facts:
Plugging the above results in (83) and introducing ,
An approximate inverse of the operator appearing on the left hand side of the above equality is thus
where is the unique solution of
A more explicit expression can be obtained by noting that
so that (recalling where the formal adjoints are taken on )
Since should have a vanishing average with respect to , this proves that
where the constant is adjusted to account for the constraint of vanishing average. A simple computation shows that it is equal to the constant defined in (43).
In fact, it is possible for the scheme considered here to precisely determine the leading order correction for numerical averages by noting that
We now come back to (81)-(82) and replace by :
where is the same as in (91), while
so that while . By the TU lemma,
where the remainder is uniformly bounded for sufficiently small. Therefore,
We mimic the above proof for the evolution operator . The equality (83) still holds, but the operator now reads
The expression of is obtained via the TU lemma, introducing the limiting operator
Let us conclude this section with the proof of Lemma 4.9.
The conclusion follows for instance by an application of Theorem 8.7 in Rey-Bellet (2006), considering as a reference dynamics the Ornstein-Uhlenbeck process
for an appropriate constant . This shows the existence of constants such that
10 Proof of Proposition 2.22
Note that the above function has average zero with respect to . We then apply Theorem 2.4 to obtain
To compute , we rely on (86) and (87) and obtain
This allows us to conclude that the limit of is the argument of the operator in the previous line, up to an additive constant chosen to ensure that has a vanishing average with respect to (which turns out to be ). We deduce the limit for with (33) since .
The expressions for the limits of and are obtained in a similar fashion.
11 Linear response theory
We briefly sketch the discussion in (Stoltz, 2012, Section 3.1) (see in particular Theorem 3.1 in this reference). Hypoellipticity arguments show that the measure has a smooth density with respect to the Lebesgue measure. It moreover formally satisfies the Fokker-Planck equation
This equation can be given a rigorous meaning when is sufficiently small. We rely on the following result (proved at the end of this section), which is itself based on the fact that can be extended to a bounded operator on (see Theorem 2.3 and the comment after it).
The operator , considered as an operator on the Hilbert space introduced in (14), is bounded.
Denoting by the spectral radius of , it is easily checked that is invertible for with
Therefore, a straightforward computation shows that
with uniformly bounded as . This gives (48).
Note first that the image of is contained in since, for any ,
It is therefore possible to give a meaning to the operator as an operator on . We then check that the perturbation is -bounded (with relative bound 0, in fact): for ,
so that, for (recall that is well defined in this case),
This proves that is bounded, hence its adjoint is bounded as well.
11.2 Proof of Lemma 3.2
Recall that we set mass matrices to identity when considering overdamped limits. Since
it follows (using first (98) to compute the linear response and then (17) to obtain the asymptotic behavior of as )
where is uniformly bounded for . This gives the desired result.
The article Hairer & Pavliotis (2008) in fact studies the limiting behavior of the autodiffusion coefficient, as computed from (50):
Using , a simple computation shows
so that .
12 Proof of Theorem 3.4
The proof again is along the lines of the proof written in Section 4.4, and we are therefore very brief, mentioning only the most important modifications.
Let us first consider the first order scheme . Using the notation introduced in Section 4.3.1, and recalling the definition , we write
All the operators appearing in the expressions above are defined on the core , and have values in . Since
it is easy to see that the operator can be rewritten as the sum of two contributions: , where, for , the smooth function can be uniformly controlled in for . Finally, the evolution operator can be rewritten as
where is defined in (70) (which corresponds to the case ), , and
We then compute, for and to be chosen later,
The first two terms in the last expression vanish by definition of and , while the third one vanishes when the function is defined by the Poisson equation
It is easy to check that the right-hand side of this equation has a vanishing average with respect to (integrating with respect to and letting the adjoints of the operators act on ). We then project (99) using and introduce the approximate inverse, defined on as
obtained by truncating the formal series expansion of the inverse operator by discarding terms associated with or . The approximate inverse is such that
with . We then replace by and conclude as in Section 4.4.
The result for the second order splitting is obtained by appropriate modifications of the proof written above for , similar to the ones introduced in Section 4.6. We will therefore mention only the most important point, which is the following. Replacing by in the expansion (77), we see that
where regroups operators of order or for , the operator is defined in (76) and satisfies
We consider only contributions of the form with and . The contributions in are the same as in the case and therefore vanish. The contribution in vanishes in view of the choice of . For the same reason, the contribution in vanishes as well:
The contribution in is proportional to
The requirement that this expression vanishes for all functions characterizes the function (the discussion on the solvability of this equation following the same lines as the discussion on the solvability of (101)). The proof is then concluded as in the case .
13 Proof of Theorem 3.6
The proof of this result is obtained by modifying the proof of Theorem 2.21 presented in Section 4.9 by taking into account the nonequilibrium perturbation, as done in the proof of Theorem 3.4 presented in Section 4.12. We will therefore be very brief and only mention the most important modifications.
We write the proof for the scheme associated with the evolution operator for instance (since this is the case explicitly treated in Section 4.9 for ). First, arguing as in Section 4.9, we see that it is possible to replace by
up to error terms in the invariant measure which are exponentially small in . Note that , so that the rules (84)-(85) are still valid. Therefore, introducing again ,
where is defined in (88), and the expressions of the operators () are obtained by expanding the various terms in powers of . Keeping only the dominant terms, we arrive at
This relation is the analogue of (100) in the overdamped limit, and the remainder of the proof is carried on following the strategy presented in Section 4.9.
Acknowledgements
The authors thank Francis Nier for several fruitful discussions on the properties of Langevin-type generators. Ben Leimkuhler and Charles Matthews acknowledge the support of the Engineering and Physical Sciences Research Council (UK) and grant EP/G036136/1. G. Stoltz was partially supported by the project DYMHOM (De la dynamique moléculaire, via l’homogénéisation, aux modèles macroscopiques de poroélasticité et électrocinétique) from the program NEEDS (Projet fédérateur Milieux Poreux MIPOR). G. Stoltz also benefited from the scientific environment of the Laboratoire International Associé between the Centre National de la Recherche Scientifique and the University of Illinois at Urbana-Champaign.