The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
FastPM: a new scheme for fast simulations of dark matter and haloes
Open accessAbstract
We introduce FastPM, a highly scalable approximated particle mesh (PM) N-body solver, which implements the PM scheme enforcing correct linear displacement (1LPT) evolution via modified kick and drift factors. Employing a two-dimensional domain decomposing scheme, FastPM scales extremely well with a very large number of CPUs. In contrast to Comoving-Lagrangian (COLA) approach, we do not require to split the force or track separately the 2LPT solution, reducing the code complexity and memory requirements. We compare FastPM with different number of steps (Ns) and force resolution factor (B) against three benchmarks: halo mass function from friends-of-friends halo finder; halo and dark matter power spectrum; and cross-correlation coefficient (or stochasticity), relative to a high-resolution TreePM simulation. We show that the modified time stepping scheme reduces the halo stochasticity when compared to COLA with the same number of steps and force resolution. While increasing Ns and B improves the transfer function and cross-correlation coefficient, for many applications FastPM achieves sufficient accuracy at low Ns and B. For example, Ns = 10 and B = 2 simulation provides a substantial saving (a factor of 10) of computing time relative to Ns = 40, B = 3 simulation, yet the halo benchmarks are very similar at z = 0. We find that for abundance matched haloes the stochasticity remains low even for Ns = 5. FastPM compares well against less expensive schemes, being only 7 (4) times more expensive than 2LPT initial condition generator for Ns = 10 (Ns = 5). Some of the applications where FastPM can be useful are generating a large number of mocks, producing non-linear statistics where one varies a large number of nuisance or cosmological parameters, or serving as part of an initial conditions solver.
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
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
Cited by
Villaescusa-Navarro, F., Hahn, C., Massara, E., Banerjee, A., Delgado, A. M., Ramanah, D. K., Charnock, T., Giusarma, E., Li, Y., Allys, E., et al. (2020) · The Astrophysical Journal Supplement Series · doi:10.3847/1538-4365/ab9d82 · Cited by 336
Self-citationnbodykit: An Open-source, Massively Parallel Toolkit for Large-scale Structure
Hand, N., Feng, Y., Beutler, F., Li, Y., Modi, C., Seljak, U., & Slepian, Z. (2018) · The Astronomical Journal · doi:10.3847/1538-3881/aadae0 · Cited by 286
Self-citationThe Dawes Review 10: The impact of deep learning for the analysis of galaxy surveys
Huertas-Company, M., & Lanusse, F. (2023) · Publications of the Astronomical Society of Australia · doi:10.1017/pasa.2022.55 · Cited by 102
“In one of the first works applying deep learning to N-body simulations, He et al. (2018) proposed a model based on a 3D convolutional U-Net (see subsection 3.2) that learned to predict full non-linear particle displacements given as an input analytic Zel’dovich Approximation (ZA) displacements (which corresponds to a…”
MethodInfluentialCosmological reconstruction from galaxy light: neural network based light-matter connection
Modi, C., Feng, Y., & Seljak, U. (2018) · Journal of Cosmology and Astroparticle Physics · doi:10.1088/1475-7516/2018/10/028 · Cited by 86
“J C A P 1 0 ( 2 0 1 8 ) 0 2 8 to g et h al o m as s & p os it io n fi el d N eu ra l N et w or k Fo rw ar d M od el Ba ck pr op ag at io n Optimization cycle for reconstruction Li ke lih oo d of th e da ta Initial Matter Density FastPM sim ulation Final Matter Density Neural Network Model Halo Mass Field True Halo Mas…”
BackgroundMethodInfluentialSelf-citationA volumetric deep Convolutional Neural Network for simulation of mock dark matter halo catalogues
Berger, P., & Stein, G. (2019) · Monthly Notices of the Royal Astronomical Society · doi:10.1093/mnras/sty2949 · Cited by 50
Metadata
- Authors
- Feng, Y., Chu, M.-Y., Seljak, U., & McDonald, P.
- Venue
- Monthly Notices of the Royal Astronomical Society
- Publisher
- Oxford University Press (OUP)
- Published
- 2016-08-24
- Volume
- 463
- Issue
- 3
- Pages
- 2273-2286
- ISSN
- 0035-8711 (ISSN-L)
- 1365-2966
- OpenAlex
- W2291841595
- Cited by
- 210
- References
- 1
- FWCI
- 7.16
- Type
- journal article
- Language
- en
- Open access
- green
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
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.