首页> 外文期刊>Journal of chemical information and modeling >Revised basin-hopping monte carlo algorithm for structure optimization of clusters and nanoparticles
【24h】

Revised basin-hopping monte carlo algorithm for structure optimization of clusters and nanoparticles

机译:改进的盆地跳跃蒙特卡洛算法用于团簇和纳米粒子的结构优化

获取原文
获取原文并翻译 | 示例
       

摘要

Suggestions for improving the Basin-Hopping Monte Carlo (BHMC) algorithm for unbiased global optimization of clusters and nanoparticles are presented. The traditional basin-hopping exploration scheme with Monte Carlo sampling is improved by bringing together novel strategies and techniques employed in different global optimization methods, however, with the care of keeping the underlying algorithm of BHMC unchanged. The improvements include a total of eleven local and nonlocal trial operators tailored for clusters and nanoparticles that allow an efficient exploration of the potential energy surface, two different strategies (static and dynamic) of operator selection, and a filter operator to handle unphysical solutions. In order to assess the efficiency of our strategies, we applied our implementation to several classes of systems, including Lennard-Jones and Sutton-Chen clusters with up to 147 and 148 atoms, respectively, a set of Lennard-Jones nanoparticles with sizes ranging from 200 to 1500 atoms, binary Lennard-Jones clusters with up to 100 atoms, (AgPd)_(55) alloy clusters described by the Sutton-Chen potential, and aluminum clusters with up to 30 atoms described within the density functional theory framework. Using unbiased global search our implementation was able to reproduce successfully the great majority of all published results for the systems considered and in many cases with more efficiency than the standard BHMC. We were also able to locate previously unknown global minimum structures for some of the systems considered. This revised BHMC method is a valuable tool for aiding theoretical investigations leading to a better understanding of atomic structures of clusters and nanoparticles.
机译:提出了改进盆地跳跃蒙特卡洛(BHMC)算法以实现团簇和纳米粒子无偏全局优化的建议。通过将在不同全局优化方法中采用的新颖策略和技术结合在一起,改进了使用蒙特卡洛采样的传统流域跳槽勘探方案,但是要注意保持BHMC的基本算法不变。这些改进包括总共11个针对簇和纳米粒子量身定制的本地和非本地试验算子,这些算子和粒子可以有效地探索势能面,选择算子的两种不同策略(静态和动态),以及用于处理非物理解决方案的筛选算子。为了评估我们策略的效率,我们将实现应用于几种类型的系统,包括分别具有最多147和148个原子的Lennard-Jones和Sutton-Chen团簇,一组Lennard-Jones纳米粒子,尺寸范围从在密度泛函理论框架内,200至1500个原子,具有最多100个原子的二元Lennard-Jones簇,由Sutton-Chen势描述的(AgPd)_(55)合金簇和具有多达30个原子的铝簇。使用无偏全局搜索,我们的实现能够成功复制出所考虑系统的所有已发布结果的绝大部分,并且在许多情况下,其效率比标准BHMC高。我们还能够为所考虑的某些系统找到先前未知的全局最小结构。修订后的BHMC方法是辅助理论研究的有价值的工具,可帮助人们更好地理解团簇和纳米颗粒的原子结构。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号