Skip to Content
You are currently on the new version of our website. Access the old version .
SymmetrySymmetry
  • Article
  • Open Access

3 September 2021

11 Pages

On Symmetrical Methods for Charged Particle Dynamics

and
1
School of Mathematics and Statistics, Huazhong University of Science and Technology, Wuhan 430074, China
2
Hubei Key Laboratory of Engineering Modeling and Scientific Computing, Huazhong University of Science and Technology, Wuhan 430074, China
*
Author to whom correspondence should be addressed.

Abstract

In this paper, we use the scalar auxiliary variable (SAV) approach to rewrite the charged particle dynamics as a new family of ODE systems. The systems own a conserved energy. It is shown that a family of symmetrical methods is energy-conserving for a new ODE system but may not be for the original systems. Moreover, the methods have high-order accuracy. Numerical results are given to confirm the theoretical findings.

1. Introduction

In this paper, we are interested in investigating high-order numerical methods for solving the following charged particle dynamics [1,2,3,4]:
q ˙ = p , p ˙ = p × L ( q ) − ∇ U ( q ) , q ( 0 ) = q 0 , p ( 0 ) = p 0 , ( q 0 , p 0 ) ∈ Ω ⊆ R 3 × R 3 ,
where L ( q ) and − ∇ U ( q ) are, respectively, the magnetic and electric fields. In recent years, many energy-conserving numerical methods have been investigated within the framework of line integral methods [1,5] or Runge–Kutta methods [6,7,8,9]. The main results indicate that the method preserves polynomial Hamiltonians. For non-polynomial Hamiltonians, the energy errors appear in the long time simulation. As a result, the numerical methods may not exactly be energy-conserving.
In this short paper, we propose a novel approach to developing some energy-conserving numerical methods for the charged particle dynamics. The main idea can be viewed as an extension of the recent scalar auxiliary variable approach [10,11,12,13,14] or the invariant energy quadratization approach [15]. Firstly, we introduce an auxiliary variable and obtain an auxiliary ordinary differential equation. Together with the original equations (1), we obtain a new family for the ODE system. The new system has the same solution as the original problem (1), and the energy of the new system can be rewritten as the quadratic invariants. Then, we studied the energy-conserving methods in the framework of Runge–Kutta methods. It can be seen that certain Runge–Kutta methods are energy-conserving for the ODE system, while the same Runge–Kutta methods cannot generally preserve the energy of the original system (1). Within the framework of Runge–Kutta methods, it is easy to find some other energy-conserving methods, e.g., Gauss methods and Hamiltonian boundary value methods [6,7,8,9].
The rest of the paper is arranged as follows. In Section 2, we propose the main approach and energy-conserving methods. In Section 3, we present several numerical results to confirm the effectiveness of the numerical methods. In Section 4, we summarize our results.

2. Energy-Conserving Methods

