Data structure for on-lattice cluster-cluster aggregation model performance optimization
文献类型：期刊论文
| 作者 | Xiong, Hailing ; Li, Hang ; Chen, Weiping ; Wu, Laosheng |
| 刊名 | COMPUTER PHYSICS COMMUNICATIONS
 |
| 出版日期 | 2014 |
| 卷号 | 185期号:3页码:836-840 |
| 关键词 | Data structure On-lattice simulation Metropolis sampling Cluster cluster aggregation Computational complexity |
| ISSN号 | 0010-4655 |
| 中文摘要 | 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. |
| WOS记录号 | WOS:000331919100016 |
| 公开日期 | 2015-03-23 |
| 源URL | [http://ir.rcees.ac.cn/handle/311016/9132]  |
| 专题 | 生态环境研究中心_城市与区域生态国家重点实验室 |
| 推荐引用方式 GB/T 7714 | Xiong, Hailing,Li, Hang,Chen, Weiping,et al. Data structure for on-lattice cluster-cluster aggregation model performance optimization[J]. COMPUTER PHYSICS COMMUNICATIONS,2014,185(3):836-840. |
| APA | Xiong, Hailing,Li, Hang,Chen, Weiping,&Wu, Laosheng.(2014).Data structure for on-lattice cluster-cluster aggregation model performance optimization.COMPUTER PHYSICS COMMUNICATIONS,185(3),836-840. |
| MLA | Xiong, Hailing,et al."Data structure for on-lattice cluster-cluster aggregation model performance optimization".COMPUTER PHYSICS COMMUNICATIONS 185.3(2014):836-840. |
入库方式： OAI收割
来源：生态环境研究中心
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。