A fast tree algorithm for multi-component coagulation equation
arXiv:2605.18353 · doi:10.1051/0004-6361/202558713
Abstract
Dust properties, such as mass and porosity, impact planet formation directly. Understanding the time evolution of dust distribution across multiple properties requires numerical computation. However, available ways to calculate the multi-component coagulation-fragmentation are highly time-consuming. This study aims to develop a fast and accurate algorithm for multi-component coagulation. We assumed that two pairs of colliding aggregates reproduce a similar outcome if the dust properties are similar, and that the ratio of dust properties in logarithmic space gives the similarity as a "distance". These assumptions enable us to apply the tree algorithm, which groups distant bins and calculates interactions together, to coagulation. The algorithm reduces the computational complexity from to , considering bins per components. We tested the algorithm by comparing it with the conventional direct method for cases where analytic solutions are known. We measured the dependencies of the wall-clock time, error in the distribution, and relative error of the total mass, on the , opening angle , and maximum dust distribution width after coagulation . The algorithms are found to calculate coagulation consistently. For , the tree method is faster than the direct method for a specific range of parameters. For , however, the tree method is faster for all parameter regions surveyed, speeding it up by tens of times. Increasing and decreasing or made it slower and more accurate. Additionally, using a small performs worse than when using a large , suggesting that limiting is unnecessary. We present a fast tree algorithm for the multi-component coagulation equation. It will enable us to evolve the multi-component dust distribution, such as in mass-porosity space, in protoplanetary disks.
23 pages, 13 figures, 3 tables, Accepted for publication in A&A
References in corpus (50)
- SciPy 1.0--Fundamental Algorithms for Scientific Computing in Python
- Array Programming with NumPy
- Rapid planetesimal formation in turbulent circumstellar discs
- The Occurrence and Architecture of Exoplanetary Systems
- A simple model for the evolution of the dust population in protoplanetary disks
- Coagulation, fragmentation and radial motion of solid particles in protoplanetary disks
- Dust coagulation in protoplanetary disks: a rapid depletion of small grains
- Gas- and dust evolution in protoplanetary disks
- The outcome of protoplanetary dust growth: pebbles, boulders, or planetesimals? II. Introducing the bouncing barrier
- The outcome of protoplanetary dust growth: pebbles, boulders, or planetesimals? I. Mapping the zoo of laboratory collision experiments
- Rapid Coagulation of Porous Dust Aggregates Outside the Snow Line: A Pathway to Successful Icy Planetesimal Formation
- The Evolution of the Water Distribution in a Viscous Protoplanetary Disk
- Fluffy dust forms icy planetesimals by static compression
- Dust coagulation in protoplanetary disks: porosity matters
- A Very Fast and Momentum-Conserving Tree Code
- Electric charging of dust aggregates and its effect on dust coagulation in protoplanetary disks
- Planetesimal formation by sweep-up: How the bouncing barrier can be beneficial to growth
- Dust Growth and Settling in Protoplanetary Disks and Disk Spectral Energy Distributions. I. Laminar Disks
- On the water delivery to terrestrial embryos by ice pebble accretion
- Numerical Modeling of the Coagulation and Porosity Evolution of Dust Aggregates
- Transport of CO in Protoplanetary Disks: Consequences of Pebble Formation, Settling, and Radial Drift
- A representative particle approach to coagulation and fragmentation of dust aggregates and fluid droplets
- Erosion and the limits to planetesimal growth
- Electrostatic Barrier against Dust Growth in Protoplanetary Disks. I. Classifying the Evolution of Size Distribution
- The outcome of protoplanetary dust growth: pebbles, boulders, or planetesimals? III. Sedimentation driven coagulation inside the snow-line
- Static compression of porous dust aggregates
- A panoptic model for planetesimal formation and pebble delivery
- DustPy: A Python Package for Dust Evolution in Protoplanetary Disks
- Growth and migration of solids in evolving protostellar disks I: Methods and Analytical tests
- Planetesimal formation via sweep-up growth at the inner edge of dead zones
- Dust Size Growth and Settling in a Protoplanetary Disk
- Protostellar collapse simulations in spherical geometry with dust coagulation and fragmentation
- Modeling dust growth in protoplanetary disks: The breakthrough case
- Evolutionary Description of Giant Molecular Cloud Mass Functions on Galactic Disks
- SPH simulations of grain growth in protoplanetary disks
- A coagulation-fragmentation model for the turbulent growth and destruction of preplanetesimals
- Solving the Coagulation Equation by the Moments Method
- Rapid formation of Gas Giant Planets via Collisional Coagulation from Dust Grains to Planetary Cores
- Grain growth for astrophysics with Discontinuous Galerkin schemes
- Evolution of porous dust grains in protoplanetary discs -- I. Growing grains
- Inhibited Coagulation of Micron-size Dust Due to the Electrostatic Barrier
- Fragmentation with Discontinuous Galerkin schemes: Non-linear fragmentation
- Evolution of dust porosity through coagulation and shattering in the interstellar medium
- Compaction during fragmentation and bouncing produces realistic dust grain porosities in protoplanetary discs
- The growth of super-large pre-planetary pebbles to an impact erosion limit
- TriPoD: Tri-Population size distributions for Dust evolution. Coagulation in vertically integrated hydrodynamic simulations of protoplanetary disks
- Global Modeling of Nebulae With Particle Growth, Drift, and Evaporation Fronts. II. The Influence of Porosity on Solids Evolution
- Investigating the Bouncing Barrier with Collision Simulations of Compressed Dust Aggregates
- Dust grain shattering in protoplanetary discs: collisional fragmentation or rotational disruption?
- O(N^2) fragmentation algorithm