Next Article in Journal
Security Concepts in Emerging 6G Communication: Threats, Countermeasures, Authentication Techniques and Research Directions
Previous Article in Journal
Cubic Chemical Autocatalysis and Oblique Magneto Dipole Effectiveness on Cross Nanofluid Flow via a Symmetric Stretchable Wedge
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Explicit K-Symplectic and Symplectic-like Methods for Charged Particle System in General Magnetic Field

School of Mathematics and Physics, University of Science and Technology Beijing, Beijing 100083, China
*
Author to whom correspondence should be addressed.
Symmetry 2023, 15(6), 1146; https://doi.org/10.3390/sym15061146
Submission received: 24 April 2023 / Revised: 11 May 2023 / Accepted: 22 May 2023 / Published: 25 May 2023

Abstract

:
We propose explicit K-symplectic and explicit symplectic-like methods for the charged particle system in a general strong magnetic field. The K-symplectic methods are also symmetric. The charged particle system can be expressed both in a canonical and a non-canonical Hamiltonian system. If the three components of the magnetic field can be integrated in closed forms, we construct explicit K-symplectic methods for the non-canonical charged particle system; otherwise, explicit symplectic-like methods can be constructed for the canonical charged particle system. The symplectic-like methods are constructed by extending the original phase space and obtaining the augmented separable Hamiltonian, and then by using the splitting method and the midpoint permutation. The numerical experiments have shown that compared with the higher order implicit Runge-Kutta method, the explicit K-symplectic and explicit symplectic-like methods have obvious advantages in long-term energy conservation and higher computational efficiency. It is also shown that the influence of the parameter ε in the general strong magnetic field on the Runge-Kutta method is bigger than the two kinds of symplectic methods.

1. Introduction

The dynamics of charged particles [1,2,3,4] in the electric and the general magnetic field is one of the most fundamental theoretical models in magnetic confinement fusion research. Under the position and velocity variables, the charged particle system can be expressed in the form of a non-canonical Hamiltoninan system, which is
Z ˙ = K 1 ( Z ) H ( Z )
where H is the Hamiltonian function and K 1 ( Z ) is the antisymmetric matrix, depending on variable Z . The non-canonical Hamiltonian system possesses a general symplectic structure. It is also a conservative system that has several conserved quantities, including the energy of the system. Therefore, when constructing numerical methods for the charged particle system, the methods should preserve the intrinsic structure or the conserved quantities [5]. This kind of numerical method is called a structure-preserving algorithm.
A structure-preserving algorithm includes the symplectic methods [6,7,8,9], the energy-preserving methods [10,11] and the volume-preserving methods [12,13]. The property that is preserved by the symplectic methods is the intrinsic symplectic structure, which can be expressed as a 2-form of the Hamiltonian system [5,14,15,16,17]; thus, they are preferable for simulating the Hamiltonian system. The canonical Hamiltonian system has the expression of
y ˙ = J 1 H ( y ) , J = ( O n I n I n O n ) .
and it possesses a symplectic structure that can be exactly preserved by the symplectic methods, while the non-canonical Hamiltonian system possesses a K-symplectic structure that can be exactly preserved by the K-symplectic methods. As the charged particle system can be represented as a non-canonical Hamiltonian system, it can be rewritten as a canonical Hamiltonian system by using a suitable coordinate transformation. The existence of the coordinate transformation is guaranteed by Darboux’s theorem [15,18]. Non-canonical Hamiltonian systems are generalized Hamiltonian systems. The well-known Schrödinger equation [19,20] can also be expressed as a non-canonical Hamiltonian system. Developing stable and efficient numerical methods for both the Hamiltonian systems and the non-canonical Hamiltonian systems is of importance. Thus, we prefer developing explicit symplectic and explicit K-symplectic methods that have long-term stability and high efficiency.
Symplectic methods exhibit superior long-term structure-preserving behaviors and long-term stability compared with conventional methods such as Runge-Kutta methods. The slower error growth and the approximate preservation of conserved quantities without secular drift are their long-term behaviors. Symplectic methods consist of the explicit symplectic methods and the implicit ones. If the Hamiltonian function of the Hamiltonian system can be separated into several subsystems, and if the analytical solution of these subsystems can be obtained, then explicit symplectic methods can be proposed by composing the analytical solutions of these subsystems. Explicit K-symplectic methods can also be proposed by using such splitting and composing approaches. The explicit methods exhibit better efficiency than the implicit methods.
Explicit symplectic methods can be constructed for separable canonical Hamiltonian systems by using the splitting methods [15,21]. This splitting technique also applies to separable non-canonical Hamiltonian systems to construct explicit K-symplectic methods [22,23,24]. Splitting methods are applied for the case when the Hamiltonian is separable. The Hamiltonian H and the Hamiltonian system (2) are called separable if H can be written as H ( q , p ) = U ( p ) + V ( q ) with some functions U and V, and nonseparable otherwise. This separability also applies to the non-canonical Hamiltonian system. If the Hamiltonian is not separable, Pihajoki proposed to extend the phase space to make the Hamiltonian separable for the canonical Hamiltonian systems, i.e., the Hamiltonian H ( q , p ) turns to H ˜ ( q , q ˜ , p , p ˜ ) = H A ( q , p ˜ ) + H B ( q ˜ , p ) . Then, symplectic-like methods were constructed with the coordinate-mixing permutation [25]. These methods are not symplectic, but they show the same long-term behavior in energy conservations as symplectic methods. Instead of adding the coordinate-mixing permutation, Tao provided another way to constrain the extended phase space. In addition to the two Pihajoki sub-Hamiltonians H A and H B , Tao also added a third sub-Hamiltonian H C , which is the norm of the difference of the two copies of the phase space with a control parameter ω , i.e., H c = q q ˜ 2 2 / 2 + p p ˜ 2 2 / 2 [26]. These methods are symplectic in the extended phase space, but as is shown, they are inferior to the symplectic-like methods with the midpoint permutation [27]. To construct symplectic methods for general nonseparable canonical Hamiltonian systems, Ohsawa and Jayawardana combined the symmetric projection method with the extended phase space approach proposed by Pihajoki [28,29]. Their methods have better performance than Tao’s methods [28].
In this paper, we construct the explicit K-symplectic and explicit symplectic-like methods for the charged particle dynamics in a general strong magnetic field. We have identified that if the three components of the magnetic field can all be integrated explicitly, then we can develop explicit K-symplectic methods. If the above condition does not hold, we can develop explicit sympletic-like methods. The numerical experiments have shown that the explicit K-symplectic and explicit symplectic-like methods have significant advantage in long-term energy conservation over the higher-order Runge-Kutta methods. The K-symplectic and symplectic-like methods also exhibit better efficiency than the higher-order Runge-Kutta methods. We also point out the influence of the parameter ε appearing in the general strong magnetic field in the numerical methods. The effects of the parameter ε on the Runge-Kutta methods are larger than the symplectic methods, which shows that the two kinds of symplectic methods are more stable than the Runge-Kutta methods.
We organize the rest of the paper as follows. Section 2 gives a brief introduction to the two kinds of expression of the charged particle system. Section 3 indicates how to utilize the splitting method to develop the explicit K-symplectic methods and symplectic-like methods. We identify that if every component of the magnetic field can be integrated explicitly, then we can develop explicit K-symplectic methods; otherwise, we can develop symplectic-like methods by extending the phase space and by using the midpoint permutation. In Section 4, numerical methods that are used to make comparison are presented. In Section 5, the numerical results of the charged particle system are provided. In Section 6, we summarize our work.

