An Adaptive Hierarchical Particle-Mesh Code With Isolated Boundary Conditions

  title={An Adaptive Hierarchical Particle-Mesh Code With Isolated Boundary Conditions},
  author={Sergio Gelato and David F Chernoff and I. Wasserman},
  journal={The Astrophysical Journal},
  pages={115 - 131}
This article describes a new, fully adaptive particle-multiple-mesh (PM2) numerical simulation code developed primarily for cosmological applications. The code integrates the equations of motion of a set of particles subject to their mutual gravitational interaction and to an optional, arbitrary external field. The interactions between particles are computed using a hierarchy of nested grids constructed anew at each integration step to enhance the spatial resolution in high-density regions of… 

Figures from this paper

Adaptive Refinement Tree: A New High-Resolution N-Body Code for Cosmological Simulations

We present a new high-resolution N-body algorithm for cosmological simulations. The algorithm employs a traditional particle-mesh technique on a cubic grid and successive multilevel relaxations on

N-Body Code with Adaptive Mesh Refinement

A simulation code with the techniques that enhance both spatial and time resolution of the particle-mesh (PM) method is developed and it is found that many of halo objects have density profiles that are well fitted to the universal profile proposed in 1996 by Navarro, Frenk, & White over the entire range of their radius.


This paper describes the open-source code Enzo, which uses block-structured adaptive mesh refinement to provide high spatial and temporal resolution for modeling astrophysical fluid flows. The code

Multi-Level Ewald: A hybrid multigrid / Fast Fourier Transform approach to the electrostatic particle-mesh problem.

It is anticipated that the MLE method's ability to break a single convolution into many independent sub-problems will be useful for extending the parallel scaling of molecular simulations.

grommet: an N‐body code for high‐resolution simulations of individual galaxies

This paper presents a fast, economical particle-multiple-mesh N-body code optimized for large-N modelling of collisionless dynamical processes, such as black hole wandering or bar-halo interactions,

Vectorization and Parallelization of the Adaptive Mesh Refinement N-Body Code

We describe our vectorized and parallelized adaptive mesh refinement (AMR) N-body code with shared time steps, and report its performance on a Fujitsu VPP5000 vector-parallel supercomputer. Our AMR

DEM Simulations of Toner Particles with an O (N log N) Hierarchical Tree Code Algorithm

A significant reduction of computation time can be achieved by applying a tree code algorithm that exploits the idea of grouping suitable particles to macroparticles thus reducing the number of necessary calculations within a reasonably limited error bound.



A new hierarchical particle-mesh code for very large scale cosmological N-body simulations

An improved three-dimensional hierarchical particle-mesh (HPM) N-body code for the gravitational evolution of structure in the universe has been developed and tested and has a much larger dynamic range.


I describe a nested-grid particle-mesh (NGPM) code designed to study gravitational instability in three-dimensions. The code is based upon a standard PM code. Within the parent grid I am able to

Multigrid Methods for N-Body Gravitational Systems

A modified particle-mesh N-body code that features an automatic, adaptive local mesh enhancement in regions where enhanced resolution is desirable and execution times are shown to be greatly improved over single grid methods and competitive with tree code simulations.

An adaptive multigrid solver for high-resolution cosmological simulations

We have developed an adaptive multigrid code for solving the Poisson equation in gravitational simulations. Finer rectangular subgrids are adaptively created in locations where the density exceeds a

A new parallel N body gravity solver: TPM

A gravity solver based on combining the well developed Particle-Mesh method and TREE methods, which runs much faster than a pure TREE code with the same number of particles and maintains almost the same resolution in high density regions.

Numerical techniques for large cosmological N-body simulations

Techniques for carrying out large N-body simulations of the gravitational evolution of clustering in the fundamental cube of an infinite periodic universe are described and compared. The accuracy of

A hierarchical O(N log N) force-calculation algorithm

A novel method of directly calculating the force on N bodies that grows only as N log N is described, using a tree-structured hierarchical subdivision of space into cubic cells, each is recursively divided into eight subcells whenever more than one particle is found to occupy the same cell.

Hierarchical Numerical Cosmology with Hydrodynamics: Methods and Code Tests

HierarchicalNumericalCosmologywithHydro dynamics:Metho dsandCo deTestsPeter Anninos, Michael L. NormanLaboratory forComputationalAstrophysicsNational Center forSupercomputing ApplicationsUniversity

Mesh-refined P3M - A fast adaptive N-body algorithm

The algorithm is roughly 50 percent faster than a tree code while requiring significantly less memory, and the cycle time under heavy clustering is about five times that for a uniform particle distribution.

Fluid model for the evolution of large-scale structure

A numerical pressureless fluid model for the evolution of density fluctuations into the nonlinear regime in an expanding world model is described. The form of the fluid equations and the method of