In this section, we present the approach and the energy-conserving methods.
Let r = U ( q ) + C 0 , where C 0 is a constant so that U ( q ) + C 0 ≥ 0 . The derivation of r yields:
r ˙ = ∇ U ( q ) ⊤ p 2 r .
Together with (1), we have a new ODE system:
q ˙ = p , p ˙ = p × L ( q ) − ∇ U ( q ) , r ˙ = ∇ U ( q ) ⊤ p 2 r ,
where the initial condition of r is given by r ( 0 ) = U ( q 0 ) + C 0 . The system has the same solutions for p and q, and the same conserved and continuous energy as (1), meaning that:
H ( p , q , r ) = 1 2 p T p + U ( q ) = 1 2 p ⊤ p + r 2 − C 0 .
This is true because, by the chain rule, it holds that:
d d t H ( p , q , r ) = p ⊤ p ˙ + 2 r r ˙ = p ⊤ ( p × L ( q ) ) − ∇ U ( q ) ⊤ p + ∇ U ( q ) ⊤ p = p ⊤ ( p × L ( q ) ) = 0 .
Let:
y = [ p T , q T , r ] T .
Then, system (2) can be viewed as the standard ordinary differential equations, having the form:
y ˙ = f ( y ) .
Let:
S = 1 2 0 0 0 0 0 0 0 1 2 0 0 0 0 0 0 0 1 2 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 ,
X , Y ∈ R n and define:
⟨ X , Y ⟩ s = Y T S X .
One can directly check that:
⟨ y , y ⟩ s = 1 2 p ⊤ p + r 2 = H ( p , q , r ) + C 0 ,
and:
⟨ y , f ( y ) ⟩ s = ⟨ y , y ˙ ⟩ s = 1 2 p ⊤ p ˙ + r r ˙ = 0 ,
where we have noted (3).
We now consider an s-stage Runge–Kutta method to solve problem (4). Let ( A , b , c ) be a given Runge–Kutta method with vectors b = ( b 1 , b 2 , ⋯ , b s ) T , c = ( c 1 , c 2 , ⋯ , c s ) T and matrix A = ( a i j ) s × s . Let h be the stepsize and define grid points t n by t n = n h , n = 0 , 1 , 2 , ⋯ . Applying the s-stage Runge–Kutta method to solve problem (4) yields:
Y i n = y n + h ∑ j = 1 s a i j f j ,
y n + 1 = y n + h ∑ j = 1 s b j f j ,
where f j = f ( Y j n ) , y n and Y i n are the numerical approximations to y ( t n ) and y ( t n + c i h ) , respectively.
Theorem 1.
Assume that the s-stage Runge–Kutta method is symplectic, i.e., it satisfies:
b i a i j + b j a j i − b i b j = 0 .
Then, the numerical solution defined in (8) and (9) preserves the energy:
H ( p n + 1 , q n + 1 , r n + 1 ) = H ( p n , q n , r n ) .
Proof. 
By (9) and definition (5), it holds that:
⟨ y n + 1 , y n + 1 ⟩ s = ⟨ y n + h ∑ j = 1 s b j f j , y n + h ∑ j = 1 s b j f j ⟩ s = ⟨ y n , y n ⟩ s + 2 h ∑ i = 1 s b i ⟨ y n , f i ⟩ s + h 2 ∑ i , j = 1 s b i b j ⟨ f i , f j ⟩ s = ⟨ y n , y n ⟩ s + 2 h ∑ i = 1 s b i ⟨ Y i n − h ∑ j = 1 s a i j f j , f i ⟩ s + h 2 ∑ i , j = 1 s b i b j ⟨ f i , f j ⟩ s = ⟨ y n , y n ⟩ s + 2 h ∑ i = 1 s b i ⟨ Y i n , f i ⟩ s − h 2 ∑ i , j = 1 s ( b i a i j + b j a j i − b i b j ) ⟨ f i , f j ⟩ s ,
where in the second equality, we have noted relation (8).
Together with relation (7), assumption (10) and (12), we have:
⟨ y n + 1 , y n + 1 ⟩ s = ⟨ y n , y n ⟩ s ,
which further implies that (11) holds. This completes the proof. □
Remark 1.
The key in the proposed approach is to add an auxiliary ordinary differential equation. Then, the energy can be rewritten as a quadratic invariant. If the coefficients of a Runge–Kutta method satisfy (10), the method conserves quadratic invariants. For the quadratic-invariants conserving Runge–Kutta methods, we also refer readers to [6,7] or [8] for more details.
Remark 2.
The new system has the same solution as the original problem (1). However, we show that the proposed Runge–Kutta methods are energy-conserving for the ODE system, while the same Runge–Kutta methods cannot generally preserve the energy of the original system (1).
Remark 3.
The theoretical results can be similarly extended to the general Hamilton system of the form:
q ˙ = − H p ( p , q ) , p ˙ = H q ( p , q ) ,
where the Hamiltonian H ( p , q ) represents the total energy of the system. It is easy to confirm that H ( p , q ) = C o n s t , along the solution curves of (13). By the proposed approach, a scalar variable r can always be introduced to modify the energy to a quadratic form. In this way, we have a new modified system by letting y = [ p T , q T , r ] T as follows:
y ˙ = f ( y ) ,
with the energy H ( y ) = ⟨ y , y ⟩ S ˜ , where S ˜ is a symmetric matrix. Then, some symmetrical methods preserve the energy of (14).