2. Charged Particle System

The motion of the charged particle in an electric field E ( X ) and a general strong magnetic field 1 ε B ( X ) is governed by the Lorentz force law. The parameter ε is used for adjusting the strength of the magnetic field. It is usually small such that the strength of the magnetic field is strong. Denote the position variable of the charged particle by X and denote its velocity by V ; the charged particle system is of the form
d X d t = V , m d V d t = q ( E ( X ) + 1 ε V × B ( X ) )
where m is the mass and q is the charge. Denote Z = ( X , V ) = ( x 1 , x 2 , x 3 , v 1 , v 2 , v 3 ) , the charged particle system can be expressed as a non-canonical Hamiltonian system [9,15]
Z ˙ = K 1 ( Z ) H ( Z )
where
K 1 ( Z ) = ( O I m I m q B ^ ( X ) m 2 )
with the Hamiltonian being H ( X , V ) = m v 1 2 / 2 + m v 2 2 / 2 + m v 3 2 / 2 + q φ ( X ) . Here, I is the 3 × 3 identity matrix. The scalar potential is φ ( X ) and the electric field is E ( X ) = φ . The general magnetic field is 1 ε B ( X ) = 1 ε ( B 1 ( X ) , B 2 ( X ) , B 3 ( X ) ) and the matrix B ^ ( X ) is
B ^ ( X ) = ( 0 B 3 ( X ) B 2 ( X ) B 3 ( X ) 0 B 1 ( X ) B 2 ( X ) B 1 ( X ) 0 ) .
The magnetic field satisfies · B ( X ) = 0 . Then, there exists a vector potential A ( X ) that satisfies B ( X ) = × A ( X ) .
According to Darboux’s theorem, under a suitable coordinate transformation, the non-canonical Hamiltonian system (3) can be transformed to a canonical Hamiltonian system [7,8,15]
y ˙ = J 1 H ( y ) , J = ( O 3 I 3 I 3 O 3 ) .
where O 3 is the 3 × 3 zero matrix and I 3 is the 3 × 3 identity matrix. The common coordinate transformation is
X = X , V = p A ( X ) ,
then, under the variable y = ( P , X ) , the charged particle system can be rewritten as a canonical Hamiltonian system
P ˙ = X H ˜ ( P , X ) , X ˙ = P H ˜ ( P , X )
with the Hamiltonian H ˜ ( P , X ) being
H ˜ = 1 2 m ( P q A ( X ) ) ( P q A ( X ) ) + q φ ( X )
where X is still the position variable, and P = m X ˙ + q A ( X ) is the conjugate momentum.

3. K-Symplectic and Symplectic-like Methods Based on Splitting Methods

As the charged particle system can be expressed in both canonical form and non-canonical form, we can develop both the symplectic and K-symplectic methods. Here, we develop the K-symplectic methods for its non-canonical form and the symplectic methods for its canonical form.

3.1. K-Symplectic Methods for the Charged Particle System

For the non-canonical Hamiltonian system (3), it owns a K-symplectic structure, which can be expressed as a 2-form:
W = i < j k i j ( Z ) d z i d z j
where k i j , 1 i , j 6 are the elements of the matrix K 1 , and z i is the i-th component of the variable Z . This general symplectic structure is exactly preserved by K-symplectic methods.
Definition 1.
A numerical method φ h is a one-step method. Given a variable v R n and a time stepsize h, assume that the value of v at the initial time step is v 0 ; by using the method φ h , we can get the value of v at the next time step, i.e., φ h ( v 0 ) R n . The method φ h is called K-symplectic if its Jacobian satisfies
φ h ( v 0 ) v 0 T K ( φ h ( v 0 ) ) φ h ( v 0 ) v 0 = K ( v 0 ) .
The Jacobian means the matrix composed by the partial derivatives of every component ( φ h ( v 0 ) ) i , 1 i n of φ h ( v 0 ) with respect to every component ( v 0 ) j , 1 j n of v 0 .
There is no common approach to construct K-symplectic methods for all non-canonical Hamiltonian systems (3). However, in some special cases where the Hamiltonian H is separable or it can be separated into several parts, the K-symplectic methods can be constructed by using the splitting and composing technique.
For the charged particle system, its Hamiltonian can be separated into four parts with the sub-Hamiltonians H 1 = m v 1 2 / 2 , H 2 = m v 2 2 / 2 , H 3 = m v 3 2 / 2 and H 4 = q φ ( X ) . For the first subsystem with H 1 = m v 1 2 / 2 , its exact solution is
x 1 ( t ) = x 10 + t m v 10 , x 2 ( t ) = x 20 , x 3 ( t ) = x 30 , v 1 ( t ) = v 10 , v 2 ( t ) = v 10 0 t B 3 ( x 10 + s m v 10 , x 20 , x 30 ) d s , v 3 ( t ) = v 10 0 t B 2 ( x 10 + s m v 10 , x 20 , x 30 ) d s .
The exact solution to the fourth subsystem with H 4 = q φ ( X ) is
x 1 ( t ) = x 10 , x 2 ( t ) = x 20 , x 3 ( t ) = x 30 , v 1 ( t ) = v 10 t q φ ( X ) x 1 | X 0 , v 2 ( t ) = v 20 t q φ ( X ) x 2 | X 0 , v 3 ( t ) = v 30 t q φ ( X ) x 3 | X 0 .
where X 0 = ( x 10 , x 20 , x 30 ) and V 0 = ( v 10 , v 20 , v 30 ) are the initial values of X and V . The exact solutions of the second and the third subsystems can also be written in integral forms.
We assume that the components of the magnetic filed B i ( X ) , i = 1 , 2 , 3 can be explicitly integrated, i.e., there exist primitive functions F i ( x 1 , x 2 , x 3 , t ) , i = 1 , 2 , , 6 such that
F 1 ( x 1 , x 2 , x 3 , t ) = 0 t B 1 ( x 1 , x 2 + s , x 3 ) d s , F 2 ( x 1 , x 2 , x 3 , t ) = 0 t B 1 ( x 1 , x 2 , x 3 + s ) d s ,
F 3 ( x 1 , x 2 , x 3 , t ) = 0 t B 2 ( x 1 + s , x 2 , x 3 ) d s , F 4 ( x 1 , x 2 , x 3 , t ) = 0 t B 2 ( x 1 , x 2 , x 3 + s ) d s ,
F 5 ( x 1 , x 2 , x 3 , t ) = 0 t B 3 ( x 1 + s , x 2 , x 3 ) d s , F 6 ( x 1 , x 2 , x 3 , t ) = 0 t B 3 ( x 1 , x 2 + s , x 3 ) d s .
If every components of the magnetic field B i ( X ) , i = 1 , 2 , 3 can be explicitly integrated, then the exact solutions of the four subsystems can be written in explicit forms; thus, we can develop explicit K-symplectic methods. Denote the exact solutions of the four subsystems with sub-Hamiltonians H i by φ t i , i = 1 , 2 , 3 , 4 , then we know that the composition method
ψ h φ h 4 φ h 3 φ h 2 φ h 1
is an explicit K-symplectic method of order 1. Another composition method,
ψ h 2 ψ h / 2 * ψ h / 2 = φ h / 2 1 φ h / 2 2 φ h / 2 3 φ h 4 φ h / 2 3 φ h / 2 2 φ h / 2 1
is an explicit K-symplectic method of order 2 [30]. The method ψ h * represents the adjoint method of ψ h , and ψ h * can be expressed as
ψ h * φ h 1 φ h 2 φ h 3 φ h 4 .
The K-symplectic methods of higher order can be developed by composing the lower-order K-symplectic method. As such, given a 2 n -th order K-symplectic method χ h 2 n , the 2 n + 2 -th order K-symplectic method χ h 2 n + 2 can be obtained in the following way:
χ h 2 n + 2 χ α n h 2 n χ β n h 2 n χ α n h 2 n
where α n = ( 2 2 1 / ( 2 n + 1 ) ) 1 and β n = 1 2 α n < 0 .
If every component of the magnetic field B ( X ) can be explicitly integrated, then we use the above splitting and composing technique to develop explicit K-symplectic methods for the charged particle system in the general strong magnetic field.

