A tree algorithm reduces multi-component coagulation complexity from O(N^{2d}) to O(d N^d log N) by grouping similar interactions and matches direct-method results in tests with analytic solutions.
ApJ581(1), 666–680 (2002)
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
fields
astro-ph.EP 2years
2026 2roles
background 1polarities
background 1representative citing papers
GPU-accelerated N-body simulations show that the common acceleration factor f distorts planetary chemical compositions and that terrestrial planets can form resonant chains without gas-driven orbital migration.
citing papers explorer
-
A fast tree algorithm for multi-component coagulation equation
A tree algorithm reduces multi-component coagulation complexity from O(N^{2d}) to O(d N^d log N) by grouping similar interactions and matches direct-method results in tests with analytic solutions.
-
Terrestrial planet formation in the era of GPU computing
GPU-accelerated N-body simulations show that the common acceleration factor f distorts planetary chemical compositions and that terrestrial planets can form resonant chains without gas-driven orbital migration.