The Convergence of Particle-in-Cell Schemes for Cosmological Dark Matter Simulations
arXiv:1503.05969 · doi:10.3847/0004-637X/816/2/56
Abstract
Particle methods are a ubiquitous tool for solving the Vlasov-Poisson equation in comoving coordinates, which is used to model the gravitational evolution of dark matter in an expanding universe. However, these methods are known to produce poor results on idealized test problems, particularly at late times, after the particle trajectories have crossed. To investigate this, we have performed a series of one- and two-dimensional "Zel'dovich Pancake" calculations using the popular Particle-in-Cell (PIC) method. We find that PIC can indeed converge on these problems provided the following modifications are made. The first modification is to regularize the singular initial distribution function by introducing a small but finite artificial velocity dispersion. This process is analogous to artificial viscosity in compressible gas dynamics, and, as with artificial viscosity, the amount of regularization can be tailored so that its effect outside of a well-defined region - in this case, the high-density caustics - is small. The second modification is the introduction of a particle remapping procedure that periodically re-expresses the dark matter distribution function using a new set of particles. We describe a remapping algorithm that is third-order accurate and adaptive in phase space. This procedure prevents the accumulation of numerical errors in integrating the particle trajectories from growing large enough to significantly degrade the solution. Once both of these changes are made, PIC converges at second order on the Zel'dovich Pancake problem, even at late times, after many caustics have formed. Furthermore, the resulting scheme does not suffer from the unphysical, small-scale "clumping" phenomenon known to occur on the Pancake problem when the perturbation wave vector is not aligned with one of the Cartesian coordinate axes.
arXiv comment29 pages, 29 figures. Accepted for publication in ApJ. The revised version includes a discussion of energy conservation in the remapping procedure, as well as some interpretive differences in the Conclusions made in response to the referee report. Results themselves are unchanged
References in corpus (20)
- The cosmological simulation code GADGET-2
- Cosmological Hydrodynamics with Adaptive Mesh Refinement: a new high resolution code called RAMSES
- A Multi-Code Analysis Toolkit for Astrophysical Simulation Data
- GIZMO: A New Class of Accurate, Mesh-Free Hydrodynamic Simulation Methods
- Multi-scale initial conditions for cosmological simulations
- Adaptive Refinement Tree - a new high-resolution N-body code for cosmological simulations
- The Coyote Universe I: Precision Determination of the Nonlinear Matter Power Spectrum
- The AGORA High-Resolution Galaxy Simulations Comparison Project
- Nyx: A Massively Parallel AMR Code for Computational Cosmology
- The Coyote Universe II: Cosmological Models and Precision Emulation of the Nonlinear Matter Power Spectrum
- Discreteness effects in simulations of Hot/Warm dark matter
- The Dark Matter Annihilation Signal from Galactic Substructure: Predictions for GLAST
- The Cosmic Code Comparison Project
- Robustness of Cosmological Simulations I: Large Scale Structure
- A new approach to simulating collisionless dark matter fluids
- Demonstrating Discreteness and Collision Error in Cosmological N-body Simulations of Dark Matter Gravitational Clustering
- Block Structured Adaptive Mesh and Time Refinement for Hybrid, Hyperbolic + N-body Systems
- Direct Integration of the Collisionless Boltzmann Equation in Six-dimensional Phase Space: Self-gravitating Systems
- DEUS Full Observable ΛCDM Universe Simulation: the numerical challenge
- An adaptive, high-order phase-space remapping for the two-dimensional Vlasov-Poisson equations