Next Article in Journal
On the Group of Absolutely Summable Sequences
Next Article in Special Issue
On Fractional Inequalities Using Generalized Proportional Hadamard Fractional Integral Operator
Previous Article in Journal
Interval-Valued Pseudo Overlap Functions and Application
Previous Article in Special Issue
Waves in a Hyperbolic Predator–Prey System
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

A Symplectic Algorithm for Constrained Hamiltonian Systems

1
College of Information and Control Engineering, Shandong Vocational University of Foreign Affairs, Weihai 264504, China
2
Department of Mathematics, Shandong University of Science and Technology, Qingdao 266590, China
3
International Institute for Symmetry Analysis and Mathematical Modelling, Department of Mathematical Sciences, North-West University, Mafikeng Campus, Mmabatho X2046, South Africa
4
Institute of Mathematical Physics, Zhejiang Sci-Tech University, Hangzhou 310018, China
5
College of Mechanical and Automotive Engineering, Zhejiang University of Water Resources and Electric Power, Hangzhou 310018, China
6
Department of Mathematics, Qingdao University, Qingdao 266071, China
*
Author to whom correspondence should be addressed.
Submission received: 18 April 2022 / Revised: 26 April 2022 / Accepted: 30 April 2022 / Published: 7 May 2022
(This article belongs to the Special Issue 10th Anniversary of Axioms: Mathematical Physics)

Abstract

:
In this paper, a symplectic algorithm is utilized to investigate constrained Hamiltonian systems. However, the symplectic method cannot be applied directly to the constrained Hamiltonian equations due to the non-canonicity. We firstly discuss the canonicalization method of the constrained Hamiltonian systems. The symplectic method is used to constrain Hamiltonian systems on the basis of the canonicalization, and then the numerical simulation of the system is carried out. An example is presented to illustrate the application of the results. By using the symplectic method of constrained Hamiltonian systems, one can solve the singular dynamic problems of nonconservative constrained mechanical systems, nonholonomic constrained mechanical systems as well as physical problems in quantum dynamics, and also available in many electromechanical coupled systems.

1. Introduction

