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.
Numerical Simulation of Dust Aggregate Collisions
2 Pith papers cite this work, alongside 205 external citations. Polarity classification is still indexing.
2
Pith papers citing it
205
external citations · OpenAlex
citation-role summary
method 1
citation-polarity summary
years
2026 2roles
method 1polarities
use method 1representative citing papers
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.
-
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.