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.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
astro-ph.EP 2years
2026 2representative citing papers
A semi-analytic model using elastoplastic contact mechanics and weakest-link fracture statistics reproduces the sticking-bouncing boundary from DEM simulations and places the bouncing barrier within ALMA-inferred size-velocity ranges for moderately porous aggregates.
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.
-
A semi-analytic model of the bouncing barrier for protoplanetary dust aggregates
A semi-analytic model using elastoplastic contact mechanics and weakest-link fracture statistics reproduces the sticking-bouncing boundary from DEM simulations and places the bouncing barrier within ALMA-inferred size-velocity ranges for moderately porous aggregates.