Symplectic integrator

From HandWiki
Short description: Numerical integration scheme for Hamiltonian systems

In mathematics, a symplectic integrator (SI) is a numerical integration scheme for Hamiltonian systems. Symplectic integrators form the subclass of geometric integrators which, by definition, are canonical transformations. They are widely used in nonlinear dynamics, molecular dynamics, discrete element methods, accelerator physics, plasma physics, quantum physics, and celestial mechanics.

Introduction

Symplectic integrators are designed for the numerical solution of Hamilton's equations, which read p˙=Hqandq˙=Hp, where q denotes the position coordinates, p the momentum coordinates, and H is the Hamiltonian. The set of position and momentum coordinates (q,p) are called canonical coordinates. (See Hamiltonian mechanics for more background.)

The time evolution of Hamilton's equations is a symplectomorphism, meaning that it conserves the symplectic 2-form dpdq. A numerical scheme is a symplectic integrator if it also conserves this 2-form.

Symplectic integrators possess, as a conserved quantity, a Hamiltonian which is slightly perturbed from the original one.[1] By virtue of these advantages, the SI scheme has been widely applied to the calculations of long-term evolution of chaotic Hamiltonian systems ranging from the Kepler problem to the classical and semi-classical simulations in molecular dynamics.

Most of the usual numerical methods, such as the primitive Euler scheme and the classical Runge–Kutta scheme, are not symplectic integrators.

Methods for constructing symplectic algorithms

Splitting methods for separable Hamiltonians

A widely used class of symplectic integrators is formed by the splitting methods.

Assume that the Hamiltonian is separable, meaning that it can be written in the form


H(p,q)=T(p)+V(q).

 

 

 

 

(1)

This happens frequently in Hamiltonian mechanics, with T being the kinetic energy and V the potential energy.

For the notational simplicity, let us introduce the symbol z=(q,p) to denote the canonical coordinates including both the position and momentum coordinates. Then, the set of the Hamilton's equations given in the introduction can be expressed in a single expression as


z˙={z,H(z)},

 

 

 

 

(2)

where {,} is a Poisson bracket. Furthermore, by introducing an operator DH={,H}, which returns a Poisson bracket of the operand with the Hamiltonian, the expression of the Hamilton's equation can be further simplified to

z˙=DHz.

The formal solution of this set of equations at time t is given as a matrix exponential:


z(t)=exp(tDH)z(0).

 

 

 

 

(3)

Note the positivity of tDH in the matrix exponential.

When the Hamiltonian has the form of equation (1), the solution (3) is equivalent to


z(t)=exp[t(DT+DV)]z(0).

 

 

 

 

(4)

The SI scheme approximates the time-evolution operator exp[t(DT+DV)] in the formal solution (4) by a product of operators as


exp[t(DT+DV)]=i=k,,1exp(tdiDT)exp(tciDV)+O(tk+1)=exp(tdkDT)exp(tckDV)exp(td1DT)exp(tc1DV)+O(tk+1),

 

 

 

 

(5)

where ci and di are real numbers, k is an integer, which is called the order of the integrator, and where i=1kci=i=1kdi=1. Note that each of the operators exp(tciDV) and exp(tdiDT) provides a symplectic map, so their product appearing in the right-hand side of (5) also constitutes a symplectic map.

Since DT2z={{z,T},T}={(q˙,0),T}=(0,0) for all z, we can conclude that


DT2=0.

 

 

 

 

(6)

By using a Taylor series, exp(aDT) can be expressed as


exp(aDT)=n=0(aDT)nn!,

 

 

 

 

(7)

where a is an arbitrary real number. Combining (6) and (7), and by using the same reasoning for DV as we have used for DT, we get


