.png){kind=icon}
返回
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}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
coagulation
aggregation
Brownian motion
N-particle simulation
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.4
论文数:
1.2W
被引数:
3.7W
机构
暂无机构信息
引用论文
Molecular structure of simple mono- and diphenyl meso-substituted porphyrin diacids: influence of protonation and substitution on the distorsion.png)
Tetrahedron
TetrahedronIF0
PREAI
分享收藏
查看更多内容