Premium
A dynamic lattice searching method with constructed core for optimization of large lennard‐jones clusters
Author(s) -
Yang Xiaoli,
Cai Wensheng,
Shao Xueguang
Publication year - 2007
Publication title -
journal of computational chemistry
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.907
H-Index - 188
eISSN - 1096-987X
pISSN - 0192-8651
DOI - 10.1002/jcc.20668
Subject(s) - maxima and minima , cluster (spacecraft) , lattice (music) , core (optical fiber) , inner core , space (punctuation) , global optimization , statistical physics , configuration space , physics , computer science , algorithm , mathematics , quantum mechanics , mathematical analysis , optics , geophysics , acoustics , programming language , operating system
Abstract A variation of the previous dynamic lattice searching (DLS) method, named as DLS with constructed core (DLSc), was proposed for structural optimization of Lennard‐Jones (LJ) clusters. In the new method, the starting random structure is generated with an icosahedron or a decahedron as a core. For a cluster with n shells, the atoms in the inner n − 2 shells are set as a fixed core, and the remaining atoms in the outer 2 shells are optimized by DLS. With applications of DLSc to optimization of LJ100–200 and LJ660–670, it was found that all the putative global minima can be obtained by using the DLSc method, and the method was proved to be high efficient compared with the previous DLS, because the searching space is reduced by the use of the fixed core. However, although DLSc is still an unbiased approach for smaller LJ clusters, it turned out to be biased for large ones. Further works are still needed to make it to be a more general method for cluster optimization problem. © 2007 Wiley Periodicals, Inc. J Comput Chem, 2007