.png){kind=icon}
返回
Data structure for on-lattice cluster-cluster aggregation model performance optimization
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cpc.2013.11.015.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
A compounded data structure is developed to optimize the simulation of colloidal aggregation using the on-lattice Cluster-Cluster Aggregation (CCA) model. Brownian motion, collision detection and aggregation as the basic operations in the CCA simulation are illustrated and evaluated based on the compounded data structure, respectively. The critical improvement of our algorithm is in distinguishing any selected clusters consisting particles and ascertaining their neighboring positions efficiently in simulation, which was traditionally performed by the exhaustive search in the whole system. Analytical results show that the new algorithm achieves linear computational complexity in each of the main operations, which is very appealing in performance optimization in using on-lattice CCA simulations. (C) 2013 Elsevier B.V. All rights reserved.
Keyword:
Data structure
On-lattice simulation
Metropolis sampling
Cluster cluster aggregation
Computational complexity
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.4
论文数:
1.2W
被引数:
3.7W
机构
引用论文
.png){kind=icon}
分享收藏
分享收藏
查看更多内容