A dynamic lattice searching method with interior operation for unbiased optimization of large Lennard-Jones clusters

✍ Scribed by Xueguang Shao; Xiaoli Yang; Wensheng Cai

• Publisher: John Wiley and Sons
• Year: 2008
• Tongue: English
• Weight: 271 KB
• Volume: 29
• Category: Article
• ISSN: 0192-8651
• DOI: 10.1002/jcc.20938

✦ Synopsis

Abstract

For improving the efficiency of dynamic lattice searching (DLS) method for unbiased optimization of large Lennard‐Jones (LJ) clusters, a variant of the interior operation (IO) proposed by Takeuchi was combined with DLS. The method is named as DLS‐IO. In the method, the IO moves outer atoms with higher energy toward the coordinates center, i.e., (0, 0, 0), of a cluster and a local minimization (LM) follows each IO. This makes the interior atoms more compact and the outer atoms more uniformly distributed with lower potential energy. Therefore, the starting structure for DLS operations is closer to the global optimum compared with the randomly generated structures. On the other hand, a method to identify the central atom is proposed for the central vacancy problem. Optimizations of LJ~500~, LJ~561~, LJ~660~, LJ~665~, and LJ~670~ were investigated with the DLS‐IO, and the structural transition during the optimization was analyzed. It was found that the method is efficient and unbiased for optimization of large LJ clusters, and it may be a promising approach to be universally used for structural optimizations. © 2008 Wiley Periodicals, Inc. J Comput Chem, 2008