.png){kind=icon}
Return
A general algorithm for exact simulation of multicomponent aggregation processes
.png){kind=icon}
PRE
AI
DOI：10.1006/jcph.2002.7017.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
A Monte Carlo (MC) algorithm is presented for the simulation of the time evolution of aggregation processes featuring multiple components, proper-ties, or conservation laws. Instead Of using deterministic differential population balance equations. the MC algorithm utilizes a stochastic approach to aggregation kinetics. As a result. exact simulation of spatially independent aggregation processes is possible without the need for numerical approximations. Furthermore, simulations exactly predict all moments of the size and composition distributions of aggregating particles for both nongelling and gelling kernels and extend these results to the postgelation period. The algorithm is shown to require at most O ((Omega(1) Omega(2)...Omega(K))(1/(K+l)) rate-limiting operations per time step for a K-component aggregation process featuring 72, monomers of each component i-a substantial performance improvement over the potential of previous methods. Simulation results are presented for bivariate sum. product. and constant kernels, and for the perikinetic (Brownian) kernel. (C) 2002 Elsevier Science (USA).
Keywords:
coagulation
clustering
collection
moments
gel transition
Journal
IF:
3.8
Papers:
1.6W
Citations:
7.4W
Organization
No organization information available
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSaveShareSaveShareSaveShareSave
View more