Performance and optimization of direct implicit particle simulation
Journal of Computational Physics
An adaptive grid with directional control
Journal of Computational Physics
Accurate numerical solution of charged particle motion in a magnetic field
Journal of Computational Physics
Symmetric spline weighting for charge and current density in particle simulation
Journal of Computational Physics
Particle rezoning for multidimensional kinetic particle-in-cell simulations
Journal of Computational Physics
A simplified implicit maxwell solver
Journal of Computational Physics
Iterative Methods for Sparse Linear Systems
Iterative Methods for Sparse Linear Systems
Journal of Computational Physics
High-order nodal discontinuous Galerkin particle-in-cell method on unstructured grids
Journal of Computational Physics
Journal of Computational Physics
Short Note: Controlling self-force errors at refinement boundaries for AMR-PIC
Journal of Computational Physics
Multi-scale simulations of plasma with iPIC3D
Mathematics and Computers in Simulation
DEMOCRITUS: An adaptive particle in cell (PIC) code for object-plasma interactions
Journal of Computational Physics
Journal of Computational Physics
Particle simulations of space weather
Journal of Computational Physics
Hi-index | 31.45 |
A novel adaptive technique for electromagnetic Particle In Cell (PIC) plasma simulations is presented here. Two main issues are identified as regards the development of the algorithm. First, the choice of the size of the particle shape function in progressively refined grids, with the decision to avoid both time-dependent shape functions and cumbersome particle-to-grid interpolation techniques, and, second, the necessity to comply with the strict stability constraints of the explicit PIC algorithm. The adaptive implementation presented responds to these demands with the introduction of a Multi Level Multi Domain (MLMD) system, where a cloud of self-similar domains is fully simulated with both fields and particles, and the use of an Implicit Moment PIC method as baseline algorithm for the adaptive evolution. Information is exchanged between the levels with the projection of the field information from the refined to the coarser levels and the interpolation of the boundary conditions for the refined levels from the coarser level fields. Particles are bound to their level of origin and are prevented from transitioning to coarser levels, but are repopulated at the refined grid boundaries with a splitting technique. The presented algorithm is tested against a series of simulation challenges.