This paper was converted on www.awesomepapers.org from LaTeX by an anonymous user.
Want to know more? Visit the Converter page.

Runge–Kutta methods determined from extended phase space methods for Hamiltonian systems

\fnmRobert I. \surMcLachlan r.mclachlan@massey.ac.nz \orgdivSchool of Mathematical and Computational Sciences, \orgnameMassey University, \orgaddress\cityPalmerston North, \postcode4472, \countryNew Zealand
Abstract

We study two existing extended phase space integrators for Hamiltonian systems, the midpoint projection method and the symmetric projection method, showing that the first is a pseudosymplectic and pseudosymmetric Runge–Kutta method and the second is a monoimplicit symplectic Runge–Kutta method.

1 Introduction

Many commonly used numerical methods for the time integration of differential equations can be expanded in B-series which elucidate their geometric and numerical properties [2, 10]. However, symplectic integrators with a B-series are implicit, the implicit midpoint rule being a central example [5]. Explicit symplectic integrators exist for some systems, such as separable classical mechanical systems [13]. To avoid this restriction, Pihajoki [15] introduced extended phase space methods: a new Hamiltonian, defined on the product of two copies of the original phase space, is constructed, that is amenable to explicit symplectic integration in the extended phase space.

In place of the Hamiltonian system XHX_{H} associated with the Hamiltonian HH and canonical symplectic form ω\omega,

q˙=D2H(q,p),p˙=D1H(q,p)\dot{q}=D_{2}H(q,p),\quad\dot{p}=-D_{1}H(q,p) (1)

((q,p)2d(q,p)\in\mathbb{R}^{2d}), Pihajoki considered the extended system

q˙=D2H(x,p),p˙=D1H(q,y)\dot{q}=D_{2}H(x,p),\quad\dot{p}=-D_{1}H(q,y)
x˙=D2H(q,y),y˙=D1H(x,p)\dot{x}=D_{2}H(q,y),\quad\dot{y}=-D_{1}H(x,p)

((q,x,p,y)4d(q,x,p,y)\in\mathbb{R}^{4d}) with initial condition

(q(0),x(0),p(0),y(0))=(q0,x0,p0,y0)=(q0,q0,p0,p0)(q(0),x(0),p(0),y(0))=(q_{0},x_{0},p_{0},y_{0})=(q_{0},q_{0},p_{0},p_{0})

such that the solution obeys q(t)=x(t)q(t)=x(t) and p(t)=y(t)p(t)=y(t) for all tt and (q(t),p(t))(q(t),p(t)) satisfies the original system (1) with initial condition (q(0),p(0))=(q0,p0)(q(0),p(0))=(q_{0},p_{0}). The extended system is Hamiltonian with extended Hamiltonian H^=H^A+B^B\hat{H}=\hat{H}_{A}+\hat{B}_{B}, H^A=H(x,p)\hat{H}_{A}=H(x,p), H^B=H(q,y)\hat{H}_{B}=H(q,y) and symplectic form ω^:=dqdp+dxdy\hat{\omega}:=dq\wedge dp+dx\wedge dy.

As xx and pp (resp. qq and yy) commute, the flow exp(tXH^A)\exp\big{(}tX_{\hat{H}_{A}}\big{)} of Hamilton’s equations for H^A\hat{H}_{A} is given explicitly by Euler’s method:

q(t)\displaystyle q(t) =q0+tD2H(x0,p0)\displaystyle=q_{0}+tD_{2}H(x_{0},p_{0})
x(t)\displaystyle x(t) =x0\displaystyle=x_{0}
p(t)\displaystyle p(t) =p0\displaystyle=p_{0}
y(t)\displaystyle y(t) =y0tD1H(x0,p0)\displaystyle=y_{0}-tD_{1}H(x_{0},p_{0})

(and analogously for H^B\hat{H}_{B}). The integrator

Φh:=exp(12hXH^A)exp(hXH^B)exp(12hXH^A)\Phi_{h}:=\exp\big{(}\frac{1}{2}hX_{\hat{H}_{A}}\big{)}\exp\big{(}hX_{\hat{H}_{B}}\big{)}\exp\big{(}\frac{1}{2}hX_{\hat{H}_{A}}\big{)}

