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
fields
astro-ph.EP 3representative citing papers
Simulations tie the deep-mantle primordial neon reservoir to an initial embryo mass of ~0.3 Earth masses assembled during solar-nebula dispersal.
An upgraded planet population synthesis model incorporates post-disc dynamical evolution and atmospheric enrichment to generate synthetic exoplanet populations with improved fidelity to N-body results and observations.
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.
-
Constructing Earth Formation History Using Deep Mantle Noble Gas Reservoirs
Simulations tie the deep-mantle primordial neon reservoir to an initial embryo mass of ~0.3 Earth masses assembled during solar-nebula dispersal.
-
Rapid and Predictive Planet Population Synthesis Model (RAPPS) I. Upgraded model and resulting synthetic populations
An upgraded planet population synthesis model incorporates post-disc dynamical evolution and atmospheric enrichment to generate synthetic exoplanet populations with improved fidelity to N-body results and observations.