Multi-level adaptive particle mesh (MLAPM): a C code for cosmological simulations
Open accessThe DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Abstract
We present a computer code written in c that is designed to simulate structure formation from collisionless matter. The code is purely grid-based and uses a recursively refined Cartesian grid to solve Poisson's equation for the potential, rather than obtaining the potential from a Green's function. Refinements can have arbitrary shapes and in practice closely follow the complex morphology of the density field that evolves. The time-step shortens by a factor of 2 with each successive refinement. Competing approaches to N-body simulation are discussed from the point of view of the basic theory of N-body simulation. It is argued that an appropriate choice of softening length ε is of great importance and that ε should be at all points an appropriate multiple of the local interparticle separation. Unlike tree and P3M codes, multigrid codes automatically satisfy this requirement. We show that at early times and low densities in cosmological simulations, ε needs to be significantly smaller relative to the interparticle separation than in virialized regions. Tests of the ability of the code's Poisson solver to recover the gravitational fields of both virialized haloes and Zel'dovich waves are presented, as are tests of the code's ability to reproduce analytic solutions for plane-wave evolution. The times required to conduct a ΛCDM cosmological simulation for various configurations are compared with the times required to complete the same simulation with the ART, AP3M and GADGET codes. The power spectra, halo mass functions and halo–halo correlation functions of simulations conducted with different codes are compared. The code is available from.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Observational Evidence for Self-Interacting Cold Dark Matter
Spergel, D. N., & Steinhardt, P. J. (2000) · Physical Review Letters · doi:10.1103/physrevlett.84.3760 · Cited by 2,097
Cited by
The cosmological simulation code gadget-2
Springel, V. (2005) · Monthly Notices of the Royal Astronomical Society · doi:10.1111/j.1365-2966.2005.09655.x · Cited by 6,368
“The mesh can also be adaptively refined, with the potential found in real space using relaxation methods (Kravtsov et al., 1997; Knebe et al., 2001).”
BackgroundKnollmann, S. R., & Knebe, A. (2009) · The Astrophysical Journal Supplement Series · doi:10.1088/0067-0049/182/2/608 · Cited by 889
Self-citationENZO: AN ADAPTIVE MESH REFINEMENT CODE FOR ASTROPHYSICS
Bryan, G. L., Norman, M. L., O'Shea, B. W., Abel, T., Wise, J. H., Turk, M. J., Reynolds, D. R., Collins, D. C., Wang, P., Skillman, S. W., et al. (2014) · The Astrophysical Journal Supplement Series · doi:10.1088/0067-0049/211/2/19 · Cited by 865
Dusty star-forming galaxies at high redshift
Casey, C. M., Narayanan, D., & Cooray, A. (2014) · Physics Reports · doi:10.1016/j.physrep.2014.02.009 · Cited by 800
The evolution of substructure — I. A new identification method
Gill, S. P. D., Knebe, A., & Gibson, B. K. (2004) · Monthly Notices of the Royal Astronomical Society · doi:10.1111/j.1365-2966.2004.07786.x · Cited by 444
Self-citation
Metadata
- Authors
- Knebe, A., Green, A., & Binney, J.
- Venue
- Monthly Notices of the Royal Astronomical Society
- Publisher
- Oxford University Press (OUP)
- Published
- 2001-08-01
- Volume
- 325
- Issue
- 2
- Pages
- 845-864
- ISSN
- 0035-8711 (ISSN-L)
- 1365-2966
- OpenAlex
- W2121394747
- Cited by
- 152
- References
- 1
- FWCI
- 5.50
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Multi-level adaptive particle mesh (MLAPM): a C code for cosmological simulations. https://app.cochat.ai/papers/10.1046/j.1365-8711.2001.04532.x
- The paper
- Knebe, A., Green, A., & Binney, J. (2001). Multi-level adaptive particle mesh (MLAPM): a C code for cosmological simulations. Monthly Notices of the Royal Astronomical Society. https://doi.org/10.1046/j.1365-8711.2001.04532.x
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.