is therefore explicit, second order, and preserves the extended symplectic form ω^\hat{\omega}.

Two key issues, however, immediately arise: the ‘duplicate’ point (x,y)(x,y) may move away from the ‘base’ point (q,p)(q,p); and it is not clear how symplecticity in the extended phase space is advantageous in the original phase space. Tao [16] addressed the first point by adding a coupling term 12α(xq2+yp2)\frac{1}{2}\alpha(\|x-q\|^{2}+\|y-p\|^{2}) to the extended Hamiltonian, finding that this could suppress the growth of (qx,py)(q-x,p-y). Other authors have addressed the second point by projecting the solution to the original phase space in different ways. Two of these, the symmetric projection method of Ohsawa [14] and the midpoint projection method of Luo et al. [7], are the subject of this paper.

The midpoint projection method, considered in Section 2, is shown to be equivalent to an explicit Runge–Kutta method that is pseudosymplectic (that is, approximately symplectic) and pseudosymmetric up to surprisingly high order – order 5 for the leapfrog-based method of classical order 2, and order 9 for the methods of classical order 4. We suggest that these properties account for the methods’ good performance in astrophysical applications.

The symmetric projection methods, considered in Section 3, are shown to be equivalent to monoimplicit symplectic Runge–Kutta methods, revealing their affine equivariance and generality.

2 The midpoint projection method

Luo et al. [7] composed such an extended phase space integrator with the midpoint projection111Called the midpoint permutation in [7].

π:4d2d,(q,x,p,y)(q+x2,p+y2)\pi\colon\mathbb{R}^{4d}\to\mathbb{R}^{2d},\quad(q,x,p,y)\mapsto\left(\frac{q+x}{2},\frac{p+y}{2}\right)

to yield an explicit integrator on the original phase space. These methods were called ‘symplectic-like’ ‘because they, like standard implicit symplectic integrators, show no drift in the energy error’ [7]. This lack of energy drift has been observed in many astrophysical simulations with nonseparable Hamiltonians without explanation, and the method has become quite popular [6, 18]. The order can be increased using composition methods [13]. The following result accounts for the greatly reduced energy drift.

Proposition 1.

The ss-stage midpoint projected methods of the form

φh:=πi=1sΦαih\varphi_{h}:=\pi\circ\prod_{i=1}^{s}\Phi_{\alpha_{i}h}

are equivalent to 2s+12s+1-stage explicit Runge–Kutta methods of at least the same classical order as the underlying composition method. In the three cases

  1. 1.

    s=1s=1, α1=1\alpha_{1}=1 (the standard extended phase space integrator with midpoint projection, of classical order 2);

  2. 2.

    s=3s=3, (α1,α2,α3)=(α,12α,α)(\alpha_{1},\alpha_{2},\alpha_{3})=(\alpha,1-2\alpha,\alpha), α=1/(221/3)\alpha=1/(2-2^{1/3}) (classical order 4);

  3. 3.

    s=5s=5, (α1,,α5)=(α,α,14α,α,α)(\alpha_{1},\dots,\alpha_{5})=(\alpha,\alpha,1-4\alpha,\alpha,\alpha), α=1/(441/3)\alpha=1/(4-4^{1/3}) (classical order 4).

the methods have pseudosymplecticity order k:=5k:=5, 99, and 99 respectively, and pseudosymmetry order 55, 99, and 99 respectively. That is, φhω=ω+𝒪(hk+1)\varphi_{h}^{*}\omega=\omega+\mathcal{O}(h^{k+1}) and φhφh=id+𝒪(hk+1)\varphi_{h}\circ\varphi_{-h}=id+\mathcal{O}(h^{k+1}).

Proof.

We begin by noting that the extended phase space methods do not rely on the partitioning into (q,p)(q,p) variables, but can be written in an affine-equivariant way that exhibits how they can be applied to any ordinary differential equation. For the ODE z˙=f(z)\dot{z}=f(z), z𝕕z\in\mathbb{R^{d}}, we consider the duplicated (i.e. extended) system

