Algorithms for particle-field simulations with collisions
Algorithms for particle-field simulations with collisions
复制标题
DOI：
10.1006/jcph.2001.6858
复制
发表时间：
2001-09-20
影响因子：
4.1
通讯作者：
Wan, WL
中科院分区：
文献类型：
--
作者：
Sigurgeirson, H;Stuart, A;Wan, WL
我们开发了一个有效的算法检测大量的粒子在速度场中移动的碰撞时，场本身可能是耦合到粒子运动。我们建立在分子动力学模拟的想法，并作为副产品，硬球分子动力学的方法进行了文献调查。我们详细分析了算法的复杂性，并提出了几个实验结果的性能，证实了分析。用于碰撞检测的最佳算法具有至少类似于检测到的碰撞总数的成本缩放。我们认为，无论是理论上和实验上，与适当的参数选择，当碰撞的数量增长的粒子数至少一样快的台球，我们建议的算法是最佳的。(C)北京：科学出版社.
We develop an efficient algorithm for detecting collisions among a large number of particles moving in a velocity field, when the field itself is possibly coupled to the particle motions. We build on ideas from molecular dynamics simulations and, as a byproduct, give a literature survey of methods for hard sphere molecular dynamics. We analyze the complexity of the algorithm in detail and present several experimental results on performance which corroborate the analysis. An optimal algorithm for collision detection has cost scaling at least like the total number of collisions detected. We argue, both theoretically and experimentally, that with the appropriate parameter choice and when the number of collisions grows with the number of particles at least as fast as for billiards, the algorithm we recommend is optimal. (C) 2001 Academic Press.