3.2. Symplectic-like Methods for the Charged Particle System

For the canonical Hamiltonian system (6), it owns a symplectic structure that is defined by the following 2-form:
ω = i = 1 3 d y i d y n + i
where y i is the i-th component of the variable y . This sympletic structure is exactly preserved by symplectic methods.
Definition 2.
A numerical method Φ h is a one-step method. Given the variable Z R n and a time stepsize h, assume that the value of Z at the initial time step is Z 0 ; by using the method Φ h , we can get the value of Z at the next time step, i.e., Φ h ( Z 0 ) R n . The method Φ h is called symplectic if its Jacobian satisfies
Φ h ( Z 0 ) Z 0 J Φ h ( Z 0 ) Z 0 = J .
The Jacobian means the matrix composed by the partial derivatives of every component ( Φ h ( Z 0 ) ) i , 1 i n of Φ h ( Z 0 ) with respect to every component ( Z 0 ) j , 1 j n of Z 0 .
There are many kinds of symplectic methods, such as symplectic Runge-Kutta methods and symplectic generating function methods. Another approach to constructing symplectic methods is the splitting method. The idea is the same as that in the above subsection.
If one of the component of the magnetic field B ( X ) can not be explicitly integrated, we can construct symplectic-like methods based on the splitting and composing technique. The charged particle system in the canonical form has the Hamiltonian
H ˜ = 1 2 m ( P q A ( X ) ) ( P q A ( X ) ) + q φ ( X )
which is not separable. To make the Hamiltonian H ˜ separable, we aim at extending the phase space ( P , X ) to two copies. Therefore, the extended phase space is ( P 1 , X 1 , P 2 , X 2 ) ; thus, we can construct an augmented Hamiltonian
H ¯ : = H ˜ ( P 1 , X 2 ) + H ˜ ( P 2 , X 1 ) .
By extending the original phase space ( P , X ) to the extended phase space ( P 1 , X 1 , P 2 , X 2 ) , and considering the augmented Hamiltonian H ¯ , we can find that the augmented Hamiltonian is separable. Thus, we can use the splitting and composing technique to construct explicit symplectic methods for the extended Hamiltonian system (13). In the extended phase space, the symplectic 2-form becomes d P 1 d X 1 + d P 2 d X 2 . Then, the extended system is
P ˙ 1 = X 1 H ¯ , X ˙ 1 = P 1 H ¯ , P ˙ 2 = X 2 H ¯ , X ˙ 2 = P 2 H ¯ .
This augmented system has the same exact solution as the original system (6) if it has the initial condition P 10 = P 0 , X 10 = X 0 , P 20 = P 0 , X 20 = X 0 , where P 0 and X 0 are the initial condtions of the original system (6) [26,28].
The augmented Hamiltonian H ¯ can be separated into two subsystems with subHamiltonians H A = H ˜ ( P 1 , X 2 ) and H B = H ˜ ( P 2 , X 1 ) . Denote the exact solution of the two subsystems by φ h H A and φ h H B . The explicit forms of the two exact solutions are
φ h H A : P 1 ( h ) = P 10 , X 1 ( h ) = X 10 + h P 1 H A , P 2 ( h ) = P 20 h X 2 H A , X 2 ( h ) = X 20 .
and
φ h H B : P 1 ( h ) = P 10 h X 1 H B , X 1 ( h ) = X 10 , P 2 ( h ) = P 20 , X 2 ( h ) = X 20 + h P 2 H B .
As the variables in the extended system are mixed, the augmented system is not the two duplicates of the original system. If there is no constraint on the two duplicates of the phase space, the numerical solution of the extended system may not converge to that of the original one; thus, the difference between the two solutions is large. To constrain the two copies of the phase space ( P 1 , X 1 , P 2 , X 2 ) , we set the permutation on them. Here, we prefer to use the midpoint permutation as
κ : P 1 ( t ) + P 2 ( t ) 2 P 1 ( t ) , P 1 ( t ) + P 2 ( t ) 2 P 2 ( t ) , X 1 ( t ) + X 2 ( t ) 2 X 1 ( t ) , X 1 ( t ) + X 2 ( t ) 2 X 2 ( t ) .
Thus, we can obtain a first-order explicit symplectic-like method as
χ h κ φ h H A φ h H B
and a second-order explicit symplectic-like method as
χ h 2 κ φ h / 2 H B φ h H A φ h / 2 H B
Higher-order symplectic-like methods can be obtained by composing the lower order methods.

4. Numerical Methods