z˙=f(z^),z^˙=f(z)\displaystyle\begin{split}\dot{z}&=f(\hat{z}),\\ \dot{\hat{z}}&=f(z)\end{split} (2)

which is separable and can be integrated by splitting and composition. When z=(q,y)z=(q,y), z^=(x,p)\hat{z}=(x,p), and f(z)=XH(z)f(z)=X_{H}(z), this yields the method above. When ff preserves dzJzdz\wedge Jz, (2) preserves dzJdz^dz\wedge Jd\hat{z}. We write out the method πΦh\pi\circ\Phi_{h} first in (z,z^)(z,\hat{z}) variables, with initial conditions (z0,z^0)(z_{0},\hat{z}_{0}):

z1/2\displaystyle z_{1/2} =z0+12hf(z^0)\displaystyle=z_{0}+\frac{1}{2}hf(\hat{z}_{0})
z^1\displaystyle\hat{z}_{1} =z^0+hf(z1)\displaystyle=\hat{z}_{0}+hf(z_{1})
z1\displaystyle z_{1} =z1/2+12hf(z^1)\displaystyle=z_{1/2}+\frac{1}{2}hf(\hat{z}_{1})
π(z1,z^1)\displaystyle\pi(z_{1},\hat{z}_{1}) =(z1+z^1)/2\displaystyle=(z_{1}+\hat{z}_{1})/2

Imposing z^0=z0\hat{z}_{0}=z_{0}, this can be written in Runge–Kutta form as

Z1\displaystyle Z_{1} =z0\displaystyle=z_{0}
Z2\displaystyle Z_{2} =z0+12hf(Z1)\displaystyle=z_{0}+\frac{1}{2}hf(Z_{1})
Z3\displaystyle Z_{3} =z0+hf(Z2)\displaystyle=z_{0}+hf(Z_{2})
Z4\displaystyle Z_{4} =Z2+12hf(Z3)\displaystyle=Z_{2}+\frac{1}{2}hf(Z_{3})
=z0+h(12f(Z1)+12f(Z2))\displaystyle=z_{0}+h\left(\frac{1}{2}f(Z_{1})+\frac{1}{2}f(Z_{2})\right)
z1\displaystyle z_{1} =(Z3+Z4)/2\displaystyle=(Z_{3}+Z_{4})/2
=z0+h(14f(Z1)+12f(Z2)+14f(Z3))\displaystyle=z_{0}+h\left(\frac{1}{4}f(Z_{1})+\frac{1}{2}f(Z_{2})+\frac{1}{4}f(Z_{3})\right)

This is a 3-stage explicit Runge–Kutta method with Butcher tableau

00001212001010141214.\begin{array}[]{c|ccc}0&0&0&0\\ \frac{1}{2}&\frac{1}{2}&0&0\\ 1&0&1&0\\ \hline\cr&\frac{1}{4}&\frac{1}{2}&\frac{1}{4}\\ \end{array}.

For this method we compute its B-series and check the pseudosymplecticity conditions222We evaluated the symplecticity conditions a(u)a(v)a(uv)a(vu)a(u)a(v)-a(u\circ v)-a(v\circ u) where uu and vv are Butcher trees in Mathematica using

Ω<<NumericalDifferentialEquationAnalysis‘ΩButcherProduct[u_, v_] := If[ByteCount[v]==0, \[FormalF][u], ReplacePart[v, 1->v[[1]] u]]ΩSymplectic[u_, v_] := ButcherPhi[u] ButcherPhi[v] - ButcherPhi[ButcherProduct[u, v]]Ω- ButcherPhi[ButcherProduct[v, u]]Ω\end{verbatim}Ω
[5, VI.7.3]. There are 1, 1, 1, 3, and 6 conditions respectively at orders 1, …, 5; these are all satisfied. Of the 16 order 6 conditions, 13 are satisfied and 3 are not, thus the method is pseudosymplectic of order 5. For pseudosymmetry, we expand φhφh\varphi_{h}\circ\varphi_{-h} in B-series similarly.

The calculation for the other methods proceeds similarly. For s=3s=3 the Butcher tableau is