{exp(aDV)=1+aDV,exp(aDT)=1+aDT.

 

 

 

 

(8)

In concrete terms, exp(tciDV) gives the mapping

(qp)(qptciVq(q)),

and exp(tdiDT) gives

(qp)(q+tdiTp(p)p).

Note that both of these maps are practically computable.

Algorithm

In each time step, the general algorithm for this class of symplectic integrators maps some initial state (q0,p0) to the state (qk,pk) one timestep t later. This is done through the sequence of substeps (q0,p0)(q1,p1)(qk1,pk1)(qk,pk). For every i=1,,k, the following equations are used to compute the substep (qi1,pi1)(qi,pi):

pi=pi1+tciF(qi1)qi=qi1+tdipim

where q is the position, p is the momentum, F(q)=Vq(q) is the force vector at q, and m is the scalar quantity of mass.

Equivalently, after converting into Lagrangian coordinates, each substep becomes

vi=vi1+tcia(xi1)xi=xi1+tdivi

where x is the position, v is the velocity, and a(x) is the acceleration vector at x.

Several symplectic integrators are given below.

A first-order example

The symplectic Euler method is the first-order integrator with k=1 and coefficients c1=d1=1.

Note that the algorithm above does not work if time-reversibility is needed. The algorithm has to be implemented in two parts, one for positive time steps, one for negative time steps.

A second-order example

The Verlet method is the second-order symplectic integrator with k=2 and coefficients

c1=12,d1=1,c2=12,d2=0.

Note that the coefficients

c1=0,d1=12,c2=1,d2=12

also form a second-order symplectic integrator[2][3], which is the Verlet method but shifted by half a time step t.

Since d2=0 in the first set of coefficients and c1=0 in the second set of coefficients, in both algorithms above one update can be ignored. There are thus only 3 steps to the algorithm, and step 1 and 3 are exactly the same, leading to the algorithm being symmetric in time, so the positive time version can also be used for negative time.

A third-order example

A third-order symplectic integrator (with k=3) was discovered by Ronald Ruth in 1983.[4] One of the many solutions is given by c1=724,c2=34,c3=124,d1=23,d2=23,d3=1.

A fourth-order example

A fourth-order integrator (with k=4) was also discovered by Ruth in 1983 and distributed privately to the particle-accelerator community at that time. This was described in a lively review article by Forest.[5] This fourth-order integrator was published in 1990 by Forest and Ruth and also independently discovered by two other groups around that same time:[2][3][6] c1=c4=12(221/3),c2=c3=121/32(221/3),d1=d3=1221/3,d2=21/3221/3,d4=0, or alternatively, c1=0,c3=21/3221/3,c2=c4=1221/3,d1=d4=12(221/3),d2=d3=121/32(221/3).

To determine these coefficients, the Baker–Campbell–Hausdorff formula can be used. Yoshida, in particular, gives an elegant derivation of coefficients for higher-order integrators.[3] Later on, Blanes and Moan[7] further developed partitioned Runge–Kutta methods for the integration of systems with separable Hamiltonians with very small error constants. Numerov%27s method, developed by the Russian astronomer Boris Vasil'evich Numerov in 1924, is also a fourth-order symplectic integrator.[8]

Splitting methods for general nonseparable Hamiltonians

General nonseparable Hamiltonians can also be explicitly and symplectically integrated.

To do so, Tao introduced a restraint that binds two copies of phase space together to enable an explicit splitting of such systems.[9] The idea is, instead of H(Q,P), one simulates H¯(q,p,x,y)=H(q,y)+H(x,p)+ω(12qx22+12py22), whose solution agrees with that of H(Q,P) in the sense that q(t)=x(t)=Q(t), p(t)=y(t)=P(t).

The new Hamiltonian is advantageous for explicit symplectic integration, because it can be split into the sum of three sub-Hamiltonians, HA=H(q,y), HB=H(x,p), and HC=ω(12qx22+12py22). Exact solutions of all three sub-Hamiltonians can be explicitly obtained: both HA,HB solutions correspond to shifts of mismatched position and momentum, and HC corresponds to a linear transformation. To symplectically simulate the system, one simply composes these solution maps.

Applications

In plasma physics

In recent decades symplectic integrator in plasma physics has become an active research topic,[10] because straightforward applications of the standard symplectic methods do not suit the need of large-scale plasma simulations enabled by the peta- to exa-scale computing hardware. Special symplectic algorithms need to be customarily designed, tapping into the special structures of the physics problem under investigation. One such example is the charged particle dynamics in an electromagnetic field. With the canonical symplectic structure, the Hamiltonian of the dynamics is H(p,x)=12(pA)2+ϕ, whose p-dependence and x-dependence are not separable, and standard explicit symplectic methods do not apply. For large-scale simulations on massively parallel clusters, however, explicit methods are preferred. To overcome this difficulty, we can explore the specific way that the p-dependence and x-dependence are entangled in this Hamiltonian, and try to design a symplectic algorithm just for this or this type of problem. First, we note that the p-dependence is quadratic, therefore the first order symplectic Euler method implicit in p is actually explicit. This is what is used in the canonical symplectic particle-in-cell (PIC) algorithm.[11] To build high order explicit methods, we further note that the p-dependence and x-dependence in this H(p,x) are product-separable, 2nd and 3rd order explicit symplectic algorithms can be constructed using generating functions,[12] and arbitrarily high-order explicit symplectic integrators for time-dependent electromagnetic fields can also be constructed using Runge-Kutta techniques.[13]

A more elegant and versatile alternative is to look at the following non-canonical symplectic structure of the problem, i(x˙,v˙)Ω=dH,Ω=d(v+A)dx,H=12v2+ϕ. Here Ω is a non-constant non-canonical symplectic form. General symplectic integrator for non-constant non-canonical symplectic structure, explicit or implicit, is not known to exist. However, for this specific problem, a family of high-order explicit non-canonical symplectic integrators can be constructed using the He splitting method.[14] Splitting H into 4 parts, H=Hx+Hy+Hz+Hϕ,Hx=12vx2,Hy=12vy2,Hz=12vz2,Hϕ=ϕ, we find serendipitously that for each subsystem, e.g., i(x˙,v˙)Ω=dHx and i(x˙,v˙)Ω=dHϕ, the solution map can be written down explicitly and calculated exactly. Then explicit high-order non-canonical symplectic algorithms can be constructed using different compositions. Let Θx,Θy,Θz and Θϕ denote the exact solution maps for the 4 subsystems. A 1st-order symplectic scheme is Θ1(Δτ)=Θx(Δτ)Θy(Δτ)Θz(Δτ)Θϕ(Δτ). A symmetric 2nd-order symplectic scheme is, Θ2(Δτ)=Θx(Δτ2)Θy(Δτ2)Θz(Δτ2)Θϕ(Δτ)Θz(Δt2)Θy(Δt2)Θx(Δt2), which is a customarily modified Strang splitting. A 2(+1)-th order scheme can be constructed from a 2-th order scheme using the method of triple jump, Θ2(+1)(Δτ)=Θ2(αΔτ)Θ2(βΔτ)Θ2(αΔτ), α=1221/(2+1),β=12α. The He splitting method is one of key techniques used in the structure-preserving geometric particle-in-cell (PIC) algorithms.[15][16][17][18]

See also

References

  1. Tuckerman, Mark E. (2010). Statistical Mechanics: Theory and Molecular Simulation (1 ed.). Oxford University Press. pp. 121–124. ISBN 978-0-19-852526-4. 
  2. 2.0 2.1 Forest, E.; Ruth, Ronald D. (1990). "Fourth-order symplectic integration". Physica D 43: 105–117. doi:10.1016/0167-2789(90)90019-L. Bibcode1990PhyD...43..105F. https://cloudfront.escholarship.org/dist/prd/content/qt35h9v2k9/qt35h9v2k9.pdf. 
  3. 3.0 3.1 3.2 Yoshida, H. (1990). "Construction of higher order symplectic integrators". Phys. Lett. A 150 (5–7): 262–268. doi:10.1016/0375-9601(90)90092-3. Bibcode1990PhLA..150..262Y. 
  4. Ruth, Ronald D. (August 1983). "A Canonical Integration Technique". IEEE Transactions on Nuclear Science NS-30 (4): 2669–2671. doi:10.1109/TNS.1983.4332919. Bibcode1983ITNS...30.2669R. https://cds.cern.ch/record/143981. 
  5. Forest, Etienne (2006). "Geometric Integration for Particle Accelerators". J. Phys. A: Math. Gen. 39 (19): 5321–5377. doi:10.1088/0305-4470/39/19/S03. Bibcode2006JPhA...39.5321F. 
  6. Candy, J.; Rozmus, W (1991). "A Symplectic Integration Algorithm for Separable Hamiltonian Functions". J. Comput. Phys. 92 (1): 230–256. doi:10.1016/0021-9991(91)90299-Z. Bibcode1991JCoPh..92..230C. 
  7. Blanes, S.; Moan, P. C. (May 2002). "Practical symplectic partitioned Runge–Kutta and Runge–Kutta–Nyström methods". Journal of Computational and Applied Mathematics 142 (2): 313–330. doi:10.1016/S0377-0427(01)00492-7. Bibcode2002JCoAM.142..313B. 
  8. Skeel, Robert D.; Zhang, Guihua; Schlick, Tamar (1997). "A Family of Symplectic Integrators: Stability, Accuracy, and Molecular Dynamics Applications". SIAM Journal on Scientific Computing 18 (1): 203–222. doi:10.1137/S1064827595282350. 
  9. Tao, Molei (2016). "Explicit symplectic approximation of nonseparable Hamiltonians: Algorithm and long time performance". Phys. Rev. E 94 (4). doi:10.1103/PhysRevE.94.043303. PMID 27841574. Bibcode2016PhRvE..94d3303T. 
  10. Qin, H.; Guan, X. (2008). "A Variational Symplectic Integrator for the Guiding Center Motion of Charged Particles for Long Time Simulations in General Magnetic Fields". Physical Review Letters 100 (3). doi:10.1103/PhysRevLett.100.035006. PMID 18232993. https://digital.library.unt.edu/ark:/67531/metadc932923/m2/1/high_res_d/960290.pdf. 
  11. Qin, H.; Liu, J.; Xiao, J. (2016). "Canonical symplectic particle-in-cell method for long-term large-scale simulations of the Vlasov–Maxwell equations". Nuclear Fusion 56 (1). doi:10.1088/0029-5515/56/1/014001. Bibcode2016NucFu..56a4001Q. 
  12. Zhang, R.; Qin, H.; Tang, Y. (2016). "Explicit symplectic algorithms based on generating functions for charged particle dynamics". Physical Review E 94 (1). doi:10.1103/PhysRevE.94.013205. PMID 27575228. Bibcode2016PhRvE..94a3205Z. 
  13. Tao, M. (2016). "Explicit high-order symplectic integrators for charged particles in general electromagnetic fields". Journal of Computational Physics 327: 245. doi:10.1016/j.jcp.2016.09.047. Bibcode2016JCoPh.327..245T. 
  14. He, Y.; Qin, H.; Sun, Y. (2015). "Hamiltonian integration methods for Vlasov-Maxwell equations". Physics of Plasmas 22: 124503. doi:10.1063/1.4938034. 
  15. Xiao, J.; Qin, H.; Liu, J. (2015). "Explicit high-order non-canonical symplectic particle-in-cell algorithms for Vlasov-Maxwell systems". Physics of Plasmas 22 (11): 112504. doi:10.1063/1.4935904. Bibcode2015PhPl...22k2504X. 
  16. Kraus, M; Kormann, K; Morrison, P.; Sonnendrucker, E (2017). "GEMPIC: geometric electromagnetic particle-in-cell methods". Journal of Plasma Physics 83 (4): 905830401. doi:10.1017/S002237781700040X. Bibcode2017JPlPh..83d9001K. 
  17. Xiao, J.; Qin, H.; Liu, J. (2018). "Structure-preserving geometric particle-in-cell methods for Vlasov-Maxwell systems". Plasma Science and Technology 20 (11): 110501. doi:10.1088/2058-6272/aac3d1. Bibcode2018PlST...20k0501X. 
  18. Glasser, A.; Qin, H. (2022). "A gauge-compatible Hamiltonian splitting algorithm for particle-in-cell simulations using finite element exterior calculus". Journal of Plasma Physics 88 (2): 835880202. doi:10.1017/S0022377822000290. Bibcode2022JPlPh..88b8302G. 
  • Leimkuhler, Ben; Reich, Sebastian (2005). Simulating Hamiltonian Dynamics. Cambridge University Press. ISBN 0-521-77290-7. 
  • Hairer, Ernst; Lubich, Christian; Wanner, Gerhard (2006). Geometric Numerical Integration: Structure-Preserving Algorithms for Ordinary Differential Equations (2 ed.). Springer. ISBN 978-3-540-30663-4. 
  • Kang, Feng; Qin, Mengzhao (2010). Symplectic geometric algorithms for Hamiltonian systems. Springer.