3. Numerical Experiments

In this section, we present some numerical results to confirm the theoretical findings.
Example 1.
We consider problem (1) with:
U ( q ) = 2 sin ( q 1 2 ) + 2 cos ( q 2 2 ) + q 3 6 + 20 , L ( q ) = ( 0 , 0 , q 1 2 + q 2 2 ) T , q ( 0 ) = ( 0 , 1 , 0.1 ) T , p ( 0 ) = ( 0.09 , 0.55 , 0.3 ) T .
We let:
r = U ( q ) and e r r o r = H ( p n , q n , r n ) − H ( p 0 , q 0 , r 0 ) .
We solve problems (1) and (2) by using the s-stage Gauss method with the stepsize h = 0.1 . The discrepancies of the discrete energy are shown in Figure 1, where s-Gauss stands for the s-stage Gauss method here and below. Clearly, by solving (2), the discrepancies of the discrete energy are of the order of machine precision. However, by solving (1) with the same stepsize, the discrepancies of the discrete energy depend on the stepsizes and the orders of the methods. Then, we take the stepsize h = 1 / 8000 and consider the obtained numerical solutions as the reference solutions. We test the convergence of the numerical methods and list the maximum errors at t = 1 in Table 1. The results imply that the s-stage Gauss method is of the order of 2 s. These numerical results confirm the theoretical results and effectiveness of the methods.
Figure 1. The discrepancies of the discrete energy for Example 1.
Table 1. The maximum errors at t = 1 and convergence orders for Example 1.
Example 2.
In the second example, we consider (1) with:
U ( q ) = 10 q 1 2 + q 2 2 − 1 , L ( q ) = ( 0 , 0 , q 1 2 + q 2 2 ) T , q ( 0 ) = ( 0 , 1 , 0 ) ⊤ , p ( 0 ) = ( 0.1 , 0.01 , 0 ) T .
The model has an important application in the investigation of the single particle motion in a non-uniform and static electromagnetic field [1,2]. We numerically solve problem (2) by using the s-stage Gauss methods. We show the maximum errors at t = 1 and convergence orders in Table 2, where the reference solutions are obtained by using the stepsize h = 1 / 8000 . Then, we set the stepsize h = π / 10 and solve problem (2) in the time interval [ 0 , 10 3 π ] . Figure 2shows that the motion occurs in the ( q 1 , q 2 ) -plane. Moreover, Figure 3 shows that the discrepancies of discrete energy are of the order of machine precision. We also solved the original problem (1) by using the same s-stage Gauss method. From Figure 3, one can see that the discrepancies of discrete energy depend on the stepsizes and the orders of the methods. The numerical results further confirm the theoretical results of the present paper.
Table 2. The maximum errors at t = 1 and convergence orders for Example 2.
Figure 2. Two-stage (left) and three-stage (right) Gauss methods with stepsize h = π / 10 for Example 2.
Figure 3. The discrepancies of the discrete energy for Example 2.
Example 3.
In the third example, we consider (1) with:
U ( q ) = 2 sin ( q 1 2 + q 2 2 + q 3 2 ) , L ( q ) = 1 2 ( q 2 − q 3 , q 1 + q 3 , q 2 − q 1 ) T , q ( 0 ) = ( 0 , 1 , 0.1 ) T , p ( 0 ) = ( 0.09 , 0.55 , 0.3 ) T .
We numerically solve problem (2) by using the s-stage Gauss methods. We show the maximum errors at t = 1 and convergence orders in Table 3, where the reference solutions are derived by using the stepsize h = 1 / 8000 . Then, we set stepsize h = 0.1 and solve problem (2). Figure 4 further shows that the discrepancies of the discrete energy are again of the order of machine precision. However, by solving the original problem (1) with the same method and stepsize, one can see from the figure that the discrepancies of the discrete energy depend on the stepsizes and the orders of the methods. The numerical results again confirm the theoretical results.
Table 3. The maximum errors at t = 1 and convergence orders for Example 3.
Figure 4. The discrepancies of the discrete energy for Example 3.
Example 4.
The Hénon–Heiles Model is a well-known and frequently used model in certain fields of physics. For example, Hénon–Heiles equations arise in the description of a moving star in the axisymmetric potential of the galaxy. Consider the model mentioned in [7]:
q 1 ˙ = p 1 , q 2 ˙ = p 2 , p 1 ˙ = − q 1 − 2 q 1 q 2 , p 2 ˙ = − q 2 − q 1 2 + q 2 2 ,
with the initial values:
q ( 0 ) = ( 0.1 , − 0.5 ) T , p ( 0 ) = ( 0 , 0 ) T ,
where p i , q i , i = 1 , 2 , are the i-th coordinates of p , q , respectively. This model has the conserved Hamiltonian:
H ( p , q ) = 1 2 ( p 1 2 + p 2 2 + q 1 2 + q 2 2 ) + q 1 2 q 2 − 1 3 q 2 3 .
Using the approach, we let:
r = q 1 2 q 2 − 1 3 q 2 3 + 1 .
We have the new system:
q ˙ 1 = p 1 , q ˙ 2 = p 2 , p ˙ 1 = − q 1 − 2 q 1 q 2 , p ˙ 2 = − q 2 − q 1 2 + q 2 2 , r ˙ = 2 q 1 q 2 p 1 + q 1 2 p 2 − q 2 2 p 2 2 r ,
with the energy:
H ( p , q , r ) = 1 2 ( p 1 2 + p 2 2 + q 1 2 + q 2 2 ) + r 2 − 1 .
Firstly, we numerically solve model (17) by using s-stage Gauss methods. The maximum errors at t = 1 and convergence orders are shown in Table 4, where we obtain the reference solutions by Gauss methods with h = 1 / 8000 .
Table 4. The maximum errors at t = 1 and convergence orders for Example 4.
Secondly, we set stepsize h = 0.1 and solve the model (15) and (17) in the time interval [ 0 , 1000 ] . Figure 5 shows the discrepancies of the discrete energy. We can see that the discrepancies are of machine precision by applying Gauss methods to system (17), while the same methods cannot preserve the energy of the original system (15). One can also see that the discrepancies depend on the orders of methods for the original system.
Figure 5. The discrepancies of the discrete energy for Example 4.
Example 5.
Consider the two-body system:
q ˙ = p , p ˙ = − q | q | 3 ,
where | · | represents the norm in Euclidean space, and the initial values are:
q ( 0 ) = ( 0.9 , 0 ) T , p ( 0 ) = ( 0 , 11 9 ) T .
This system owns the Hamiltonian:
H ( p , q ) = 1 2 ( p 1 2 + p 2 2 ) − 1 | q | .
Letting:
r = 1 | q |
which leads to the new system:
q ˙ = p , p ˙ = − q | q | 3 , r ˙ = − p 1 q 1 + p 2 q 2 2 r | q | 3 ,
with the energy:
H ( p , q , r ) = 1 2 ( p 1 2 + p 2 2 ) − r 2 .
We use different Gauss methods to solve system (20) to test the accuracy of our schemes. We present the maximum errors at t = 1 and the convergence orders with the reference solutions calculated by stepsize h = 1 / 8000 . The corresponding results are shown in Table 5, from which we can see that the accuracy property is held.
Table 5. The maximum errors at t = 1 and convergence orders for Example 5.
Then, we set h = 0.1 and solve (19) and (20) by different Gauss methods. We show the discrepancies of the discrete energy in Figure 6, in which we can see that our schemes are energy-conserving while the same methods are not for the original system.
Figure 6. The discrepancies of the discrete energy for Example 5.

