.png){kind=icon}
返回
Parallelized event chain algorithm for dense hard sphere and polymer systems
.png){kind=icon}
OA
AI
DOI：10.1016/j.jcp.2014.10.059.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We combine parallelization and cluster Monte Carlo for hard sphere systems and present a parallelized event chain algorithm for the hard disk system in two dimensions. For parallelization we use a spatial partitioning approach into simulation cells. We find that it is crucial for correctness to ensure detailed balance on the level of Monte Carlo sweeps by drawing the starting sphere of event chains within each simulation cell with replacement. We analyze the performance gains for the parallelized event chain and find a criterion for an optimal degree of parallelization. Because of the cluster nature of event chain moves massive parallelization will not be optimal. Finally, we discuss first applications of the event chain algorithm to dense polymer systems, i.e., bundle-forming solutions of attractive semiflexible polymers. (C) 2014 Elsevier Inc. All rights reserved.
Keyword:
Parallelization
Monte Carlo
Event chain algorithm
Semiflexible polymers
Filament bundles
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.8
论文数:
1.6W
被引数:
7.4W
机构
引用论文
.png){kind=icon}
查看更多内容