An \mathcal{O}(N) Maxwell solver with improved numerical dispersion properties
Yingchao Lu, Chengkun Huang, Patrick Kilian, Fan Guo, Hui Li, Edison, Liang

TL;DR
This paper introduces an (N) Maxwell solver based on finite element methods that enhances numerical dispersion properties in relativistic PIC simulations, suitable for parallel computing and reducing instabilities.
Contribution
It presents a novel finite element Maxwell solver with (N) complexity that improves dispersion accuracy and suppresses numerical instabilities in high-speed plasma simulations.
Findings
Reduces Numerical Cherenkov instability growth rate
Achieves (N) computational complexity
Enhances dispersion properties in relativistic PIC simulations
Abstract
A Maxwell solver derived from finite element method with \mathcal{O}(N) computing cost is developed to improve the numerical dispersion properties in relativistic particle-in-cell (PIC) simulations. The correction of the dispersion relation of the electromagnetic wave is achieved using the neighboring cells via an iteration scheme without decomposing into Fourier modes. The local nature of the communication is ideally suited to massively parallel computer architectures. This Maxwell solver constrains the Numerical Cherenkov instability (NCI) for the ultra-relativistic drifting pair plasma in x direction to large wave vectors for two dimensional grid. The growth rate of NCI is suppressed by using the low pass filtering.
| domain size | , |
|---|---|
| boundary condition | periodic, both in and |
| number of cells | , |
| pseudo-particles per cell | (256 for each species) |
| drift Lorentz factor | |
| temperature | |
| time step | |
| particle shape | 1th, 2nd, 4th order B-spline |
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLaser-Plasma Interactions and Diagnostics · Magnetic confinement fusion research · Astrophysics and Cosmic Phenomena
An Maxwell solver with improved numerical dispersion
properties
Yingchao Lu
Theoretical Division, Los Alamos National Laboratory, Los Alamos, New Mexico, 87545, USA
Department of Physics and Astronomy, Rice University, Houston, Texas 77005, USA
Chengkun Huang
Patrick Kilian
Fan Guo
Hui Li
Edison Liang
Abstract
A Maxwell solver derived from finite element method with computing cost is developed to improve the numerical dispersion properties in relativistic particle-in-cell (PIC) simulations. The correction of the dispersion relation of the electromagnetic wave is achieved using the neighboring cells via an iteration scheme without decomposing into Fourier modes. The local nature of the communication is ideally suited to massively parallel computer architectures. This Maxwell solver constrains the Numerical Cherenkov instability (NCI) for the ultra-relativistic drifting pair plasma in direction to large wave vectors for two dimensional grid. The growth rate of NCI is suppressed by using the low pass filtering.
keywords:
Particle-in-cell, Numerical Cherenkov instability, Maxwell solver
1 Introduction
Particle-in-cell (PIC) method[2] is widely used for the simulations of plasma dynamics ranging from Laser Plasma Accelerators (LPAs) to collisionless astrophysical problems. The traditional Yee scheme[15] introduces a resonance between the beam and electromagnetic (EM) wave, which results in numerical Cherenkov instability (NCI) [5]. The resonance is a numerical artifact, which is due to two fundamental properties in the numerical schemes: (1) In the Maxwell solver, the dispersion relation of the vacuum electromagnetic waves deviates from the physical one, i.e. (we call luminous, superluminous, subluminous). (2) The dispersion of the drifting plasma has contribution of aliases[9]. For example, in Yee solver the dispersion is superluminous along any axis but luminous along diagonals and the main beam will intersect at some direction between these two directions for low . This numerical artifact has significant impact on the quality and physical interpretation of relativistic PIC simulations. The numerical instabilities near , once generated, are difficult to be differentiated from the physics modes, which are also near . A numerical scheme without numerical resonance near or suppressing the NCI growth rate resolves the numerical artifact. Several approaches have been proposed to improve the numerical dispersion properties[14, 3, 7, 8, 6, 13, 16, 10], including the optimal choice of time step and spectral solvers.
One approach to minimize the NCI growth rate is achieved by optimal choice of time step, which was found for both energy conserving and momentum conserving scheme by using the analytical formula for the asymptotic growth rate[14]. The asymptotic NCI growth rate is useful for optimizing the numerical dispersion properties of different interpolation schemes and Maxwell solvers.
Another approach to improve the numerical dispersion is to use the spatial Fourier transform based methods, such as Pseudo-Spectral Time Domain (PSTD) algorithms[7, 8, 6]. Those methods can constrain numerical resonance between EM mode and beams to large wave vectors, i.e. no resonance near . The numerical instabilities can then be suppressed by applying low-pass filtering[13]. The non-local nature of communication cost and the computational cost of the spatial Fourier transform algorithms make those methods challenging to scale on massively parallel computers. In the generalized PSTD algorithm[6], the components of the wavevectors can be replaced by the Fourier transforms of finite difference approximations to spatial derivatives on a grid, which reduces the communication cost to local and computational cost to . The mixed FD-FFT solver use 1D FFT only[16] or high order FDTD in one direction only[10]. However, the mixed solver nature in different directions requires correction due to the loss of charge conservation.
In this paper, we aim to develop an alternative numerical scheme on multi-dimensional grid with superluminous numerical dispersion in a large range of including , and with computing cost and only local communication. The discretized set of Maxwell equations without lumping, i.e. keeping the averaging operators, from Eastwood 1991[4] is found to satisfy all our requirements and has been implemented in this work using the EPOCH code[1]. If the charge conserving current deposition is used, the set of equations also conserve the Gauss’s law for electric field, there is no need for divergence cleaning of electric field or correction of the current. The divergence-free nature of the magnetic field is also preserved. In principle, the numerical scheme we develop here can be implemented in any Yee-grid based PIC code and generalized to complex geometries. Our numerical scheme modifies Ampere’s equations, instead of modifying the Faraday equation in the finite-difference time-domain (FDTD) method[3].
This paper is organized as follows. The algorithm for solving Maxwell equations and the dispersion properties of the numerical electromagnetic waves in vacuum are described in Sec 2. The NCI growth rate for drifting pair plasma is discussed in Sec 3, following the analytical technique in Xu 2013[14]. The numerical experiments are carried out to confirm the two dimensional EM dispersion relation and the NCI growth rate in Sec 4.
2 Maxwell Solver
In Eastwood [4], the coupled relativistic Vlasov-Maxwell set of equations are derived using finite elements in both space and time. Their finite element derivations are suitable for complex geometries. In this paper, we solve the Vlasov-Maxwell equation on uniform rectangular grid by using Faraday and Ampere’s equations from Eastwood, without modifying other modules from the usual finite difference PIC, i.e., force interpolation, current deposition and particle pusher. The discretized Faraday equations from Eastwood 1991 can be generalized to 3D
[TABLE]
and the Ampere’s equations are
[TABLE]
and the Gauss’s law for electric field and magnetic field
[TABLE]
where difference operators , , , and averaging operators , , , respectively act on the spatial indices , , and time step index :
[TABLE]
and similarly for and on index , and for and on index , and for and on the index . The product of two averaging operators and is abbreviated as , similarly for averaging operators in other directions. All the indices can be integers or half integers, depending on the staggered directions of the grid and time step. As derived from finite element method[4], the averaging stencil is for spatial grid in all three spatial dimensions and also for time step. The variables for electric field , magnetic field and current density are defined either at grid point or has a half-grid offset, on integer or half-integer time step, as same as in the Yee scheme. The whole set of discrete variables is
[TABLE]
where , , , are integers. By lumping the averaging operators, in Eqs(1) to Eq(6), we recover the discretized equations for Yee solver. In the numerical scheme we use in this work, we keep those averaging operators instead of lumping them in order to achieve the desired numerical dispersion properties.
By performing Fourier transform on Eqs(1) to (6), assuming that all the variables have form, the difference and averaging operators can be written in terms of frequency or wave vector
[TABLE]
and similarly for , where is the grid size in direction, is the time step. The Eqs(1) to (6) in Fourier space can be written as
[TABLE]
where
[TABLE]
[TABLE]
By multiplying on Eq(15) and using Eq(14) to eliminate , we get
[TABLE]
We define the vacuum part of dielectric tensor by , then the matrix elements of can be written down
[TABLE]
By lumping the averaging operators, i.e. letting and in Eq(20), the vacuum dielectric tensor for Yee solver is recovered.
It is derived in Appendix A that Eq(7) is conserved automatically if it is fulfilled at the initial condition and a charge conserving current deposition scheme is used. And Eq(8) is conserved if it is fulfilled at the initial condition.
2.1 Dispersion relation for EM waves in vacuum
In vacuum we have zero current , the dispersion relation of EM waves can be obtained by calculating the determinant of the dielectric tensor
[TABLE]
The mode represents the background field while the other root of represents the EM mode. Thus we obtain the vacuum EM wave dispersion relation
[TABLE]
We define the function to be
[TABLE]
Then Eq(28) becomes
[TABLE]
For numerical stability, the frequency must be real which, by Eq(30) implies the same time step constraint as Yee solver
[TABLE]
The detail derivation of Eq(31) is in Appendix B. For , we expand the phase speed to second order in
[TABLE]
From Eq(32) we derive in Appendix B that the EM mode for sufficiently small always has phase speed larger than or equal to , i.e. the speed of light, so the resonance between EM mode and unaliased plasma beam with any physical speed cannot be located near .
For a two-dimensional grid, we can write down the dispersion relation of the EM mode, the CFL limit of time step and the expansion of phase speed in the similar way
[TABLE]
[TABLE]
[TABLE]
For the the case, we plot the phase velocity in space for different values of time step in Fig. 1.
In the 2D or 3D case for , the phase speed is constant and equals to along the diagonal of the first Brillouin zone, i.e. in 3D case and in 2D case. For or off-diagonal direction, the second order term in Eq(32) and (33) is always larger than zero, thus is larger than for sufficiently small .
2.2 Numerical iteration scheme
2.2.1 Equations for three dimensional case
Updating is fully explicit by using Eqs(1) to (3). However, Eqs(4) to (6) contain the time averaging operator on the L.H.S., which require the field at a previous step and a future step. This requirement can be eliminated by substituting Eq(1) to (3) into the averaging operators. For example, the time averaging of can be written as
[TABLE]
where we used Eq(3) in the derivation. Similarly we can write down the time averaging of as
[TABLE]
Substituting Eq(36) and (37) into the time averaging terms in Eq(4), we obtain
[TABLE]
where is the index for th time step. If we define the auxiliary variable such that
[TABLE]
then we can simplify Eq(38) to be
[TABLE]
The equations for the auxiliary variables are similar in and directions
[TABLE]
And the change of electric field vector from th step to th step and the change of the auxiliary vector satisfy the linear transform
[TABLE]
The matrix elements of can then be written down
[TABLE]
[TABLE]
where we define the dimensionless operator to be the value difference between the right cell and left cell in direction
[TABLE]
and similarly for and directions. with multiple indexes represents the abbreviation of multiplication, e.g. and .
To update the electric field, we first compute the change of auxiliary field explicitly by using Eqs(40) to (42). Then the change of the electric field can be obtained by solving Eq(43) and the electric field is updated simply by the increment . To solve for by Eq(43), we propose to use the iteration method listed in Alg 1. We prove in Appendix C that the infinity norm of matrix is always less unity in 1D and 2D case. For 3D case, the infinity norm of is less than unity if . In the 3D and case the infinity norm of matrix is always less than because . Thus the iteration in Alg 1 always converges to the exact solution. Further more the infinity norm or eigenvalues of matrix does not depend on the number of cells on the mesh, which implies that the speed of convergence is not dependent on the size of the problem.
For several reasons, we propose to use a predetermined number for the number of iterations instead of determine during the iterations, (1) calculating the norm and determine requires a global reduction and broadcasting among processors (2) keeping fixed number of iterations can keep the consistency of the error of dispersion relation throughout all time steps (3) fixed number of iterations is sufficient for reducing the error, e.g. Fig. 2(a) shows that for and case, 20 iterations are sufficient to keep the low error for numerical dispersion relation, especially for the modes near . The precondition for the matrix or relaxation method can be used to accelerate the convergence and will be subjects of future reports.
The computational cost of the solver is where is the number of cells. For each iteration, the new quantity (subscript in parentheses for iteration step, not time step or spatial grid) only depends on the old quantity at the nearest neighbor and next nearest neighbor cells, so that in the domain decomposed mesh, the communication is local, i.e. communication only needed to get the quantities at the adjacent cells. Our Maxwell solver needs slightly more memory than Yee solver due to the auxiliary field variables. Comparing to the global FFT-based solvers, where the computing cost is and the requirement for communication is non-local, our algorithm is less computational expensive and more scalable. In Fig. 2(b), we show the weak-scaling performance of our solver by testing without particles, for 100 time steps. Each processor resolves a grid, regardless of what number of processors is used. The runtime only increases from 14.32 seconds for to 15.75 seconds for , which implies that the slowdown of the speed is only and the scaling of the solver is close to .
2.2.2 Equations for two dimensional case
The Maxwell equations on two dimensional grid in plane can be written down by setting and in Eqs(1) to (3) and (40) to (42). We obtain
[TABLE]
The matrix elements of on two dimensional grid in plane can be written down by setting in Eqs(44) to (49). We obtain
[TABLE]
Using Alg 1, and need to be solved simultaneously because , but can be solved independent of and .
2.2.3 Equations for one dimensional case
The Maxwell equations on one dimensional grid in direction can be written down by setting and in Eqs(51) to (56). We obtain
[TABLE]
The matrix elements of on one dimensional grid in direction can be written down by setting in Eqs(57) to (61). We obtain
[TABLE]
Using Alg 1, and can be solved independently and there is no need to solve for because .
3 NCI growth rate
For a cold plasma drifting with ultra-relativistic velocity , we derive in Appendix E the NCI growth rate following Xu 2013[14]. In two dimensional grid in plane, the asymptotic expression for NCI growth rate is
[TABLE]
where is the relativistic electron plasma frequency. The notation with subscript is for the interpolation functions for the corresponding component of , and . The averaging operators in Fourier space is given in Eq(11) and in Eq(16). The , , , are defined in Eqs(132) to (135). The growth rate is only nonzero for the condition that sits near the EM modes and beam modes
[TABLE]
For our momentum conserving scheme we have
[TABLE]
where
[TABLE]
Thus
[TABLE]
4 Numerical verifications
We implement our Maxwell solver in the PIC code EPOCH 2D[1], where we use the default Boris particle push and the options for particle shapes in the code. We use iterations for solving Eq(43).
4.1 2D dispersion relation for electromagnetic wave
To initialize the simulation, we only put a point source in one cell of the two dimensional domain, so that the spatial Fourier transform of field in the initial frame is nonzero for all wavevectors. In the simulations, we use , and number of cells . The time step is . And the simulation is run for . No particles are loaded in this test. In the post-processing, the discrete Fourier transform is performed for electric field in both space and time to test the numerical dispersion relation. To make the data periodic in time before the discrete Fourier transform, we apply the Hann window function
[TABLE]
The numerical value of the frequency for each ) is calculated to be the weighted value of in the discrete Fourier transform, i.e,
[TABLE]
where is the discrete Fourier transform of , is the discretized frequency in the discrete Fourier transform, and is the discretized wavevector. Since is always real-valued, the transform in satisfies , thus it is sufficient to calculate the components. The results for phase velocities in the numerical tests are plotted in Fig. 1 (d) to (f) against the phase velocities calculated from Eq(34). The results of numerical experiments are consistent with Eq(34) for , which suggests that the number of iterations is sufficient. The EM wave at high becomes more superluminal, i.e. larger , for smaller time steps.
4.2 Location of NCI in space and growth
rate
We carry out numerical tests to verify the location of NCI in space and compare the growth rate in the test runs with the analytical expression in Eq(77). In our test runs, a pair plasma is initialize with a drifting speed in direction. And the Lorentz factor is . The numerical parameters of the test runs are listed in Table 1. We use the method in [17] to load the particles with relativistic shifted-Maxwellian distribution, which takes care of the spatial part of the transformation , and the acceptance efficiencies are 50% for generic cases and 100% for symmetric distributions. We use momentum conserving scheme for field interpolation and current deposition in our simulations.
The locations of NCI resonance modes in space are computed by solving Eq(71) and (72) for the main beam and first order aliasing beam , as shown in Fig. 3 (a), where is the index for aliasing beam as in Eq(121). The smallest value of in the NCI modes is plotted in Fig. 3(e), showing that if only resonance exists, if both and resonance exist. However, the simulation shows that the dominant NCI mode is from the resonance which indicates that an effective method to suppress such resonance is desired. The location of NCI modes is bounded by for all the valid time step . The NCI modes in the numerical experiments are visualized in Fig. 3 (b)-(d) by plotting the spatial Fourier transform of the out-of-plane magnetic field. The locations of NCI in space are consistent between the theory and the numerical experiments as shown in Fig. 3 (f)-(h). The growth rate in Eq(77) is essentially zero on axis, which is also seen in Fig. 3 (b)-(d). There is no higher order aliasing , as solved by using Eq(71) and (72).
In the test runs for drifting pair plasma, the fastest growing NCI mode will dominate in the growth of the total field energy, thus the growth rate for the amplitude of the fastest growing NCI mode is half of the growth rate for the total field energy for WKB approximation. The growth rate of the fastest growing NCI mode can be calculated by maximizing Eq(77) over or . We calculate the growth rate of the fastest growing NCI mode, i.e. the most unstable NCI mode, as shown in the curves in Fig. 3(i). In the same figure, we also show the growth rate calculated from the numerical experiments by calculating half of the growth rate of total field energy. Using high order B-spline particle shape significantly reduces the NCI growth rate, although more computational cost is required. The trend of the NCI growth rate are consistent between the analytical expression and the numerical results.
For the case, we use the low pass filtering with our solver and make the comparison with Yee solver, as shown in Fig. 4. The growth rate of NCI is significantly suppressed as shown in Fig. 4(a) and (c).
5 Conclusions and discussions
We demonstrate that the Maxwell solver from Eastwood[4] has several good numerical properties that allow for the efficient mitigation of NCI. The dispersion relation is always superluminal in a large range of including , thus the NCI resonance are separated from the physical modes in space. There is only high NCI mode, i.e. for and NCI. Those high modes can be suppressed by applying a low-pass filter on the current during the simulation. An alternative approach to deal with the high mode is to post-process the fields and currents with a low-pass filter after the simulation. Although our algorithm requires solving linear equations using an iteration method, it is local, of computational cost and scalable for multi-dimensional simulation applications, which has advantage over the methods based on spatial Fourier transform. This solver also possess conservation properties such that no correction scheme is needed. The examples in this paper are using 2D grid, but our implementation and discussions on the numerical properties can be generalized to 3D grid. The averaging stencil we used in this work is . Another stencil can be potentially found to further improve the numerical properties. The rate of convergence may also be improved by using more optimized iteration scheme. These further improvements and generalizations will be subjects of future reports.
The Maxwell solver we developed was derived from finite element method in Eastwood 1991[4]. The particle pusher we use is the Boris push, which conserves the phase space volume for particles. If we derive the particle pusher using the finite element method in Eastwood 1991, then the particle pusher should be implicit. By the combination of that implicit particle pusher and the Maxwell solver we used in this work, the numerical solution of all the particle and field variables should strictly satisfy the minimal action principle and has better conservation properties than traditional PIC methods. As we learned from Eastwood 1991, the numerical conservation laws can be well defined and without error terms in the finite element method. With finite element methods, we can potentially construct numerical schemes which is structure preserving for both particles and fields in the relativistic case, as an alternative approach to the method derived from Hamiltonian for the non-relativistic case[12]. Further more, the finite element PIC is suitable for complex geometries.
6 Acknowledgements
Research presented in this paper was supported by the Center for Space and Earth Science(CSES) program and Laboratory Directed Research and Development(LDRD) program of Los Alamos National Laboratory(LANL). The simulations were performed with LANL Institutional Computing which is supported by the U.S. Department of Energy National Nuclear Security Administration under Contract No. 89233218CNA000001, and with the Extreme Science and Engineering Discovery Environment (XSEDE), which is supported by National Science Foundation(NSF) grant number ACI-1548562.
Appendix A Conservation of the divergence of the fields
Starting from the L.H.S of Eq(8) and apply on it, and using Eqs(1) to (3), we obtain
[TABLE]
Thus Eq(8) is conserved during the evolution as long as it is conserved initially.
The time evolution of the difference between the L.H.S of Eq(7) can be calculated by using Eqs(4) to (6) and the continuity equation for charge conserving deposition scheme
[TABLE]
We obtain
[TABLE]
where the last step requires the use of a charge-conserving current deposition scheme. Thus Eq(7) is conserved during the evolution as long as it is conserved initially and the charge conserving deposition scheme is used. If one does not use a charge-conserving current deposition scheme, then the correction for the the Gauss’s law for electric field is needed, otherwise the finite grid instability can grow due to the loss of charge conservation[11].
Appendix B Derivation for the limit of time step and the superluminal property
of dispersion relation
For real value of , the function satisfies From Eq(30) we need for real that
[TABLE]
So
[TABLE]
And needs to be less or equal to the minimum value on the R.H.S, which is reached when , thus we get Eq(31)
[TABLE]
The 2D case can be derived in the same way.
From (32) we have
[TABLE]
Using Eq(31) we have
[TABLE]
Using Cauchy inequality and letting , , , , , , then the R.H.S of Eq(87) is greater than or equal to zero, thus we have . For the L.H.S. of Eq(87) to be equal to zero, we need and , i.e. . The 2D case can be derived in the same way.
Appendix C Derivation of the inequality for infinite norm of matrix
The infinite norm of matrix is simply the maximum absolute row sum of the matrix. The absolute row sum is . The operators , etc are diagonalized in Fourier space, thus it is convenient to analyze the properties of matrix in Fourier space. In Fourier space satisfies . Similarly, and . And satisfy . Similarly, and . Thus
[TABLE]
We use Eq(31), which makes , , and The maximum of is 0 when , thus . Using \bigg{|}\bar{D}_{zx}\bigg{|}\leq 4, \bigg{|}\bar{D}_{xy}\bigg{|}\leq 4 we have
[TABLE]
Thus for the absolute row sum
[TABLE]
The R.H.S. of Eq(91) is monotonic in and as derived in Appendix C.1, and reaches maximum when , thus
[TABLE]
When we have . Similarly, we have if and we have if . Thus the infinite norm of matrix is less than if . In the case the infinite norm of matrix is always less than because .
For 2D case, from Eqs(57) to (61) we have
[TABLE]
Similarly we can prove . And
[TABLE]
For 1D case we have
[TABLE]
To calculate the speed of convergence of the iteration, we need to compute the eigenvalues of matrix . We derive in Appendix D how the error of the dispersion relation depends on the number of iterations. For symmetric matrix , the absolute value of eigenvalue is always smaller or equal to the infinity norm, thus and is invertible if the infinity norm is less than 1.
C.1 Derivation of the inequality for the infinite norm of
in 3D
The R.H.S of Eq(91) can be written as
[TABLE]
where the constants , , , , are
[TABLE]
and the variables and satisfy and . By take the derivative of w.r.t and we can check the monotonicity, e.g.
[TABLE]
Since \big{(}1-\frac{c^{2}\Delta t^{2}}{\Delta y^{2}}-\frac{c^{2}\Delta t^{2}}{\Delta z^{2}}\big{)}>0, reaches minimum at
[TABLE]
Thus increases as increases. Similarly increases as increases.
Appendix D Speed of convergence and error term for iteration
We constrain the derivation to the case where the infinity norm of matrix is less than 1, which is always true in 1D or 2D. Using finite number of iterations for Alg 1, we have the error term, which is the difference between the increment electric field we get after iterations and after infinite number of iterations
[TABLE]
where we used in the last step
[TABLE]
which is true for the exact solution in Eq(43). Thus by mathematical induction from Eq(100) we have
[TABLE]
where we used in the last step. Multiply Eq(102) on the left by and use Eq(101), we obtain
[TABLE]
Thus
[TABLE]
Because the eigenvalue of matrix has , Eq(104) always converge to with . Since Eq(104) holds for each time step, we have
[TABLE]
From the Fourier transform of Eqs(40) to (42), we obtain
[TABLE]
where
[TABLE]
is the spatial averaging operator and is the frequency of electromagnetic wave with iterations. In Eqs(1) to 3, we use as an approximation for to update , thus
[TABLE]
From Eqs(105) and (106) and (108) we can eliminate and and get the equation for
[TABLE]
For
[TABLE]
If is a eigenvector of with eigenvalue , then from Eq(105) we know that both and are eigenvectors of with eigenvalue . By comparing Eq(109) and Eq(110) we obtain
[TABLE]
where is the frequency of electromagnetic wave with infinite number of iterations, which is given by Eq(28). We can rewrite Eq(111) as
[TABLE]
With sufficient number of iterations, is close to , thus
[TABLE]
For each set of , has three eigenvalues . And are functions of . Let be the eigenvalue with the largest absolute value among , i.e. , then with sufficient number of iterations the dominant error term for dispersion relation is
[TABLE]
Appendix E Asymptotic NCI growth rate
Following the derivation in Xu 2013[14], we derive the asymptotic expression for NCI growth rate in 2D. We use the relativistic electron plasma frequency instead of the expression . The definition of with has physical meaning of the oscillation frequency in cold drifting plasma. Eq(10) in Xu 2013 and Eq(20) in this paper are the same for the R.H.S, but on the L.H.S of Eq(20) in this paper, the vacuum dielectric tensor are different from Xu 2013 and is written down in Eqs(21) to (26). In this paper we have written down in Eq(16). The dielectric tensor for the current part of drifting plasma is same as that in Xu 2013. We ignore high order terms in , in limit
[TABLE]
where
[TABLE]
are the aliased frequency and wavevector, the interpolation functions have dummy variables with aliasing wavevector. We expand around the beam resonance and write , where is a small term. Denoting as the numerator we can write as
[TABLE]
Using and only keeping and terms, we can obtain
[TABLE]
where
[TABLE]
Now we use the condition that sits near the EM modes
[TABLE]
and expand the finite difference operator , and where
[TABLE]
[TABLE]
and then we further expand to first order in , since this term is sensitive near the EM mode, while only keeping the zeroth order of in and
[TABLE]
We then obtain a cubic equation, we can drop the small term
[TABLE]
So the growth rate
[TABLE]
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1Arber et al. [2015] T D Arber, K Bennett, C S Brady, A Lawrence-Douglas, M G Ramsay, N J Sircombe, P Gillies, R G Evans, H Schmitz, A R Bell, and C P Ridgers. Contemporary particle-in-cell approach to laser-plasma modelling. Plasma Physics and Controlled Fusion , 57(11):113001, sep 2015. doi: 10.1088/0741-3335/57/11/113001 .
- 2Birdsall [1991] C.K. Birdsall. Particle-in-cell charged-particle simulations, plus monte carlo collisions with neutral atoms, PIC-MCC. IEEE Transactions on Plasma Science , 19(2):65–85, apr 1991. doi: 10.1109/27.106800 .
- 3Blinne et al. [2018] Alexander Blinne, David Schinkel, Stephan Kuschel, Nina Elkina, Sergey G. Rykovanov, and Matt Zepf. A systematic approach to numerical dispersion in maxwell solvers. Computer Physics Communications , 224:273–281, mar 2018. doi: 10.1016/j.cpc.2017.10.010 .
- 4Eastwood [1991] James W. Eastwood. The virtual particle electromagnetic particle-mesh method. Computer Physics Communications , 64(2):252–266, may 1991. doi: 10.1016/0010-4655(91)90036-k .
- 5Godfrey [1974] Brendan B Godfrey. Numerical cherenkov instabilities in electromagnetic particle codes. Journal of Computational Physics , 15(4):504–521, aug 1974. doi: 10.1016/0021-9991(74)90076-x .
- 6Godfrey and Vay [2015] Brendan B. Godfrey and Jean-Luc Vay. Improved numerical cherenkov instability suppression in the generalized PSTD PIC algorithm. Computer Physics Communications , 196:221–225, nov 2015. doi: 10.1016/j.cpc.2015.06.008 .
- 7Godfrey et al. [2014 a] Brendan B. Godfrey, Jean-Luc Vay, and Irving Haber. Numerical stability analysis of the pseudo-spectral analytical time-domain PIC algorithm. Journal of Computational Physics , 258:689–704, feb 2014 a. doi: 10.1016/j.jcp.2013.10.053 .
- 8Godfrey et al. [2014 b] Brendan B. Godfrey, Jean-Luc Vay, and Irving Haber. Numerical stability improvements for the pseudospectral EM PIC algorithm. IEEE Transactions on Plasma Science , 42(5):1339–1344, may 2014 b. doi: 10.1109/tps.2014.2310654 .
