A dynamic lattice searching method with constructed core for optimization of large Lennard-Jones clusters

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 c...

Ausführliche Beschreibung

Bibliographische Detailangaben
Veröffentlicht in:Journal of computational chemistry. - 1984. - 28(2007), 8 vom: 01. Juni, Seite 1427-33
1. Verfasser: Yang, Xiaoli (VerfasserIn)
Weitere Verfasser: Cai, Wensheng, Shao, Xueguang
Format: Aufsatz
Sprache:English
Veröffentlicht: 2007
Zugriff auf das übergeordnete Werk:Journal of computational chemistry
Schlagworte:Journal Article
LEADER 01000caa a22002652 4500
001 NLM16869896X
003 DE-627
005 20250208020451.0
007 tu
008 231223s2007 xx ||||| 00| ||eng c
028 5 2 |a pubmed25n0562.xml 
035 |a (DE-627)NLM16869896X 
035 |a (NLM)17330880 
040 |a DE-627  |b ger  |c DE-627  |e rakwb 
041 |a eng 
100 1 |a Yang, Xiaoli  |e verfasserin  |4 aut 
245 1 2 |a A dynamic lattice searching method with constructed core for optimization of large Lennard-Jones clusters 
264 1 |c 2007 
336 |a Text  |b txt  |2 rdacontent 
337 |a ohne Hilfsmittel zu benutzen  |b n  |2 rdamedia 
338 |a Band  |b nc  |2 rdacarrier 
500 |a Date Completed 01.06.2007 
500 |a Date Revised 17.04.2007 
500 |a published: Print 
500 |a Citation Status PubMed-not-MEDLINE 
520 |a 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 
650 4 |a Journal Article 
700 1 |a Cai, Wensheng  |e verfasserin  |4 aut 
700 1 |a Shao, Xueguang  |e verfasserin  |4 aut 
773 0 8 |i Enthalten in  |t Journal of computational chemistry  |d 1984  |g 28(2007), 8 vom: 01. Juni, Seite 1427-33  |w (DE-627)NLM098138448  |x 1096-987X  |7 nnns 
773 1 8 |g volume:28  |g year:2007  |g number:8  |g day:01  |g month:06  |g pages:1427-33 
912 |a GBV_USEFLAG_A 
912 |a SYSFLAG_A 
912 |a GBV_NLM 
912 |a GBV_ILN_350 
951 |a AR 
952 |d 28  |j 2007  |e 8  |b 01  |c 06  |h 1427-33