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]
where
,
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
, and it leads to the constraints of Hamiltonian equations as [
3,
4]
where
,
and
. 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
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
, and the Lagrangian function
satisfies
When the generalized momenta and Hamiltonian of the system are constructed, there are inherent constraints between the canonical variables in the phase space
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]
where
is the Hamiltonian of the system and
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
where
and
is an anti-symmetric matrix.
Let
, where
then Equation (5) can be rewritten as
where
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
be the corresponding canonical variables which is a transformation from
to
.
are new variables after canonicalization. By the chain rule, the canonicalization of Equation (7) can be written as [
11]
where
. If we let
i.e.,
Note that is a given matrix and is the original variable, so we can get through this transformation, which is a set of canonical new generalized momenta and generalized coordinates . 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):
that is, the canonical Hamiltonian system is
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
is called the symplectic transformation for a system if its Jacobian is a symplectic matrix
For the canonical Hamiltonian system (9), if
then it is a first-order symplectic scheme. When
, Equation (15) becomes
which is an explicit symplectic scheme. For the canonical Hamiltonian system (9), the Euler midpoint rule is
which is a second-order symplectic scheme. A Runge-Kutta method
is symplectic if and only if
. 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
where
The Hamiltonian
can be rewritten as
with
and
According to the canonialization method shown in
Section 2, we have
According to Equation (10), we get
and
Hence, we have
and thus
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
, where
and time step size
(see
Figure 1).
Using Equation (23) we can obtain
and
, and time step size
, then using the second-order explicit symplectic scheme on the basis of
, we get the trajectory of the non-canonical variable
(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
, and
and time step size
(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.