The explicit K-symplectic methods and symplectic-like methods are compared with conventional Runge-Kutta methods to demonstrate their advantage in structure preservation and computational efficiency. Here, we list all the numerical methods we used.
2ndKSYM: the second-order explicit K-symplectic method ψ h 2 for the non-canonical charged particle system with the expression
ψ h 2 φ h / 2 1 φ h / 2 2 φ h / 2 3 φ h 4 φ h / 2 3 φ h / 2 2 φ h / 2 1 .
We formulate the methods φ h / 2 1 , φ h / 2 2 , φ h / 2 3 and φ h 4 with discrete time stepsize h, which can be calculated as follows:
φ h / 2 1 : x 11 = x 10 + h 2 m v 10 , x 21 = x 20 , x 31 = x 30 , v 11 = v 10 , v 21 = v 10 0 h 2 B 3 ( x 10 + s m v 10 , x 20 , x 30 ) d s , v 31 = v 10 0 h 2 B 2 ( x 10 + s m v 10 , x 20 , x 30 ) d s .
φ h / 2 2 : x 12 = x 11 , x 22 = x 21 + h 2 m v 21 , x 32 = x 31 , v 12 = v 21 0 h 2 B 3 ( x 11 , x 21 + s m v 21 , x 31 ) d s , v 22 = v 21 , v 32 = v 21 0 h 2 B 1 ( x 11 , x 21 + s m v 21 , x 31 ) d s .
φ h / 2 3 : x 13 = x 12 , x 23 = x 22 , x 33 = x 32 + h 2 m v 32 , v 13 = v 32 0 h 2 B 2 ( x 12 , x 22 , x 32 + s m v 32 ) d s , v 23 = v 32 0 h 2 B 1 ( x 12 , x 22 , x 32 + s m v 32 ) d s , v 33 = v 32 .
φ h 4 : x 14 = x 13 , x 24 = x 23 , x 34 = x 33 , v 14 = v 13 h q φ x 1 ( x 13 , x 23 , x 33 ) , v 24 = v 23 h q φ x 2 ( x 13 , x 23 , x 33 ) , v 34 = v 33 h q φ x 3 ( x 13 , x 23 , x 33 ) .
Therefore, we know that
( x 11 , x 21 , x 31 , v 11 , v 21 , v 31 ) = φ h / 2 1 ( x 10 , x 20 , x 30 , v 10 , v 20 , v 30 )
where x 10 , x 20 , x 30 , v 10 , v 20 , v 30 are the initial values of x 1 , x 2 , x 3 , v 1 , v 2 , v 3 , and x 11 , x 21 , x 31 , v 11 , v 21 , v 31 are the values of the variables at time step h / 2 . The notions are similar for others. Then, we have
( x 12 , x 22 , x 32 , v 12 , v 22 , v 32 ) = φ h / 2 2 ( x 11 , x 21 , x 31 , v 11 , v 21 , v 31 ) ,
( x 13 , x 23 , x 33 , v 13 , v 23 , v 33 ) = φ h / 2 3 ( x 12 , x 22 , x 32 , v 12 , v 22 , v 32 ) ,
( x 14 , x 24 , x 34 , v 14 , v 24 , v 34 ) = φ h 4 ( x 13 , x 23 , x 33 , v 13 , v 23 , v 33 ) ,
( x 15 , x 25 , x 35 , v 15 , v 25 , v 35 ) = φ h / 2 3 ( x 14 , x 24 , x 34 , v 14 , v 24 , v 34 ) ,
( x 16 , x 26 , x 36 , v 16 , v 26 , v 36 ) = φ h / 2 2 ( x 15 , x 25 , x 35 , v 15 , v 25 , v 35 )
and
( x 17 , x 27 , x 37 , v 17 , v 27 , v 37 ) = φ h / 2 1 ( x 16 , x 26 , x 36 , v 16 , v 26 , v 36 ) .
Thus, we know that ψ h 2 ( x 10 , x 20 , x 30 , v 10 , v 20 , v 30 ) = ( x 17 , x 27 , x 37 , v 17 , v 27 , v 37 ) .
4thKSYM: the fourth-order explicit K-symplectic method for the non-canonical charged particle system. The fourth-order method is constructed by composing the first-order K-symplectic method ψ h . We formulate the method ψ h with discrete time stepsize h. Then, we know that
( x 11 , x 21 , x 31 , v 11 , v 21 , v 31 ) = φ h 1 ( x 10 , x 20 , x 30 , v 10 , v 20 , v 30 )
where x 10 , x 20 , x 30 , v 10 , v 20 , v 30 are the initial values of x 1 , x 2 , x 3 , v 1 , v 2 , v 3 . Then
( x 12 , x 22 , x 32 , v 12 , v 22 , v 32 ) = φ h 2 ( x 11 , x 21 , x 31 , v 11 , v 21 , v 31 ) ,
( x 13 , x 23 , x 33 , v 13 , v 23 , v 33 ) = φ h 3 ( x 12 , x 22 , x 32 , v 12 , v 22 , v 32 )
and
( x 14 , x 24 , x 34 , v 14 , v 24 , v 34 ) = φ h 4 ( x 13 , x 23 , x 33 , v 13 , v 23 , v 33 ) .
Therefore, we know that ψ h ( x 10 , x 20 , x 30 , v 10 , v 20 , v 30 ) = ( x 14 , x 24 , x 34 , v 14 , v 24 , v 34 ) . The composing way is as follows:
ψ h 4 ψ α 6 h ψ β 6 h * ψ β 2 h * ψ α 1 h ψ β 1 h * ,
where ψ h * is the adjoint method of the method ψ h . Values of the parameters α 1 , β 1 , , α 6 , β 6 are given as follows [31].
β 1 = α 6 = 0.082984406417405 , α 1 = β 6 = 0.16231455076687 , β 2 = α 5 = 0.23399525073150 , α 2 = β 5 = 0.37087741497958 , β 3 = α 4 = 0.40993371990193 , α 3 = β 4 = 0.059762097006575 .
This composing way is a systematic way of obtaining a higher-order method and it is a symmetric composition of the first-order method [15]. The parameters α i , β i , i = 1 , 2 , , 6 are chosen to satisfy the order conditions of the numerical method [15]. That is to say, the parameters α i , β i , i = 1 , 2 , , 6 are chosen such that the composing method (22) is of order 4.
2ndSYM: the second-order explicit symplectic-like method χ h 2 for the canonical charged particle system with the expression
χ h 2 κ φ h / 2 H B φ h H A φ h / 2 H B .
We formulate the methods φ h / 2 H B and φ h / 2 H A with discrete time stepsize h, which can be calculated as follows:
φ h / 2 H B : P 11 = P 10 h 2 X 1 H B ( P 20 , X 10 ) , X 11 = X 10 , P 21 = P 20 , X 21 = X 20 + h 2 P 2 H B ( P 20 , X 10 ) .
φ h H A : P 12 = P 11 , X 12 = X 11 + h P 1 H A ( P 11 , X 21 ) , P 22 = P 21 h X 2 H A ( P 11 , X 21 ) , X 22 = X 21 .
φ h / 2 H B : P 13 = P 12 h 2 X 1 H B ( P 22 , X 12 ) , X 13 = X 12 , P 23 = P 22 , X 23 = X 22 + h 2 P 2 H B ( P 22 , X 12 ) .
κ : P 14 = P 13 + P 23 2 , X 14 = X 13 + X 23 2 , P 24 = P 13 + P 23 2 , X 24 = X 13 + X 23 2 .
Therefore, we know that χ h 2 ( P 10 , X 10 , P 20 , X 20 ) = ( P 14 , X 14 , P 24 , X 24 ) .
4thSYM: the fourth order explicit symplectic-like method for the non-canonical charged particle system. The fourth-order method is constructed by composing the first-order K-symplectic method χ h . Here, we formulate χ h with discrete time stepsize h. Then, we know that
( P 11 , X 11 , P 21 , X 21 ) = φ h H B ( P 10 , X 10 , P 20 , X 20 ) ,
( P 12 , X 12 , P 22 , X 22 ) = φ h H A ( P 11 , X 11 , P 21 , X 21 )
with φ h H B and φ h H A defined in Equations (24) and (25). Then we know that χ h ( P 10 , X 10 , P 20 , X 20 ) = ( P 12 , X 12 , P 22 , X 22 ) . The composing way is as follows:
χ h 4 κ χ α 6 h χ β 6 h * χ β 2 h * χ α 1 h χ β 1 h *
where ψ h * is the adjoint method of the method ψ h . Values of the parameters α 1 , β 1 , , α 6 , β 6 are the same as those in 4thKSYM [31]. The parameters are chosen in the same way as in 4thKSYM.
RK3: the third-order implicit Runge-Kutta method [32,33]. As the RK3 method is implicit, the iteration method is used to solve this method. We set the tolerance error to be 10 10 . The RK3 method is displayed as follows:
Z n + 1 = Z n + 1 2 h f ( W 1 ) + 1 2 h f ( W 2 ) , W 1 = Z n + 1 2 h f ( W 1 ) 3 6 h f ( W 2 ) , W 2 = Z n + 3 6 h f ( W 1 ) + 1 2 h f ( W 2 )
where Z = ( x 1 , x 2 , x 3 , v 1 , v 2 , v 3 ) and f = K 1 H ( Z ) with the matrix and the Hamiltonian H, which are defined in Section 2.
RK5: the fifth-order implicit Runge-Kutta method [32,33]. As the RK5 method is implicit, the iteration method is used to solve this method. We set the tolerance error to be 10 12 . The RK5 method is displayed as follows:
Z n + 1 = Z n + 1 9 h f ( W 1 ) + 16 + 6 36 h f ( W 2 ) + 16 6 36 h f ( W 3 ) , W 1 = Z n + 1 9 h f ( W 1 ) + 1 6 18 h f ( W 2 ) + 1 + 6 18 h f ( W 3 ) , W 2 = Z n + 1 9 h f ( W 1 ) + 88 + 7 6 360 h f ( W 2 ) + 88 43 6 360 h f ( W 3 ) , W 3 = Z n + 1 9 h f ( W 1 ) + 88 + 43 6 360 h f ( W 2 ) + 88 7 6 360 h f ( W 3 )
where Z = ( x 1 , x 2 , x 3 , v 1 , v 2 , v 3 ) and f = K 1 H ( Z ) with the matrix and the Hamiltonian H, which are defined in Section 2.

