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

Research output: Contribution to journalArticleAcademicpeer-review

29 Citations (Scopus)

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, in which two particles are combined 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. We also compare their performance in the simulation of the two-stream instability. (C) 2013 Elsevier Inc. All rights reserved.
Original languageEnglish
Pages (from-to)318-330
Number of pages13
JournalJournal of Computational Physics
Volume259
DOIs
Publication statusPublished - 15 Feb 2014

Keywords

  • Adaptive particle management
  • Coalescence
  • K-d tree
  • Macro-particle
  • Particle in cell
  • Particle simulations
  • Super-particle

Fingerprint

Dive into the research topics of 'Controlling the weights of simulation particles : adaptive particle management using k-d trees'. Together they form a unique fingerprint.

Cite this