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 =
3 Pith papers cite this work, alongside 12 external citations. Polarity classification is still indexing.
3
Pith papers citing it
12
external citations · OpenAlex
years
2026 3representative 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.
Radiative-transfer simulations with common dust models generate a range of spectral indices but cannot reach the lowest observed emissivity indices in protostars without invoking unexpectedly large millimeter-sized grains.
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.
-
Pristine composition or size evolution: Can current dust models reproduce emissivities observed in nearby protostars?
Radiative-transfer simulations with common dust models generate a range of spectral indices but cannot reach the lowest observed emissivity indices in protostars without invoking unexpectedly large millimeter-sized grains.