A hierarchical O(N log N) force-calculation algorithm¶
Barnes, J., & Hut, P. (1986). A hierarchical O(N log N) force-calculation algorithm. Nature.
Cited by¶
1 citation across 1 artifact.
Each citation links to the sentence it supports in the citing article.
Primes¶
- Co-location
- This is the compression that makes region-level reasoning tractable at all.
This sourceReplaces the pairwise interaction table with a region-level treatment of grouped bodies, the compression that makes large-N systems tractable.
Supported in partVerified against the publisher's abstract
Abstract supports hierarchical cell subdivision giving O(N log N) force calculation, but not the claim's 'region-level reasoning' or 'at all'.
“Here we describe a novel method of directly calculating the force on N bodies that grows only as N log N. The technique uses a tree-structured hierarchical subdivision of space into cubic cells, each of which is recursively divided into eight subcells whenever more than one particle is found to occupy the same cell.”
- This is the compression that makes region-level reasoning tractable at all.
Verification¶
Does it exist? Confirmed. This work's DOI resolves to a registered record, which fixes its identity. That is all it fixes.
Does it back the claim? Read against the text for 1 of 1 citation: 1 supported in part. Each verdict is shown under its citation below, with what in the work backs the sentence.
Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.
See how references were verified.
Registry ID ref:42547216a767 · see in the full table