In 1993, symplectic algorithms for constrained Hamiltonian systems have been proposed [1]. We know that the displacements q and momenta p of an object moving freely are given by a Hamilton canonical equation in the form [2]
q ˙ = p H ( p ,   q ) ,   p ˙ = q ( p , q )
where p ,   q R n , H :   R n × R n   R n is called the Hamiltonian function. A natural question is what happens when (1) is constrained by algebraic equations on q and/or p. That is, there are Hamiltonian constraints of the form g ( q ) = 0 , and it leads to the constraints of Hamiltonian equations as [3,4]
q ˙ = p H ( p ,   q ) ,   p ˙ = q H ( p , q ) λ G ( q ) t ,
where g :   R n   R n , G ( q ) = g q ( q ) R n × m and λ R m . Equation (2) is called a constrained Hamiltonian system, which is not only a relatively loose concept but also a general constrained mechanical system. The flow of a Hamiltonian system like (1) possesses an important symplectic geometric structure. It has been observed in numerical experiments that symplectic methods with fixed step-size possess better long-term stability properties. Leimkuhler and Skeel [5] investigated symplectic numerical integrators of constrained Hamiltonian systems in molecular dynamics. By composition methods, Reich [6] studied symplectic integration of the constrained Hamiltonian systems. The method they proposed can reduce Hamiltonian differential-algebraic equations to ordinary differential equations in Euclidean space.
When studying symmetry properties of classical and quantum constrained systems, Li [7,8] found that via Legendre transformation, a singular Lagrangian system can be transformed into the phase space determined by generalized momenta and generalized coordinates. Since there are inherent constraints between generalized momenta and generalized coordinates, it is named a constrained Hamiltonian system. A lot of important physical systems belong to this system, such as quantum electrodynamics, quantum flavor dynamics, and so on. Even many electromechanical coupled systems belong to constrained Hamiltonian systems. For a Lagrangian system, if the value of determinant det ( 2 L q s q k ) vanishes, then it is named as a singular Lagrange system. The Lagrangian function of supersymmetry, supergravity, and string theory are all singular. Therefore, the fundamental theory of constrained Hamiltonian systems acts an important role in modern quantum field theory [9].
In the late 1980s, Feng et al. established the so-called symplectic algorithms to study the equations in Hamiltonian form and showed that these methods are more superior over a long time by combining theoretical analysis and computer experimentation [10,11]. The symplectic method has been widely recognized as a suitable numerical integrator with global conservation properties for canonical Hamiltonian systems. It has been well applied in testing particle simulation and some physical experiments in plasma physics, and thus derived a series of results, for instance, a variational multi-symplectic particle-in-cell algorithm of the Vlasov-Maxwell system [12], the practical symplectic partitioned Runge-Kutta and Runge-Kutta-Nystrom methods [13], the symplectic integrations of Hamiltonian systems [14], symplectic integrators of the Ablowitz–Ladik discrete nonlinear Schrödinger equation [15], etc. The standard symplectic scheme normally works for a canonical structure of the dynamical system. However, the symplectic simulation for the constrained Hamiltonian systems is beset with difficulties since the constrained Hamiltonian systems are usually non-canonical.
In this paper, we will present a general procedure for constructing the canonical coordinates of constrained Hamiltonian systems. By defining a variable transformation and calculations, the canonical variables for constrained Hamiltonian systems can be derived, and thus the constrained Hamiltonian systems are canonicalized. Once the canonical coordinates of constrained Hamiltonian systems are derived, one can employ the standard canonical symplectic methods to study the constrained Hamiltonian systems. The method we proposed is of importance in the study of constrained Hamiltonian systems. We believe that the symplectic method of constrained Hamiltonian systems given in this paper can be used in the study of quantum dynamics, electromechanical coupled systems, and strange constrained dynamics as well.
To verify the effect of the canonicalization and illustrate the advantage of the canonical symplectic simulation, a numerical example of the constrained Hamiltonian system is presented. Clearly, the numerical results derived by the canonical symplectic method are more accurate in the long-term simulation since they can maintain conservation properties.

2. Canonicalization of Constrained Hamiltonian Systems

