.png){kind=icon}
.png){kind=icon}
Return
An Efficient Growth Pattern Algorithm (GrowPAL) for Cluster Structure Prediction
.png){kind=icon}
OA
AI
DOI：10.1021/acs.jctc.4c00365.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Identifying the lowest energy isomers in large clusters is a major challenge. Here, we introduce the Growth Pattern Algorithm (GrowPAL), a new approach that generates initial seeds composed of n+1 atoms from the system with n atoms through an interstitial-type addition (I-type) mechanism. We evaluated the effectiveness of GrowPAL on Lennard-Jones (LJ) clusters with up to n = 80 atoms, verifying the algorithm's ability to find challenging minima such as LJ(38) and the partially icosahedral LJ(69) with fewer optimizations than existing methods. In addition, we discuss the advantages and limitations of GrowPAL using our deconstruction scheme, which identifies forebears structures to study growth pathways. Having evaluated the strengths and weaknesses of GrowPAL, we employed it to explore Sutton-Chen clusters containing 5 to 80 atoms, uncovering three new lowest energy forms. We then applied GrowPAL to boron clusters containing 8 to 15 atoms, successfully identifying all reported minima. Overall, GrowPAL offers a practical solution for efficiently identifying global minima in hierarchical systems, thereby reducing computational costs.
Keywords:
LENNARD-JONES CLUSTERS
OPTIMIZATION
TRANSITION
SEARCH
MINIMA
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
5.5
Papers:
1.1W
Citations:
5.4W