A recent proof-of-principle study proposes a nonlinear electrostatic implicit particle-in-cell (PIC) algorithm in one dimension (Chen, Chacón, Barnes, J. Comput. Phys. 230 (2011) 7018). The algorithm employs a kinetically enslaved Jacobian-free Newton-Krylov (JFNK) method, and conserves energy and charge to numerical round-off. In this study, we generalize the method to electromagnetic simulations in 1D using the Darwin approximation of Maxwell's equations, which avoids radiative aliasing noise issues by ordering out the light wave. An implicit, orbit-averaged time-space-centered finite difference scheme is applied to both the 1D Darwin field equations (in potential form) and the 1D-3V particle orbit equations to produce a discrete system that remains exactly charge-and energy-conserving. Furthermore, enabled by the implicit Darwin equations, exact conservation of the canonical momentum per particle in any ignorable direction is enforced via a suitable scattering rule for the magnetic field. Several 1D numerical experiments demonstrate the accuracy and the conservation properties of the algorithm.
IntrodutionThe electromagnetic (EM) Particle-in-cell (PIC) method solves Vlasov-Maxwell's equations for kinetic plasma simulations [1,2]. In the standard approach, Maxwell's equations are solved on a grid, and the Vlasov equation is solved by method of characteristics using a large number of particles, from which the evolution of the probability distribution function (PDF) is obtained. The field-PDF description is tightly coupled. Maxwell's equations (or a subset thereof) are driven by moments of the PDF such as charge density and/or current density. The PDF, on the other hand, follows a hyperbolic equation in phase space, whose characteristics are determined by the fields self-consistently.To date, most PIC methods employ explicit time-stepping (e.g. leapfrog scheme), which can be very inefficient for long-time, large spatial scale simulations. The algorithmic inefficiency of standard explicit PIC is rooted in the presence of numerical stability constraints, which force both a minimum grid-size (due to the so-called finite-grid instability [1,2], which requires resolution of the smallest Debye length) and a very small timestep (due to the wellknown CFL constraint in the general electromagnetic case, c∆t < ∆x, where c is speed of