## Abstract A highly efficient unbiased global optimization method called dynamic lattice searching (DLS) was proposed. The method starts with a randomly generated local minimum, and finds better solution by a circulation of construction and searching of the dynamic lattice (DL) until the better so
A dynamic lattice searching method with constructed core for optimization of large lennard-jones clusters
✍ Scribed by Xiaoli Yang; Wensheng Cai; Xueguang Shao
- Publisher
- John Wiley and Sons
- Year
- 2007
- Tongue
- English
- Weight
- 340 KB
- Volume
- 28
- Category
- Article
- ISSN
- 0192-8651
No coin nor oath required. For personal study only.
✦ Synopsis
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
📜 SIMILAR VOLUMES
## 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 at