We introduce a general family of Weighted Flow Algorithms for simulating particle coagulation, generate a method to optimally tune these methods, and prove their consistency and convergence under general assump- tions. These methods are especially effective when the size distribution of the particle population spans many orders of magnitude, or in cases where the concentration of those particles that significantly drive the population evolu- tion is small relative to the background density. We also present a family of simulations demonstrating the efficacy of the method.

Original languageEnglish (US)
Pages (from-to)69-94
Number of pages26
JournalJournal of Computational Dynamics
Issue number1
StatePublished - 2019


  • Martingales
  • Particle coagulation
  • Smolu- chowski equation
  • Stochastic simulation

ASJC Scopus subject areas

  • Computational Mechanics
  • Computational Mathematics


Dive into the research topics of 'Convergence of a generalized weighted flow algorithm for stochastic particle coagulation'. Together they form a unique fingerprint.

Cite this