Pith. sign in

REVIEW 3 cited by

A Very Fast and Momentum-Conserving Tree Code

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv astro-ph/0003209 v2 pith:LG4CMRDE submitted 2000-03-15 astro-ph

A Very Fast and Momentum-Conserving Tree Code

classification astro-ph
keywords codetreecomputationalinteractionsmutualacceleratedaccuracyadvantage
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

The tree code for the approximate evaluation of gravitational forces is extended and substantially accelerated by including mutual cell-cell interactions. These are computed by a Taylor series in Cartesian coordinates and in a completely symmetric fashion, such that Newton's third law is satisfied by construction and hence momentum exactly conserved. The computational effort is further reduced by exploiting the mutual symmetry of the interactions. For typical astrophysical problems with N=10^5 and at the same level of accuracy, the new code is about four times faster than the tree code. For large N, the computational costs are found to scale almost linearly with N, which can also be supported by a theoretical argument, and the advantage over the tree code increases with ever larger N.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. A Novel Implementation of Self-Interacting Dark Matter in AREPO

    astro-ph.CO 2026-07 accept novelty 6.5

    A dedicated-tree Monte-Carlo SIDM module in AREPO-2 conserves energy/momentum under multiple scatters, supports velocity-dependent and inelastic models, and runs with only modest overhead versus CDM except in late cor...

  2. A Scalable Fast Multipole Method Poisson Solver for the RAMSES code: II. Adaptive Mesh Refinement and Adaptive Time Stepping

    astro-ph.IM 2026-07 conditional novelty 6.0

    An FMM Poisson solver for RAMSES is extended to adaptive mesh refinement and adaptive time stepping, matching multigrid accuracy while conserving momentum better across coarse-fine interfaces and scaling better in parallel.

  3. A fast spectral-multigrid Poisson solver in non-Cartesian geometries

    astro-ph.IM 2026-06 unverdicted novelty 6.0

    A spectral-multigrid Poisson solver for spherical and cylindrical coordinates achieves second-order accuracy on uniform and logarithmic radial grids with vacuum boundary handling via screening mass and scales to 4096 cores.