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.
Grain Growth for Astrophysics with Discontinuous
3 Pith papers cite this work, alongside 28 external citations. Polarity classification is still indexing.
3
Pith papers citing it
28
external citations · OpenAlex
years
2026 3representative citing papers
Presents and benchmarks an SPH code for the full one-fluid dusty gas with multiple species that conserves mass, momentum, angular momentum and energy while recovering analytic solutions where the terminal velocity approximation fails.
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.
-
Full one-fluid dusty gas with multiple grain species in SPH
Presents and benchmarks an SPH code for the full one-fluid dusty gas with multiple species that conserves mass, momentum, angular momentum and energy while recovering analytic solutions where the terminal velocity approximation fails.
-
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.