Numerical charge conservation in Particle-In-Cell codes

Author(s):  
R. Barthelmé ◽  
C. Parzani
2003 ◽  
Vol 156 (1) ◽  
pp. 73-85 ◽  
Author(s):  
T Umeda ◽  
Y Omura ◽  
T Tominaga ◽  
H Matsumoto

2020 ◽  
Vol 86 (3) ◽  
Author(s):  
Alexander S. Glasser ◽  
Hong Qin

In recent years, several gauge-symmetric particle-in-cell (PIC) methods have been developed whose simulations of particles and electromagnetic fields exactly conserve charge. While it is rightly observed that these methods’ gauge symmetry gives rise to their charge conservation, this causal relationship has generally been asserted via ad hoc derivations of the associated conservation laws. In this work, we develop a comprehensive theoretical grounding for charge conservation in gauge-symmetric Lagrangian and Hamiltonian PIC algorithms. For Lagrangian variational PIC methods, we apply Noether’s second theorem to demonstrate that gauge symmetry gives rise to a local charge conservation law as an off-shell identity. For Hamiltonian splitting methods, we show that the momentum map establishes their charge conservation laws. We define a new class of algorithms – gauge-compatible splitting methods – that exactly preserve the momentum map associated with a Hamiltonian system’s gauge symmetry – even after time discretization. This class of algorithms affords splitting schemes a decided advantage over alternative Hamiltonian integrators. We apply this general technique to design a novel, explicit, symplectic, gauge-compatible splitting PIC method, whose momentum map yields an exact local charge conservation law. Our study clarifies the appropriate initial conditions for such schemes and examines their symplectic reduction.


2013 ◽  
Vol 13 (4) ◽  
pp. 1134-1150 ◽  
Author(s):  
Jinqing Yu ◽  
Xiaolin Jin ◽  
Weimin Zhou ◽  
Bin Li ◽  
Yuqiu Gu

AbstractHigh-order interpolation algorithms for charge conservation in Particle-in-Cell (PIC) simulations are presented. The methods are valid for the case that a particle trajectory is a zigzag line. The second-order and third-order algorithms which can be applied to any even-order and odd-order are discussed in this paper, respectively. Several test simulations are performed to demonstrate their validity in two-dimensional PIC code. Compared with the simulation results of one-order, high-order algorithms have advantages in computation precision and enlarging the grid scales which reduces the CPU time.


2020 ◽  
Vol 140 (6) ◽  
pp. 318-324
Author(s):  
Haruki Ejiri ◽  
Takashi Fujii ◽  
Akiko Kumada ◽  
Kunihiko Hidaka

Sign in / Sign up

Export Citation Format

Share Document