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.
and Cuzzi, Jeffrey N
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
Numerical simulations of porous fractal and consolidated particles show stronger forward scattering, broader polarization peaks, and lower absorption per unit mass than compact spheres, implying larger dust masses from observed fluxes.
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.
-
Modeling (Sub-)millimeter Scattering Properties of Fractal and Consolidated Porous Particles: Applications to Protoplanetary Disks
Numerical simulations of porous fractal and consolidated particles show stronger forward scattering, broader polarization peaks, and lower absorption per unit mass than compact spheres, implying larger dust masses from observed fluxes.