Abstract
We present a deterministic scheme for the discrete Smoluchowski's coagulation equation based on a binary grid refinement. Starting from the binary grid Ω0={1,2,4,8,16,. . .}, we first introduce an appropriate grid refinement by adding at each level 2l grid points in every binary subsection of the grid Ωl. In a next step we derive an approximate equation for the dynamic behavior on each level Ωl based on a piecewise constant approximation of the right hand side of Smoluchowski's equation. Numerical results show that the computational effort can be drastically decreased compared to the corresponding complete integer grid. When considering unbounded kernels in Smoluchowski's equation we use an adaptive time step method to overcome numerical instabilities which may occur at the tails of the density function.
Similar content being viewed by others
References
D.J. Aldous, Deterministic and stochastic models for coalescence (aggregation and coagulation): A review of the mean-field theory for probabilists, Bernoulli 5 (1999) 3–48.
H. Babovsky, On a Monte-Carlo scheme for Smoluchowski's coagulation equation, Monte Carlo Methods Appl. 5 (1999) 1–18.
A.S. Cavaretta, W. Dahmen and C.A. Michelli, Stationary subdivision, Mem. Amer. Math. Soc. 93 (1991).
A. Cohen, N. Dyn and B. Matei, Quasilinear subdivision schemes with applications to ENO interpolation, Appl. Comput. Harmon. Anal. 15 (2003) 89–116.
Y.R. Domilovskiy, A.A. Lushnikov and V.N. Piskurov, Monte Carlo simulation of coagulation processes, Izv. Atmos. Ocean. Phys. 15 (1979) 129–134.
A. Eibeck and W. Wagner, An efficient stochastic algorithm for studying coagulation dynamics and gelation phenomena, SIAM J. Sci. Comput. 22 (2000) 802–821.
A.L. Garcia, C. Van den Broeck, M. Aertsens and R. Serneels, A Monte Carlo simulation of coagulation, Phys. A Math. Gen. 143 (1987) 535–546.
D.N. Gillespie, An exact method for numerically simulating the stochastic coalescence process in a cloud, J. Atmospheric Sci. 32 (1975) 1977–1989.
A. Harten, S. Osher, B. Engquist and S.R. Chakravarthy, Some results on uniformly high-order accurate essentially nonoscillatory schemes, Appl. Numer. Math. 2 (1986) 347–377.
A. Kolodko and K. Sabelfeld, Stochastic particle methods for Smoluchowski coagulation equation: Variance reduction and error estimations, Preprint No. 842, Weierstraß-Institut für Angewandte Analysis und Stochastik (2003).
C. Lecot and W. Wagner, A quasi-Monte Carlo scheme for Smoluchowski's coagulation equation, Math. Comp. 73 (2004) 1953–1966.
F. Leyvraz and H.R. Tschudi, Singularities in the kinetics of coagulation processes, J. Phys. A Math. Gen. 14 (1981) 3389–3405.
K. Liffman, A direct simulation Monte Carlo method for cluster coagulation, J. Comput. Phys. 100 (1992) 116–127.
J.B. McLeod, On an infinite set of nonlinear differential equations I,II, Quart. J. Math. Oxf. II Ser. 13 (1962) 119–128, 193–205.
H. Niederreiter, ed., Monte Carlo and Quasi-Monte Carlo Methods 2002 (Springer, Berlin, 2004).
K.K. Sabelfeld, S.V. Rogasinsky, A.A. Kolodko and A.I. Levykin, Stochastic algorithms for solving Smoluchowsky coagulation equation and application to aerosol growth simulation, Monte Carlo Methods Appl. 2 (1996) 41–87.
C.-W. Shu and S. Osher, Efficient implementation of essentially non-oscillatory shock-capturing schemes, J. Comput. Phys. 77 (1988) 439–471.
M. v. Smoluchowski, Versuch einer mathematischen Theorie des Koagulationskinetik kolloider Lösungen, Z. Phys. Chem. 92 (1916) 129–168.
M. v. Smoluchowski, Drei Vorträge über Diffusion, Brownsche Molekularbewegung und Koagulation von Kolloidteilchen, Phys. Z. 17 (1916) 557–571, 585–599.
J.L. Spouge, Monte Carlo results for random coagulation, J. Colloid Interface Sci. 107 (1985) 38–43.
J. Struckmeier, Adaptive grid refinement for Smoluchowski's coagulation equation, in preparation.
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by C. Brezinski
Rights and permissions
About this article
Cite this article
Struckmeier, J. A deterministic scheme for Smoluchowski's coagulation equation based on binary grid refinement. Numer Algor 40, 233–249 (2005). https://doi.org/10.1007/s11075-005-4186-3
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/s11075-005-4186-3