Get access

Efficiency of random search procedures along the silicon cluster series: Sin (n = 5–10, 15, and 20)

Authors

  • Fabrice Avaltroni,

    1. Laboratory for Computational Molecular Design, Institut des Sciences et Ingénierie Chimiques, Ecole Polytechnique Fédérale de Lausanne, CH-1015 Lausanne, Switzerland
    Search for more papers by this author
  • Clemence Corminboeuf

    Corresponding author
    1. Laboratory for Computational Molecular Design, Institut des Sciences et Ingénierie Chimiques, Ecole Polytechnique Fédérale de Lausanne, CH-1015 Lausanne, Switzerland
    • Laboratory for Computational Molecular Design, Institut des Sciences et Ingénierie Chimiques, Ecole Polytechnique Fédérale de Lausanne, CH-1015 Lausanne, Switzerland
    Search for more papers by this author

Abstract

The efficiency of the simplest isomeric search procedure consisting in random generation of sets of atomic coordinates followed by density functional theory geometry optimization is tested on the silicon cluster series (Si5–10,15,20). Criteria such as yield, isomer distributions and recurrences are used to clearly establish the performance of the approach with respect to increasing cluster size. The elimination of unphysical candidate structures and the use of distinct box shapes and theoretical levels are also investigated. For the smaller Sin (n = 5–10) clusters, the generation of random coordinates within a spherical box is found to offer a reasonable alternative to more complex algorithms by allowing straightforward identification of every known low-lying local minima. The simple stochastic search of larger clusters (i.e. Si15 and Si20) is however complicated by the exponentially increasing number of both low- and high-lying minima leading to rather arbitrary and non-comprehensive results. © 2011 Wiley Periodicals, Inc. J Comput Chem 2011

Get access to the full text of this article

Ancillary