Assume that a mechanical system is determined by the generalized coordinates q i ( i = 1 , 2 , , n ) , and the Lagrangian function L = L ( t , q i , q ˙ i ) satisfies det ( 2 L q s q k ) = 0 When the generalized momenta and Hamiltonian of the system are constructed, there are inherent constraints between the canonical variables in the phase space
ϕ j ( t , q i , p i ) = 0 ( j = 1 , 2 , , n r , i = j = 1 , 2 , , n )
this is the constraint equation that should be obtained between the generalized coordinates and the generalized momenta of the constrained Hamiltonian system.
Then the motion equations of a singular system can be written as [11]
q ˙ i = H c p i + λ j φ j p i , p ˙ i = H c q i λ j φ j q i ( i = 1 , 2 , , n )
where H c is the Hamiltonian of the system and λ j is the Lagrange multiplier. The multiplier in Formula (4) can be given by Equations (3) and (4).
The motion Equation (4) of the constrained Hamiltonian system can be rewritten as
( p ˙ 1 p ˙ i q ˙ 1 q ˙ n ) = ( 0 n S n T n 0 n ) ( H c p 1 H c p i H c q 1 H c q i ) = M 2 n × 2 n ( H c p 1 H c p i H c q 1 H c q i ) ,
where
S n = ( 1 λ j φ j H c 0 0 1 λ j φ j H c ) n × n , T n = ( 1 + λ j φ j H c 0 0 1 + λ j φ j H c ) n × n
and M 2 n × 2 n is an anti-symmetric matrix.
Let v = ( p , q ) T , where p = ( p 1 , p 2 , , p n ) , q = ( q 1 , q 2 , , q n ) , then Equation (5) can be rewritten as
v ˙ = K ( v ) 1 H c ( v ) ,
where
K ( v ) = ( 0 n T n 1 S n 1 0 n ) .
It is easy to see that Equations (5) and (7) are non-canonical Hamiltonian systems.
To rewrite the non-canonical Hamiltonian system in canonical form, we let Z = Ψ ( v ) be the corresponding canonical variables which is a transformation from R 2 n to R 2 n . Z = ( p ˜ , q ˜ ) T are new variables after canonicalization. By the chain rule, the canonicalization of Equation (7) can be written as [11]
Z ˙ = ( Ψ v ) K ( v ) 1 ( Ψ v ) T H ˜ ( Z ) ,
where H ˜ ( Z ) = H c ( v ) . If we let ( Ψ v ) K ( v ) 1 ( Ψ v ) T = J 1 , i.e.,
K ( v ) = ( Ψ v ) T J ( Ψ v )
Note that K ( v ) is a given matrix and v = ( p , q ) T is the original variable, so we can get Ψ ( v ) through this transformation, which is a set of canonical new generalized momenta p ˜ = ( p ˜ 1 , p ˜ 2 , , p ˜ n ) and generalized coordinates q ˜ = ( q ˜ 1 , q ˜ 2 , , q ˜ n ) . Now, we have transformed the non-canonical Hamiltonian system into a canonical Hamiltonian system.
By substituting the new variables into the original Hamiltonian of the constrained system, it becomes canonical. Based on the canonical Hamiltonian equations, one can examine their properties and hence some useful algorithms can be applied to examine the numerical solutions and numerical simulation of the constrained Hamilton systems. The results of the original system can be obtained by replacing the new variables with the old ones.

3. Symplectic Method for Constrained Hamiltonian Systems

The constrained Hamiltonian systems are transformed in the canonical form (9):
d Z d t = J 1 ˜ H ( Z ) ,
that is, the canonical Hamiltonian system is
d Z d t = J 1 ˜ H ( Z ) , J = ( 0 I n I n 0 ) , Z R 2 n
We now show that the properties, conclusions, and calculation methods of canonical Hamiltonian systems can be extended to constrained Hamiltonian systems. We give the symplectic method for constrained Hamiltonian systems as follows.
A transformation of the constrained Hamiltonian system
Ψ : R 2 n R 2 n , v = ( p q ) Z ˜ = ( p ˜ q ˜ )
is called the symplectic transformation for a system if its Jacobian is a symplectic matrix
( d Z ˜ d Z ) T J ( d Z ˜ d Z ) = J k = 1 n d p ˜ k d q ˜ k = k = 1 n d p k d q k .
For the canonical Hamiltonian system (9), if
p ˜ = p τ H q ( p ˜ , q ) , q ˜ = q + τ H p ( p ˜ , q ) ,
then it is a first-order symplectic scheme. When H ( p , q ) = U ( p ) + V ( q ) , Equation (15) becomes
p ˜ = p τ V q ( q ) , q ˜ = q + τ U p ( p ˜ ) ,
which is an explicit symplectic scheme. For the canonical Hamiltonian system (9), the Euler midpoint rule is
Z ˜ = Z + τ J 1 H ( Z ˜ + Z 2 ) ,
which is a second-order symplectic scheme. A Runge-Kutta method
Z ˜ = Z + τ i = 1 m b i J 1 H ( K i ) , K i = Z + τ i = 1 m a i j J 1 H ( K j ) , i = 1 , , m ,
is symplectic if and only if b i b j b i a i j b j a i j = 0 . In Equations (15)–(18), τ represents the time step size.

4. Example

