Controlling the weights of simulation particles: adaptive particle management using k-d trees

DOI10.1016/J.JCP.2013.12.005zbMATH Open1349.76740arXiv1301.1552OpenAlexW2101294528MaRDI QIDQ348706FDOQ348706

Jannis Teunissen, Ute Ebert

Publication date: 5 December 2016

Published in: Journal of Computational Physics (Search for Journal in Brave)

Abstract: In particle simulations, the weights of particles determine how many physical particles they represent. Adaptively adjusting these weights can greatly improve the efficiency of the simulation, without creating severe nonphysical artifacts. We present a new method for the pairwise merging of particles. Pairwise merging reduces the number of particles by combining two particles into one. To find particles that are `close' to each other, we use a k-d tree data structure. With a k-d tree, close neighbors can be searched for efficiently, and independently of the mesh used in the simulation. The merging can be done in different ways, conserving for example momentum or energy. We introduce probabilistic schemes, which set properties for the merged particle using random numbers. The effect of various merge schemes on the energy distribution, the momentum distribution and the grid moments is compared.

Full work available at URL: https://arxiv.org/abs/1301.1552

Recommendations

• Adaptive particle management in a particle-in-cell code
• Parallel load-balanced particle simulation with hierarchical particle grouping strategies
• Dynamic and selective control of the number of particles in kinetic plasma simulations
• Particle merging algorithm for PIC codes
• Octree particle management for DSMC and PIC simulations

zbMATH Keywords

coalescenceparticle in cell\(k\)-d treeadaptive particle managementmacro-particleparticle simulationssuper-particle

Mathematics Subject Classification ID

Probabilistic methods, particle methods, etc. for boundary value problems involving PDEs (65N75) Particle methods and lattice-gas methods (76M28) Statistical mechanics of plasmas (82D10)

Cites Work

• A PIC-MCC code for simulation of streamer propagation in air
• Title not available (Why is that?)
• Title not available (Why is that?)
• Multidimensional binary search trees used for associative searching
• Dynamic and selective control of the number of particles in kinetic plasma simulations
• A new method for coalescing particles in PIC codes.
• Particle rezoning for multidimensional kinetic particle-in-cell simulations
• Adaptive particle management in a particle-in-cell code
• Method to increase the simulation speed of particle-in-cell (PIC) code
• Control of the number of particles in fluid and MHD particle in cell methods
• Spatially hybrid computations for streamer discharges. II: Fully 3D simulations

Cited In (10)

• A velocity space hybridization-based Boltzmann equation solver
• A new method to dispatch split particles in particle-in-cell codes
• Parcel-number-density control algorithms for the efficient simulation of particle-laden two-phase flows
• Particle merging algorithm for PIC codes
• An improved stochastic weighted particle method for boundary driven flows
• Octree particle management for DSMC and PIC simulations
• Moment preserving constrained resampling with applications to particle-in-cell methods
• FLEKS: a flexible particle-in-cell code for multi-scale plasma simulations
• A performant energy-conserving particle reweighting method for particle-in-cell simulations
• A Fast Solver for Implicit Integration of the Vlasov--Poisson System in the Eulerian Framework

Uses Software

• PIC-MCC
• KDTREE

This page was built for publication: Controlling the weights of simulation particles: adaptive particle management using \(k\)-d trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q348706)