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 Kokubo, Eiichiro, year = 2001, month = jan
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 2years
2026 2roles
method 1polarities
use method 1representative citing papers
The Bern Model has incorporated MHD disk evolution, pebble accretion, and improved interiors, yielding quantitative matches to exoplanet mass functions, radius distributions, and system architectures.
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.
-
The formation of planetary systems: physics, populations, and architectures
The Bern Model has incorporated MHD disk evolution, pebble accretion, and improved interiors, yielding quantitative matches to exoplanet mass functions, radius distributions, and system architectures.