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.
W., Spaans M., Tielens A
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
method 1
citation-polarity summary
fields
astro-ph.EP 2roles
method 1polarities
use method 1representative citing papers
Porous elongated dust grains exhibit decreasing intrinsic polarization with rising porosity and 90-degree polarization flips at specific wavelength-to-size ratios, enabling a new multi-wavelength method to constrain grain porosity in protoplanetary disks.
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.
-
Intrinsic polarisation of elongated porous dust grains
Porous elongated dust grains exhibit decreasing intrinsic polarization with rising porosity and 90-degree polarization flips at specific wavelength-to-size ratios, enabling a new multi-wavelength method to constrain grain porosity in protoplanetary disks.