5. Numerical Experiments

Here, we present several examples of a charged particle system under different magnetic fields. In the first two examples, the magnetic fields are integrable, and the integral can be written in closed forms; thus, the explicit K-symplectic methods are constructed. In the last two examples, since the magnetic fields cannot be integrated in closed form, we construct the explicit symplectic-like methods.

5.1. Example 1

The system is normalized according to natural units. We set the particle mass m = 1 and electric charge q = 1 . The electric field is
E ( X ) = 10 2 ( x 1 2 + x 2 2 ) 3 / 2 ( x 1 , x 2 , 0 )
and the scalar potential is φ ( X ) = 10 2 x 1 2 + x 2 2 . We choose the magnetic field to be
B ( X ) = 0 , 0 , 2 x 1 2 + 3 x 2 2 .
The integral of the third component of the magnetic field with respect to x 1 can be integrated in closed form
2 x 1 2 + 3 x 2 2 d x 1 = 1 4 2 x 1 2 x 1 2 + 3 x 2 2 + 3 2 ln ( 2 x 1 + 4 x 1 2 + 6 x 2 2 ) .
The integral with respect to x 2 can also be obtained in closed form. Thus, the explicit K-symplectic methods can be constructed for the charged particle system in non-canonical form.
The initial condition is Z 0 = ( 0 , 1 , 0 , 0.2 , 0.1 , 0 ) . Displayed in Figure 1a,b are the projections on the x 1 x 2 plane of the phase orbit obtained by the second-order K-symplectic method and the third-order Runge-Kutta method under the parameter ε = 1 5 . As can be seen from Figure 1a,b, under the same stepsize, the phase orbit of the 2ndKSYM method is preserved well, while the phase orbit of the RK3 method is not accurate. Displayed in Figure 1c,d are the energy errors obtained by the 2ndKSYM method, the RK3 method, the 4thKSYM method and the RK5 method. The energy errors of the 2ndKSYM method and the 4thKSYM method oscillates with small amplitudes over a long time, while those of the RK3 method and the RK5 method increase along time and increase without bound. The K-symplectic methods demonstrate their advantage in orbit preservation and energy preservation over a long time. Figure 2 shows the phase orbit obtained by the two K-symplectic methods and two Runge-Kutta methods under the parameter ε = 1 10 . Displayed in Figure 2a,b are the phase orbits obtained by the 2ndKSYM and RK3 methods. It can be seen that the phase orbit of the 2ndKSYM method can be preserved under a big stepsize, but the phase orbit of the RK3 method is not accurate even under a very small stepsize. This shows the big influence of the parameter ε on the third-order Runge-Kutta method. When the parameter ε turns big, the stepsize of the third-order Runge-Kutta method should be very small. Displayed in Figure 2c,d are the phase orbits obtained by the 4thKSYM and RK5 methods under the same stepsize. The phase orbit of the 4thKSYM method is accurate over a long period, while the phase orbit of the RK5 method is not accurate. This clearly shows the superior advantage of the two K-symplectic methods in structure-preservation compared with the two higher-order Runge-Kutta methods.
Figure 3 shows the computational efficiency of the 2ndKSYM method, the RK3 method, the 4thKSYM method and the RK5 method under two different parameters ε . Figure 3a,b are the energy errors versus computational time for the four methods for ε = 1 5 . Figure 3c,d are the energy errors versus computational time for the four methods for ε = 1 10 . Method A is more efficient than method B if A takes less computational (CPU) time to achieve the same magnitude of error than B. We can observe from Figure 3 that under the same stepsize, both the computational times and the energy errors of the two K-symplectic methods are much less than the two Runge-Kutta methods. The computational time of the RK3 method is nearly 8 times of that of the 2ndKSYM method, and the computational time of the RK5 method is nearly 4 times of that of the 4thKSYM method. The energy error of the 2ndKSYM method is nearly 1 100 times of that of the RK3 method, while the energy error of the 4thKSYM method is nearly 1 10000 times of that of the RK5 method. To obtain the same order of magnitude of energy error, the two K-symplectic methods need much less computational times compared to the two Runge-Kutta methods. This shows that the two K-symplectic methods are much more efficient than the two higher-order Runge-Kutta methods.

5.2. Example 2

The system is normalized according to natural units. We set the particle mass m = 1 and electric charge q = 1 . The electric field is
E ( X ) = 10 2 ( x 1 2 + x 2 2 ) 3 / 2 ( x 1 , x 2 , 0 )
We choose the magnetic field to be
B ( X ) = cos ( x 2 + x 3 ) , x 1 2 + x 3 2 , x 1 2 2 + x 2 2 2 .
As the three components of the magnetic field B can be integrated explicitly, we can construct explicit K-symplectic methods.
The initial condition is Z 0 = ( 0.2 , 1 , 0.2 , 0.02 , 0.01 , 0.01 ) . Figure 4 shows the energy error and the computational efficiency of the two K-symplectic methods and the two Runge-Kutta methods under the parameter ε = 1 5 . It can be seen from Figure 4a,b that the defects | H n H 0 | / | H 0 | of the 2ndKSYM method and the 4thKSYM method oscillate within small intervals, but those of the RK3 method and the RK5 method increase without bound. Figure 4c,d shows that to obtain the same magnitude of the defect | H n H 0 | / | H 0 | , such as 10 4 , the computational time of the 2ndKSYM method is much less than the computational time of the RK3 method. The 2ndKSYM method exhibits better efficiency than the RK3 method. The 4thKSYM method also exhibits better efficiency than the RK5 method. Displayed in Figure 5 are the relative energy errors | H n H 0 | / | H 0 | obtained by the 2ndKSYM method, the RK3 method, the 4thKSYM method and the RK5 method under the parameter ε = 1 10 . As can be seen from Figure 5, the defects | H n H 0 | / | H 0 | of the two K-symplectic methods can be preserved by small errors, while the defects of the two Runge-Kutta methods do not have boundaries and increase along time. Displayed in Figure 5a,b are the energy errors obtained by the 2ndKSYM and the RK3 methods. Displayed in Figure 5c,d are the energy errors obtained by the 4thKSYM and the RK5 methods. We can observe that the maximum energy errors of the 2ndKSYM method and RK3 under ε = 1 5 are of magnitude 10 5 and 10 3 , while the energy error of the 2ndKSYM method and the RK3 method under ε = 1 10 are of magnitude 10 4 and 10 1 . When the parameter ε turns from 1 5 to 1 10 , the energy error of the 2ndKSYM method is one order of magnitude larger, while that of the RK3 method is two orders of magnitude larger. This observation also applies to the 4thKSYM method and RK5 method. This shows the big influence of parameter ε on the Runge-Kutta methods, and it also shows that the two kinds of symplectic methods are more stable than the Runge-Kutta methods.

5.3. Example 3