The Lotka-Volterra model can be expressed as a non-canonical Hamiltonian system with n = 1
( p ˙ q ˙ ) = ( 0 p q p q 0 ) H ( p , q ) ,
where H ( p , q ) = p 2 log p + q log q .
The Hamiltonian H can be rewritten as H = H 1 + H 2 with H 1 = p 2 log p and H 2 = q log q . According to the canonialization method shown in Section 2, we have
K = ( 0 1 p q 1 p q 0 ) .
According to Equation (10), we get
p ˜ p q ˜ p p ˜ p q ˜ p = 0 , p ˜ p q ˜ q q ˜ p p ˜ q = 1 p q
and
p ˜ = log ( p ) , q ˜ = log ( q ) .
Hence, we have
p = exp ( p ˜ ) , q = exp ( q ˜ )
and thus
H ˜ ( p ˜ , q ˜ ) = exp ( p ˜ ) 2 p ˜ + exp ( q ˜ ) q ˜ ,
which is a canonical Hamiltonian system. Using the second-order explicit symplectic scheme on the basis of the canonicalization, we get the trajectory of the canonical variable p ˜ , q ˜ , where p ˜ ( 0 ) = ln 2 ,   q ˜ ( 0 ) = ln 3 ,   and time step size τ = 0.1 (see Figure 1).
Using Equation (23) we can obtain p , q , and p ( 0 ) = 2 ,   q ( 0 ) = 3 , and time step size τ = 0.1 , then using the second-order explicit symplectic scheme on the basis of p , q , we get the trajectory of the non-canonical variable p , q (see Figure 2).
In addition, the implicit Runge-Kutta method of order 3 is applied directly to the non-canonical Hamiltonian system directly, and then we get the trajectory of the original variables p , q , and p ( 0 ) = 2 ,   q ( 0 ) = 3 and time step size τ = 0.1 (see Figure 3).
As can be seen from Figure 1 and Figure 2, the trajectory diagrams of regularized variables and initial variables are kept unchanged by a symplectic algorithm. After 1,000,000 steps, the graph remains basically unchanged, which indicates that the symplectic algorithm of constrained Hamiltonian systems has the property of preserving structure. Namely, the physical properties of constrained Hamiltonian systems can be maintained by a symplectic method. One can see from Figure 3 that the graph using the third-order Runge Kutta method (or general numerical calculation method) is very unstable. This method does not have the property of preserving the structure, that is, it cannot maintain the physical properties of the constrained Hamiltonian systems. It is shown clearly from the three figures that the symplectic algorithm has better structure-preserving properties. It is of great significance to study the constrained Hamiltonian systems using the symplectic algorithm.

5. Conclusions

In this paper, we discuss the canonicalization method of the constrained Hamiltonian systems, then the symplectic method is applied to the constrained Hamiltonian systems on the basis of the canonicalization. Compared with the traditional Runge-Kutta method, they have better structural preservation properties. Consequently, the symplectic methods can be applied to more noncanonical Hamiltonian systems, which will be further investigated in our next work.

Author Contributions

Conceptualization, methodology, validation, and supervision, J.F. and L.Z.; formal analysis and investigation, C.X.; writing—original draft preparation, S.C.; writing—review and editing, L.Z.; W.Z. symplectic algorithm numerical simulation. All authors have read and agreed to the published version of the manuscript.

Funding

This research was funded by the National Nature Science Foundation of China, 11872335, 12172199, 11672270.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

