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, alongside 818 external citations. Polarity classification is still indexing.
3
Pith papers citing it
818
external citations · external index
citation-role summary
background 1
citation-polarity summary
years
2026 3roles
background 1polarities
background 1representative citing papers
An intermediate-mass companion to Sgr A* plus resonant relaxation in a depleting gas disk can simultaneously produce the observed orbits of S-stars, clockwise disk stars, and off-disk stars within their 6-15 Myr lifetimes.
GPU-accelerated N-body simulations show that the common acceleration factor f distorts planetary chemical compositions and that terrestrial planets can form resonant chains without gas-driven orbital migration.
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 complex kinematics of the young stars orbiting the supermassive black hole in the Galactic center can be explained by the presence of an intermediate mass companion of Sgr A$^\star$
An intermediate-mass companion to Sgr A* plus resonant relaxation in a depleting gas disk can simultaneously produce the observed orbits of S-stars, clockwise disk stars, and off-disk stars within their 6-15 Myr lifetimes.
-
Terrestrial planet formation in the era of GPU computing
GPU-accelerated N-body simulations show that the common acceleration factor f distorts planetary chemical compositions and that terrestrial planets can form resonant chains without gas-driven orbital migration.