.png){kind=icon}
Return
An effective algorithm for simulating diffusion-driven aggregation
.png){kind=icon}
PRE
AI
DOI：10.1016/S0010-4655(01)00150-3.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In many fields of physics and chemistry growth phenomena driven by mutual particle collisions (coagulation) are of great interest. In this paper an effective N-particle-method for simulating the coagulation due to Brownian motion at very low number densities is presented. Under such conditions the mean particle distance exceeds the typical aggregate diameter by orders of magnitude and a collision will be a very rare event. We derive a criterion which allows an efficient detection of candidates for imminent collisions. The N-particle method is based on an adaptive time step scheme respecting for the individual dynamical states of the aggregates. The numerical cost of the algorithm scales with the particle number approximately as N log N. In order to minimize the influence of the decreasing number of particles within the simulation box a new rescaling method is used throughout the aggregation process. (C) 2001 Elsevier Science B.V. All rights reserved.
Keywords:
coagulation
aggregation
Brownian motion
N-particle simulation
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.4
Papers:
1.2W
Citations:
3.7W
Organization
No organization information available
Cited Papers
Molecular structure of simple mono- and diphenyl meso-substituted porphyrin diacids: influence of protonation and substitution on the distorsion.png)
Tetrahedron
TetrahedronIF0
PREAI
ShareSaveShareSaveShareSave
ShareSave
ShareSave
View more