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
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
years
2026 3representative citing papers
A 2D Monte Carlo dust evolution simulation shows that a planet-induced pressure bump reproduces the observed compositions and formation ages of carbonaceous chondrites, implying formation in a single long-lived dust trap outside Jupiter's orbit.
Jet feedback in centrally concentrated clouds reduces star formation efficiency to 12-16% and yields cluster structures more consistent with observations than models without jets.
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.