The system is normalized according to natural units. We set the particle mass m = 1 and electric charge q = 1 . The electric field is
E ( X ) = 10 2 ( x 1 2 + x 2 2 ) 3 / 2 ( x 1 , x 2 , 0 )
The magnetic field is chosen to be
B ( X ) = 3 x 1 x 3 r 5 , 3 x 2 x 3 r 5 , 2 x 3 2 x 1 2 x 2 2 r 5
where r = x 1 2 + x 2 2 + x 3 2 . When the component of the magnetic field is chosen as the integrand, it can not be integrated explicitly; thus, explicit K-symplectic methods cannot be obtained. Thus, we aim to construct explicit symplectic-like methods for the canonical charged particle system. Accordingly, we can obtain the vector potential as
A ( X ) = y r 3 , x r 3 , 0 .
The initial condition is Z 0 = ( 10 , 10 , 10 , 0 , 0 , 0 ) . Displayed in Figure 6 are the orbits projected on the x 1 x 2 plane and the energy evolution of the two symplectic-like methods and two Runge-Kutta methods. It is demonstrated in Figure 6a,b that although the phase orbits of the 2ndSYM method and the RK3 method do not show much difference, the energy error of the 2ndKSYM method is much less than that of the RK3 method. Displayed in Figure 6c,d are the energy errors obtained by the 2ndKSYM, the 4thKSYM, the RK3 and the RK5 methods. The energy error of the 4thSYM method can be bounded within a very small interval, but the energy error of the RK5 method increases without bound. The symplectic-like methods show their long-term energy conservation behavior. Figure 7 shows the computational efficiency of the four methods under two different parameters ε . Figure 7a shows the energy error versus the computational time for the four methods for the parameter ε = 1 100 while Figure 7b shows the energy error versus the computational time for the four methods for ε = 1 200 . Both the energy errors and the CPU times of the two symplectic-like methods are less than those of the two Runge-Kutta methods. The two symplectic-like methods exhibit better efficiency than the two Runge-Kutta methods.

5.4. Example 4

The system is normalized according to natural units. We set the particle mass m = 1 and electric charge q = 2 . The electric field is
E ( X ) = 10 2 ( x 1 2 + x 2 2 ) 3 / 2 ( x 1 , x 2 , 0 ) .
We choose the vector potential as
A ( X ) = B 0 r 2 2 R q e ζ ln R R 0 R 0 B 0 2 e x 3 + B 0 R 0 x 3 2 R e R
where R = x 1 2 + x 2 2 , ζ = arctan x 2 x 1 . The values are set to be R 0 = 3 , B 0 = 1 . Accordingly, we can obtain the magnetic field as
B ( X ) = B 0 r q R e θ + B 0 R 0 R e ζ
with the poloidal coordinates being θ = arctan x 3 R R 0 and r = ( R R 0 ) 2 + x 3 2 . The initial condition is Z 0 = ( 3.15 , 0 , 0 , 0.016 , 0.04 , 0 ) . Displayed in Figure 8 are the energy error and the computational efficiency obtained by the two symplectic-like methods and the two Runge-Kutta methods. The symplectic-like methods have shown their advantage in long-term energy conservation, as shown in Figure 8a,b. The two symplectic-like methods are more efficient than the two Runge-Kutta methods, as shown in Figure 8c,d.

6. Conclusions

We have constructed explicit K-symplectic methods and explicit symplectic-like methods for the charged particle system in the general strong magnetic field. If the three components of the magnetic field can all be integrated explicitly, then we can construct K-symplectic methods; if the above condition does not hold, we can construct sympletic-like methods. Symplectic-like methods can be constructed by extending the original phase space and obtaining the augmented separable Hamiltonian, and then by using the splitting method and the midpoint permutation. The numerical experiments have shown that the explicit K-symplectic methods and explicit symplectic-like methods have a significant advantage in long-term energy conservation over the higher-order Runge-Kutta methods. Both the K-symplectic methods and the symplectic-like methods exhibit better computational efficiency than the higher-order Runge-Kutta methods. The numerical experiments also show that the effect of the parameter ε on the Runge-Kutta methods is larger than the symplectic methods.

Author Contributions

Conceptualization, Y.L. and J.Y.; Methodology, Y.L. and J.Y.; Formal Analysis, J.Y. and H.T.; Funding acquisition, Y.L.; Software, H.T., Z.Q. and S.C.; Validation, Z.Q. and S.C., Writing—original draft preparation, Y.L. and H.Z.; Writing—review and editing, Y.L., J.Y. and H.T. All authors have read and agreed to the published version of the manuscript.

Funding

This research is supported by the Fundamental Research Funds for the Central Universities (FRF-TP-20-068A1).

Data Availability Statement

