Coagulation algorithms with size binning

DOI10.1006/JCPH.1994.1106MaRDI QIDQ1331446zbMATH OpenOpenAlexFDO

Authors David M. Stratton, Jason Gans, Eric D. Williams

Publication date 21 August 1994

Published in Journal of Computational Physics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jcph.1994.1106

zbMATH Keywords

aerosol particle concentrationconstant approximationlinear functionSmoluchowski equation

Mathematics Subject Classification ID

Multiphase and multicomponent flows (76T99)

Review text

Two algorithms employing a geometric size binning convention are examined: the first assumes that the aerosol particle concentration as a function of size can be considered constant within each size bin; the second approximates the concentration as a linear function of particle size within each size bin. The output of each algorithm is compared to an analytical solution in a special case of the Smoluchowski equation for which an exact solution is known.

Recommendations

• Solving aerosol coagulation with size-binning methods
• Stochastic algorithms for solving Smolouchovsky coagulation equation and applications to aerosol growth simulation.
• Monte Carlo simulation of the coagulation processes governed by Smoluchowski equation with random coefficients
• scientific article; zbMATH DE number 1286184
• Numerical simulation of the general dynamic equation (GDE) for aerosols with two collocation methods

Cited in

(4)

• Numerical simulation of the general dynamic equation (GDE) for aerosols with two collocation methods
• A review of current issues in air pollution modeling and simulation
• Binning for efficient stochastic multiscale particle simulations
• Solving aerosol coagulation with size-binning methods

This page was built for publication: Coagulation algorithms with size binning

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1331446)