.png){kind=icon}
返回
Efficiency of linked cell algorithms
.png){kind=icon}
OA
AI
DOI：10.1016/j.cpc.2010.11.002.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The linked cell algorithm is an essential part of molecular simulation software, both molecular dynamics and Monte Carlo. Though it scales linearly with the number of particles, there has been a constant interest in increasing its performance, because a large part of CPU time is spent to identify the interacting particles. Several recent publications proposed improvements to the algorithm and investigated their efficiency by applying them to particular setups. Here we develop a general method to evaluate the efficiency of these algorithms which is mostly independent of the parameters of the simulation, and test it for a number of linked cell algorithms. We also propose a combination of linked cell reordering and interaction sorting that performs well for a broad range of simulation setups. (C) 2010 Elsevier B.V. All rights reserved.
Keyword:
Molecular simulation
Molecular dynamics
Monte Carlo
Neighbour list
Linked cell list
Linked cell reordering
Interaction sorting
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.4
论文数:
1.2W
被引数:
3.7W
机构
引用论文
The Transmembrane Domains of ErbB Receptors do not Dimerize Strongly in MicellesErbB受体的跨膜结构域在胶束中不会强烈二聚化
.png){kind=icon}
PREAI
分享收藏分享收藏分享收藏A fast pairlist-construction algorithm for molecular simulations under periodic boundary conditions
PREAI
分享收藏
查看更多内容