Ray tracing method is an important tool of studying wave propagation in plasma. The ray tracing equations are Hamiltonian and usually calculated by traditional Runge-Kutta-Fehlberg method. Symplectic geometric structure of Hamiltonian system is not considered in Runge-Kutta-Fehlberg method. In order to preserve the symplectic geometric structure of Hamiltonian system, symplectic geometric algorithm is used to solve ray tracing equations. In a calculation example, the propagation trajectories of waves in non-magnetized plasmas are calculated by using the symplectic geometric algorithm, and the results are compared with those obtained by Runge-Kutta-Fehlberg algorithm. The results show that the symplectic geometric algorithm has a unique advantage in maintaining the propagation trajectory and dispersion function value.
Feng and his coworkers created the symplectic geometric algorithms for Hamiltonian systems, according to geometric structure of Hamiltonian systems [1, 2, 3, 4, 5, 6, 7]. Compared to the traditional algorithm, the symplectic geometric algorithm can keep the geometric structure unchanged. Theoretical and numerical analysis showed that the symplectic geometric algorithm is an effective method to simulate the long-term behavior of Hamiltonian systems [8, 9].
Ray tracing is a geometric optics approximation [10], in which the parameters of the medium are assumed to change little in a wavelength. In one dimension case it means that , A is some parameter of the medium. The ray tracing technique is based on the WKB approximation, which holds as long as the amplitude is slowly varying.The field strength of the wave can be seen as consisting of two parts: the first part is slowly changing amplitude,and the other part is fast changing phase. This method is widely used to study the propagation of radio waves in plasma [11, 12, 13, 14, 15, 16, 17, 18]. When the waves propagating in the plasma are slightly disturbed and the plasma waves are linearly absorbed or without absorption, the ray trajectory equations have a Hamiltonian form. The usual method for solving the Hamiltonian ray trajectory equation is the Runge-Kutta-Fehlberg method. Hereinafter referred to as RKF method. The traditional RKF method does not take into account the symplectic geometric structure of the Hamiltonian system, and the difference scheme does not guarantee that the transformation between two steps is symplectic. In this paper, the general form of the implicit symplectic difference scheme for ray tracing equation is derived, and the advantage of symplectic geometric algorithm over a traditional algorithm is shown by a calculation example.
Symplectic difference schemes of ray tracing equation in non-magnetized plasma
Let D be the wave’s dispersion function, D is 0 at any point on the ray trajectory. D can be written as D (, , , ), where is the wave vector, represents spatial position on the ray trajectory, is the wave frequency, is propagation time. The ray tracing equations can be written as:
Equations (1) and (2) are Hamiltonian form, the dispersion function D is Hamiltonian. In non-magnetized plasma, the dispersion relationship of transverse wave is
means particle species in plasma, usually including electrons and more than one species of positive ion. denotes the oscillation frequency of species particles, it is called plasma frequency. is the particle density, is the particle mass, is the particle charge, is The dielectric constant in vacuum. For high frequency waves, only the response of electrons to waves is considered. The response of ions to waves is not considered. So the dispersion relation of the transverse wave can be simplified as
In the propagation without considering the nonlinear effect, the wave frequency remains a constant. Then the Hamiltonian in Eqs (8) and (9) can be written as
According to symplectic geometric algorithms, the implicit symplectic difference scheme of the above equations can be constructed [19]. Such as the fourth order implicit symplectic difference scheme is
Arbitrary even order accuracy can be obtained by using the symplectic geometrical algorithm. There is no even power of time step in the implicit difference scheme. This greatly simplifies the calculation and increases the speed of operation. The generating function is odd about time step [20], so there is no even term of time step in the expansion of the generating function.
Position deviation changes over time.
Calculation example
In the two-dimensional case, the electron density profile of non-magnetized plasma is assumed to be
where and are constants. Then the transverse wave dispersion function is
Related physical quantities are normalized, , , , , , , . Thus the normalized differential equations are written as
The initial conditions are
Wave vector deviation changes over time.
The dispersion function value changes over time in symplectic geometric method.
The dispersion function value changes over time in RKF method.
From the analytical solution, we can see that the propagation path of this beam is a circle. Figure 1 shows the position deviations between the analytical solution, and the propagation trajectory obtained by using the fourth-order symplectic difference scheme and the RKF scheme. The position deviation is defined as where the subscript ncrepresents the results obtained by using the fourth-order symplectic difference scheme and the RKF scheme. The subscript ana represents the analytical solution. From Fig. 1 it can be seen that the trajectory deviation calculated by the symplectic difference scheme increases linearly with time, and the trajectory deviation calculated by the RKF scheme increases non-linearly with time. Figure 2 shows the wave vector deviation of the analytical solution and the wave vector obtained by the fourth-order symplectic difference scheme and the RKF scheme. The wave vector deviation is defined as . Figure 2 shows that the wave vector deviation of the results calculated by the symplectic difference scheme increases linearly with time, and the deviation of the results calculated by the RKF scheme increases with time. As time goes on, the advantages of the symplectic difference scheme are becoming more apparent. Figures 3 and 4 show the change of the dispersion function values calculated bysymplectic difference scheme and the RKF scheme respectively over time. In the wave propagation, the dispersion function value is a constant for zero. From these two graphs, it can be seen that the accuracy of the dispersion function value in the symplectic difference scheme is higher 2–3 orders than that in the RKF scheme.In the symplectic difference scheme, the dispersion function value oscillates over time in a small range, ensuring high accuracy of the dispersion function values over a long period of time. In the RKF scheme, the absolute value of dispersion function increases linearly with time, and the dispersion function value cannot be maintained over a long period of time.
Conclusion
By comparing the symplectic geometric algorithm with the traditional numerical algorithm, we can see the advantage of the symplectic geometric algorithm in maintaining the dispersion function value. The symplectic geometric algorithm can maintain a relatively stable dispersion function value. The propagation trajectory calculated by symplectic geometric algorithm has a high degree of credibility. In this paper, the case of non-magnetized plasma is considered. The next step is to consider the application of symplectic geometric algorithm in complex magnetic field.
References
1.
FengK., Journal of Computational Mathematics4(3) (1986), 279–289.
2.
FengK. and QingM.Z., Hamiltonian algorithms for Hamiltonian systems and a comparative numerical study, Computer Physics Communications65 (1991), 173–187.
3.
FengK., Formal power series and numerical algorithms for dynamical systems, Series on Applied Mathematics1 (1991), 28–35.
4.
FengK. and WangD.L., Symplectic difference schemes for Hamiltonian systems in general symplectic structure, Journal of Computational Mathematics9(1) (1991), 86–96.
5.
FengK. and ShangZ., Volume-preserving algorithms for source-free dynamical systems, Numerische Mathematik71(4) (1995), 451–463.
6.
FengK., The calculus of generating functions and the formal energy for Hamiltonian algorithms, Journal of Computational Mathematics16(6) (1998), 481–498.
7.
FengK., The step-transition operators for multi-step methods of ODE’s, Journal of Computational Mathematics16(3) (1998), 193–202.
8.
LiuS.X. et al., The application of symplectic geometric algorithm in a special Chaplygin system, Acta Physica Sinica60(3) (2011), 034501 (in Chinese).
9.
LiuS.X. and DingP.Z., New progress of structure-preserving computation for quantum system, Progress in Physics24(1) (2004), 47–89 (in Chinese).
10.
BernsteinI.B., Geometric optics in space- and time- varying plasmas, Physics of Fluids18(3) (1975), 320–324.
11.
SmirnovA.P. and HarveyR.W., Calculations of the current drive in DIII-D with the GENRAY ray tracing code, Bulletin of the American Physical Society40 (1995), 1837–1842.
12.
YangC. et al., Modelling of the EAST lower-hybrid current drive experiment using GENRAY/CQL3D and TORLH/CQL3D, Plasma Physics and Controlled Fusion56(12) (2014), 125003.
13.
EsterkinA.R. and PiliyaA.D., Fast ray tracing code for LHCD simulations, Nuclear Fusion36(11) (1996), 1501–1512.
14.
McVeyB.D., A ray-tracing analysis of fast-wave heating of tokamaks, Nuclear Fusion19(4) (1979), 461–468.
15.
BaranovY.F. and FedorovV.I., Lower-hybrid wave propagation in tokamaks, Nuclear Fusion20(9) (1980), 1111–1118.
16.
BrambillaM.A. et al., Eikonal description of HF waves in toroidal plasmas, Plasma Physics24(10) (1982), 1187–1218.
17.
BonoliP., Linear theory of lower hybrid heating, IEEE Transactions on Plasma Science12(2) (1984), 95–107.
18.
CasolariA. and CardinaliA., Analysis of the chaotic behavior of the lower hybrid wave propagation in magnetised plasma by hamiltonian theory, Entropy18(5) (2016), 175.
19.
FengK. and QingM.Z., Symplectic geometric algorithms for Hamiltonian system, Zhejiang Science & Technology Press 2003, 222–227. (in Chinese).
20.
FengK., Construction of canonical difference schemes for Hamiltonian formalism via generating functions, Journal of Computational Mathematics7(1) (1989), 71–96.