An exact particle splitting algorithm for PIC codes

2018/05/16 by Mathieu Drouin, Drouin, Mathieu
Engineering · Computer Science · #Advancements in Photolithography Techniques #Electromagnetic Simulation and Numerical Methods #Image and Object Detection Techniques

paper · pdf · doi:10.48550/arxiv.1805.06540

Abstract

Splitting and merging are long standing issues in PIC codes. I propose a novel algorithm devoted to exact splitting for Particle-In-Cell (PIC) codes relying on Adaptive Mesh Refinement (AMR) grids. AMR grids have - by definition - a constant refinement factor between levels, this strong property combined with B-spline shape functions makes possible exact splitting of macro-particles in space. The proposed exact splitting method is applicable for any integer refinement factor and B-spline shape functions of arbitrary order. Besides, this exact algorithm removes by construction the usual numerical noise increase resulting from approximate particle splitting strategies.

Related

• Particle Control in Phase Space by Global K-Means Clustering
• π-PIC: a framework for modular particle-in-cell developments and simulations
• Moment Preserving Constrained Resampling with Applications to\n Particle-in-Cell Methods
• Structure-preserving geometric particle-in-cell algorithm suppresses finite-grid instability -- Comment on "Finite grid instability and spectral fidelity of the electrostatic Particle-In-Cell algorithm'' by Huang et al
• Particle in Cell (PIC): Error Estimates for Adaptive Grids