On the accuracy of simulating mixing by random-walk particle-based mass-transfer algorithms

Abstract

Several algorithms have been used for mass transfer between particles undergoing advective and macro-dispersive random walks. The mass transfer between particles is required for general reactions on, and among, particles. The mass transfer is shown to be diffusive, and may be simulated using implicit, explicit, or mixed methods. All algorithms investigated are accurate to $\mathcal{O}(\Delta t)$. For $N$ particles, the implicit and semi-implicit methods require inverse matrix solutions and $\mathcal{O}(N^3)$ calculations. The explicit methods use forward matrix solves and require only $\mathcal{O}(N^2)$ calculations. Practically, this means that naive implementations with more than about 5,000 particles run more reliably using explicit methods

arXiv comment14 pages, 3 figures

Cited by in corpus (9)

• On the separate treatment of mixing and spreading by the reactive-particle-tracking algorithm: An example of accurate upscaling of reactive Poiseuille flow
• Accelerating and parallelizing Lagrangian simulations of mixing-limited reactive transport
• Numerical Equivalence Between SPH and Probabilistic Mass Transfer Methods for Lagrangian Simulation of Dispersion
• A Mass-transfer Particle-tracking Method for Simulating Transport with Discontinuous Diffusion Coefficients
• Reactive Particle-tracking Solutions to a Benchmark Problem on Heavy Metal Cycling in Lake Sediments
• A Lagrangian Method for Reactive Transport with Solid/Aqueous Chemical Phase Interaction
• Global random walk solvers for reactive transport and biodegradation processes in heterogeneous porous media
• Entropy: The former trouble with particles (including a new numerical model computational penalty for the Akaike information criterion)
• A Computational Information Criterion for Particle-Tracking with Sparse or Noisy Data