期刊文献+

TGMin: A global-minimum structure search program based on a constrained basin-hopping algorithm 被引量:4

TGMin: A global-minimum structure search program based on a constrained basin-hopping algorithm
原文传递
导出
摘要 In this article, we introduce Tsinghua Global Minimum (TGMin) as a new program for the global minimum searching of geometric structures of gas-phase or surface-supported atomic clusters, and the constrained basin-hopping (BH) algorithm implemented in this program. To improve the efficiency of the BH algorithm, several types of constraints are introduced to reduce the vast search space, including constraints on the random displacement step size, displacement of low-coordination atoms, and geometrical structure adjustment after displacement. The ultrafast shape-recognition (USR) algorithm and its variants are implemented to identify duplicate structures during the global minimum search. In addition to the Metropolis acceptance criterion, we also implemented a morphology-based constraint that confines the global minimum search to a specific type of morphology, such as planar or non-planar structures, which offers a strict divide-and-conquer strategy for the BH algorithm. These improvements are implemented in the TGMin program, which was developed over the past decade and has been used in a number of publications. We tested our TGMin program on global minimum structural searches for a number of metal and main-group clusters including C60, Au20 and B20 clusters. Over the past five years, the TGMin program has been used to determine the global minimum structures of a series of boron atomic clusters (such as [B26]^-, [B28]^-, [B30]^-, [B35]^-, [B36]^-, [B39]^-, [B40]^-, [MnB16]^-, [COB18]^-, [RhB18]^-, and [TaB20]^-), metal-containing clusters Lin (n = 3-20), Aug(CO)8^+ and [Cr6O19]^2-. and the oxide-supported metal catalyst Au7/γ-Al2O3, as well as other isolated and surface-supported atomic clusters. In this article we present the major features of TGMin program and show that it is highly efficient at searching for global-minimum structures of atomic clusters in the gas phase and on various surface supports. In this article, we introduce Tsinghua Global Minimum (TGMin) as a new program for the global minimum searching of geometric structures of gas-phase or surface-supported atomic clusters, and the constrained basin-hopping (BH) algorithm implemented in this program. To improve the efficiency of the BH algorithm, several types of constraints are introduced to reduce the vast search space, including constraints on the random displacement step size, displacement of low-coordination atoms, and geometrical structure adjustment after displacement. The ultrafast shape-recognition (USR) algorithm and its variants are implemented to identify duplicate structures during the global minimum search. In addition to the Metropolis acceptance criterion, we also implemented a morphology-based constraint that confines the global minimum search to a specific type of morphology, such as planar or non-planar structures, which offers a strict divide-and-conquer strategy for the BH algorithm. These improvements are implemented in the TGMin program, which was developed over the past decade and has been used in a number of publications. We tested our TGMin program on global minimum structural searches for a number of metal and main-group clusters including C60, Au20 and B20 clusters. Over the past five years, the TGMin program has been used to determine the global minimum structures of a series of boron atomic clusters (such as [B26]^-, [B28]^-, [B30]^-, [B35]^-, [B36]^-, [B39]^-, [B40]^-, [MnB16]^-, [COB18]^-, [RhB18]^-, and [TaB20]^-), metal-containing clusters Lin (n = 3-20), Aug(CO)8^+ and [Cr6O19]^2-. and the oxide-supported metal catalyst Au7/γ-Al2O3, as well as other isolated and surface-supported atomic clusters. In this article we present the major features of TGMin program and show that it is highly efficient at searching for global-minimum structures of atomic clusters in the gas phase and on various surface supports.
出处 《Nano Research》 SCIE EI CAS CSCD 2017年第10期3407-3420,共14页 纳米研究(英文版)
基金 Acknowledgements The TGMin program was initially developed at Tsinghua University (China) as a part of the Ph.D. Dissertation (2012) of Y. F. Z. under the supervision of J. L. Y. F. Z. is financially supported by the National Key Research and Development Program of China (No. 2016YFB0201203) and National High-tech R&D Program of China (No. 2015AA01A304). X. C. and J. L. are supported by the National Basic Research Program of China (No. 2013CB834603) and the National Natural Science Foundation of China (Nos. 21433005, 91426302, 21521091, and 21590792).
关键词 basin hopping ultrafast shape recognition global minimum search density functional theory cluster basin hopping, ultrafast shape recognition, global minimum search, density functional theory, cluster
  • 相关文献

参考文献3

二级参考文献1

共引文献35

同被引文献3

引证文献4

二级引证文献4

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部