0000000012α112α1000000α10α100000α1+12α212α1012α1+12α20000α1+α20α10α2000α1+α2+12α312α1012α1+12α2012α2+12α300α1+α2+α30α10α20α3014α112α114(α1+α2)12α214(α2+α3)12α314α3\begin{array}[]{c|ccccccc}0&0&0&0&0&0&0&0\\ \frac{1}{2}\alpha_{1}&\frac{1}{2}\alpha_{1}&0&0&0&0&0&0\\ \alpha_{1}&0&\alpha_{1}&0&0&0&0&0\\ \alpha_{1}+\frac{1}{2}\alpha_{2}&\frac{1}{2}\alpha_{1}&0&\frac{1}{2}\alpha_{1}+\frac{1}{2}\alpha_{2}&0&0&0&0\\ \alpha_{1}+\alpha_{2}&0&\alpha_{1}&0&\alpha_{2}&0&0&0\\ \alpha_{1}+\alpha_{2}+\frac{1}{2}\alpha_{3}&\frac{1}{2}\alpha_{1}&0&\frac{1}{2}\alpha_{1}+\frac{1}{2}\alpha_{2}&0&\frac{1}{2}\alpha_{2}+\frac{1}{2}\alpha_{3}&0&0\\ \alpha_{1}+\alpha_{2}+\alpha_{3}&0&\alpha_{1}&0&\alpha_{2}&0&\alpha_{3}&0\\ \hline\cr&\frac{1}{4}\alpha_{1}&\frac{1}{2}\alpha_{1}&\frac{1}{4}\left(\alpha_{1}+\alpha_{2}\right)&\frac{1}{2}\alpha_{2}&\frac{1}{4}\left(\alpha_{2}+\alpha_{3}\right)&\frac{1}{2}\alpha_{3}&\frac{1}{4}\alpha_{3}\\ \end{array}

Pseudosymplecticity was introduced by Aubry and Chartier [1], who derive various explicit pseudosymplectic Runge–Kutta methods; the second order method above appears there as a member of a 1-parameter family of 3-stage methods of pseudosymplectic order 4, it being the unique member of that family that is pseudosymplectic of order 5.

The numerical examples in the astrophysics literature do not show energy drift. However, the potential drift effect is rather small and we have confirmed numerically in planar Hamiltonian systems that the energy does drift proportionally to h5th^{5}t resp. h9th^{9}t for the 2nd resp. 4th order methods above. Symmetry also affects time integration and can moderate energy drift [12], so it is possible that pseudosymmetry is having some positive effect as well. The 3-stage 4th order method is known to have large error constants and it is possible that the 5-stage method given here, or some other explicit pseudosymplectic method, may be have advantages in these applications. On the other hand, energy behaviour is not the only manifestation of symplecticity and the choice of a symplectic vs a pseudosymplectic integrator may depend on the application.

3 The symmetric projection method

Ohsawa [14] defined the extended phase space integrator with symmetric projection as follows. Let

D=[IdId0000IdId],𝒩=kerD={(q,q,p,p):(q,p)2d}.D=\begin{bmatrix}I_{d}&-I_{d}&0&0\\ 0&0&I_{d}&-I_{d}\end{bmatrix},\quad\mathcal{N}=\mathrm{ker}D=\{(q,q,p,p)\colon(q,p)\in\mathbb{R}^{2d}\}.

Given an extended phase space integrator Φh:4d4d\Phi_{h}\colon\mathbb{R}^{4d}\to\mathbb{R}^{4d} and initial condition z0=(q0,p0)2dz_{0}=(q_{0},p_{0})\in\mathbb{R}^{2d}, the integrator is the map z0z1z_{0}\mapsto z_{1} defined by

  1. 1.

    ζ0:=(q0,q0,p0,p0)\zeta_{0}:=(q_{0},q_{0},p_{0},p_{0})

  2. 2.

    Find μ2d\mu\in\mathbb{R}^{2d} such that Φh(ζ0+Dμ)+Dμ𝒩\Phi_{h}(\zeta_{0}+D^{\top}\mu)+D^{\top}\mu\in\mathcal{N}

  3. 3.

    ζ^0:=ζ0+Dμ\hat{\zeta}_{0}:=\zeta_{0}+D^{\top}\mu

  4. 4.

    ζ^1:=Φh(ζ^0)\hat{\zeta}_{1}:=\Phi_{h}(\hat{\zeta}_{0})

  5. 5.

    ζ1=(q1,q1,p1,p1):=ζ^1+Dμ\zeta_{1}=(q_{1},q_{1},p_{1},p_{1}):=\hat{\zeta}_{1}+D^{\top}\mu

  6. 6.

    z1=(q1,p1)z_{1}=(q_{1},p_{1})

