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
citation-role summary
background 1
citation-polarity summary
fields
astro-ph.EP 2years
2026 2verdicts
CONDITIONAL 2roles
background 1polarities
background 1representative citing papers
Halos in Elias 2-24, IM Lup, and DM Tau hold 20-30% of total dust mass with cm-sized grains, helping resolve the disk mass-budget problem even though drift and growth timescales are shorter than disk ages.
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.
-
Dust characterization of halos: The extended emission in protoplanetary disks
Halos in Elias 2-24, IM Lup, and DM Tau hold 20-30% of total dust mass with cm-sized grains, helping resolve the disk mass-budget problem even though drift and growth timescales are shorter than disk ages.