The data presented in this study are available on request from the corresponding author.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. He, Y.; Sun, Y.J.; Zhang, R.L.; Wang, Y.L.; Liu, J.; Qin, H. High order volume-preserving algorithms for relativistic charged particles in general electromagnetic fields. Phys. Plasmas 2016, 23, 092109. [Google Scholar] [CrossRef]
  2. Zhang, R.L.; Qin, H.; Tang, Y.F.; Liu, J.; He, Y.; Xiao, J.Y. Explicit symplectic algorithms based on generating functions for charged particle dynamics. Phys. Rev. E. 2016, 94, 013205. [Google Scholar] [CrossRef] [PubMed]
  3. Zhang, R.L.; Wang, Y.L.; He, Y.; Xiao, J.Y.; Liu, J.; Qin, H.; Tang, Y.F. Explicit symplectic algorithms based on generating functions for relativistic charged particle dynamics in time-dependent electromagnetic field. Phys. Plasmas 2018, 25, 022117. [Google Scholar] [CrossRef]
  4. Tang, R.; Li, D. On Symmetric Methods for Charged Particle Dynamics. Symmetry 2021, 13, 1626. [Google Scholar] [CrossRef]
  5. Feng, K. Collected Works of Feng Kang (II); National Defence Industry Press: Beijing, China, 1995; pp. 44–47. [Google Scholar]
  6. Feng, K. On Difference Schemes and Symplectic Geometry. In Proceedings of 1984 Beijing Symposium on Differential Geometry and Differential Equations; Feng, K., Ed.; Science Press: Beijing, China, 1985; pp. 42–58. [Google Scholar]
  7. Feng, K.; Qin, M.Z. Symplectic Geometric Algorithms for Hamiltonian System; Springer: New York, NY, USA, 2009. [Google Scholar]
  8. Sanz-Serna, J.M.; Calvo, M.P. Numerical Hamiltonian Problems; Chapman and Hall: London, UK, 1994. [Google Scholar]
  9. Tang, Y.F.; Pérez-García, V.M.; Vázquez, L. Symplectic Methods for the Ablowitz-Ladik Model. Appl. Math. Comput. 1997, 82, 17–38. [Google Scholar] [CrossRef]
  10. Brugnano, L.; Iavernaro, F. Line Integral Methods for Conservative Problems; Chapman and Hall/CRC: Boca Raton, FL, USA, 2016. [Google Scholar]
  11. Brugnano, L.; Zhang, C.J.; Li, D.F. A class of energy-conserving Hamiltonian boundary value methods for nonlinear Schrödinger equation with wave operator. Commun. Nonlin. Sci. Numer. Simulat. 2018, 60, 33–49. [Google Scholar] [CrossRef]
  12. Shang, Z.J. Construction of volume-preserving difference schemes for source-free systems via generating functions. J. Comput. Math. 1994, 12, 265–272. [Google Scholar]
  13. Shang, Z.J. Generating functions for volume-preserving mappings and Hamilton-Jacobi equations for source-free dynamical systems. Sci. China Ser. A 1994, 37, 1172–1188. [Google Scholar]
  14. Channell, P.J.; Scovel, J.C. Symplectic Integration of Hamiltonian Systems. Nonlinearity 1990, 3, 231–259. [Google Scholar] [CrossRef]
  15. Hairer, E.; Lubich, C.; Wanner, G. Geometric Numerical Integration: Structure-Preserving Algorithms for Ordinary Differential Equations; Springer: Berlin/Heidelberg, Germany, 2002. [Google Scholar]
  16. Kosinski, P.; Maslanka, P. Relativistic symmetries and Hamiltonian formalism. Symmetry 2020, 12, 1810. [Google Scholar] [CrossRef]
  17. Zajac, M.; Sardon, C.; Ragnisco, O. Time-dependent Hamiltonian mechanics on a locally conformal symplectic manifold. Symmetry 2023, 15, 843. [Google Scholar] [CrossRef]
  18. Arnold, V.I. Mathematical Methods of Classical Mechanics; Springer: Berlin/Heidelberg, Germany, 1978. [Google Scholar]
  19. Albosaily, S.; Mohammed, W.W.; Aiyashi, M.A.; Abdelrahman, M.A.E. Exact solutions of the (2 + 1)-dimensional stochastic chiral nonlinear Schrödinger equation. Symmetry 2020, 12, 1874. [Google Scholar] [CrossRef]
  20. Shah, N.A.; Agarwal, P.; Chung, J.D.; El-Zahar, E.R.; Hamed, Y.S. Analysis of optical solitons for nonlinear Schrödinger equation with detuning term by iterative transform method. Symmetry 2020, 12, 1850. [Google Scholar] [CrossRef]
  21. Blanes, S.; Moan, P.C. Splitting Methods for Non-autonomous Hamiltonian Equations. J. Comput. Phys. 2001, 170, 205–230. [Google Scholar] [CrossRef]
  22. He, Y.; Zhou, Z.Q.; Sun, Y.J.; Liu, J.; Qin, H. Explicit K-symplectic algorithms for charged particle dynamics. Phys. Lett. A 2017, 381, 568–573. [Google Scholar] [CrossRef]
  23. Zhu, B.B.; Zhao, Y.L. Symplectic all-at-once method for Hamiltonian systems. Symmetry 2021, 13, 1930. [Google Scholar] [CrossRef]
  24. Zhu, B.B.; Tang, Y.F.; Zhang, R.L.; Zhang, Y.H. Symplectic simulation of dark solitons motion for nonlinear Schrödinger equation. Numer. Algorithms 2019, 81, 1485–1503. [Google Scholar] [CrossRef]
  25. Pihajoki, P. Explicit methods in extended phase space for inseparable Hamiltonian problems. Celest. Mech. Dyn. Astr. 2015, 121, 211–231. [Google Scholar] [CrossRef]
  26. Tao, M.L. Explicit symplectic approximation of nonseparable Hamiltonians: Algorithm and long time performance. Phys. Rev. E 2016, 94, 043303. [Google Scholar] [CrossRef]
  27. Wu, Y.L.; Wu, X. An optimized Forest-Ruth-like algorithm in extended phase space. Int. J. Mod. Phys. C 2018, 29, 1850006. [Google Scholar] [CrossRef]
  28. Jayawardana, B.; Ohsawa, T. Semiexplicit symplectic integrators for non-separable Hamiltonian systems. Math. Comput. 2023, 92, 251–281. [Google Scholar] [CrossRef]
  29. Ohsawa, T. Preservation of Quadratic Invariants by Semiexplicit Symplectic Integrators for Non-separable Hamiltonian Systems. arXiv 2022, arXiv:2208.10546. [Google Scholar]
  30. Strang, G. On the construction and comparison of difference schemes. SIAM J. Numer. Anal. 1968, 5, 507–517. [Google Scholar] [CrossRef]
  31. Blanes, S.; Moan, P.C. Practical symplectic partitioned Runge-Kutta and Runge-Kutta-Nystrom methods. J. Comput. Appl. Math. 2002, 142, 313–330. [Google Scholar] [CrossRef]
  32. Butcher, J.C. Implicit Runge-Kutta Processes. Math. Comput. 1964, 18, 50–64. [Google Scholar] [CrossRef]
  33. Hairer, E.; Nørsett, S.P.; Wanner, G. Solving Ordinary Differential Equation I: Nonstiff Problems; Springer: Berlin/Heidelberg, Germany, 1987. [Google Scholar]