The method is well-defined, symmetric, and symplectic [14]. Jayawardana and Ohsawa [8] further show that the method preserves arbitrary quadratic invariants. Together these results give a strong indication that the method may be a symplectic B-series method. We show below that this is true and that it is in fact equivalent to a monoimplicit Runge–Kutta method, a class introduced by Cash [3] that have only a single implicit stage. (The Simpson–AVF method z1=z0+16h(f(z0)+4f((z0+z1)/2)+f(z1))z_{1}=z_{0}+\frac{1}{6}h(f(z_{0})+4f((z_{0}+z_{1})/2)+f(z_{1})) is an example [4].) In a monoimplicit Runge–Kutta method the AA matrix of the Butcher tableau takes the form of a rank one matrix plus a matrix of zero spectral radius.

The extended phase space integrator with symmetric projection is also an instance of the class of extended Runge–Kutta methods that we now define.

Definition 1.

For ODEs z˙=f(z)\dot{z}=f(z), zdz\in\mathbb{R}^{d}, an extended Runge–Kutta method is defined by the equations

Zi\displaystyle Z_{i} =z0+hj=1maijkj,i=1,,s\displaystyle=z_{0}+h\sum_{j=1}^{m}a_{ij}k_{j},\quad i=1,\dots,s
z1=\displaystyle z_{1}= z0+hi=1mbiki\displaystyle z_{0}+h\sum_{i=1}^{m}b_{i}k_{i}
ki\displaystyle k_{i} =f(Zi),i=1,,s\displaystyle=f(Z_{i}),\quad i=1,\dots,s
0\displaystyle 0 =j=1mdijkj,i=1,,ms\displaystyle=\sum_{j=1}^{m}d_{ij}k_{j},\quad i=1,\dots,m-s

where the matrix dijd_{ij} has full rank.

Recall the central result of Munthe-Kaas et al. [9]: Let Φ={Φn}n\Phi=\{\Phi_{n}\}_{n\in\mathbb{N}} be an integration method, defined for all vector fields on all dimensions nn. Then Φ\Phi is a B-series method if and only if the property of affine equivariance is fulfilled: if a(x):=Ax+ba(x):=Ax+b is an affine map from m\mathbb{R}^{m} to n\mathbb{R}^{n}, ff a vector field on m\mathbb{R}^{m}, and gg a vector field on n\mathbb{R}^{n} such that g(Ax+b)=Af(x)g(Ax+b)=Af(x), then aΦm(f)=Φn(f)aa\circ\Phi_{m}(f)=\Phi_{n}(f)\circ a.

Proposition 2.

Extended Runge–Kutta methods are affine equivariant.

Proposition 3.

Let MM be the m×mm\times m matrix defined by

Mij=bibjbiaijbjajiM_{ij}=b_{i}b_{j}-b_{i}a_{ij}-b_{j}a_{ji}

for i,j=1,,mi,j=1,\dots,m, where we have defined aij=0a_{ij}=0 for i>si>s. Let VV be an m×sm\times s matrix whose columns form a basis for the nullspace of dd. If bi=0b_{i}=0 for i=s+1,,mi=s+1,\dots,m, and VTMV=0V^{T}MV=0, then the extended Runge–Kutta method with parameters aija_{ij}, bib_{i}, and dijd_{ij}, is quadratic-preserving and symplectic.

Proof.

Suppose ff has a quadratic first integral zCzz^{\top}Cz. Following the standard proof for Runge–Kutta methods,

