✦ LIBER ✦

Clever and Efficient Method for Searching Optimal Geometries of Lennard-Jones Clusters

✍ Scribed by Takeuchi, Hiroshi

Book ID: 121417322
Publisher: American Chemical Society
Year: 2006
Tongue: English
Weight: 85 KB
Volume: 46
Category: Article
ISSN: 0095-2338
DOI: 10.1021/ci600206k

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A dynamic lattice searching method for f

A dynamic lattice searching method for fast optimization of Lennard–Jones clusters

✍ Xueguang Shao; Longjiu Cheng; Wensheng Cai 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 106 KB

## 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

An unbiased population-based search for

An unbiased population-based search for the geometry optimization of Lennard–Jones clusters: 2 ≤ N ≤ 372

✍ Wayne Pullan 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 197 KB

## Abstract This article presents the results obtained using an unbiased Population Based Search (PBS) for optimizing Lennard–Jones clusters. PBS is able to repeatedly obtain all putative global minima, for Lennard–Jones clusters in the range 2 ≤ __N__ ≤ 372, as reported in the Cambridge Cluster Da

A dynamic lattice searching method with

A dynamic lattice searching method with constructed core for optimization of large lennard-jones clusters

✍ Xiaoli Yang; Wensheng Cai; Xueguang Shao 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 340 KB 👁 1 views

## 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

A dynamic lattice searching method with

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

✍ Xueguang Shao; Xiaoli Yang; Wensheng Cai 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 271 KB

## 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

Smoothing techniques of global optimizat

Smoothing techniques of global optimization: Distance scaling method in searches for most stable Lennard-Jones atomic clusters

✍ Pillardy, Jaros?aw; Piela, Lucjan 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 187 KB

Spatial averaging of the potential energy function facilitates the search for the most stable configuration of a molecular system. Recently some global optimization methods of this kind have been designed in the literature that rely on physical phenomena such as diffusion, wave function evolution in

An Efficient Method Based on Lattice Con

An Efficient Method Based on Lattice Construction and the Genetic Algorithm for Optimization of Large Lennard-Jones Clusters

✍ Xiang, ; Jiang, ; Cai, ; Shao, 📂 Article 📅 2004 🏛 American Chemical Society 🌐 English ⚖ 218 KB