Coagulation algorithms with size binning
type: Item
instance of: scholarly article
title: Coagulation algorithms with size binning
zbMATH Open document ID: 0805.76056
author: David M. Stratton
author: Jason Gans
author: Eric D. Williams
published in: Journal of Computational Physics
publication date: 1994-08-21T00:00:00Z
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.
Mathematics Subject Classification ID: 76M25
Mathematics Subject Classification ID: 76T99
zbMATH DE Number: 622265
zbMATH Keywords: constant approximation
zbMATH Keywords: aerosol particle concentration
zbMATH Keywords: linear function
zbMATH Keywords: Smoluchowski equation
MaRDI profile type: MaRDI publication profile
full work available at URL: jcph.1994.1106
OpenAlex ID: W2168452931
DOI: 10.1006/JCPH.1994.1106
Recommended article: Solving aerosol coagulation with size-binning methods
Recommended article: Stochastic algorithms for solving Smolouchovsky coagulation equation and applications to aerosol growth simulation.
Recommended article: Monte Carlo simulation of the coagulation processes governed by Smoluchowski equation with random coefficients
Recommended article: Q4242699
Recommended article: Numerical simulation of the general dynamic equation (GDE) for aerosols with two collocation methods
description: scientific article; zbMATH DE number 622265