z1Cz1z0Cz0=2hj+1mbiz0Cki+h2i,j=1mMijkiCkj.z_{1}^{\top}Cz_{1}-z_{0}^{\top}Cz_{0}=2h\sum_{j+1}^{m}b_{i}z_{0}^{\top}Ck_{i}+h^{2}\sum_{i,j=1}^{m}M_{ij}k_{i}^{\top}Ck_{j}.

Using the condition on the bib_{i}, and expressing k1,,ksk_{1},\dots,k_{s} in the basis whose columns are VV, i.e. ki=j=1sVijk^jk_{i}=\sum_{j=1}^{s}V_{ij}\hat{k}_{j}, gives the result. ∎

Proposition 4.

Extended phase space integrators with symmetric projection, where the extended method Ψ\Psi is a composition method, are extended Runge–Kutta methods and can be written as monoimplicit symplectic Runge–Kutta methods.

Corollary 1.
  1. 1.

    Extended phase space integrators with symmetric projection methods preserve arbitrary affine symmetries, quadratic integrals, and constant symplectic structures when there are any.

  2. 2.

    Monoimplicit symplectic Runge–Kutta methods of all orders exist.

Proof.

We again write the extended system as

z˙\displaystyle\dot{z} =f(z^)\displaystyle=f(\hat{z})
z^˙\displaystyle\dot{\hat{z}} =f(z).\displaystyle=f(z).

Let Δ:z(z,z)\Delta\colon z\mapsto(z,z); Sμ:(z,z^)(z+μ,zμ)S_{\mu}\colon(z,\hat{z})\mapsto(z+\mu,z-\mu); π:(z,z^)z\pi\colon(z,\hat{z})\to z. In these variables the symmetric projection method takes the form

πSμΨSμΔ\pi\circ S_{\mu}\circ\Psi\circ S_{\mu}\circ\Delta

where μ\mu is determined by the condition that SμΨhSμ𝒩S_{\mu}\circ\Psi_{h}\circ S_{\mu}\in\mathcal{N}.

We first illustrate the complete construction for the case that Ψh\Psi_{h} is the leapfrog method Φh\Phi_{h}. Its three substeps are then

z\displaystyle z^{*} =z0+μ+12hf(z0μ)\displaystyle=z_{0}+\mu+\frac{1}{2}hf(z_{0}-\mu)
z^\displaystyle\hat{z}^{*} =z0μ+hf(z)\displaystyle=z_{0}-\mu+hf(z^{*})
z\displaystyle z^{**} =z+12hf(z^)\displaystyle=z^{*}+\frac{1}{2}hf(\hat{z}^{*})

Defining the three stages Z1Z_{1}, Z2Z_{2}, and Z3Z_{3} as the zz-values at which ff is evaluated, and defining hk4=μhk_{4}=\mu, we have

Z1\displaystyle Z_{1} =z0hk4\displaystyle=z_{0}-hk_{4}
Z2\displaystyle Z_{2} =z0+h(12k1+k4)\displaystyle=z_{0}+h\left(\frac{1}{2}k_{1}+k_{4}\right)
Z3\displaystyle Z_{3} =z0+h(k2k4)\displaystyle=z_{0}+h(k_{2}-k_{4})

The condition SμΨSμΔ(n)S_{\mu}\circ\Psi\circ S_{\mu}\in\Delta(\mathbb{R}^{n}) is

z+μ=z^μz^{**}+\mu=\hat{z}^{*}-\mu

which leads to the constraint

12k1+k212k34k4=0.-\frac{1}{2}k_{1}+k_{2}-\frac{1}{2}k_{3}-4k_{4}=0.

The update equation is z1=z+μz_{1}=z^{**}+\mu or

z1=z0+h(14k1+12k2+14k3).z_{1}=z_{0}+h\left(\frac{1}{4}k_{1}+\frac{1}{2}k_{2}+\frac{1}{4}k_{3}\right).

Thus the parameters for this method are

