## Abstract The first implementation of the MortonβFirth algorithm for the simulation of living/controlled polymerization processes is presented. Modifications were introduced to the native algorithm, improving its simplicity. The validity of the new algorithm was confirmed by comparison of results
A General Algorithm for Exact Simulation of Multicomponent Aggregation Processes
β Scribed by Ian J. Laurenzi; John D. Bartels; Scott L. Diamond
- Publisher
- Elsevier Science
- Year
- 2002
- Tongue
- English
- Weight
- 935 KB
- Volume
- 177
- Category
- Article
- ISSN
- 0021-9991
No coin nor oath required. For personal study only.
β¦ Synopsis
A Monte Carlo (MC) algorithm is presented for the simulation of the time evolution of aggregation processes featuring multiple components, properties, 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(( 1 2 . . . ΞΊ ) 1/(ΞΊ+1) ) rate-limiting operations per time step for a ΞΊ-component aggregation process featuring i 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.
π SIMILAR VOLUMES
## Abstract We present an extension of our previous theory describing aggregation processes in selfβassociating polymer systems, i.e., in copolymers with strongly attracting groups. In particular, the formation and properties of micelles are studied in detail for the superstrong segregation regime.