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.
Title resolution pending
2 Pith papers cite this work, alongside 223 external citations. Polarity classification is still indexing.
2
Pith papers citing it
223
external citations · OpenAlex
citation-role summary
method 1
citation-polarity summary
years
2026 2roles
method 1polarities
use method 1representative citing papers
Next-generation IFU instruments could detect core scouring and tangential anisotropy from MBH binaries up to z~0.14 for ~150 pc cores and higher redshifts for larger cores, expanding searchable volume by 30-40 times including lower-mass systems.
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.