A=[00011200101010000]A=\begin{bmatrix}0&0&0&-1\\ \frac{1}{2}&0&0&1\\ 0&1&0&-1\\ 0&0&0&0\end{bmatrix}
b=[1412140]b=\begin{bmatrix}\frac{1}{4}&\frac{1}{2}&\frac{1}{4}&0\end{bmatrix}
d=[121124].d=\begin{bmatrix}-\frac{1}{2}&1&-\frac{1}{2}&-4\end{bmatrix}.

(For the null space of dd we take

V=[218100010001].V=\begin{bmatrix}2&-1&-8\\ 1&0&0\\ 0&1&0\\ 0&0&1\end{bmatrix}.

A direct calculation shows that

M=116[1214242812144840]M=\frac{1}{16}\begin{bmatrix}1&-2&1&4\\ -2&4&-2&-8\\ 1&-2&1&4\\ 4&-8&4&0\end{bmatrix}

and VMV=0V^{\top}MV=0, confirming that the method is quadratic-preserving.)

The extra stage k4k_{4} can be explicitly eliminated using the constraint, giving the 3-stage monoimplicit symplectic Runge–Kutta method with tableau

0181418123814181183418141214.\begin{array}[]{c|ccc}0&\frac{1}{8}&-\frac{1}{4}&\frac{1}{8}\\ \frac{1}{2}&\frac{3}{8}&\frac{1}{4}&-\frac{1}{8}\\ 1&\frac{1}{8}&\frac{3}{4}&\frac{1}{8}\\ \hline\cr&\frac{1}{4}&\frac{1}{2}&\frac{1}{4}\end{array}.

For the general case, let Ψh\Psi_{h} be the composition method with time steps given by parameters a1,,asa_{1},\dots,a_{s}, i.e.

Ψh=exp(ashXH^B)exp(as1hXH^A)exp(a2hXH^B)exp(a1hXH^A).\Psi_{h}=\exp(a_{s}hX_{\hat{H}_{B}})\exp(a_{s-1}hX_{\hat{H}_{A}})\dots\exp(a_{2}hX_{\hat{H}_{B}})\exp(a_{1}hX_{\hat{H}_{A}}).

Writing out the stages as above, and eliminating the constraint μ\mu, leads to an ss-stage monoimplicit Runge–Kutta method with parameters

A=L+14uv,bi=12aiA=L+\frac{1}{4}uv^{\top},\quad b_{i}=\frac{1}{2}a_{i}

where

L=[0a100a20a10a300a20a40a10a3as10],ui=(1)i,vj=aj(1)j.L=\begin{bmatrix}0&\dots\\ a_{1}&0&\dots\\ 0&a_{2}&0&\dots\\ a_{1}&0&a_{3}&0&\dots\\ 0&a_{2}&0&a_{4}&0&\dots\\ &&\ddots&&\ddots\\ a_{1}&0&a_{3}&\dots&&a_{s-1}&0\end{bmatrix},\quad u_{i}=(-1)^{i},\quad v_{j}=a_{j}(-1)^{j}.

Therefore

biaij=12bibjcjib_{i}a_{ij}=\frac{1}{2}b_{i}b_{j}c_{j-i}

where

