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
The paper assesses the feasibility of using SKA-AA4 for thermal detections and characterization of TNOs and Centaurs at cm wavelengths.
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.
-
Unveiling the Trans-Neptunian Region with the SKA
The paper assesses the feasibility of using SKA-AA4 for thermal detections and characterization of TNOs and Centaurs at cm wavelengths.