The DOI matches its Crossref record.
Mesh-refined P3M - A fast adaptive N-body algorithm
Abstract
Substantial improvements in the performance of "particle-particle- particle-mesh" (P^3^M) algorithms may be achieved by allowing spatially adaptive mesh refinements in regions of high particle density. The cycle time under heavy clustering is ~ 5 times that for a uniform particle distribution: ~ 10-20 times faster than conventional P^3^M. The algorithm is roughly 50% faster than a "tree code" while requiring significantly less memory.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
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 Evolution of X‐Ray Clusters in a Low‐Density Universe
Eke, V. R., Navarro, J. F., & Frenk, C. S. (1998) · The Astrophysical Journal · doi:10.1086/306008 · Cited by 441
Phantom: A Smoothed Particle Hydrodynamics and Magnetohydrodynamics Code for Astrophysics
Price, D. J., Wurster, J., Tricco, T. S., Nixon, C., Toupin, S., Pettitt, A., Chan, C., Mentiplay, D., Laibe, G., Glover, S., et al. (2018) · Publications of the Astronomical Society of Australia · doi:10.1017/pasa.2018.25 · Cited by 429
Metadata
- Authors
- Couchman, H. M. P.
- Venue
- The Astrophysical Journal
- Publisher
- American Astronomical Society
- Published
- 1991-02
- Volume
- 368
- Pages
- L23
- ISSN
- 0004-637X (ISSN-L)
- 1538-4357
- OpenAlex
- W2015256574
- Cited by
- 253
- References
- 0
- FWCI
- 1.43
- Type
- journal article
- Language
- en
- Open access
- closed
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: Mesh-refined P3M - A fast adaptive N-body algorithm. https://app.cochat.ai/papers/10.1086/185939
- The paper
- Couchman, H. M. P. (1991). Mesh-refined P3M - A fast adaptive N-body algorithm. The Astrophysical Journal. https://doi.org/10.1086/185939
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.