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.
Nat Astron , pages =
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2representative citing papers
Drop tower experiments on fine basalt, coarse basalt, and glass beads at 150-1000 mm/s² show volume increases up to 19.6% at lower gravity, with sensitivity varying by particle size, roughness, and uniformity.
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.
-
Experiments on Settling of Granular and Cohesive Material in Low Gravity
Drop tower experiments on fine basalt, coarse basalt, and glass beads at 150-1000 mm/s² show volume increases up to 19.6% at lower gravity, with sensitivity varying by particle size, roughness, and uniformity.