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.
Total Variation Diminishing
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
verdicts
CONDITIONAL 2representative citing papers
Domain-of-dependence stabilization for cut-cell meshes achieves fully discrete stability for linear advection under a CFL condition independent of arbitrarily small cell sizes.
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 domain-of-dependence stabilization for cut-cell meshes is fully discretely stable
Domain-of-dependence stabilization for cut-cell meshes achieves fully discrete stability for linear advection under a CFL condition independent of arbitrarily small cell sizes.