Figure 1. The phase orbit and the energy evolution obtained by the 2ndKSYM, 4thKSYM, RK3 and RK5 methods with the parameter ϵ = 1 / 5 in Example 1. The time interval for subfigures (a,b) is [ 0 , 10 4 π ] , and the time stepsize is h = π / 800 . In subfigure (c), the stepsize is h = π / 800 , while in (d), the stepsize is h = π / 200 .
Figure 1. The phase orbit and the energy evolution obtained by the 2ndKSYM, 4thKSYM, RK3 and RK5 methods with the parameter ϵ = 1 / 5 in Example 1. The time interval for subfigures (a,b) is [ 0 , 10 4 π ] , and the time stepsize is h = π / 800 . In subfigure (c), the stepsize is h = π / 800 , while in (d), the stepsize is h = π / 200 .
Symmetry 15 01146 g001
Figure 2. The phase orbit projected on the x 1 x 2 plane of the 2ndKSYM, 4thKSYM, RK3 and RK5 methods with the parameter ϵ = 1 / 10 in Example 1. The time interval for the four subfigures is [ 0 , 2 × 10 4 π ] . In subfigure (a), the stepsize is π / 400 , and in subfigure (b), the stepsize is h = π / 3200 . In subfigure (c), the stepsize is h = π / 100 , while in (d), the stepsize is h = π / 100 .
Figure 2. The phase orbit projected on the x 1 x 2 plane of the 2ndKSYM, 4thKSYM, RK3 and RK5 methods with the parameter ϵ = 1 / 10 in Example 1. The time interval for the four subfigures is [ 0 , 2 × 10 4 π ] . In subfigure (a), the stepsize is π / 400 , and in subfigure (b), the stepsize is h = π / 3200 . In subfigure (c), the stepsize is h = π / 100 , while in (d), the stepsize is h = π / 100 .
Symmetry 15 01146 g002
Figure 3. The maximum energy error versus CPU time for the 2ndKSYM, 4thKSYM, RK3 and RK5 methods in Example 1. In subfigures (a,b), ϵ = 1 / 5 while in subfigures (c,d), ϵ = 1 / 10 . In subfigure (a), the stepsize is h = π / 800 / 2 i , i = 0 , 1 , 2 , 3 , while in (b), the stepsize is h = π / 100 / 2 i , i = 0 , 1 , 2 , 3 . In subfigure (c), the stepsize is h = π / 1600 / 2 i , i = 0 , 1 , 2 , 3 , while in (d), the stepsize is h = π / 100 / 2 i , i = 0 , 1 , 2 , 3 .
Figure 3. The maximum energy error versus CPU time for the 2ndKSYM, 4thKSYM, RK3 and RK5 methods in Example 1. In subfigures (a,b), ϵ = 1 / 5 while in subfigures (c,d), ϵ = 1 / 10 . In subfigure (a), the stepsize is h = π / 800 / 2 i , i = 0 , 1 , 2 , 3 , while in (b), the stepsize is h = π / 100 / 2 i , i = 0 , 1 , 2 , 3 . In subfigure (c), the stepsize is h = π / 1600 / 2 i , i = 0 , 1 , 2 , 3 , while in (d), the stepsize is h = π / 100 / 2 i , i = 0 , 1 , 2 , 3 .
Symmetry 15 01146 g003
Figure 4. The energy evolution and computational efficiency for the 2ndKSYM, 4thKSYM, RK3 and RK5 methods with the parameter ϵ = 1 / 2 in Example 2. In subfigure (a), the stepsize is h = π / 6400 , while in subfigure (b), the stepsize is h = π / 800 . The time interval is [ 0 , 10 4 π ] . In subfigure (c,d), the stepsize for the 2ndKSYM and RK3 methods is h = π / 3200 / 2 i , i = 0 , 1 , 2 , 3 , while that for the 4thKSYM and RK5 methods is h = π / 200 / 2 i , i = 0 , 1 , 2 , 3 .
Figure 4. The energy evolution and computational efficiency for the 2ndKSYM, 4thKSYM, RK3 and RK5 methods with the parameter ϵ = 1 / 2 in Example 2. In subfigure (a), the stepsize is h = π / 6400 , while in subfigure (b), the stepsize is h = π / 800 . The time interval is [ 0 , 10 4 π ] . In subfigure (c,d), the stepsize for the 2ndKSYM and RK3 methods is h = π / 3200 / 2 i , i = 0 , 1 , 2 , 3 , while that for the 4thKSYM and RK5 methods is h = π / 200 / 2 i , i = 0 , 1 , 2 , 3 .
Symmetry 15 01146 g004
Figure 5. The energy error obtained by the 2ndKSYM, 4thKSYM, RK3 and RK5 methods with the parameter ϵ = 1 / 5 in Example 2. The stepsize for the 2ndKSYM and RK3 methods is h = π / 12 , 800 , and the stepsize for the 4thKSYM and RK5 methods is h = π / 1600 . The time interval is [ 0 , 1000 π ] . Subfigures (a,b) are the energy errors obtained by the 2ndKSYM and the RK3 methods. Subfigures (c,d) are the energy errors obtained by the 4thKSYM and the RK5 methods.
Figure 5. The energy error obtained by the 2ndKSYM, 4thKSYM, RK3 and RK5 methods with the parameter ϵ = 1 / 5 in Example 2. The stepsize for the 2ndKSYM and RK3 methods is h = π / 12 , 800 , and the stepsize for the 4thKSYM and RK5 methods is h = π / 1600 . The time interval is [ 0 , 1000 π ] . Subfigures (a,b) are the energy errors obtained by the 2ndKSYM and the RK3 methods. Subfigures (c,d) are the energy errors obtained by the 4thKSYM and the RK5 methods.
Symmetry 15 01146 g005aSymmetry 15 01146 g005b
Figure 6. The phase orbit projected on the x 1 x 2 plane and the energy evolution of the 2ndKSYM, 4thKSYM, RK3 and RK5 methods with the parameter ϵ = 1 / 400 in Example 3. Subfigure (a,b) are the phase orbits obtained by the 2ndKSYM and the RK3 methods with the time interval being [ 0 , 10 5 π ] and the stepsize being h = π / 2 . For subfigure (c), the stepsize for the two methods is h = π / 2 , while for subfigure (d), the stepsize is h = π .
Figure 6. The phase orbit projected on the x 1 x 2 plane and the energy evolution of the 2ndKSYM, 4thKSYM, RK3 and RK5 methods with the parameter ϵ = 1 / 400 in Example 3. Subfigure (a,b) are the phase orbits obtained by the 2ndKSYM and the RK3 methods with the time interval being [ 0 , 10 5 π ] and the stepsize being h = π / 2 . For subfigure (c), the stepsize for the two methods is h = π / 2 , while for subfigure (d), the stepsize is h = π .
Symmetry 15 01146 g006
Figure 7. The computational efficiency obtained by the 2ndKSYM, 4thKSYM, RK3 and RK5 methods in Example 3. For subfigure (a), the value is ϵ = 1 / 100 , and the time interval is [ 0 , 10 5 π ] . For subfigure (b), the value is ϵ = 1 / 200 , and the time interval is [ 0 , 10 5 π ] . In both subfigures, the stepsize for the 2ndKSYM and RK3 methods is h = π / 2 i , i = 0 , 1 , 2 , 3 , and the stepsize for the 4thKSYM and RK5 methods is h = 2 π / 2 i , i = 0 , 1 , 2 , 3 .
Figure 7. The computational efficiency obtained by the 2ndKSYM, 4thKSYM, RK3 and RK5 methods in Example 3. For subfigure (a), the value is ϵ = 1 / 100 , and the time interval is [ 0 , 10 5 π ] . For subfigure (b), the value is ϵ = 1 / 200 , and the time interval is [ 0 , 10 5 π ] . In both subfigures, the stepsize for the 2ndKSYM and RK3 methods is h = π / 2 i , i = 0 , 1 , 2 , 3 , and the stepsize for the 4thKSYM and RK5 methods is h = 2 π / 2 i , i = 0 , 1 , 2 , 3 .
Symmetry 15 01146 g007
Figure 8. The energy error and the computational efficiency obtained by the 2ndKSYM, 4thKSYM, RK3 and RK5 methods with the parameter ϵ = 1 / 5 in Example 4. For subfigures (a,b), the time interval is [ 0 , 10 4 π ] . The stepsize for the 2ndKSYM and RK3 methods is h = π / 800 , and the stepsize for the 4thKSYM and RK5 methods is h = π / 200 . For subfigure (c), the time interval is [ 0 , 10 3 π ] . The stepsize for the 2ndKSYM and RK3 methods is h = π / 800 / 2 i , i = 0 , 1 , 2 , 3 , and the stepsize for the 4thKSYM and RK5 methods is h = π / 50 / 2 i , i = 0 , 1 , 2 , 3 .
Figure 8. The energy error and the computational efficiency obtained by the 2ndKSYM, 4thKSYM, RK3 and RK5 methods with the parameter ϵ = 1 / 5 in Example 4. For subfigures (a,b), the time interval is [ 0 , 10 4 π ] . The stepsize for the 2ndKSYM and RK3 methods is h = π / 800 , and the stepsize for the 4thKSYM and RK5 methods is h = π / 200 . For subfigure (c), the time interval is [ 0 , 10 3 π ] . The stepsize for the 2ndKSYM and RK3 methods is h = π / 800 / 2 i , i = 0 , 1 , 2 , 3 , and the stepsize for the 4thKSYM and RK5 methods is h = π / 50 / 2 i , i = 0 , 1 , 2 , 3 .
Symmetry 15 01146 g008
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Lu, Y.; Yuan, J.; Tian, H.; Qin, Z.; Chen, S.; Zhou, H. Explicit K-Symplectic and Symplectic-like Methods for Charged Particle System in General Magnetic Field. Symmetry 2023, 15, 1146. https://doi.org/10.3390/sym15061146

AMA Style

Lu Y, Yuan J, Tian H, Qin Z, Chen S, Zhou H. Explicit K-Symplectic and Symplectic-like Methods for Charged Particle System in General Magnetic Field. Symmetry. 2023; 15(6):1146. https://doi.org/10.3390/sym15061146

Chicago/Turabian Style

Lu, Yulan, Junbin Yuan, Haoyang Tian, Zhengwei Qin, Siyuan Chen, and Hongji Zhou. 2023. "Explicit K-Symplectic and Symplectic-like Methods for Charged Particle System in General Magnetic Field" Symmetry 15, no. 6: 1146. https://doi.org/10.3390/sym15061146

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