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.
Hybrid Method of Moments with Interpolation Closure--
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
astro-ph.EP 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
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.