Abstract
We construct stochastic pseudo-symplectic methods and analyze their pseudo-symplectic orders for stochastic Hamiltonian systems with additive noises in this paper. All of these methods are explicit so that the numerical implementations become much easier than implicit methods. Through the numerical experiments, we find that these methods have desired properties in accuracy and stability as well as the preservation of the symplectic structure of the systems.
Similar content being viewed by others
Avoid common mistakes on your manuscript.
1 Introduction
Hamiltonian systems perturbed by additive Gaussian noises are used to describe the traditional Hamiltonian systems driven by random forces, which may give rise to essential differences in dynamical evolutions (see e.g. [3, 5, 10]). In this paper, we consider a class of stochastic Hamiltonian systems of the form
where \(P,\ Q,\ f,\ g,\ \sigma _r,\ \gamma _r\) are n-dimensional column-vectors, \(W_r\) are independent standard Wiener processes on a probability space \((\Omega ,\mathscr {F},\mathbb {P})\), \(r=1,\ldots ,m\), and H is a Hamiltonian.
The Hamiltonians are assumed to be in \(\mathscr {C}_b^K\) for certain \(K\in \mathbb {N}\), the function space consists of K-times continuous differentiable functions with bounded derivatives up to order K. As in the deterministic case, the solution
of (1.1) preserves the symplectic structure (see e.g. [10], Theorem 4.1). That is, for \(y_0=(p_0,q_0)\),
To numerically solve the stochastic Hamiltonian system (1.1), much research is looking at the stochastic symplectic integrators (see, [3, 6, 8, 9, 11,12,13] and references therein). This interest is motivated by the fact that symplectic integrators, in comparison with usual numerical schemes, allow us to simulate Hamiltonian systems on a long time interval with high accuracy. However, the backward error analysis for showing the good long time behaviors of stochastic symplectic integrators for stochastic Hamiltonian systems does not exist in the literature and it is a challenging open problem. It is known that all of stochastic symplectic methods should be implicit for general stochastic Hamiltonian systems and thus more computation complexity will arise. Only for special stochastic Hamiltonian systems such as separable systems, explicit stochastic symplectic methods can be constructed (see [10]).
In this paper, we construct explicit stochastic pseudo-symplectic methods for system (1.1) that can preserve the symplectic properties in relatively long time frames with certain accuracy. For the deterministic Hamiltonian systems, Aubry and Chartier [2] have proposed the concept of pseudo-symplectic methods (see also [7]). A one-step numerical method \(y_1=\Phi _h(y_0)\) of order M, \(\Phi _h=\varphi _h+{\mathscr {O}}(h^{M+1})\), is called a pseudo-symplectic method of order (M, N) with \(N>M\), if it satisfies
This idea motivates the following definition of a stochastic pseudo-symplectic method, whose strong convergence rate should be consistent with the convergence of stochastic integral in the sense of \(L^2(\Omega )\)-norm. From the viewpoint of structure preservation, stochastic symplectic methods and stochastic pseudo-symplectic methods generally have good performance, although it is also worthy to mention that there are exceptions such as the Lie-Trotter splitting methods for the simulation of the invariant measure for stochastic Langevin equation in [1].
Definition 1.1
If a numerical method \(y_1=\Phi _h(y_0)\) of mean-square order M for the stochastic Hamiltonian system (1.1) satisfies
with \(N>M\), then this method is called a pseudo-symplectic method of mean-square order (M, N), and N is called the pseudo-symplectic order. Here \(\Vert \cdot \Vert \) denotes the Frobenius norm and \(\mathbb {E}\) denotes the expectation.
The rest of this paper is organized as follows. We construct a series of pseudo-symplectic methods for (1.1) with additive noise in Sect. 2, and give the pseudo-symplectic orders. In Sect. 3, we give numerical experiments for the pseudo-symplectic mid-point method. Compared with the Euler method and the symplectic method, we find that the pseudo-symplectic methods can be used in long-time computations to nearly preserve the symplectic structure. Finally, in Sect. 4, a summary of our work is presented.
2 Pseudo-symplectic methods for stochastic Hamiltonian systems
In this section, we construct two explicit methods and a series of explicit Runge–Kutta methods for (1.1).
2.1 Stochastic pseudo-symplectic mid-point method and stochastic pseudo-symplectic trapezoidal method
Suppose that \(0=t_0<t_1\cdots <t_n=T\) is a partition of [0, T] with \(t_k=kh\), \(k=0,\ldots ,n-1\), and \(h=\frac{T}{n}\). Denote \(\delta _k W_r:=W_r(t_k+h)-W_r(t_k)\), \(r=1,\ldots ,m\), \(k=0,\ldots ,n-1\), and define
For \(\alpha \in [0,1]\), define
and
Comparing the above two explicit methods (2.1) + (2.2) and (2.1) + (2.3) with Euler method and then applying Milstein’s mean-square comparison theorem (see e.g. [10], theorem 1.2.5), we obtain the convergence of the two explicit methods with mean-square order 1. They are both shown to be pseudo-symplectic in the following theorem.
Theorem 2.1
Assume that \(H \in \mathscr {C}_b^2\), then there exists a positive constant \(C_1=C_1(H,\alpha )\) such that the methods (2.1) + (2.2) and (2.1) + (2.3) for the system (1.1) satisfy
Moreover, if \(H \in \mathscr {C}_b^4\), then there exists a positive constant \(C_2=C_2(H)\) such that
Proof
We only prove the results for the method (2.1) + (2.2). Similar arguments can be applied to the method (2.1) + (2.3). Rewrite (2.1) + (2.2) as
and
Assume that H is twice differentiable. From the above equations we have
Simple calculations yield
where \(\tilde{H}_{pp}, \tilde{H}_{pq}\) and \(\tilde{H}_{qq}\) denote the second derivatives of H with respect to \(\tilde{p}\) and \(\tilde{q}\). Then
with
Thus
In what follows we only estimate \(\Sigma _{11}^T \Sigma _{21}-\Sigma _{21}^T \Sigma _{11}\), while an analogous idea can be applied to estimate the terms \(\Sigma _{11}^T \Sigma _{22}-\Sigma _{21}^T \Sigma _{12}\), \(\Sigma _{12}^T \Sigma _{21}-\Sigma _{22}^T \Sigma _{11}\) and \(\Sigma _{12}^T \Sigma _{22}-\Sigma _{22}^T \Sigma _{12}\).
Direct calculations yield that
Thus (2.4) holds for certain \(C_1\).
Now we assume that \(H\in \mathscr {C}_b^4\). Expanding \(\widetilde{H}_{pp}\) and \(\widetilde{H}_{pq}\) at (p, q), we have
Since \(\widetilde{p}-p\) and \(\widetilde{q}-q\) are both \(O(h^{\frac{1}{2}})\), the coefficient of \(h^2\) in the estimation of \(\Sigma _{11}^T \Sigma _{21}-\Sigma _{21}^T \Sigma _{11}\) is \(|2\alpha -1| \left( \mathbb {E}\Vert H_{pp}H_{pq}-H_{pq}H_{pp}\Vert ^2\right) ^\frac{1}{2}+{\mathscr {O}}(h)\). So there exists a positive constant \(\widetilde{C}=\widetilde{C}(H)\) such that
This yields (2.5) and we complete the proof.
The expansion (2.4) implies that, for (1.1), the method (2.1) + (2.2) and (2.1) + (2.3) are of order (1, 2) if and only if \(\alpha =\frac{1}{2}\). We call them the stochastic pseudo-symplectic mid-point method and stochastic pseudo-symplectic trapezoidal method, respectively. Moreover, the proof of Theorem 2.1 implies that the coefficients of \(h^3\) in the estimation of \(\Sigma _{11}^T \Sigma _{21}-\Sigma _{21}^T \Sigma _{11}\) could not vanish, even if \(\alpha =\frac{1}{2}\). This shows that the method (2.1) + (2.2) and (2.1) + (2.3) for (1.1) could not be pseudo-symplectic with pseudo-symplectic order more than 2 for any \(\alpha \in [0,1]\).
2.2 Explicit Runge–Kutta methods
Among the numerical methods for stochastic Hamiltonian systems, Runge–Kutta methods belongs to an important class of methods. However, they may bring more complexity to the calculations because they can be implicit. We try to construct a class of explicit Runge–Kutta methods in this subsection. Set
with \(i=2,\ldots ,s\), where \(\varphi _i,\ \psi _i,\ \eta ,\ \zeta ,\ i=1,\ldots ,s,\) are functions that are independent of p and q and parameters \(\alpha _{ij},\ \beta _i,\ i=2,\ldots ,s,\ j=1,\ldots ,i-1\), need to be fixed.
We first construct a 2-stage explicit Runge–Kutta method
Let
where
with \(\xi _{rk}\) and \(\eta _{rk}\), \(r=1,2,\ldots ,m\), \(k=0,1,\ldots ,n-1\), being a sequence of independent N(0, 1)-distributed random variables and where the parameters satisfy
It turns out that the method (2.7)–(2.9), satisfying (2.10), is mean-square convergent of order \(\frac{3}{2}\) (see e.g. [10]). We don’t consider any higher order scheme here due to the fact that schemes with mean-square order higher than \(\frac{3}{2}\) need to simulate the multiple Wiener intergral (see e.g. [13]). The following theorem shows that (2.7) is pseudo-symplectic of pseudo-symplectic order 2, with appropriate assumptions on the Hamiltonian H.
Theorem 2.2
Assume that \(H \in \mathscr {C}_b^4\) and the parameters in the 2-stage explicit Runge–Kutta method (2.7)–(2.9) satisfy the condition (2.10), then this method is pseudo-symplectic of order \((\frac{3}{2},2)\) provided \(\beta _1=\frac{1}{2},\ \beta _2=\frac{1}{2}\) and \(\alpha _{21}=1\).
Proof
Rewrite (2.7) as
The above formulations immediately yield
Successively, we can get
and
with
We have
Next we only focus on the estimate for \(\Theta _{11}^T \Theta _{21}-\Theta _{21}^T \Theta _{11}\). An analogous idea can be applied to estimate the other elements of the above matrix.
Direct calculations yield that
Therefore, (2.4) holds for some \(C_1\). Due to
and the relationship of \(p,q,P_1,Q_1,P_2,Q_2\), we obtain
for some matrix \(\mathbb {M}\) which is generally not symmetric. The above analysis implies that the 2-stage explicit RK method (2.7) is pseudo-symplectic of order \((\frac{3}{2},2)\) under the condition (2.10), which yields \(\beta _2=\frac{1}{2}\), \(\beta _1=\frac{1}{2}\) and \(\alpha _{21}=1\).
For general s-stage explicit Runge–Kutta method (2.6) with
it is convergent of mean-square order \(\frac{3}{2}\) when the parameters satisfy (see e.g. [10])
The following theorem shows that (2.6) satisfying (2.13) is pseudo-symplectic of pseudo-symplectic order 2. The proof is similar to that of Theorem 2.2 and thus we omit it.
Theorem 2.3
If the parameters in the s-stage explicit Runge–Kutta method (2.6) satisfy (2.13), then it is pseudo-symplectic of order \((\frac{3}{2},2)\) provided
Notice that for \(s=2\), combining (2.13) and (2.14), this method is of order \((\frac{3}{2},2)\) if and only if \(\beta _1=\frac{1}{2},\ \beta _2=\frac{1}{2}\) and \(\alpha _{21}=1\), as shown in Theorem 2.2. For \(s>2\), this method could be of order \((\frac{3}{2},2)\) with many admissible parameters. One can construct higher order explicit pseudo-symplectic methods based on the explicit Runge–Kutta method (2.6) through appropriate choice of the parameters.
3 Numerical experiments
In this section, we give numerical experiments to simulate stochastic Hamiltonian system (1.1). We take both linear and nonlinear oscillators as well as a stochastic nonlinear Schrödinger equation as examples.
3.1 Stochastic harmonic oscillator
We first consider a linear harmonic oscillator with additive noise (see e.g. [10]):
with Hamiltonians \(H_0(p,q)=\frac{1}{2}(p^2+q^2)\) and \(H_1(p,q)=-\gamma p\), which represents kinetic energy and thermal energy, respectively, caused by the stochastic perturbation. The exact solution of this system is
with \(h:=t_{k+1}-t_k\), \(k=0,1,\ldots ,N-1\). We simulate the linear harmonic oscillator (3.1) by the pseudo-symplectic mid-point method, i.e., the method (2.1) + (2.2),
compared with the (forward) Euler method and the symplectic mid-point method. For simplicity, we take \(p_0=q_0=0\) and \(\gamma =1\) in the simulations.
Since the period of free oscillations of (3.1) is \(2\pi \), the left part and the right parts of Fig. 1, corresponding to the time interval [0, 128] and [0, 1280], approximately contain 20 oscillations and 200 oscillations of (3.1). From these graphs, it is clear that the Euler method is unsuitable for the simulation of the Hamiltonian system (3.1) on a long time interval, since the amplitude of oscillations simulated by Euler method is about 50000 times greater than the exact amplitude after 200 oscillations. In contrast, the pseudo-symplectic method as well as symplectic method does much better than Euler method in reproducing oscillations of the system (3.1). Although the pseudo-symplectic method is not so accurate as the symplectic method, the norm of its error still keeps within \(5\%\) of the norm of the exact solution after 200 oscillations.
Figure 2 represents the evolution of domains in the phase plane of system (3.1). The initial domain is the unit circle with center at the origin. We plot images of this circle, which are obtained by the exact solution (3.2) and the three methods. The exact graphs are unit circles shifted from the origin due to the effect of noise. The images for Euler method are also circles but the radius increased, while for the symplectic and pseudo-symplectic methods, the images become ellipse. In spite of the fact that pseudo-symplectic method and Euler method are both explicit and have the same mean-square order of accuracy, pseudo-symplectic method is much better than Euler method and does more or less as well as symplectic method.
3.2 Nonlinear stochastic oscillator
Next, we consider the following double well problem (see e.g. [3]):
It is obvious that \(H_0(p,q):=\frac{1}{2}(p^2-q^2)+\frac{1}{4}q^4\) and \(H_1(p,q):=-\sigma q\) are the Hamiltonians for this system. Since the system (3.4) is nonlinear, we can’t explicitly express its solution. We test the pseudo-symplectic mid-point method
compared with symplectic mid-point method which is a fully implicit method, and both forward and backward Euler methods. We take \(p_0=q_0=\sqrt{2}\) and \(\sigma =0.05\) in the simulations.
Figure 3 illustrates the numerical behavior of pseudo-symplectic mid-point method, symplectic mid-point method, and backward Euler methods applied to (3.4) in the time interval [0, 140]. These graphs indicate that the pseudo-symplectic method, compared with the symplectic method, does much better than backward Euler method in reproducing oscillations of the system (3.4).
3.3 Stochastic nonlinear Schrödinger equation
In this part, we consider the following focusing stochastic nonlinear Schrödinger equation with an additive noise:
under homogenous Dirichlet boundary condition. Here \(T\in (0,\infty )\), \(\mathscr {O}=(0, 1)\) and \(W=\{W(t):\ t\in [0,T]\}\) is a real-valued \(\Phi \)-Wiener process on a stochastic basis \((\Omega , \mathscr {F}, \mathscr {F}_t, \mathbb P)\) (see e.g. [4]), i.e., there exists an real-valued, orthonormal basis \(\{e_k\}_{k=1}^\infty \) of \(L_2(\mathscr {O})\) and a sequence of mutually independent, real-valued Brownian motions \(\{\beta _k\}_{k=1}^\infty \) such that
This equation models the propagation of nonlinear dispersive waves in non-homogeneous or random media (see e.g. [4]).
It is shown in [4] that the charge of this equation has the following evolution:
Here we will show that our numerical scheme recovers the charge evolution. To make it clear, we first truncate the noise with the first \(M=2^3\) terms and spatially discretize Eq. (3.6) by centered difference method with uniform step size \(\delta x=\frac{1}{M}\), we obtain the M-dimensional stochastic Hamiltonian system
where \(P_{\delta x}\) and \(Q_{{\delta x}}\) are the real part and imaginary part of the numerical solution \(u_{\delta x}\), respectively, and \(\Delta _{\delta x}\) denotes the centered difference discretization of \(\Delta \). Here we take \(\Phi ^\frac{1}{2} e_k=\frac{1}{1+k^{2.6}}e_k\) with \(e_k(x)=\sqrt{2}\sin (k\pi x)\), \(1\le k\le M\), \(x\in {\mathscr {O}}\). Then we apply the proposed pseudo-symplectic scheme (2.3) with \(\alpha =1/2\) to numerically solve Eq. (3.7) with time step size \(\delta t=2^{-12}\). Figure 4 presents the evolution of charge for our numerical methods compared with symplectic methods.
4 Conclusions
In the present paper, a class of explicit pseudo-symplectic methods applicable to stochastic Hamiltonian systems with an additive multidimensional Wiener process is introduced. Compared to other methods, the main advantage of the proposed class of pseudo-symplectic methods is the significant reduction of the computational costs as well as the preservation of the symplectic structure of the systems over a relatively long time with certain accuracy. These theoretical results are verified by linear and nonlinear oscillators as well as spatially discrete stochastic nonlinear Schrödinger equation. For future research, the construction of explicit pseudo-symplectic schemes with higher pseudo-symplectic order for general stochastic Hamiltonian system with multiplicative noises may be of particular interest.
References
Abdulle, A., Vilmart, G., Zygalakis, C.: Long time accuracy of Lie–Trotter splitting methods for Langevin dynamics. SIAM J. Numer. Anal. 53(1), 1–16 (2015)
Aubry, A., Chartier, P.: Pseudo-symplectic Runge–Kutta methods. BIT 38(3), 439–461 (1998)
Burrage, K., Burrage, P.M.: Low rank Runge–Kutta methods, symplecticity and stochastic Hamiltonian problems with additive noise. J. Comput. Appl. Math. 236(16), 3920–3930 (2012)
de Bouard, A., Debussche, A.: The stochastic nonlinear Schrödinger equation in \(H^1\). Stochastic Anal. Appl. 21(1), 97–126 (2003)
de la Cruz, H., Jimenez, J.C., Zubelli, J.P.: Locally linearized methods for the simulation of stochastic oscillators driven by random forces. BIT. 57(1), 123–151 (2017)
Deng, J., Anton, C., Wong, Y.: High-order symplectic schemes for stochastic Hamiltonian systems. Commun. Comput. Phys. 16(1), 169–200 (2014)
Hairer, E., Lubich C., Wanner, G. Geometric numerical integration, volume 31 of Springer series in computational mathematics. In: Structure-preserving algorithms for ordinary differential equations. 2nd edn, Springer, Berlin (2006)
Milstein, G.N., Repin, Y.M., Tretyakov, M.V.: Numerical methods for stochastic systems preserving symplectic structure. SIAM J. Numer. Anal. 40(4), 1583–1604 (2002)
Milstein, G.N., Repin, Y.M., Tretyakov, M.V.: Symplectic integration of Hamiltonian systems with additive noise. SIAM J. Numer. Anal. 39(6), 2066–2088 (2002)
Milstein, G.N., Tretyakov, M.V.: Stochastic Numerics for Mathematical Physics. Scientific Computation. Springer, Berlin (2004)
Wang, L., Hong, J.: Generating functions for stochastic symplectic methods. Discrete Contin. Dyn. Syst. 34(3), 1211–1228 (2014)
Wang, L., Hong, J., Scherer, R.: Stochastic symplectic approximation for a linear system with additive noises. IAENG Int. J. Appl. Math. 42(1), 60–65 (2012)
Zhou, W., Zhang, J., Hong, J., Song, S.: Stochastic symplectic Runge–Kutta methods for the strong approximation of Hamiltonian systems with additive noise. J. Comput. Appl. Math. 325, 134–148 (2017)
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by Antonella Zanna Munthe-Kaas.
Authors are supported by National Natural Science Foundation of China (No. 91630312, No. 91530118 and No. 11290142).
Rights and permissions
About this article
Cite this article
Niu, X., Cui, J., Hong, J. et al. Explicit pseudo-symplectic methods for stochastic Hamiltonian systems. Bit Numer Math 58, 163–178 (2018). https://doi.org/10.1007/s10543-017-0668-7
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10543-017-0668-7