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.
General Non-Linear Fragmentation with Discontinuous
2 Pith papers cite this work, alongside 7 external citations. Polarity classification is still indexing.
2
Pith papers citing it
7
external citations · OpenAlex
fields
astro-ph.EP 2years
2026 2representative 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.
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.