ck={1k even1k odd,k>03k odd,k<0c_{k}=\begin{cases}1&k\hbox{\rm\ even}\\ -1&k\hbox{\rm\ odd},k>0\\ 3&k\hbox{\rm\ odd},k<0\end{cases}

and thus we have

bibjbiaijbjaji=0b_{i}b_{j}-b_{i}a_{ij}-b_{j}a_{ji}=0

for all ii and jj, which is the condition for a Runge–Kutta method to be symplectic. ∎

4 Discussion

The results here have been established by direct calculation, but the methods appear quite natural and intrinsically defined. One could seek direct geometric proofs, not relying on B-series, of the pseudosymplecticity and pseudosymmetry orders for the midpoint projection method when the extended method is an arbitrary symplectic integrator. Likewise, for the symmetric projection method, the diagonal 𝒩\mathcal{N} is a symplectic subspace of the extended symplectic space, suggesting an approach using the symplectic geometry of constraints [11]. The question mentioned earlier, of the best pseudosymplectic method to use in applications, and any potential issues arising from nonsymplecticity, should be examined. Finally, we suggest determining the entire set of monoimplicit symplectic Runge–Kutta methods and their relative merits.

Dedication

A preliminary version of this work was presented at ANODE 2023 in honour of John Butcher’s 90th birthday. It was therefore very pleasing and appropriate to find that, as the work developed, it turned out to involve Runge–Kutta methods and Butcher series so intimately. Happy birthday, John!

References

  • [1] Aubry, A. and Chartier, P. (1998). Pseudo-symplectic Runge–Kutta methods. BIT Numerical Mathematics, 38, 439–461.
  • [2] Butcher, J. C. (2021). B-series: Algebraic Analysis of Numerical Methods. Springer Series in Computational Mathematics, vol. 55. Berlin: Springer.
  • [3] Cash, J. R. (1975). A class of implicit Runge-Kutta methods for the numerical integration of stiff ordinary differential equations. Journal of the ACM (JACM), 22(4), 504-511.
  • [4] Celledoni, E., McLachlan, R. I., McLaren, D. I., Owren, B., Quispel, G. R. W., and Wright, W. M. (2009). Energy-preserving Runge–Kutta methods. ESAIM: Mathematical Modelling and Numerical Analysis, 43(4), 645–649.
  • [5] Hairer, E., Lubich, C., and Wanner, G. (2006). Geometric Numerical Integration: Structure-Preserving Algorithms for Ordinary Differential Equations (Springer Series in Computational Mathematics, 31) Berlin: Springer.
  • [6] Li, D. and Wu, X. (2019). Chaotic motion of neutral and charged particles in a magnetized Ernst-Schwarzschild spacetime. The European Physical Journal Plus, 134, 1–12.
  • [7] Luo, J., Wu, X., Huang, G., and Liu, F. (2017). Explicit symplectic-like integrators with midpoint permutations for spinning compact binaries. The Astrophysical Journal, 834(1), 64.
  • [8] Jayawardana, B., and Ohsawa, T. (2023). Semiexplicit symplectic integrators for non-separable Hamiltonian systems. Mathematics of Computation, 92(339), 251–281.
  • [9] McLachlan, R. I., Modin, K., Munthe-Kaas, H., and Verdier, O. (2016). B-series methods are exactly the affine equivariant methods. Numerische Mathematik, 133, 599–622.
  • [10] McLachlan, R. I., Modin, K., Munthe-Kaas, H., and Verdier, O. (2017). Butcher series. A story of rooted trees and numerical methods for for evolution equations, Asia Pacific Mathematics Newsletter 7, No 1, (2017), 1–11.
  • [11] McLachlan, R. I., Modin, K., Verdier, O., and Wilkins, M. (2014). Geometric generalisations of Shake and Rattle. Foundations of Computational Mathematics 14 (2)2 339–370.
  • [12] McLachlan, R. I., and Perlmutter, M. (2004). Energy drift in reversible time integration. Journal of Physics A: Mathematical and General, 37(45), L593.
  • [13] McLachlan, R. I. and Quispel, G. R. W. (2002). Splitting methods. Acta Numerica, 11, 341-434.
  • [14] Ohsawa, T. (2023). Preservation of Quadratic Invariants by Semiexplicit Symplectic Integrators for Nonseparable Hamiltonian Systems. SIAM Journal on Numerical Analysis, 61(3), 1293–1315.
  • [15] Pihajoki, P. (2015).Explicit methods in extended phase space for inseparable Hamiltonian problems. Celestial Mechanics and Dynamical Astronomy, 121(3):211–231.
  • [16] Tao, M. (2016) Explicit high-order symplectic integrators for charged particles in general electromag- netic fields. Journal of Computational Physics, 327:245–251.
  • [17] Tao, M. (2016) Explicit symplectic approximation of nonseparable Hamiltonians: Algorithm and long time performance. Physical Review E, 94(4):043303.
  • [18] Pan, G., Wu, X., and Liang, E. (2021). Extended phase-space symplectic-like integrators for coherent post-Newtonian Euler-Lagrange equations. Physical Review D, 104(4), 044055.