## 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
Geometry Optimization and Conformational Analysis of (C60)N Clusters Using a Dynamic Lattice-Searching Method
✍ Scribed by Longjiu Cheng; Wensheng Cai; Xueguang Shao
- Publisher
- John Wiley and Sons
- Year
- 2005
- Tongue
- English
- Weight
- 223 KB
- Volume
- 6
- Category
- Article
- ISSN
- 1439-4235
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
## 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
## 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