Not applicable.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Reich, S. Symplectic Integration of Constrained Hamiltonian Systems by Runge-Kutta Methods; Technical Report 93-13; Department of Computer Science, University of British Columbia: Vancouver, BC, Canada, 1993. [Google Scholar]
  2. Hildebrand, F.B. Methods of Applied Mathematics, 2nd ed.; Prentice-Hall: Englewood Cliffs, NJ, USA, 1965. [Google Scholar]
  3. Dirac, P.A.M. Lecture on Quantum Mechanics; Yeshiva University Press: New York, NY, USA, 1964. [Google Scholar]
  4. Arnold, V.I. Mathematical Methods of Classical Mechanics, Graduate Texts in Mathematics, No. 60; Springer: New York, NY, USA, 1975. [Google Scholar]
  5. Leimkuhler, B.J.; Skeel, R.D. Symplectic numerical integrators in constrained Hamiltonian systems. J. Comput. Phys. 1994, 112, 117–125. [Google Scholar] [CrossRef] [Green Version]
  6. Reich, S. Symplectic Integration of Constrained Hamiltonian Systems by Composition Methods. SIAM J. Numer. Anal. 1996, 33, 475–491. [Google Scholar] [CrossRef] [Green Version]
  7. Li, Z.P. Classical and Quantal Dynamics of Constrained System and Their Symmetrical Properties; Beijing Polytechnic Univ. Press: Beijing, China, 1993. [Google Scholar]
  8. Li, Z.P.; Jiang, J.H. Symmetries in Constrained Canonical System; Beijing Science Press: Beijing, China, 2002. [Google Scholar]
  9. Holod, I.; Lin, Z. Verification of electromagnetic fluid-kinetic hybrid electron model in global Gyrokinetic particle simulation. Phys. Plasmas 2013, 20, 032309. [Google Scholar] [CrossRef] [Green Version]
  10. Feng, K.; Qin, M. Symplectic Geometric Algorithms for Hamiltonian Systems; Zhejiang Science and Technology Publishing House: Hangzhou, China, 2010. [Google Scholar]
  11. Feng, K.; Qin, M. Symplectic difference schemes for Hamiltonian systems. J. Comp. Math. 1991, 1, 86–96. [Google Scholar]
  12. Xiao, J.; Liu, J.; Qin, H. A variational multi-symplectic particle-in-cell algorithm with smoothing functions for the Vlasov-Maxwell system. Phys. Plasmas 2013, 20, 102517. [Google Scholar] [CrossRef]
  13. Blanes, S.; Moan, P.C. Practical symplectic partitioned Runge-Kutta and Runge-Kutta-Nystrom methods. J. Comp. Appl. Math. 2000, 142, 313–330. [Google Scholar] [CrossRef] [Green Version]
  14. Channell, P.J.; Scovel, C. Symplectic integration of Hamiltonian systems. Nonlinearity 1990, 3, 231–259. [Google Scholar] [CrossRef]
  15. Schober, C.M. Symplectic integrators for the Ablowitz–Ladik discrete nonlinear Schrödinger equation. Phys. Lett. A 1999, 259, 140–151. [Google Scholar] [CrossRef]
Figure 1. Trajectory of the canonical variable p ˜ , q ˜ .
Figure 1. Trajectory of the canonical variable p ˜ , q ˜ .
Axioms 11 00217 g001
Figure 2. Trajectory of the non-canonical variable p , q .
Figure 2. Trajectory of the non-canonical variable p , q .
Axioms 11 00217 g002
Figure 3. Trajectory of the non-canonical variable.
Figure 3. Trajectory of the non-canonical variable.
Axioms 11 00217 g003
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Fu, J.; Zhang, L.; Cao, S.; Xiang, C.; Zao, W. A Symplectic Algorithm for Constrained Hamiltonian Systems. Axioms 2022, 11, 217. https://0-doi-org.brum.beds.ac.uk/10.3390/axioms11050217

AMA Style

Fu J, Zhang L, Cao S, Xiang C, Zao W. A Symplectic Algorithm for Constrained Hamiltonian Systems. Axioms. 2022; 11(5):217. https://0-doi-org.brum.beds.ac.uk/10.3390/axioms11050217

Chicago/Turabian Style

Fu, Jingli, Lijun Zhang, Shan Cao, Chun Xiang, and Weijia Zao. 2022. "A Symplectic Algorithm for Constrained Hamiltonian Systems" Axioms 11, no. 5: 217. https://0-doi-org.brum.beds.ac.uk/10.3390/axioms11050217

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop