Variational integrators for stochastic dissipative Hamiltonian systems
Michael Kraus, Tomasz M. Tyranowski

TL;DR
This paper develops variational integrators for stochastic dissipative Hamiltonian systems, enabling structure-preserving simulations that maintain key physical properties over long times, with applications to kinetic plasma models.
Contribution
It introduces a general methodology for deriving stochastic variational integrators based on a stochastic Hamiltonian framework, extending geometric numerical methods to stochastic dissipative systems.
Findings
Integrators preserve a discrete stochastic Lagrange-d'Alembert principle.
Numerical tests show superior stability and energy behavior.
Application to Vlasov-Fokker-Planck equation demonstrates effectiveness.
Abstract
Variational integrators are derived for structure-preserving simulation of stochastic forced Hamiltonian systems. The derivation is based on a stochastic discrete Hamiltonian which approximates a type-II stochastic generating function for the stochastic flow of the Hamiltonian system. The generating function is obtained by introducing an appropriate stochastic action functional and considering a stochastic generalization of the deterministic Lagrange-d'Alembert principle. Our approach presents a general methodology to derive new structure-preserving numerical schemes. The resulting integrators satisfy a discrete version of the stochastic Lagrange-d'Alembert principle, and in the presence of symmetries, they also satisfy a discrete counterpart of Noether's theorem. Furthermore, mean-square and weak Lagrange-d'Alembert Runge-Kutta methods are proposed and tested numerically to demonstrate…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Variational integrators for stochastic dissipative Hamiltonian systems
Michael Kraus [email protected] Max-Planck-Institut für Plasmaphysik
Boltzmannstraße 2, 85748 Garching, Germany
Technische Universität München, Zentrum Mathematik
Boltzmannstraße 3, 85748 Garching, Germany
Tomasz M. Tyranowski [email protected] Max-Planck-Institut für Plasmaphysik
Boltzmannstraße 2, 85748 Garching, Germany
Abstract
Variational integrators are derived for structure-preserving simulation of stochastic forced Hamiltonian systems. The derivation is based on a stochastic discrete Hamiltonian which approximates a type-II stochastic generating function for the stochastic flow of the Hamiltonian system. The generating function is obtained by introducing an appropriate stochastic action functional and considering a stochastic generalization of the deterministic Lagrange-d’Alembert principle. Our approach presents a general methodology to derive new structure-preserving numerical schemes. The resulting integrators satisfy a discrete version of the stochastic Lagrange-d’Alembert principle, and in the presence of symmetries, they also satisfy a discrete counterpart of Noether’s theorem. Furthermore, mean-square and weak Lagrange-d’Alembert Runge-Kutta methods are proposed and tested numerically to demonstrate their superior long-time numerical stability and energy behavior compared to non-geometric methods. The Vlasov-Fokker-Planck equation is considered as one of the numerical test cases, and a new geometric approach to collisional kinetic plasmas is presented.
1 Introduction
Stochastic differential equations (SDEs) play an important role in modeling dynamical systems subject to internal or external random fluctuations. Standard references include [10], [54], [62], [69], [89], [100]. Within this class of problems, we are interested in stochastic forced Hamiltonian systems, which take the form
[TABLE]
where and for are the Hamiltonian functions, and are the forcing terms, is the standard -dimensional Wiener process, and denotes Stratonovich integration. We use to denote the stochastic differential of stochastic processes (other than the Wiener process ) to avoid confusion with the exterior derivative of differential forms. The system (1) can be formally regarded as a classical forced Hamiltonian system with the randomized Hamiltonian given by , and the randomized forcing given by , where and are the deterministic Hamiltonian and forcing, respectively, and , represent the intensity of the noise. Equation (1) is a generalization of stochastic Hamiltonian systems considered in [13], [50], [72], and [93]. Such systems can be used to model, e.g., mechanical systems with uncertainty, or error, assumed to arise from random forcing, limited precision of experimental measurements, or unresolved physical processes on which the Hamiltonian of the deterministic system might otherwise depend. Applications arise in many models in physics, chemistry, and biology. Particular examples include molecular dynamics (see, e.g., [12], [55], [70], [112]), dissipative particle dynamics (see, e.g., [103]), investigations of the dispersion of passive tracers in turbulent flows (see, e.g., [108], [121]), energy localization in thermal equilibrium (see, e.g., [102]), lattice dynamics in strongly anharmonic crystals (see, e.g., [39]), description of noise induced transport in stochastic ratchets (see, e.g., [71]), and collisional kinetic plasmas ([61], [113]).
As occurs for other SDEs, most Hamiltonian SDEs cannot be solved analytically and one must resort to numerical simulations to obtain approximate solutions. In principle, general purpose stochastic numerical schemes for SDEs can be applied to stochastic Hamiltonian systems. However, as for their deterministic counterparts, stochastic Hamiltonian systems possess several important geometric features: in the case of systems without forcing, their phase space flows (almost surely) preserve the symplectic structure ([13], [92], [93]); when the forcing terms are present, then the solutions also satisfy the stochastic Lagrange-d’Alembert principle, as will be shown in Section 2, and in some special cases the phase space flow may be conformally symplectic (see [14], [51], [94]). When simulating these systems numerically, it is therefore advisable that the numerical scheme also preserves such geometric features. Geometric integration of deterministic Hamiltonian systems has been thoroughly studied (see [41], [88], [107] and the references therein) and symplectic integrators have been shown to demonstrate superior performance in long-time simulations of Hamiltonian systems without forcing, compared to non-symplectic methods; so it is natural to pursue a similar approach for stochastic Hamiltonian systems. This is a relatively recent pursuit. Stochastic symplectic integrators are discussed in [5], [7], [8], [9], [22], [25], [33], [52], [80], [81], [92], [93], [95], [118], [127], [128], [130], [132].
Long-time accuracy and near preservation of the Hamiltonian by symplectic integrators applied to deterministic Hamiltonian systems have been rigorously studied using the so-called backward error analysis (see, e.g., [41] and the references therein). To the best of our knowledge, such general rigorous results have not yet been proved for stochastic Hamiltonian systems, but backward error analysis for SDEs is currently an active area of research. Modified SDEs associated with some particular numerical schemes are considered in [1], [31], [32], [111], [129], and [133]. Backward error analysis for the Langevin equation with additive noise is studied for several integrators in [2], [63], and [64]. Recently, backward error analysis for a weak symplectic scheme applied to a stochastic Hamiltonian system has been presented in [6]. Asymptotic preservation of large deviation principles by stochastic symplectic methods is investigated in [29]. The numerical evidence and partial theoretical results to date are promising and suggest that stochastic geometric integrators indeed possess the property of very accurately capturing the evolution of the Hamiltonian over long time intervals.
An important class of geometric integrators are variational integrators. This type of numerical schemes is based on discrete variational principles and provides a natural framework for the discretization of Lagrangian systems, including forced, dissipative, or constrained ones. These methods have the advantage that they are symplectic when applied to systems without forcing, and in the presence of a symmetry, they satisfy a discrete version of Noether’s theorem. For an overview of variational integration for deterministic systems see [84]; see also [44], [56], [59], [74], [75], [97], [98], [106], [123], [126]. Variational integrators were introduced in the context of finite-dimensional mechanical systems, but were later generalized to Lagrangian field theories (see [83]) and applied in many computations, for example in elasticity, electrodynamics, or fluid dynamics; see [77], [99], [117], [122].
Stochastic variational integrators were first introduced in [16] and further studied in [15]. However, those integrators were restricted to the special case when the Hamiltonian functions were independent of , and only low-order Runge-Kutta types of discretization were considered. Stochastic discrete Hamiltonian variational integrators applicable to a general class of Hamiltonian systems were proposed in [50] by generalizing the variational principle for deterministic systems introduced in [75] and applying a Galerkin type of discretization; see also [48]. In the present work we extend the ideas put forth in [50] to forced systems of the form (1) and propose the corresponding Lagrange-d’Alembert variational integrators.
When the forcing terms in Eq. (1) are linear functions of the momentum variable , then the stochastic flow of the system is conformally symplectic (see [94] and Section 2.4). Stochastic conformally symplectic integrators for such systems were proposed in [14], [17], and [51]. Quasi-symplectic integrators were introduced in [94] and further studied in [90]. These ideas are very interesting, but at present seem to be limited only to systems that exhibit a very special form, that is, systems with separable Hamiltonians, linear forcing terms, and additive noise. The stochastic Lagrange-d’Alembert variational integrators introduced in Section 3 are applicable to the general class of systems of the form (1) and preserve their underlying variational structure.
Main content
The main content of the remainder of this paper is, as follows.
In Section 2 we introduce a stochastic Lagrange-d’Alembert principle and a stochastic generating function suitable for considering stochastic forced Hamiltonian systems, and we discuss their properties.
In Section 3 we present a general framework for constructing stochastic Lagrange-d’Alembert variational integrators, prove the discrete stochastic Lagrange-d’Alembert principle, propose mean-square and weak stochastic Lagrange-d’Alembert Runge-Kutta methods, and present several particularly interesting examples of low-stage schemes. We also discuss connections with the idea of quasi-symplectic integrators.
In Section 4 we present the results of our numerical tests, which verify the excellent long-time performance of our integrators compared to some popular non-geometric methods. In particular, as one of the test cases we consider the Vlasov-Fokker-Planck equation, which is used as a model for collisional kinetic plasmas.
Section 5 contains the summary of our work.
2 Lagrange-d’Alembert principle for stochastic forced Hamiltonian systems
The stochastic variational integrators proposed in [16] and [15] were formulated for dynamical systems which are described by a Lagrangian and which are subject to noise whose magnitude depends only on the position . Therefore, these integrators can be extended to (1) only if the Hamiltonian functions are independent of and the Hamiltonian is non-degenerate (i.e., the associated Legendre transform is invertible). However, in the case of general the paths of the system become almost surely nowhere differentiable, which poses a difficulty in interpreting the meaning of the corresponding Lagrangian. To avoid these kind of issues, in [50] an action functional based on a phase space Lagrangian was introduced, and variational integrators for unforced Hamiltonian systems were constructed. In the present work we extend the approach taken in [50] to include forced Hamiltonian systems. To begin, in the next section, we will introduce an appropriate stochastic action functional and show that it can be used to define a type-II generating function for the stochastic flow of the system (1).
2.1 Stochastic Lagrange-d’Alembert principle
Let the Hamiltonian functions and for be defined on the cotangent bundle of the configuration manifold , and let denote the canonical coordinates on . The Hamiltonian forces and for are fiber-preserving mappings with the coordinate representations and , respectively, where by a slight abuse of notation we use the same symbol to denote the force and its local representation. For simplicity, in this work we assume that the configuration manifold has a vector space structure, , so that and . In this case, the natural pairing between one-forms and vectors can be identified with the scalar product on , that is, , where denotes the coordinates on . Let be the probability space with the filtration , and let denote a standard -dimensional Wiener process on that probability space (such that is -measurable). We will assume that the Hamiltonian functions and the forcing terms are sufficiently smooth and satisfy all the necessary conditions for the existence and uniqueness of solutions to (1), and their extendability to a given time interval with . One possible set of such assumptions can be formulated by considering the Itô form of (1),
[TABLE]
with and
[TABLE]
where , , and denote the Hessian matrices of , whereas , , , and denote the Jacobian matrices of and , respectively, and the forcing matrix is defined as . For simplicity and clarity of the exposition, throughout this paper we assume that (see [10], [54], [62], [69])
- (H1)
and for are functions of their arguments,
- (H2)
and for are functions of their arguments,
- (H3)
and are globally Lipschitz.
These assumptions are sufficient for our purposes, but could be relaxed if necessary. Define the space
[TABLE]
Since we assume , the space is a vector space (see [100]). Therefore, we can identify the tangent space . We can now define the following stochastic action functional, ,
[TABLE]
where denotes Stratonovich integration, and we have omitted writing the elementary events as arguments of functions, following the standard convention in stochastic analysis. For a given curve \big{(}q(t),p(t)\big{)} in and its arbitrary variation \big{(}\delta q(t),\delta p(t)\big{)}, we define the corresponding variation of the action functional as
[TABLE]
Theorem 2.1** **(Stochastic Lagrange-d’Alembert Principle in Phase Space).
Suppose that , , and , for satisfy conditions (H1)-(H3). If the curve \big{(}q(t),p(t)\big{)} in satisfies the stochastic forced Hamiltonian system (1) for , where , then it also satisfies the integral equation
[TABLE]
almost surely for all variations \big{(}\delta q(\cdot),\delta p(\cdot)\big{)}\in C([t_{a},t_{b}]) such that almost surely and .
Proof.
Let the curve \big{(}q(t),p(t)\big{)} in satisfy (1) for . It then follows that the stochastic processes and are almost surely continuous, -adapted semimartingales, that is, \big{(}q(\cdot),p(\cdot)\big{)}\in C([t_{a},t_{b}]) (see [10], [100]). We calculate the variation (2.5) as
[TABLE]
where we have used the end point condition, . Since the Hamiltonians are and the processes , are almost surely continuous, in the last two lines we have used a dominated convergence argument to interchange differentiation with respect to and integration with respect to and . Upon applying the integration by parts formula for semimartingales (see [100]), we find
[TABLE]
Substituting and rearranging terms produces,
[TABLE]
where we have used . Therefore, we have
[TABLE]
Since \big{(}q(t),p(t)\big{)} satisfy (1), then by definition we have that almost surely for all ,
[TABLE]
that is, can be represented as the sum of the semi-martingales for , where the sample paths of the process are almost surely continuously differentiable. Let us calculate
[TABLE]
where in the last equality we have used the standard property of the Riemann-Stieltjes integral for the first term, as is almost surely differentiable, and the associativity property of the Stratonovich integral for the second term (see [100], [54]). Substituting (2.1) in the term of (2.1), we show that . By a similar argument we also prove that . Therefore, the left-hand side of (2.1) is equal to zero, almost surely.
∎
Remark: It is natural to expect that the converse theorem, that is, if \big{(}q(\cdot),p(\cdot)\big{)} satisfy the integral principle (2.6), then the curve \big{(}q(t),p(t)\big{)} is a solution to (1), should also hold, although a larger class of variations may be necessary. Variants of such a theorem for systems without forcing have been proved in Lázaro-Camí & Ortega [72] and Bou-Rabee & Owhadi [16]. We leave this as an open question. Here, we will use the action functional (2.4) and the Lagrange-d’Alembert principle (2.6) to construct numerical schemes, and we will directly verify that these numerical schemes converge to solutions of (1).
2.2 Stochastic type-II generating function and forcing
When the functions , , , and satisfy standard measurability and regularity conditions (e.g., (H1)-(H3)), then the system (1) possesses a pathwise unique stochastic flow . It can be proved that for fixed this flow is mean-square differentiable with respect to the , arguments, and is also almost surely a diffeomorphism (see [10], [54], [62], [69]). We will show below that the action functional (2.4) can be used to construct a type II generating function for . Let be a particular solution of (1) on . Suppose that for almost all there is an open neighborhood of , an open neighborhood of , and an open neighborhood of the curve such that for all and there exists a pathwise unique solution of (1) which satisfies , , and for . (As in the deterministic case, for sufficiently close to one can argue that such neighborhoods exist; see [82].) Define the function as
[TABLE]
where the domain is given by . Define further the two functions as
[TABLE]
Below we prove that the functions and generate111A generating function for the transformation is a function of one of the variables and one of the variables . Therefore, there are four basic types of generating functions: , , , and . In this work we use the type-II generating function . the stochastic flow .
Theorem 2.2**.**
The function is a type-II stochastic generating function and the functions are type-II stochastic exact discrete forces for the stochastic mapping , that is, is implicitly given by the equations
[TABLE]
where the derivatives are understood in the mean-square sense.
Proof.
Under appropriate regularity assumptions on the Hamiltonians and forces (e.g., (H1)-(H3)), the solutions and are mean-square differentiable with respect to the parameters and , and the partial derivatives are semimartingales (see [10]). We calculate the derivative of as
[TABLE]
where for notational convenience we have omitted writing and explicitly as arguments of and . Applying the integration by parts formula for semimartingales (see [100]), we find
[TABLE]
where the left-hand side integral is understood as a column vector with the components given by
[TABLE]
for each . Substituting and rearranging terms, we obtain
[TABLE]
since is a solution of (1). After performing similar manipulations for , together we obtain the result
[TABLE]
By definition of the flow, then .
∎
2.3 Noether’s theorem for stochastic systems with forcing
Let a Lie group act on by the left action . The Lie group then acts on and by the tangent and cotangent lift actions, respectively, given in coordinates by the formulas (see [47], [82])
[TABLE]
where and summation is implied over repeated indices. Let denote the Lie algebra of and the exponential map (see [47], [82]). Each element defines the infinitesimal generators , , and , which are vector fields on , , and , respectively, given by
[TABLE]
The momentum map associated with the action is defined as the mapping such that for all the function is the Hamiltonian for the infinitesimal generator , i.e.,
[TABLE]
where \xi_{T^{*}Q}(q,p)=\big{(}q,p,\xi^{q}_{T^{*}Q}(q,p),\xi^{p}_{T^{*}Q}(q,p)\big{)}. The momentum map can be explicitly expressed as (see [47], [82])
[TABLE]
Noether’s theorem for deterministic Hamiltonian systems relates symmetries of the Hamiltonian to quantities preserved by the flow of the system (see [47], [82]). When the Hamiltonian system is subject to external forces that are orthogonal to the infinitesimal generators of the symmetry group, then the corresponding momentum maps are still conserved (see [84]). It turns out that this result carries over to the stochastic case, as well. A stochastic version of Noether’s theorem for systems without forcing was proved in [13], [50], and [72]. Below we state and provide a proof of Noether’s theorem for stochastic forced Hamiltonian systems.
Theorem 2.3** **(Noether’s theorem for stochastic systems with forcing).
Suppose that the Hamiltonians and for are invariant with respect to the cotangent lift action of the Lie group , that is,
[TABLE]
for all . If the forcing terms are orthogonal to the infinitesimal generators of , that is,
[TABLE]
for all and , then the cotangent lift momentum map associated with is almost surely preserved along the solutions of the stochastic forced Hamiltonian system (1).
Proof.
Equation (2.25) implies that the Hamiltonians are infinitesimally invariant with respect to the action of , that is, for all we have
[TABLE]
where and denote differentials with respect to the variables and . Let be a solution of (1) and consider the stochastic process , where is arbitrary. Using the rules of Stratonovich calculus we can calculate the stochastic differential
[TABLE]
where we used (1), (2.23), (2.24), and (2.27). Therefore, if (2.26) holds, then J_{\xi}\big{(}q(t),p(t)\big{)}=\text{const} almost surely for all , which completes the proof.
∎
Remark.
When the external forces are not all orthogonal to the infinitesimal generators of the symmetry group, formula (2.3) provides the rate of change of the momentum map.
2.4 Conformal symplecticity and phase space volume
The flow for stochastic Hamiltonian systems without forcing almost surely preserves the canonical symplectic two-form
[TABLE]
that is, , where denotes the pull-back by the flow (see [93], [13], [72]). This property does not hold for the general stochastic forced Hamiltonian system (1). However, for certain choices of the forcing terms, the flow may be conformally symplectic, which means that for all there exists a constant (possibly random) such that
[TABLE]
Deterministic conformally symplectic systems are considered in [87]. Conformal symplecticity for the special case of (1) with a separable Hamiltonian, an additive noise, and the forcing terms equal to with a real parameter , and for , was considered in [14] and [51]. Below we demonstrate that the property of conformal symplecticity persists for more general cases.
Theorem 2.4** **(Conformal symplecticity).
Suppose that , , and , for satisfy conditions (H1)-(H3). If the forcing terms have the form
[TABLE]
for real parameters , then the stochastic flow for (1) is almost surely conformally symplectic with the parameter in (2.30) given by
[TABLE]
for all .
Proof.
For fixed , the stochastic process satisfies the system (1), which can be written as
[TABLE]
where and are vector fields on , and are given by, respectively,
[TABLE]
Let us calculate the stochastic differential of . Using the stochastic generalization of the dynamic definition of the Lie derivative (see Theorem 1.2 in [48]), we can write
[TABLE]
where and denote the Lie derivatives with respect to the vector fields and , respectively. Using Cartan’s magic formula (see, e.g., [3]) we have that
[TABLE]
since , where denotes the interior product with the vector field . Substituting (2.34), (2.31), and (2.29), we obtain
[TABLE]
since the Hamiltonian function is . In a similar fashion we show that . Plugging this in (2.35), we obtain a stochastic differential equation of the form
[TABLE]
It is straightforward to verify that the solution of (2.38) that satisfies the initial condition has the form
[TABLE]
with given by (2.32), which proves the conformal symplecticity of the flow . It holds almost surely, since the solution of the SDE (2.38) is pathwise unique (see [10], [54], [62], [69]).
∎
The evolution of stochastic Hamiltonian systems without forcing preserves volumes in phase space, that is, for the standard volume form on defined as
[TABLE]
we have that . This is a direct consequence of the symplecticity of the flow. Phase space volume preservation does not hold for the general forced system (1), although for certain choices of the forcing terms the flow may possess a property similar to (2.30). Such a property was proved for the special case of (1) with a separable Hamiltonian, an additive noise, and the forcing terms equal to with a constant matrix , and for (see [13], [51], [90], [91], [92], [93], [94]). Below we demonstrate that this property holds also for more general cases.
Theorem 2.5** **(Phase space volume evolution).
Suppose that , , and , for satisfy conditions (H1)-(H3). If the forcing terms have the form
[TABLE]
for constant matrices , then the phase space volume form for almost surely evolves according to the formula
[TABLE]
where
[TABLE]
and is the stochastic flow for (1).
Proof.
This theorem is a special case of, e.g., Lemma 4.3.1 in [69]. We briefly outline an alternative geometric proof, analogous to the proof of Theorem 2.4. Similar to (2.35), we can write
[TABLE]
Using the property of the divergence operator (see, e.g., [3]), we calculate
[TABLE]
where we have used (2.34) and (2.41), and the fact that the Hamiltonian function is . In a similar way we show that . Therefore, we obtain the SDE of the form
[TABLE]
It is straightforward to verify that the solution that satisfies the initial condition is given by (2.42) with as in (2.43). The formula (2.42) holds almost surely, because the solution of the SDE is pathwise unique (see [10], [54], [62], [69]).
∎
3 Stochastic Lagrange-d’Alembert variational integrators
Suppose we would like to solve (1) on the interval with the initial conditions . Consider the discrete set of times for , where is the time step. In order to determine the discrete curve that approximates the exact solution of (1) at times we need to construct an approximation of the exact stochastic flow on each interval , so that . A numerical method respecting the underlying Lagrange-d’Alembert principle (2.6) can be constructed by approximating the generating function and forcing terms in (2.15). Let the discrete Hamiltonian function be an approximation of the generating function (2.13), and let the discrete forces be approximations of the forcing terms (2.2). The approximate numerical flow is now generated as in (2.20):
[TABLE]
If there is no risk of confusion, we will omit writing the time arguments of and . We will refer to the scheme (3) as a stochastic Lagrange-d’Alembert variational integrator.
3.1 Discrete stochastic Lagrange-d’Alembert principle
The advantage of the integrator (3) is that it follows from a discrete version of the stochastic Lagrange-d’Alembert principle (2.6). The discrete Lagrange-d’Alembert principle for deterministic Lagrangian systems was proposed in [59]; see also [84]. Below we generalize it to the stochastic case in the setting of Hamiltonian systems defined on the phase space . Define the discrete random curve space as
[TABLE]
On that space define the discrete action functional, ,
[TABLE]
Note that is an approximation of the stochastic action functional (2.4) on the interval .
Theorem 3.1** **(Discrete stochastic Lagrange-d’Alembert Principle in Phase Space).
Suppose the discrete Hamiltonian is almost surely continuously differentiable, and the discrete forces are almost surely continuous with respect to their arguments. The discrete random curve satisfies the set of equations
[TABLE]
almost surely for , if and only if it almost surely satisfies the variational equation
[TABLE]
for all variations such that and almost surely.
Proof.
Consider an arbitrary random curve . Let us calculate the variation corresponding to the arbitrary variation with and (almost surely). We have
[TABLE]
where in the second equality we have shifted the summation index in the term and used the fact that . It is now straightforward to see that if the set of equations (3.1) is satisfied, then the variational equation (3.5) holds almost surely. Conversely, if the variational equation (3.5) holds for all variations with and , then the set of equations (3.1) has to be satisfied almost surely.
∎
3.2 Discrete Noether’s theorem for stochastic systems with forcing
Another advantage of the integrator (3) is that one can prove a discrete counterpart of Theorem 2.3. If the discrete system inherits the symmetries of the continuous problem, then the evolution of the momentum maps will be accurately captured by the numerical solution. Discrete Noether’s theorem for systems described by a type-II generating function was first proved for deterministic systems in [75], and later generalized to the stochastic case in [50]. Discrete Noether’s theorem for deterministic Lagrangian systems with forcing was first proposed in [84]. Below we combine these ideas and formulate a version of discrete Noether’s theorem applicable to discrete systems described by (3). Let be the generalized discrete stochastic Lagrangian defined as
[TABLE]
Consider the action of the Lie group on given by
[TABLE]
For any the corresponding infinitesimal generator on is then given by
[TABLE]
Theorem 3.2** **(Discrete Noether’s theorem for stochastic systems with forcing).
Suppose the generalized discrete stochastic Lagrangian is invariant under the action of the Lie group , that is,
[TABLE]
If the discrete forces satisfy the condition
[TABLE]
for all , then the cotangent lift momentum map associated with is almost surely preserved along the solutions of the discrete equations (3), i.e., a.s. .
Proof.
Since the generalized discrete Lagrangian is invariant with respect to the actions of , for an arbitrary we have
[TABLE]
where we have used the fact that . Assume that , , and satisfy the discrete evolution equation (3). By substituting (3) in (3.2), we obtain
[TABLE]
This can be rewritten as
[TABLE]
where we have used the definition of the cotangent lift momentum map (2.24). If the condition (3.11) holds, then we have . The result holds almost surely, because equation (3) is satisfied almost surely. ∎
Remark.
When the discrete forces do not satisfy the condition (3.11), equation (3.14) provides the rate of change of the momentum map, which mimicks formula (2.3) in the continuous case.
3.3 Mean-square Lagrange-d’Alembert partitioned Runge-Kutta methods
3.3.1 Construction
Partitioned Runge-Kutta methods for deterministic forced Hamiltonian systems have been proposed in [57] and [84]. A general class of stochastic mean-square Runge-Kutta methods for Stratonovich ordinary differential equations was introduced and analyzed in [19], [20], and [21]. These ideas were later used by Ma & Ding & Ding [80] and Ma & Ding [81] to construct symplectic Runge-Kutta methods for stochastic Hamiltonian systems without forcing; see also [50]. Below we combine these ideas and introduce mean-square Lagrange-d’Alembert partitioned Runge-Kutta methods for stochastic forced Hamiltonian systems of the form (1).
Definition 3.3**.**
An -stage mean-square Lagrange-d’Alembert partitioned Runge-Kutta method for the system (1) is given by
[TABLE]
where is the time step, are the increments of the Wiener process, and for are the position and momentum internal stages, respectively, and the coefficients of the method , , , , , , , , , and satisfy the conditions
[TABLE]
for .
The partitioned Runge-Kutta method (3.15) can be represented by the tableau
[TABLE]
where , , etc. The set of equations (3.15) forms a one-step numerical scheme. Knowing and at time , one can solve Equations (3.15a)-(3.15) for the internal stages and , and then use (3.15c)-(3.15) to determine and at time . If given and instead, one can also solve (3.15) for the remaining variables , , and . Note that since we have only used in (3.15), we can in general expect mean-square convergence of order 1.0 at most. To obtain mean-square convergence of higher order we would also need to include higher-order multiple Stratonovich integrals, e.g., to achieve convergence of order 1.5 we would need to include terms involving (see [21], [92], [93]). Below we prove that the Runge-Kutta method (3.15) with the conditions (3.16) is indeed a stochastic Lagrange-d’Alembert method of the form (3).
Theorem 3.4**.**
The -stage mean-square partitioned Runge-Kutta method (3.15) with the conditions (3.16) is a stochastic Lagrange-d’Alembert variational integrator of the form (3) with the discrete Hamiltonian
[TABLE]
and the discrete forces
[TABLE]
where , , , and satisfy the system of equations (3.15) and are understood as functions of and .
Proof.
The proof involves straightforward, although rather lengthy and tedious algebraic manipulations. Therefore, for the clarity and brevity of the exposition, we only consider the one-dimensional noise case and point out the key steps of the derivations. Let us introduce the following shorthand notation:
[TABLE]
Differentiate each of the equations (3.15) with respect to and to express the Jacobians , , , , and analogous Jacobians with respect to , in terms of the derivatives of the terms (3.3.1). For instance, we have
[TABLE]
where denotes the identity matrix. Let us now calculate the derivative of the discrete Hamiltonian (3.18) with respect to . After substituting the Jacobians (3.21) and using (3.15) to replace , we obtain the expression
[TABLE]
After using (3.16a)-(3.16d) in the last four terms (e.g., ), and substituting (3.15) for , we get
[TABLE]
By using the conditions (3.16e)-(3.16h) and collecting terms, we finally arrive at
[TABLE]
In a similar fashion we derive
[TABLE]
which completes the proof.
∎
3.3.2 Convergence
Mean-square convergence concentrates on pathwise approximations of the exact solutions (see [62], [89]). Let be the exact solution to (1) with the initial conditions and , and let denote the numerical solution at time obtained by applying (3.15) iteratively times with the constant time step . The numerical solution is said to converge in the mean-square sense with global order if there exist and a constant such that for all we have
[TABLE]
where , as defined before, and denotes the expected value. In principle, in order to determine the mean-square order of convergence of the Lagrange-d’Alembert partitioned Runge-Kutta method (3.15) we need to calculate the power series expansions of and in terms of the powers of and , and compare them to the Stratonovich-Taylor expansions for the exact solution and (see [21], [62], [89]). As mentioned in Section 3.3.1, the mean-square order of the method (3.15) cannot exceed 1.0. Below we provide the conditions that have to be satisfied by the coefficients of the method (3.15) in order for it to be convergent.
Theorem 3.5**.**
Suppose that, in addition to conditions (H1)-(H3), the functions , , and , for have all the necessary partial derivatives. Let the coefficients of the method (3.15) satisfy the conditions
[TABLE]
If the noise is commutative, that is, if the following conditions are satisfied
[TABLE]
where the vectors and for each are defined as
[TABLE]
then the method (3.15) is convergent with mean-square order 1.0. If the noise is noncommutative, then the method (3.15) is convergent with mean-square order 0.5.
Proof.
General order conditions for stochastic non-partitioned Runge-Kutta methods have been analyzed in [20] and [21]. Conditions for mean-square convergence of order 1.0 for stochastic partitioned Runge-Kutta methods with a one-dimensional noise have been derived in [81]. However, the method (3.15) is more general, as we allow a multidimensional noise, and different coefficients are applied to the Hamiltonian and forcing terms, but the method of proof is similar to the proof of Theorem 2.1 in [81], therefore we only present the main steps. To simplify the notation, denote , , and similarly for the remaining coefficients of the method. Let also be an -dimensional vector. Then the conditions (3.5) can be written more compactly, e.g., or . We first determine power expansions of the internal stages and in terms of the powers of and . We plug in series expansions for and in Equations (3.15a)-(3.15), and determine their coefficients by expanding the derivatives of the Hamiltonians and forcing terms into Taylor series around . Then we plug in thus found series expansions into Equations (3.15c)-(3.15), and again expand the derivatives of the Hamiltonians and forcing terms into Taylor series around . This way we obtain the series expansions of and as
[TABLE]
where the vectors and for each are defined as
[TABLE]
and the forcing terms and the derivatives of the Hamiltonians are evaluated at . Let and denote the exact solution of (1) such that and . Using (1) we calculate the Stratonovich-Taylor expansions for and as (see [62])
[TABLE]
where denotes a double Stratonovich integral, and have been defined in (3.5), and the forcing terms and the derivatives of the Hamiltonians are again evaluated at . Assuming the conditions (3.5) are satisfied, we have that and , but comparing (3.3.2) and (3.3.2), we find that in the general case of noncommutative noise not all first order terms agree, and therefore we only have the local error estimates
[TABLE]
Theorem 1.1 from [89] then implies that the method (3.15) has mean-square order 0.5. However, if the noise is commutative, then using the property (see [62], [89]), one can easily show
[TABLE]
In that case all first-order terms in the expansions (3.3.2) and (3.3.2) agree, and we have the local error estimates
[TABLE]
Theorem 1.1 from [89] then implies that the method (3.15) has mean-square order .
∎
In the case of a one-dimensional noise the commutation condition (3.28) is trivially satisfied, therefore we have the following corollary.
Corollary 3.6**.**
Under the assumptions of Theorem 3.5, the method (3.15) is convergent with mean-square order 1.0 for systems driven by a one-dimensional noise.
3.3.3 Examples
In the construction of the integrator (3.15) we may choose the number of stages . In the deterministic case, the higher the number of stages, the higher order of convergence can be achieved (see [41], [42], [43]). In our case, however, as explained earlier, we cannot in general achieve mean-square order of convergence higher than 1.0, because we only used in (3.15). Since the system (3.15a)-(3.15) requires solving equations for variables, from the computational point of view it makes sense to only consider methods with low values of . In this work we focus on the following classical numerical integration formulas (one can easily verify that the conditions (3.16) and (3.5) are satisfied for the discussed methods).
Stochastic midpoint method
Using the midpoint rule we obtain a one-stage non-partitioned Runge-Kutta method represented by the tableau
[TABLE]
Noting that and , this method can be written as
[TABLE]
The stochastic midpoint method was considered in [93] and [81] in the context of symplectic integrators for stochastic Hamiltonian systems without forcing; see also [50]. This example demonstrates that the stochastic midpoint method retains its geometric properties also for forced systems. It is an implicit method and in general one has to solve equations for unknowns. However, if the Hamiltonians are separable, that is, and , then from the first equation can be substituted into the second one. In that case only nonlinear equations have to be solved for . 2. 2.
Stochastic Störmer-Verlet method
A generalization of the classical Störmer-Verlet method can be obtained by choosing the tableau
[TABLE]
Noting that , , and , this method can be more efficiently written as
[TABLE]
This method was considered in [81] in the context of symplectic integrators for stochastic Hamiltonian systems without forcing; see also [50]. It is particularly efficient, because the first equation can be solved separately from the second one, and the last equation is an explicit update. Moreover, if the Hamiltonians are separable, the second equation becomes explicit. If in addition the forcing terms and have special forms, then further improvements in efficiency are possible. For instance, if the forcing terms depend linearly on , as is often the case in practical applications, then the first equation is a linear equation for , and can be solved using linear solvers. In case the forcing terms are independent of altogether, then the whole method becomes fully explicit. 3. 3.
2-stage stochastic DIRK method
In order to reduce the computational cost of solving nonlinear equations, diagonally implicit Runge-Kutta (DIRK) methods use lower-triangular tableaus (see [41], [42], [43]). One can easily verify that the most general family of 2-stage stochastic DIRK methods that satisfy the conditions (3.16) and (3.5) has a tableau of the form
[TABLE]
where is an arbitrary parameter. One can check that for and , this method reduces to the stochastic midpoint method (1). For other choices of , one needs to solve equations (3.15a) and (3.15), first for ( equations) in order to calculate the internal stages and ( variables), and then for ( equations) to find the internal stages and ( variables). If the Hamiltonians are separable, then equations (3.15a) can be substituted into equations (3.15), and the problem is reduced to solving two systems of equations each.
Note that the methods (1), (2), and (3.40) are in general implicit. One can use the Implicit Function Theorem to show that for sufficiently small and , the relevant nonlinear equations will have a solution. However, since the increments are unbounded, for some values of solutions might not exist. To avoid problems with numerical implementations, if necessary, one can replace in equations (1) and (2) with the truncated random variables defined as
[TABLE]
where is suitably chosen for the considered problem. See [23] and [93] for more details regarding schemes with truncated random increments and their convergence.
3.4 Weak Lagrange-d’Alembert Runge-Kutta methods
3.4.1 Construction
A general class of weak stochastic Runge-Kutta methods for Stratonovich ordinary differential equations was introduced and analyzed in [104] and [105]. These ideas were later used by Wang & Hong & Xu [130] to construct weak symplectic Runge-Kutta methods for stochastic Hamiltonian systems without forcing. Below we combine these ideas and introduce weak Lagrange-d’Alembert Runge-Kutta methods for stochastic forced Hamiltonian systems of the form (1).
Definition 3.7**.**
An -stage weak Lagrange-d’Alembert Runge-Kutta method for the system (1) is given by
[TABLE]
where is the time step, are independent three-point distributed random variables with and , , , , and for and are the position and momentum internal stages, respectively, and the coefficients of the method , , , , , , satisfy the conditions
[TABLE]
for .
The Runge-Kutta method (3.42) can be represented by the tableau
[TABLE]
where , , etc. The set of equations (3.42) forms a one-step numerical scheme. Knowing and at time , one can solve Equations (3.42a)-(3.42) for the internal stages , , and , and then use (3.42e)-(3.42) to determine and at time . Depending on the choice of the coefficients, the method (3.42) is in general implicit. However, since the random variables are bounded, one can show that for sufficiently small , the relevant nonlinear equations will have a solution. Below we prove that the Runge-Kutta method (3.42) with the conditions (3.43) is indeed a stochastic Lagrange-d’Alembert method of the form (3).
Theorem 3.8**.**
The -stage weak Runge-Kutta method (3.42) with the conditions (3.43) is a stochastic Lagrange-d’Alembert variational integrator of the form (3) with the discrete Hamiltonian
[TABLE]
and the discrete forces
[TABLE]
where , , , , , and , satisfy the system of equations (3.42) and are understood as functions of and .
Proof.
The proof is analogous to the proof of Theorem 3.4. ∎
Remark.
For stochastic Hamiltonian systems without forcing, i.e. , , the method (3.42) reduces to a weak symplectic Runge-Kutta method of the type introduced in [130]. Therefore, in that case Theorem 3.8 also provides a type-II generating function for such a family of methods, and consequently an alternative proof of their symplecticity.
3.4.2 Convergence
Rather than precisely approximating each sample path, weak convergence concentrates on approximating the probability distribution and functionals of the exact solution (see [62], [89]). Let be the exact solution to (1) with the initial conditions and , and let denote the numerical solution at time obtained by applying (3.42) iteratively times with the constant time step . The numerical solution is said to converge weakly with weak global order if for each there exists and a constant such that for all we have
[TABLE]
where , and denotes the space of all with polynomial growth, i.e., there exists a constant and such that for all and any partial derivative of order . Weak convergence of the Runge-Kutta methods of type (3.42) has been analyzed, and the relevant order conditions for the coefficients have been derived in [105].
3.4.3 Examples
In [130] a number of weak symplectic Runge-Kutta methods for stochastic Hamiltonian systems without forcing have been proposed. Since the symplecticity conditions derived in [130] are equivalent to the conditions (3.43), these methods become Lagrange-d’Alembert integrators when applied to systems with forcing. In this work, we particularly focus on two methods, namely and , as dubbed in [130].
SRKw1
The family of 1-stage methods is defined by the tableau
[TABLE]
where is an arbitrary parameter. This method is weakly convergent with order 1.0 (see [105], [130]). Since , equations (3.42) and (3.42) imply that and . Therefore, in general one has to solve the system (3.42a)-(3.42) for the variables , , , and . However, for several choices of the parameter the computational cost can be reduced. If , then one can first solve the equations (3.42a)-(3.42) for the variables , , and then the equations (3.42)-(3.42) for the remaining variables , . Moreover, if the Hamiltonians are separable, that is, and , then equation (3.42a) can be substituted into equation (3.42), and equation (3.42) can be substitted into equation (3.42), thus reducing the complexity to solving two systems of equations each. A similar situation occurs for . For we further have and , and the method takes the form of the stochastic midpoint method (1) with replaced by . 2. 2.
SRKw2
For systems driven by a single noise () we can consider methods with . The family of 4-stage methods is defined by the tableau
[TABLE]
where are arbitrary parameters. This method is weakly convergent with order 2.0 (see [105], [130]). Note that , so the values of the internal stages , , , and are not needed in (3.42e) and (3.42) to calculate and , respectively. Moreover, equations (3.42) and (3.42) for are explicit updates, therefore there is no need to solve for or calculate the values of these internal stages. In fact, the choice of the parameters , , and has no effect on the values of and , therefore we can set them to zero for convenience. Consequently, the system of equations (3.42a) and (3.42) for , and equations (3.42) and (3.42) for ( equations) has to be solved for the internal stages , , , , , and ( variables). If the Hamiltonians are separable, then equations (3.42a) and (3.42) can be substituted into equations (3.42) and (3.42), and the resulting system of equations can be solved for , , and ( variables).
3.5 Quasi-symplecticity
The idea of quasi-symplectic integrators has been proposed in [94] as an attempt to construct numerical methods that at least to some extent emulate the special time evolution of the symplectic and volume forms, as pointed out in Theorem 2.4 and Theorem 2.5, respectively. The authors considered a special form of the stochastic forced Hamiltonian system, namely
[TABLE]
where is an constant positive definite matrix, is an constant matrix, and are constant vectors. The authors call a numerical integrator quasi-symplectic if it satisfies the following two conditions when applied to the system (3.5):
- (QS1)
it degenerates to a symplectic method when the forcing term vanishes, i.e., ,
- (QS2)
the Jacobian
[TABLE]
does not depend on and .
The condition (QS2) is natural, since the exact Jacobian (2.43) does not depend on the phase space variables. Several quasi-symplectic numerical methods have been proposed and tested in [94]; see also [90]. Below we demonstrate that the idea of quasi-symplecticity can be extended to more general systems than (3.5).
The methods presented in Section 3.3.3 and Section 3.4.3 preserve the underlying variational structure of the general system (1), as has been shown in Theorem 3.1. These methods also naturally reduce to symplectic methods, when the forcing terms and vanish (see [50], [80], [81], [93], [130]). Below we show that the Störmer-Verlet method satisfies the condition (QS2) for a much broader class of systems than (3.5).
Theorem 3.9**.**
Suppose that , , and , for satisfy conditions (H1)-(H3). If the Hamiltonians are separable, that is,
[TABLE]
and the forcing terms have the form
[TABLE]
for constant matrices , then the Jacobian of the discrete flow defined by the Störmer-Verlet method (2) does not depend on and , and is almost surely equal to
[TABLE]
where is the identity matrix, , and we assume that the matrix is almost surely invertible.
Proof.
With the separable Hamiltonians (3.52) and the linear forcing terms (3.53), the first equation in (2) is linear, and can be expressed as
[TABLE]
We then plug in into the second and third equations in (2) to obtain expressions for and as functions of and . Let us introduce the notation
[TABLE]
Using this notation, the Jacobian of the mapping can be expressed as
[TABLE]
Let us transform this determinant into a block upper triangular form by performing basic linear manipulations on its columns and rows. First, multiply the upper and lower right blocks by on the right, and add the results to the upper and lower left blocks, respectively. Then, multiply the upper left and right blocks by on the left, and add the results to the lower left and right blocks, thus obtaining a block upper triangular form. Writing out these steps explicitly, we have
[TABLE]
which completes the proof. ∎
Remark.
In case the matrix is not almost surely invertible, one can replace with the suitably chosen truncated increments (3.41).
4 Numerical experiments
In this section we present the results of our numerical experiments. We have tested the performance of the stochastic Lagrange-d’Alembert integrators presented in Section 3, namely the midpoint method (1), the Störmer-Verlet method (2), the DIRK method (3.40) with , the method (3.48) with , and the method (3.49), and compared it to the performance of some popular general purpose non-geometric explicit stochastic integrators, namely the mean-square Heun method ([24], [62]), the mean-square and methods (see [19], [20], [21], [24]), and the weak and methods ([105]). The Lagrange-d’Alembert integrators have demonstrated superior behavior in long-time simulations in all of the examples described below. In the case of the midpoint, Störmer-Verlet, and DIRK methods, we used unbounded increments , but observed no numerical issues. In principle, one should use truncated increments of the form (3.41), but for the chosen parameters in the examples below, the probability of encountering a singularity was negligible. All computations have been performed in the Julia programming language with the help of the GeometricIntegrators.jl library (see [67]).
4.1 Long-time energy behavior
The Kubo oscillator is a stochastic Hamiltonian system with the Hamiltonians given by and , where is the noise intensity (see [93]). It is an example of an oscillator with a fluctuating frequency and it was first introduced in the context of the line-shape theory (see [4], [68]), but later also found many other applications in connection with mechanical systems, turbulence, laser theory, wave propagation (see [124] and the references therein), magnetic resonance spectroscopy, nonlinear spectroscopy (see [96] and the references therein), single molecule spectroscopy ([58]), and stochastic resonance ([26], [27], [28], [38]). The Kubo oscillator serves as a prototype for multiplicative stochastic processes, and since its solutions can be calculated analytically, it is often used for validation of numerical algorithms (see, e.g., [36], [81], [93], [118]). Here we consider the damped Kubo oscillator with the forcing terms given by and , where is the damping coefficient. It is straightforward to verify that the exact solution is given by
[TABLE]
where and are the initial conditions, the angular frequency is , and we have assumed the underdamped case . Note that (4.1) is the solution of the deterministic damped harmonic oscillator with the time argument shifted by . Given that is normally distributed, one can explicitly calculate the expected value of the Hamiltonian as a function of time as
[TABLE]
where
[TABLE]
Simulations with the initial conditions , , and the parameters and were carried out until the time (approximately 800 periods of the oscillator in the absence of noise). In each case 50000 sample paths were generated. The numerical value of the mean Hamiltonian as a function of time is depicted in Figure 4.1 and Figure 4.2 for the mean-square and weak integrators, respectively. We see that the Lagrange-d’Alembert integrators capture the exponential decay of very accurately even when relatively large time steps are used. The explicit Heun and methods fail to reproduce that behavior even for the significantly smaller time step. While the explicit , , and methods capture the qualitative decay of , still much smaller time steps would be needed to reach the level of accuracy of the Lagrange-d’Alembert integrators, thus rendering them inefficient. The accuracy of the Monte Carlo approximation of at each time step was controlled by estimating the relative error , where denotes the standard deviation of the mean. The maximum relative error for the Störmer-Verlet method was , and for all other methods it did not exceed .
4.2 Ergodic limits
In many cases of practical interest the system (1) is ergodic, which means that
- (1)
it possesses a unique invariant measure represented by the probability density function with , i.e. a stationary solution of the corresponding Fokker-Planck equation (see [37])
- (2)
for any function with polynomial growth at infinity, its ergodic limit, i.e. the expected value with respect to the invariant measure, can be calculated as the limit
[TABLE]
where is an arbitrary solution of (1) with arbitrary initial conditions.
For more information about ergodic systems and ergodic numerical schemes see, e.g., [14], [17], [51], [85], [86], [90], [119]. For many applications, it is interesting to compute the mean of a given function with respect to the invariant law of the diffusion, but the explicit form of the invariant measure is often not known. If the considered system is ergodic, then the ergodic limit can be approximated as
[TABLE]
by choosing a sufficiently large time . One can then use numerical integrators to approximate and . However, formula (4.5) requires integration of the system over comparatively long time intervals, which poses a significant computational difficulty. Below we compare the performance of the geometric integrators introduced in Section 3 with the performance of explicit schemes. Note that we do not make any claims about the ergodicity of the used schemes and defer this issue to future work.
In recent years the analysis of nonlinear oscillators subjected to random excitations has been of significant interest, for instance in the context of stochastic resonance and stochastic bifurcation theory. The van der Pol oscillator is one of the most extensively studied systems in nonlinear dynamics and has a long history of being used in physical and biological sciences (see, e.g., [40]). It possesses a trivial fixed point and a limit cycle attractor. Various stochastic extensions of the van der Pol oscillator have been considered to test the effect of external noises on its self-sustaining mechanism, the period and lifetime of its oscillations, and the attraction basins of its fixed point and limit cycle (see, e.g., [34], [53], [76], [78], [79], [109], [114], [120]). A numerical study of such stochastic extensions requires long integration times and serves as an interesting testbed for numerical algorithms. Consider van der Pol’s equation with additive noise (see [90]), which is a stochastic forced Hamiltonian system of the form (1) with
[TABLE]
where and are parameters. The explicit form of the invariant measure for this system is unknown, however, it is interesting to compute the ergodic value of the energy. Note that the forcing term is not globally Lipschitz, therefore this example also tests the Lagrange-d’Alembert integrators in the situation when the assumption (H3) from Section 2.1 is not satisfied. Simulations with the initial conditions , , and the parameters and were carried out until the time . In each case sample paths were generated. The numerical value of the mean Hamiltonian as a function of time is depicted in Figure 4.3 for the DIRK, Heun, and methods. As the reference value we take , which was calculated in [90] using a second-order weak quasi-symplectic method at the time with the time step and sample paths. We see that the DIRK method accurately reproduces the reference value even with the relatively large time step , while the Heun and methods require the much smaller time step to reach that level of accuracy. The situation is similar for the other Lagrange-d’Alembert and explicit integrators. Figure 4.4 depicts the behavior of near the reference value on the time interval for each of the tested integrators. The maximum relative Monte Carlo error did not exceed in any of the simulations.
4.3 Vlasov equation
In recent years there has been a growing interest in applying geometric integration to particle-in-cell (PIC) simulations of the Vlasov equation in plasma physics. The results to date concern almost entirely collisionless cases (see [18], [35], [45], [101], [110], [115], [116], [131]). The first step towards a geometric description of collision operators, using the so-called metriplectic formulation, has been recently made in [46]. Below we demonstrate that stochastic forced Hamiltonian systems provide an alternative structure-preserving description, and further consider two examples, namely the Lenard-Bernstein and the Lorentz collision operators, to test the long-time behavior of the stochastic Lagrange-d’Alembert integrators.
4.3.1 Lenard-Bernstein collision operator
The following two-dimensional Vlasov-Fokker-Planck equation
[TABLE]
has been studied in [61] and [113] as a model for collisional kinetic plasmas, where denotes the particle distribution function in the position-velocity phase space, is the external electric field with the electrostatic potential , and , , are real parameters. The right-hand side of (4.7) is the so-called Lenard-Bernstein collision operator, which models small-angle collisions and was originally used to study longitudinal plasma oscillations (see [73]). A stochastic split particle-in-cell (PIC) method for the numerical simulation of (4.7) has been proposed in [113], whereby the advection part is solved using the standard PIC method, and the diffusion part is modeled by a stochastic differential equation. Below we demonstrate a structure-preserving approach to solving (4.7). When is interpreted as a probability density function, then (4.7) is the Fokker-Planck equation for the two-dimensional stochastic process whose evolution is governed by the stochastic differential equation (see [37], [62])
[TABLE]
driven by the one-dimensional Wiener process . This equation is a stochastic forced Hamiltonian system (1) with
[TABLE]
It can be easily verified that the stationary solution of (4.7) is given by the Gibbs measure
[TABLE]
where is the normalizing constant such that . Let us consider (4.7) on the domain with periodic boundary conditions in , and with the electrostatic potential
[TABLE]
where is the maximum magnitude of the electric field . One can check that the system (4.3.1) with the potential (4.11) is ergodic (see Theorem 3.2 in [85]). As the initial condition, we take the probability distribution of the form
[TABLE]
where for describes a perturbation of the uniform distribution along the spatial direction , and for is the so called bump-on-tail distribution in the velocity space, where the bump is centered at with the standard deviation . Simulations with the parameters , , , , , , , and were carried out until the time . In each case sample paths were generated. The initial conditions and were randomly drawn from the probability distribution (4.12) using rejection sampling (see Figure 4.5). The exact ergodic value of the Hamiltonian can be calculated using the invariant probability density (4.10) as
[TABLE]
The numerical value of the mean Hamiltonian as a function of time is depicted in Figure 4.6 for the DIRK, Heun, and methods. We see that the DIRK method accurately reproduces the ergodic limit even with the relatively large time step , while the method requires the much smaller time step to reach a comparable level of accuracy. The Heun method yields a less accurate result even for . The situation is similar for the other Lagrange-d’Alembert and explicit integrators. Figure 4.7 depicts the behavior of near the exact ergodic limit on the time interval for each of the tested integrators. The maximum relative Monte Carlo error did not exceed in any of the simulations. The numerical probability density at the final time calculated with each of the mean-square and weak methods is depicted in comparison to the exact invariant measure (4.10) in Figure 4.8 and Figure 4.9, respectively.
4.3.2 Lorentz collision operator
The following four-dimensional Vlasov-Fokker-Planck equation
[TABLE]
has been used in [11] to study the electron-ion collision effects on the damping of electron plasma waves, where denotes the particle distribution function in the position-velocity phase space, and are the components of the external electric field with the electrostatic potential , and is a real parameter. The right-hand side of (4.14) is the so-called Lorentz collision operator, which models electron-ion interactions via pitch-angle scattering. The primary effect of this type of scattering is a change of the direction of the electron’s velocity with negligible energy loss. More information about the Lorentz collision operator can be found in [60]. Below we demonstrate a structure-preserving approach to solving (4.14). When is interpreted as a probability density function, then (4.14) is the Fokker-Planck equation for the four-dimensional stochastic process whose evolution is governed by the stochastic differential equation (see [37], [62])
[TABLE]
driven by the one-dimensional Wiener process . This equation is a stochastic forced Hamiltonian system (1) with
[TABLE]
Let us consider (4.14) on the domain with periodic boundary conditions in and , and with the electrostatic potential
[TABLE]
where is the maximum magnitude of the electric field . As the initial condition, we take the probability distribution of the form
[TABLE]
where the parameters describe a perturbation of the uniform distribution along the spatial directions and , and the velocity part is Maxwellian. The Lorentz collision operator by construction preserves the total energy of the plasma, that is,
[TABLE]
where E(H)\equiv E\Big{(}H\big{(}X(t),Y(t),V_{x}(t),V_{y}(t)\big{)}\Big{)} for short (see [60]). Moreover, in the stochastic description (4.3.2) the Hamiltonian is almost surely preserved for each sample path, which can be easily verified by calculating the stochastic differential
[TABLE]
where the last equality follows from (4.3.2) and (4.3.2).
Mean-square integrators aim to approximate each sample path of the exact solution, and therefore they should also approximate the stronger energy preservation condition (4.20). In order to test the long-time performance of the mean-square integrators discussed in Section 3.3.3, simulations with the parameters , , and were carried out for a single sample path until the time . For each integrator the same random initial condition, drawn from the probability distribution (4.18), and the same realization of the Brownian motion were used. The numerical value of the Hamiltonian as a function of time is depicted in Figure 4.10. Even with relatively large time steps the mean-square Lagrange-d’Alembert integrators preserve energy much more accurately than the non-geometric explicit methods.
On the other hand, weak integrators aim to approximate the probability distribution and functionals of the exact solutions rather than each sample path, therefore they may not preserve energy on each sample path, but nevertheless they should approximate the mean energy (4.19). In order to test the long-time performance of the weak integrators discussed in Section 3.4.3, simulations with the same parameters as above were carried out until the time . In each case sample paths were generated. The initial conditions were randomly drawn from the probability distribution (4.18). The exact mean energy can be calculated by substituting (4.3.2), (4.17), and (4.18) into (4.19). For the chosen parameters, we have .The numerical value of the mean Hamiltonian as a function of time is depicted in Figure 4.11 for the , , , and methods. We see that the weak Lagrange-d’Alembert methods accurately reproduce the mean energy conservation even with the relatively large time steps, while the non-geometric methods require much smaller time steps to reach a comparable level of accuracy. The maximum relative Monte Carlo error did not exceed in any of the simulations.
5 Summary and future work
In this paper we have presented a general framework for constructing a new class of stochastic variational integrators for stochastic forced Hamiltonian systems. We have extended the approach taken in [50] by considering the stochastic Lagrange-d’Alembert principle and constructing the corresponding structure-preserving schemes, which we have dubbed stochastic Lagrange-d’Alembert variational integrators. We have shown that in the presence of a symmetry such integrators satisfy a discrete version of Noether’s theorem. We have further considered certain classes of mean-square and weak Runge-Kutta methods previously known in the literature, and determined the conditions under which such methods become Lagrange-d’Alembert integrators. We have finally pointed out several examples of low-stage Runge-Kutta methods of that type, and demonstrated their superior long-time numerical performance via numerical experiments. In particular, as one of the test cases we have considered the Vlasov-Fokker-Planck equation and proposed a new geometric approach to the simulation of collisional kinetic plasmas.
Our work can be extended in several ways. The mean-square partitioned Runge-Kutta methods introduced in Section 3.3 only use the increments , therefore their mean-square order of convergence cannot exceed 1.0 (see [21], [92], [93]). To obtain mean-square convergence of higher order one can extend the definitions of the discrete Hamiltonian (3.18) and the discrete forces (3.4) to include higher-order multiple Stratonovich integrals, e.g., to achieve convergence of order 1.5 we would need to include terms involving ; see [50] for an example how this can be done for unforced Hamiltonian systems. Another aspect worth a more detailed investigation is the issue of ergodicity of the Lagrange-d’Alembert methods. In Section 4.2 and Section 4.3 we have experimentally demonstrated the usefulness of our integrators in calculating the ergodic limits, but have not formally proved their ergodicity. It would be beneficial to determine under what conditions Lagrange-d’Alembert integrators can be ergodic in the sense discussed in, e.g., [85], [86], or [119], when applied to ergodic Hamiltonian systems. It would also be interesting to extend the idea of Lagrange-d’Alembert integrators to stochastic Hamiltonian systems that are both forced and constrained. Structure-preserving numerical methods for such systems would be of great interest in molecular dynamics (see [15], [30], [125]). Yet another direction of great practical significance would be a further study of the geometric approach to collisional kinetic plasmas presented in Section 4.3 and application of more realistic collision operators that preserve the total energy and momentum, as well as an extension to the self-consistent Maxwell-Vlasov equations (see [65], [66]). Finally, one may extend the idea of variational integration to stochastic multisymplectic partial differential equations such as the stochastic Korteweg-de Vries, Camassa-Holm or Hunter-Saxton equations. Theoretical groundwork for such numerical schemes has been recently presented in [49].
Acknowledgements
We would like to thank Christopher Albert, Darryl Holm, Katharina Kormann, Omar Maj, Philip Morrison, Bruce Scott, Cesare Tronci, and Udo von Toussaint for useful comments and references. We are particularly endebted to Eric Sonnendrücker for pointing out the connections between stochastic systems and the Vlasov equation. The study is a contribution to the Reduced Complexity Models grant number ZT-I-0010 funded by the Helmholtz Association of German Research Centers.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] A. Abdulle, D. Cohen, G. Vilmart, and K. Zygalakis. High weak order methods for stochastic differential equations based on modified equations. SIAM Journal on Scientific Computing , 34(3):A 1800–A 1823, 2012.
- 2[2] A. Abdulle, G. Vilmart, and K. Zygalakis. Long time accuracy of Lie–Trotter splitting methods for Langevin dynamics. SIAM Journal on Numerical Analysis , 53(1):1–16, 2015.
- 3[3] R. Abraham, J. Marsden, and T. Ratiu. Manifolds, Tensor Analysis, and Applications . Applied Mathematical Sciences. Springer New York, 1993.
- 4[4] P. Anderson. A mathematical model for the narrowing of spectral lines by exchange or motion. Journal of the Physical Society of Japan , 9(3):316–339, 1954.
- 5[5] S. Anmarkrud and A. Kværnø. Order conditions for stochastic Runge–Kutta methods preserving quadratic invariants of Stratonovich SD Es. Journal of Computational and Applied Mathematics , 316:40 – 46, 2017.
- 6[6] C. Anton. Weak backward error analysis for stochastic Hamiltonian systems. BIT Numerical Mathematics , 2019.
- 7[7] C. Anton, J. Deng, and Y. S. Wong. Weak symplectic schemes for stochastic Hamiltonian equations. Electronic Transactions on Numerical Analysis , 43:1–20, 2014.
- 8[8] C. Anton, Y. S. Wong, and J. Deng. On global error of symplectic schemes for stochastic Hamiltonian systems. International Journal of Numerical Analysis and Modeling, Series B , 4(1):80–93, 2013.
