Abstract
This chapter focuses on discrete gradient integrators intending to preserve the first integral or the Lyapunov function of the original continuous system. Incorporating the discrete gradients with exponential integrators, we discuss a novel exponential integrator for the conservative or dissipative system \(\dot{y}=Q(My+\nabla U(y))\), where Q is a \(d\times d\) real matrix, M is a \(d\times d\) symmetric real matrix and \(U : \mathbb {R}^{d}\rightarrow \mathbb {R}\) is a differentiable function. For conservative systems, the exponential integrator preserves the energy, while for dissipative systems, the exponential integrator preserves the decaying property of the Lyapunov function. Two properties of the new scheme are presented. Numerical experiments demonstrate the remarkable superiority of the new scheme in comparison with other structure-preserving schemes in the recent literature.
Access provided by CONRICYT-eBooks. Download chapter PDF
This chapter focuses on discrete gradient integrators intending to preserve the first integral or the Lyapunov function of the original continuous system. Incorporating the discrete gradients with exponential integrators, we discuss a novel exponential integrator for the conservative or dissipative system \(\dot{y}=Q(My+\nabla U(y))\), where Q is a \(d\times d\) real matrix, M is a \(d\times d\) symmetric real matrix and \(U : \mathbb {R}^{d}\rightarrow \mathbb {R}\) is a differentiable function. For conservative systems, the exponential integrator preserves the energy, while for dissipative systems, the exponential integrator preserves the decaying property of the Lyapunov function. Two properties of the new scheme are presented. Numerical experiments demonstrate the remarkable superiority of the new scheme in comparison with other structure-preserving schemes in the recent literature.
2.1 Introduction
In this chapter we are interested in the numerical solution of the IVP
where the \(\dot{y}\) denotes the derivative with respect to time, Q is a \(d\times d\) real matrix, M is a \(d\times d\) symmetric real matrix and \(U : \mathbb {R}^{d}\rightarrow \mathbb {R}\) is a differentiable function. Since M is symmetric, \(My(t)+\nabla U(y(t))\) is the gradient of the function
In physical applications, the quantity H is often referred to as “energy”. Two special categories are important in applications:
(i) If Q is skew-symmetric, then (2.1) is a conservative system with the first integral H, i.e. H(y(t)) is constant.
(ii) If Q is negative semi-definite (denoted by \(Q\le 0\)), then (2.1) is a dissipative system with the Lyapunov function H, i.e. H(y(t)) is monotonically decreasing along the solution y(t).
An even more particular case in the first category is that Q in (2.1) is the identity matrix. The system becomes
An algorithm for (2.2) is an exponential integrator if it involves the computation of matrix exponentials (or related matrix functions) and exactly integrates the following system
In general, exponential integrators permit larger stepsizes and achieve higher accuracy than non-exponential ones when (2.2) is a very stiff differential equation such as a highly oscillatory ODE or a semi-discrete time-dependent PDE. Therefore, numerous exponential algorithms have been proposed for first-order (see, e.g. [1, 10, 20, 22,23,24,25,26, 31]) and second-order (see e.g. [11, 12, 14, 18, 34]) ODEs.
On the other hand, (2.2) often possesses many important geometrical/physical structures. For example, the canonical Hamiltonian system
is a special case of (2.2), with
The flow of (2.3) preserves the symplectic 2-form \(\mathrm{d}y\wedge J\mathrm{d}y\) and the function H(y). In the sense of geometric integration, it is a natural idea to design numerical schemes that preserve the two structures. As far as we know, most research papers dealing with exponential integrators up to now focus on the development of high-order explicit schemes but fail to be structure preserving except for symmetric/symplectic/energy-preserving methods for first-order ODEs in [5, 7] and oscillatory second-order ODEs (see, e.g. [18, 32, 33]).
It should be noted that the choice for M in (2.1) or in (2.2) is not unique. In order to take advantage of exponential integrators, the matrix M in (2.1) should be chosen such that \(||QM||\gg ||Q Hess(U)||\), where Hess(U) is the Hessian matrix of U. For example, highly oscillatory Hamiltonian systems can be characterized by a dominant linear part My, where M implicitly contains the large frequency component. Up to now, many energy-preserving or energy-decaying methods have been proposed in the case of \(M=0\) (see, e.g. [3, 4, 15, 17, 19, 29]). However, these general-purpose methods are not suitable for dealing with (2.1) when ||QM|| is very large. On the one hand, numerical solutions generated by these methods are far from accurate. On the other hand, they are generally implicit, and iterative solutions are required at each step. But the fixed-point iterations for them are not convergent unless the stepsize is taken very small. As mentioned at the beginning, these two obstacles can hopefully be overcome by introducing exponential integrators. In [32], the authors proposed an energy-preserving AAVF integrator (a trigonometric method) for solving the second-order Hamiltonian system
which falls into the class of (2.1) by introducing
and
In this chapter, we present and analyse a new exponential integrator for (2.1) which can preserve the first integral or the Lyapunov function.
This chapter is organized as follows. Section 2.2 presents the discrete gradient integrators. In Sect. 2.3, we construct a general structure-preserving scheme for (2.1)–an exponential discrete gradient integrator. Two important properties of the scheme are proven. Symmetry and convergence of the EAVF integrator are investigated in Sect. 2.4. We then present a list of problems which can be solved by this scheme in Sect. 2.5. Numerical results, including the comparison between our new scheme and other structure-preserving schemes in the literature, are shown in Sect. 2.6. Section 2.7 is devoted to concluding remarks.
2.2 Discrete Gradient Integrators
Let r(z) be a holomorphic function in the neighborhood of zero (\(r(0):=\lim \limits _{z\rightarrow 0} r(z)\) if 0 is a removable singularity)
The series (2.4) is assumed to be absolutely convergent. For a matrix A, the matrix-valued function r(A) is defined by
I and O always denote identity and zero matrices of appropriate dimensions respectively. \(A^{\frac{1}{2}}\) is a square root (not necessarily principal) of a symmetric matrix A. If \(r^{(i)}(0)=0\) for all odd i, then \(r(A^{\frac{1}{2}})\) is well defined for every symmetric A (independent of the choice of \(A^{\frac{1}{2}}\)). For functions of matrices, the reader is referred to [21].
The discrete gradient method is an effective approach to constructing energy-preserving integrators. A discrete gradient (DG) of a differentiable function g is a bi-variate mapping \({\nabla }^\mathrm{D}g:\mathbb R^{d}\times \mathbb {R}^{d}\rightarrow \mathbb R^{d}\) satisfying
Accordingly, a DG integrator for the system (2.3) is defined by
Multiplying \({\nabla }^\mathrm{D}g(y^{1},y^{0})^{\intercal }\) on both sides of (2.6) and using the first identity of (2.5), we obtain \(H(y^{1})=H(y^{0})\), i.e., the scheme (2.6) is energy preservation. For more details on the DG method, readers are referred to [15, 30]. A typical discrete gradient is the average-vector-field (AVF) which is defined by
Then the AVF integrator for the system (2.3) is given by
2.3 Exponential Discrete Gradient Integrators
We next derive the exponential discrete gradient method for the problem (2.1). The starting point is the following variation-of-constants formula for the problem (2.1):
Approximating \(\nabla U(y(t_{0}+\xi h))\) in (2.9) by \({\nabla }^\mathrm{D}U(y^{1},y^{0})\), we obtain the following exponential discrete gradient (EDG) integrator:
where \(V=hQM\),
and \(y^{1}\) is an approximation of \(y(t_{0}+h)\).
Due to the energy-preserving property of the DG method, we are hopeful of preserving the first integral by (2.10) when Q is skew symmetric. For simplicity, we sometimes write \({\nabla }^\mathrm{D}U(y^{1},y^{0})\) in brief as \({\nabla }^\mathrm{D}U\). To begin with, we give the following preliminary lemma.
Lemma 2.1
For any real symmetric matrix M and scalar \(h>0\), the matrix
satisfies:
Proof
Consider the linear ODE:
When Q is skew symmetric, (2.11) is a conservative equation with the first integral \(\frac{1}{2}y^{\intercal }My\), and its exact solution starting from the initial value \(y(0)=y^{0}\) is \(y(t)=\exp (tQM)y^{0}\). It then follows immediately from
that
for any vector \(y^{0}\). Therefore,
is skew-symmetric. Since it is also symmetric, \(B=0\).
Likewise, the case that \(Q\le 0\) can be proved. \(\square \)
Theorem 2.1
If Q is skew-symmetric, then the integrator (2.10) preserves the first integral H in (2.1):
where \(H(y)=\frac{1}{2}y^{\intercal }My+U(y)\).
Proof
Here we firstly assume that the matrix M is nonsingular. We next calculate \(\frac{1}{2}y^{1\intercal }My^{1}\). Denote \(M^{-1}{\nabla }^\mathrm{D}U=\widetilde{\nabla }U\). Replacing \(y^{1}\) by \(\exp (V)y^{0}+h\varphi (V)Q{\nabla }^\mathrm{D}U(y^{1},y^{0})\) leads to
On the other hand, it follows from the property of the discrete gradient (2.5) that
Combining (2.12), (2.13) and collecting terms by types ‘\(y^{0\intercal }*y^{0}\)’, ‘\(y^{0\intercal }*\widetilde{\nabla }U\)’, ‘\(\widetilde{\nabla }U^{\intercal }*\widetilde{\nabla }U\)’ lead to
where \(B=\exp (V)^{\intercal }M\exp (V)-M\) and \(C=\exp (V)^{\intercal }M-M\exp (V)\). The last step is from the skew-symmetry of the matrix B (according to Lemma 2.1) and C.
If M is singular, it is easy to find a series of symmetric and nonsingular matrices \(\{M_{\varepsilon }\}\) which converge to M when \(\varepsilon \rightarrow 0.\) Thus, according to the result stated above, it still holds that
for all \(\varepsilon ,\) where \(H_{\varepsilon }(y)=\frac{1}{2}y^{\intercal }M_{\varepsilon }y+U(y)\) is the first integral of the perturbed problem
and
Therefore, when \(\varepsilon \rightarrow 0\), \(y^{1}_{\varepsilon }\rightarrow y^{1}\) and (2.15) lead to
This completes the proof. \(\square \)
Moreover, the scheme (2.10) can also respect the decay of the first integral when \(Q\le 0\) in (2.1). The next theorem shows this point.
Theorem 2.2
If Q is negative semi-definite (not necessarily symmetric), then the scheme (2.10) preserves the decaying property of the Lyapunov function H in (2.1):
where \(H(y)=\frac{1}{2}y^{\intercal }My+U(y)\).
Proof
If M is nonsingular, the equation in (2.14)
still holds, since the derivation does not depend on the skew-symmetry of Q. By Lemma 2.1, B is negative semi-definite. Thus \(H(y^{1})\le H(y^{0}).\) In the case that M is singular, this theorem can be easily proved by replacing the equalities
in the proof of Theorem 2.1 with the inequalities
We omit the details. \(\square \)
2.4 Symmetry and Convergence of the EAVF Integrator
In this chapter, we consider a special type of the discrete gradient in (2.10), the average vector field,
The corresponding integrator becomes
where \(V=hQM\) and \(y^{1}\approx y(t_{0}+h)\). The scheme (2.16) is called an exponential AVF integrator and denoted by EAVF.
In the sequel we present and prove two properties of EAVF—symmetry and convergence.
Theorem 2.3
The EAVF integrator (2.16) is symmetric.
Proof
Exchanging \(y^{0}\leftrightarrow y^{1}\) and replacing h by \(-h\) in (2.16), we obtain
We rewrite (2.17) as:
Since \(\exp (V)\varphi (-V)=\varphi (V)\), (2.18) is the same as (2.16) exactly. This means that EAVF is symmetric. \(\square \)
It should be noted that the scheme (2.16) is implicit in general, and thus iterative solutions are required. We next discuss the convergence of the fixed-point iteration for the EAVF integrator.
Theorem 2.4
Suppose that \(||\varphi (V)||_{2}\le C\), and that \(\nabla U(u)\) satisfies a Lipschitz condition; i.e., there exists a constant L such that
for all arguments v and w \(\in \mathbb {R}^{d}\). If
then the mapping
has a unique fixed point and the iteration for the EAVF integrator (2.16) is convergent.
Proof
Since
where \(\rho =\dfrac{{\hat{h}}}{2}CL||Q||_{2}<1\), by the Contraction Mapping Theorem, the mapping \(\varPsi \) has a unique fixed point and the iteration solving the Eq. (2.16) is convergent. \(\square \)
Remark 2.1
We note two special and important cases in practical applications. If QM is skew-symmetric or symmetric negative semi-definite, then the spectrum of V lies in the left half-plane. Since QM is unitarily diagonalizable and \(|\varphi (z)|\le 1\) for any z satisfying \(\mathrm{Re}(z)\le 0\), we have \(||\varphi (V)||_{2}\le 1\).
In many cases, the matrix M has an extremely large norm (e.g., M incorporates high frequency components in oscillatory problems or M is the differential matrix in semi-discrete PDEs), and hence Theorem 2.4 ensures the possibility of choosing relatively large stepsize regardless of M.
In practice, the integral in (2.16) usually cannot be easily calculated. Therefore, we can evaluate it using the s-point Gauss-Legendre (GLs) formula \((b_{i},c_{i})_{i=1}^{s}\):
The corresponding scheme is denoted by EAVFGLs. Since the s-point GL quadrature formula is symmetric, EAVFGLs is also symmetric. Due to the fact that \(\sum _{i=1}^{s}b_{i}c_{i}=1/2\), the corresponding iteration for EAVFGLs is convergent provided (2.19) holds.
2.5 Problems Suitable for EAVF
2.5.1 Highly Oscillatory Nonseparable Hamiltonian Systems
Consider the Hamiltonian
where p and q are both d-length vectors, partitioned as
\(M_{1}, A_{1}\) are symmetric positive definite matrices, and \(0<\varepsilon \ll 1\). This Hamiltonian governs oscillatory mechanical systems in 2 or 3 spatial dimensions such as the stiff spring pendulum and the dynamics of the multi-atomic molecule (see, e.g. [8, 9]). With an appropriate canonical transformation (see, e.g. [18]), the Hamiltonian becomes
where \(p_{1}=(p_{1,1},\ldots ,p_{1,l})^{\intercal }, q_{1}=(q_{1,1},\ldots ,q_{1,l})^{\intercal }\). The corresponding differential equations are given by
where \(\omega ^2=\mathrm{diag}(\omega _{1}^2,\ldots ,\omega _{l}^2), \omega _{j}=\lambda _{j}/\varepsilon \) for \(j=1,\ldots ,l\). Equation (2.21) is of the form (2.1) with
and
Since \(q_{11},\ldots ,q_{1l}\) and \(p_{11},\ldots ,p_{1l}\) are fast variables, it is favorable to integrate the linear part of them exactly by the scheme (2.16). Note that
where \(\mathrm{sinc}(z)=\sin (z)/z, g_{1}(z)=(1-\cos (z))/z^{2}, g_{2}(z)=\cos (z)-1\). Unfortunately, the block \(h^{-1}g_{2}(h\varOmega ^{\frac{1}{2}})\) is not uniformly bounded. In the first experiment, the iteration still works well, perhaps due to the small Lipshitz constant of \(\nabla S\).
2.5.2 Second-Order (Damped) Highly Oscillatory System
Consider
where q is a d-length vector variable, \(U_{1}: \mathbb {R}^{d}\rightarrow \mathbb {R}\) is a differential function, N is a symmetric negative semi-definite matrix, \(\varOmega \) is a symmetric positive semi-definite matrix, \(||\varOmega ||\) or \(||N||\gg 1\). (2.22) stands for highly oscillatory problems such as the dissipative molecular dynamics, the (damped) Duffing and semi-discrete nonlinear wave equations. By introducing \(p=\dot{q},\) we write (2.22) as a first-order system of ODEs:
which falls into the class of (2.1), where
Clearly, \(Q\le 0\) and (2.23) is a dissipative system with the Lyapunov function \(H=\frac{1}{2}p^{\intercal }p+\frac{1}{2}q^{\intercal }\varOmega q+U_{1}(q)\). Applying the EAVF integrator (2.16) to the Eq. (2.23) yields the scheme:
where \(\exp (hQM)\) and \(\varphi (hQM)\) are partitioned into
respectively.
It should be noted that only the second equation in the scheme (2.24) needs to be solved by iteration. From the proof procedure of Theorem 2.4, one can find that the convergence of the fixed-point iteration for the second equation in (2.24) is irrelevant to ||QM|| provided \(\varphi _{21}\) is uniformly bounded.
Theorem 2.5
Suppose that \(\varOmega \) and N commute and \(||\nabla U_{1}(v)-\nabla U_{1}(w)||_{2}\le L||v-w||_{2}\). Then the iteration
for the scheme (2.24) is convergent provided
Proof
It is crucial here to find a uniform bound of \(\Vert \varphi _{21}\Vert \). Since \(\varOmega \) and N commute, they can be simultaneously diagonalized:
where F is an orthogonal matrix, \(\varLambda =\mathrm{diag}(\lambda _{1},\ldots ,\lambda _{d}), \varSigma =\mathrm{diag}(\sigma _{1},\ldots ,\sigma _{d})\) and \(\lambda _{i}\ge 0, \sigma _{i}\le 0\) for \(i=1,2,\ldots ,d\). It now follows from
that
To show that \(\exp _{21}\) and \(\varphi _{21}\) depends on h, we denote them by \(\exp _{21}^{h}\) and \(\varphi _{21}^{h}\), respectively. After some calculations, we have
We then have
In order to estimate \(||\exp _{21}^{h}||_{2}\), the bound of the function
should be considered for \(\sigma \le 0,\lambda \ge 0\). If \(\sigma ^{2}-4\lambda <0\), we set \((\sigma ^{2}-4\lambda )^{\frac{1}{2}}=\mathrm{i}a,\) where \(\mathrm{i}\) is the imaginary unit and a is a real number. Then we have
If \(\sigma ^{2}-4\lambda \ge 0\), then \(a=(\sigma ^{2}-4\lambda )^{\frac{1}{2}}\le -\sigma \),
Thus,
It follows from (2.25) and (2.26) that
Therefore, using \(\varphi (hQM)=\int _{0}^{1}\exp ((1-\xi )hQM)\mathrm{d}\xi \) and (2.27), we obtain
The rest of the proof is similar to that of Theorem 2.4 which we omit here. \(\square \)
It can be observed that in the particular case that \(N=0\), the scheme (2.24) reduces to the AAVF integrator in [32].
2.5.3 Semi-discrete Conservative or Dissipative PDEs
Many time-dependent PDEs are in the form:
where \(y(\cdot ,t)\in X\) for every \(t\ge 0\), X is a Hilbert space like \(\mathbf {L}^{2}(\mathscr {D})\), \(\mathbf {L}^{2}(\mathscr {D})\times \mathbf {L}^{2}(\mathscr {D}),\ldots ,\) \(\mathscr {D}\) is a domain in \(\mathbb {R}^{d}\), and \(\mathscr {Q}\) is a linear operator on X, the functional \(\mathscr {H}[y]=\int _{\mathscr {D}}f(y,\partial _{\alpha }y)\mathrm{d}x\) (f is smooth, \(x=(x_{1},\ldots ,x_{d}), \mathrm{d}x=\mathrm{d}x_{1}\ldots \mathrm{d}x_{d}\) and \(\partial _{\alpha }y\) denote the partial derivatives of y with respect to spatial variables \(x_{i}, 1\le i\le d\)). Under a suitable boundary condition (BC), the variational derivative \(\dfrac{\delta \mathscr {H}}{\delta y}\) is defined by:
for any smooth \(z\in X\) vanishing on the boundary of \(\mathscr {D}\), where \(\langle \cdot ,\cdot \rangle \) is the inner product of X. If \(\mathscr {Q}\) is a skew or negative semi-definite operator with respect to \(\langle \cdot ,\cdot \rangle \), then the Eq. (2.28) is conservative (e.g., the nonlinear wave, nonlinear Schrödinger, Korteweg–de Vries and Maxwell equations) or dissipative (e.g., the Allen–Cahn, Cahn–Hilliard, Ginzburg–Landau and heat equations), i.e., \(\mathscr {H}[y]\) is constant or monotonically decreasing (see, e.g. [6, 13]). In general, after the spatial discretisation, (2.28) becomes a conservative or dissipative system of ODEs in the form (2.1).
A typical example of a conservative system is the nonlinear Schrödinger (NSL) equation:
subject to the periodic BC \(y(0,t)=y(L,t)\). Denoting \(y=p+\mathrm{i}q\) (\(\mathrm{i}^2=-1\)), where p, q are the real and imaginary parts of y, the Eq. (2.29) can be written in the form of (2.28):
where \(X=\mathbf {L}^{2}([0,L])\times \mathbf {L}^{2}([0,L]),\)
We consider the spatial discretisation of (2.30). It is supposed that the spatial domain is equally partitioned into N intervals: \(0=x_{0}<x_{1}<\ldots <x_{N}=L\). Discretizing the spatial derivatives of (2.30) by central differences gives
where
is an \(N\times N\) symmetric differential matrix, \(\tilde{p}=(p_{0},\ldots ,p_{N-1})^{\intercal }, \tilde{q}=(q_{0},\ldots ,q_{N-1})^{\intercal }, p_{i}(t)\approx p(x_{i},t)\) and \(q_{i}(t)\approx q(x_{i},t)\) for \(i=0,\ldots ,N-1\).
As an example of dissipative PDEs we consider the Allen–Cahn (AC) equation
subject to the the Neumann BC \(\frac{\partial }{\partial {x}}y(0,t)=\frac{\partial }{\partial {x}}y(L,t)\). \(X=\mathbf {L}^{2}([0,L]), \mathscr {Q}=-1, \mathscr {H}[y]=\int _{0}^{L}(\frac{1}{2}\beta (\frac{\partial }{\partial {x}}y)^{2}-\frac{1}{2}y^{2}+\frac{1}{4}y^{4})\mathrm{d}x\). The spatial grids are chosen in the same way as the NLS. Discretizing the spatial derivative with the central difference, we obtain
where
is the \((N-1)\times (N-1)\) symmetric differential matrix, \(\tilde{y}=(y_{1},\ldots ,y_{N-1})^{\intercal }, y_{i}(t)\approx y(x_{i},t)\).
Both the semi-discrete NLS equation (2.31) and AC equation (2.33) are of the form (2.1). For the NLS equation, we have
while for the AC equation, we have
Therefore, the scheme (2.16) can be applied to solve them. Since the matrix QM is skew or symmetric negative semi-definite in these two cases, according to Remark 2.1, the convergence of fixed-point iterations for them is independent of the differential matrix.
2.6 Numerical Experiments
In this section, we compare the EAVF method (2.16) with the well-known implicit midpoint method which is denoted by MID:
and the traditional AVF method for (2.1) given by
where \(\widetilde{U}(y)=U(y)+\frac{1}{2}y^{\intercal }My\). The authors in [30] showed that (2.35) preserves the first integral or the Lyapunov function \(\widetilde{U}\). Our comparison also includes another energy-preserving method of order four for (2.1):
where
This method is denoted by CRK since it can be written as a continuous Runge–Kutta method. For details, readers are referred to [17].
Throughout the experiment, the ‘reference solution’ is computed by high-order methods with a sufficiently small stepsize. We always start to calculate from \(t_{0}=0\). \(y^{n}\approx y(t_{n})\) is obtained by the time-stepping way \(y^{0}\rightarrow y^{1} \rightarrow \cdots \rightarrow y^{n}\rightarrow \cdots \) for \(n=1,2,\ldots \) and \(t_{n}=nh\). The error tolerance for iteration solutions of the four methods is set as \(10^{-14}\). The maximum global error (GE) over the total time interval is defined by:
The maximum global error of H (EH) on the interval is:
In our numerical experiments, the computational cost of each method is measured by the number of function evaluations (FE).
Example 2.1
The motion of a triatomic molecule can be modelled by a Hamiltonian system with the Hamiltonian of the form (2.20) (see, e.g. [8]):
where
The initial values are given by:
Setting \(h=1/2^{i}\) for \(i=6,\ldots ,10\), \( \omega =50\), and \(h=1/100\times 1/2^{i}\) for \(i=0,\ldots ,4\), \(\omega =100\), we integrate the problem (2.21) with the Hamiltonian (2.37) over the interval [0, 50]. Since the nonlinear term \(\nabla S(p,q)\) is complicated to be integrated, we evaluate the integrals in EAVF, AVF and CRK by the 3-point Gauss–Legendre (GL) quadrature formula \((b_{i},c_{i})_{i=1}^{3}\):
The corresponding schemes are denoted by EAVFGL3, AVFGL3 and CRKGL3 respectively. Numerical results are presented in Fig. 2.1.
Figure 2.1a, c show that MID and AVFGL3 lost basic accuracy. It can be observed from Fig. 2.1b, d that AVFGL3, EAVFGL3, CRKGL3 are much more efficient in preserving energy than MID. In the aspects of both energy preservation and algebraic accuracy, EAVF is the most efficient among the four methods.
Example 2.2
The equation
is an averaged system in wind-induced oscillation, where \(\zeta \ge 0\) is a damping factor and \(\lambda \) is a detuning parameter (see, e.g. [16]). For convenience, setting \(\zeta =r\mathrm{cos}(\theta ), \lambda =r\mathrm{sin}(\theta ), r\ge 0, 0\le \theta \le \pi /2\), (see [29]) we write (2.38) as
which is of the form (2.1), where
Its Lyapunov function (dissipative case, when \(\theta <\pi /2\)) or the first integral (conservative case, when \(\theta =\pi /2\)) is:
The matrix exponential of the EAVF scheme (2.16) for (2.39) is calculated by:
where \(c=\cos (\theta ), s=\sin (\theta )\), and \(\varphi (V)\) can be obtained by \((\exp (V)-I)V^{-1}\). Given the initial values:
we first integrate the conservative system (2.39) with the parameters \(\theta =\pi /2, r=20\) and stepsizes \(h=1/20\times 1/2^{i}\) for \(i=-1,\ldots ,4\) over the interval [0, 200]. Setting \(\theta =\pi /2-10^{-4}, r=20,\) we then integrate the dissipative (2.39) with the stepsizes \(h=1/20\times 1/2^{i}\) for \(i=-1,\ldots ,4\) over the interval [0, 100]. Numerical errors are presented in Figs. 2.2 and 2.3. It is noted that the integrands appearing in AVF, EAVF are polynomials of degree two and the integrands in CRK are polynomials of degree five. We evaluate the integrals in AVF, EAVF by the 2-point GL quadrature:
and the integrals appearing in CRK by the 3-point GL quadrature. Then there is no quadrature error.
The efficiency curves of AVF and MID consist of only five points in Figs. 2.2a, b, and 2.3a (two points overlap in Figs. 2.2a and 2.3a), since the fixed-point iterations of MID and AVF are not convergent when \(h=1/10\). Note that QM is skew-symmetric or negative semi-definite, the convergence of iterations for the EAVF method is independent of r by Theorem 2.4 and Remark 2.1. Thus larger stepsizes are allowed for EAVF. The experiment shows that the iterations for EAVF uniformly converge for \(h=1/20\times 1/2^{i}\) for \(i=-1,\ldots ,4\). Moreover, it can be observed from Fig. 2.3b that MID cannot strictly preserve the decay of the Lyapunov function.
Example 2.3
The PDE:
where \(\varepsilon >0, \beta , \gamma \ge 0\), is a continuous generalization of \(\alpha \)-FPU (Fermi–Pasta–Ulam) system (see, e.g. [28]). Taking \(\partial _{t}u=v\) and the homogeneous Dirichlet BC \(u(0,t)=u(L,t)=0\), the Eq. (2.41) is of the type (2.28), where \(X=\mathbf {L}^{2}([0,L])\times \mathbf {L}^{2}([0,L])\) and
It is easy to verify that \(\mathscr {Q}\) is a negative semi-definite operator, and thus (2.41) is dissipative. The spatial discretization yields a dissipative system of ODEs:
where \(c=1/\varDelta x, \beta ^{'}=c^{2}\beta , \varepsilon ^{'}=c^{p+2}\varepsilon , V(u)=u^{p+2}/[(p+2)(p+1)], u_{j}(t)\approx u(x_{j},t), x_{j}=j/\varDelta x\) for \(j=1,\ldots ,N-1\) and \(u_{0}(t)=u_{N}(t)=0\). Note that the nonlinear term \(u_{xx}u_{x}^{p}\) is approximated by:
We now write it in the compact form (2.22):
where \(q=(u_{1},\ldots ,u_{N-1})^{\intercal }, N=\beta ^{'}D-\gamma I, \varOmega =-c^{2}D+m^{2}I, U_{1}(q)=\varepsilon ^{'}\sum _{j=0}^{N-1}V(u_{j+1}-u_{j})\) and
In this experiment, we set \(p=1, m=0, c=1, \varepsilon =\frac{3}{4},\) and \(\gamma =0.005.\) Consider the initial conditions in [28]:
with \(B=5, \kappa =0.1\), that is,
for \(j=1,\ldots ,N-1\). Let \(N=128, \beta =0, 2.\) We compute the numerical solution by MID, AVF and EAVF with the stepsizes \(h=1/2^{i}\) for \(i=1,\ldots ,5\) over the time interval [0, 100]. Similarly to EAVF (2.24), the nonlinear systems resulting from MID (2.34) and AVF (2.35) can be reduced to:
and
respectively. Both the velocity \(p^{1}\) of MID and AVF can be recovered by
The integrals in AVF and EAVF are exactly evaluated by the 2-point GL quadrature. Since \(\exp (hA), \varphi (hA)\) in (2.24) have no explicit expressions, they are calculated by the Matlab package in [2]. The basic idea is to evaluate \(\exp (hA), \varphi (hA)\) by their Padé approximations. Numerical results are plotted in Fig. 2.4. Alternatively, there are other popular algorithms such as the contour integral method and the Krylov subspace method for matrix exponentials and \(\varphi \)-functions. Readers are referred to [23] for a summary of algorithms and well-established mathematical software.
According to Theorem 2.5, the convergence of iterations in the EAVF scheme is independent of \(\varOmega \) and N. Iterations of MID and AVF are not convergent when \(\beta =2, h=1/2\). Thus the efficiency curves of MID and AVF in Fig. 2.4b consist of only 4 points. From Fig. 2.4c, it can be observed that the EAVF method is dissipative even using the relatively large stepsize \(h=1/2\).
2.7 Conclusions and Discussions
Exponential integrators date back to the original work by Hersch [20]. The term “exponential integrators” was coined in the seminal paper by Hochbruck, Lubich and Selhofer [22]. It turns out that exponential integrators have constituted an important class of effective methods for the numerical solution of differential equations in applied sciences and engineering. In this chapter, combining the ideas of the exponential integrator with the average vector field, a new exponential scheme EAVF was proposed and analysed. The EAVF method can preserve the first integral or the Lyapunov function for the conservative or dissipative system (2.1). The symmetry of EAVF is responsible for the good long-term numerical behavior. The implicitness of EAVF means that the solution must be solved iteratively. We have analysed the convergence of the fixed-point iteration and showed that the convergence is free from the influence of a large class of coefficient matrices M. In the dynamics of the triatomic molecule, wind-induced oscillation and the damped FPU problem, we compared the new EAVF method with the MID, AVF and CRK methods. The three problems are modelled by the system (2.1) having a dominant linear term and small nonlinear term. As for the efficiency as well as preserving energy and dissipation, EAVF is superior to the other three methods. In general, energy-preserving and energy-decaying methods are implicit, and iterative solutions are required. With relatively large stepsizes, the iterations of EAVF converge while those of AVF and MID do not. We conclude that EAVF is a promising method for solving the system (2.1) with \(||QM||\gg ||Q\ {Hess}(U)||\).
In conclusion, exponential integrators are an important class of structure-preserving numerical methods for differential equations. Therefore, we will further discuss and analyse exponential Fourier collocation methods in the next chapter, and symplectic exponential Runge–Kutta methods for solving nonlinear Hamiltonian systems in Chap. 4.
This chapter is based on the work of Li and Wu [27].
References
Berland, H., Owren, B., Skaflestad, B.: Solving the nonlinear Schrödinger equations using exponential integrators on the cubic Schrödinger equation. Model. Identif. Control 27, 201–217 (2006)
Berland, H., Skaflestad, B., Wright, W.: EXPINT – A MATLAB package for exponential integrators, ACM Trans. Math. Softw. 33 (2007)
Brugnano, L., Iavernaro, F., Trigiante, D.: Hamiltonian boundary value methods (energy preserving discrete line integral methods). J. Numer. Anal. Ind. Appl. Math. 5, 17–37 (2010)
Calvo, M., Laburta, M.P., Montijano, J.I., Rández, L.: Projection methods preserving Lyapunov functions. BIT Numer. Math. 50, 223–241 (2010)
Celledoni, E., Cohen, D., Owren, B.: Symmetric exponential integrators with an application to the cubic Schrödinger equation. Found. Comp. Math. 8, 303–317 (2008)
Celledoni, E., Grimm, V., McLachlan, R.I., Maclaren, D.I., O’Neale, D., Owren, B., Quispel, G.R.W.: Preserving energy resp. dissipation in numerical PDEs using the “Average Vector Field” method. J. Comput. Phys. 231, 6770–6789 (2012)
Cieśliński, J.L.: Locally exact modifications of numerical schemes. Comput. Math. Appl. 62, 1920–1938 (2013)
Cohen, D.: Conservation properties of numerical integrators for highly oscillatory Hamiltonian systems. IMA J. Numer. Anal. 26, 34–59 (2006)
Cohen, D., Jahnke, T., Lorenz, K., Lubich, C.: Numerical integrators for highly oscillatory Hamiltonian systems: a review. In: Mielke, A. (ed.) Analysis, Modeling and Simulation of Multiscale Problems, pp. 553–576. Springer, Berlin (2006)
Cox, S.M., Matthews, P.C.: Exponential time differencing for stiff systems. J. Comput. Phys. 176, 430–455 (2002)
Deuflhard, P.: A study of extrapolation methods based on multistep schemes without parasitic solutions. Z. Angew. Math. Phys. 30, 177–189 (1979)
Franco, J.: Runge–Kutta–Nyström methods adapted to the numerical integration of perturbed oscillators. Comput. Phys. Commun. 147, 770–787 (2002)
Furihata, D., Matuso, T.: Discrete Variational Derivative Method: A Structure-Preserving Numerical Method for Partial Differential Equations. Chapman and Hall/CRC, Boca Raton (2010)
Gautschi, W.: Numerical integration of ordinary differential equations based on trigonometric polynomials. Numer. Math. 3, 381–397 (1961)
Gonzalez, O.: Time integration and discrete Hamiltonian systems. J. Nonlinear Sci. 6, 449–467 (1996)
Guckenheimer, J., Holmes, P.: Nonlinear Oscillations, Dynamical Systems, and Bifurcations of Vector Fields. Springer, New York (1983)
Hairer, E.: Energy-preserving variant of collocation methods. J. Numer. Anal. Ind. Appl. Math. 5, 73–84 (2010)
Hairer, E., Lubich, C., Wanner, G.: Geometric Numerical Integration, vol. XIII, 2nd edn. Springer, Berlin (2006)
Hernández-Solano, Y., Atencia, M., Joya, G., Sandoval, F.: A discrete gradient method to enhance the numerical behavior of Hopfield networks. Neurocomputing 164, 45–55 (2015)
Hersch, J.: Contribution à la méthode des équations aux différences. Z. Angew. Math. Phys. 9, 129–180 (1958)
Higham, N.J.: Functions of Matrices: Theory and Computation. SIAM, Philadelphia (2008)
Hochbruck, M., Lubich, C., Selhofer, H.: Exponential integrators for large systems of differential equations. SIAM J. Sci. Comput. 19, 1552–1574 (1998)
Hochbruck, M., Ostermann, A.: Exponential integrators. Acta Numerica 19, 209–286 (2010)
Kassam, A.K., Trefethen, L.N.: Fourth order time-stepping for stiff PDEs. SIAM. J. Sci. Comput. 26, 1214–1233 (2005)
Klein, C.: Fourth order time-stepping for low dispersion Korteweg–de Vries and nonlinear Schrödinger equations. Electron. Trans. Numer. Anal. 29, 116–135 (2008)
Lawson, J.D.: Generalized Runge–Kutta processes for stable systems with large Lipschitz constants. SIAM. J. Numer. Anal. Model. 4, 372–380 (1967)
Li, Y.W., Wu, X.Y.: Exponential integrators preserving first integrals or Lyapunov functions for conservative or dissipative systems. SIAM J. SCI. Comput. 38, A1876–A1895 (2016)
Macías-Díaz, J.E., Medina-Ramírez, I.E.: An implicit four-step computational method in the study on the effects of damping in a modified \(\alpha \)-Fermi-Pasta-Ulam medium. Commun. Nonlinear Sci. Numer. Simul. 14, 3200–3212 (2009)
McLachlan, R.I., Quispel, G.R.W., Robidoux, N.: A unified approach to Hamiltonian systems, Poisson systems, gradient systems, and systems with Lyapunov functions or first integrals. Phys. Rev. Lett. 81, 2399–2411 (1998)
McLachlan, R.I., Quispel, G.R.W., Robidoux, N.: Geometric integration using dicrete gradients. Philos. Trans. R. Soc. A 357, 1021–1046 (1999)
Pavlov, B.V., Rodionova, O.E.: The method of local linearization in the numerical solution of stiff systems of ordinary differential equations. USSR Comput. Math. Math. Phys. 27, 30–38 (1987)
Wang, B., Wu, X.Y.: A new high precision energy-preserving integrator for system of oscillatory second-order differential equations. Phys. Lett. A 376, 1185–1190 (2012)
Wu, X.Y., Wang, B., Xia, J.: Explicit symplectic multidimensional exponential fitting modified Runge–Kutta–Nyström methods. BIT Numer. Math. 52, 773–795 (2012)
Yang, H., Wu, X.Y., You, X., Fang, Y.: Extended RKN-type methods for numerical integration of perturbed oscillators. Comput. Phys. Commun. 180, 1777–1794 (2009)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2018 Springer Nature Singapore Pte Ltd. And Science Press
About this chapter
Cite this chapter
Wu, X., Wang, B. (2018). Exponential Average-Vector-Field Integrator for Conservative or Dissipative Systems. In: Recent Developments in Structure-Preserving Algorithms for Oscillatory Differential Equations. Springer, Singapore. https://doi.org/10.1007/978-981-10-9004-2_2
Download citation
DOI: https://doi.org/10.1007/978-981-10-9004-2_2
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-10-9003-5
Online ISBN: 978-981-10-9004-2
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)