4. Summary

In this paper, some energy-conserving numerical schemes were developed by introducing an auxiliary variable and an auxiliary ordinary differential equation. This approach, as an extension of the scalar auxiliary variable approach, was developed and applied for the charged particle dynamics. The new system has the same solution as the original system. It was shown that some symmetrical methods are energy-conserving for the new system, while the same methods cannot generally preserve the energy of the original system. Our numerical experiments confirmed the theoretical findings. Furthermore, the approach can be extended to other ODE systems or time-dependent partial differential equations.

Author Contributions

Methodology and Software, R.T.; Formal analysis, D.L. Both authors have read and agreed to the published version of the manuscript.

Funding

This work is supported by NSFC. (Grant Nos. 11771162,11971010.)

Institutional Review Board Statement

Not applicable.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Brugnano, L.; Montijano, J.I.; Rández, L. High-order energy-conserving Line Integral Methods for charged particle dynamics. J. Comput. Math. 2019, 396, 209–227. [Google Scholar] [CrossRef] [Scilit]
  2. Qin, H.; Zhang, S.X.; Xiao, J.Y.; Liu, J.; Sun, Y.J.; Tang, W.M. Why is Boris algorithm so good? Phys. Plasmas 2013, 20, 084503. [Google Scholar] [CrossRef] [Scilit]
  3. Li, T.; Wang, B. Efficient energy-preserving methods for charged-particle dynamics. Appl. Math. Comput. 2019, 361, 703–714. [Google Scholar] [CrossRef] [Scilit]
  4. Brugnano, L.; Iavernaro, F.; Zhang, R. Arbitrarily high-order energy-preserving methods for simulating the gyrocenter dynamics of charged particles. J. Comput. Appl. Math. 2020, 380, 112994. [Google Scholar] [CrossRef] [Scilit]
  5. Cao, W.; Li, D.; Zhang, Z. Optimal Superconvergence of Energy Conserving Local Discontinuous Galerkin Methods for Wave Equations. Commu. Comput. Phys. 2017, 21, 211–236. [Google Scholar] [CrossRef] [Scilit]
  6. Sanz-Serna, J.M. Runge-Kutta schemes for Hamilton systems. BIT Numer. Math. 1988, 28, 877–883. [Google Scholar] [CrossRef] [Scilit]
  7. Hairer, E.; Lubich, C.; Wanner, G. Geometric Numerical Integration: Structure-Preserving Algorithms for Ordinary Differential Equations, 2nd ed.; Springer: Berlin/Heidelberg, Germany, 2006. [Google Scholar]
  8. Cooper, G.J. Stability of Runge–Kutta Methods for Trajectory Problems. IMA J. Numer. Anal. 1987, 7, 1–13. [Google Scholar] [CrossRef] [Scilit]
  9. Brugnano, L.; Frasca-Caccia, G.; Iavernaro, F. Line Integral Solution of Hamiltonian. PDEs Math. 2019, 7, 275. [Google Scholar] [CrossRef] [Scilit]
  10. Shen, J.; Xu, J.; Yang, J. The scalar auxiliary variable (SAV) approach for gradient flows. J. Comput. Phys. 2018, 353, 407–416. [Google Scholar] [CrossRef] [Scilit]
  11. Shen, J.; Xu, J.; Yang, J. A New Class of Efficient and Robust Energy Stable Schemes for Gradient Flows. SIAM Rev. 2019, 61, 474–506. [Google Scholar] [CrossRef] [Scilit]
  12. Akrivis, G.; Li, B.; Li, D. Energy–Decaying Extrapolated RK–SAV Methods for the Allen–Cahn and Cahn–Hilliard Equations. SIAM J. Sci. Comput. 2019, 41, A3703–A3727. [Google Scholar] [CrossRef] [Scilit]
  13. Li, D.; Sun, W. Linearly implicit and high-order energy-conserving schemes for nonlinear wave equations. J. Sci. Comput. 2020, 83, 65. [Google Scholar] [CrossRef] [Scilit]
  14. Li, X.; Wen, J.; Li, D. Mass- and energy-conserving difference schemes for nonlinear fractional Schrödinger equations. Appl. Math. Lett. 2021, 111, 106686. [Google Scholar] [CrossRef] [Scilit]
  15. Zhang, H.; Qian, X.; Song, S. Novel high–order energy–preserving diagonally implicit Runge–Kutta schemes for nonlinear Hamiltonian ODEs. Appl. Math. Lett. 2020, 102, 106091. [Google Scholar] [CrossRef] [Scilit]
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Article Metrics

Citations

Article Access Statistics

Multiple requests from the same IP address are counted as one view.