Efficiency of random search procedures along the silicon cluster series : Si(n) (n=5-10, 15, and 20)

Copyright © 2011 Wiley Periodicals, Inc.

Bibliographische Detailangaben
Veröffentlicht in:Journal of computational chemistry. - 1984. - 32(2011), 9 vom: 15. Juli, Seite 1869-75
1. Verfasser: Avaltroni, Fabrice (VerfasserIn)
Weitere Verfasser: Corminboeuf, Clemence
Format: Online-Aufsatz
Sprache:English
Veröffentlicht: 2011
Zugriff auf das übergeordnete Werk:Journal of computational chemistry
Schlagworte:Journal Article
LEADER 01000naa a22002652 4500
001 NLM207186502
003 DE-627
005 20231224001535.0
007 cr uuu---uuuuu
008 231224s2011 xx |||||o 00| ||eng c
024 7 |a 10.1002/jcc.21769  |2 doi 
028 5 2 |a pubmed24n0691.xml 
035 |a (DE-627)NLM207186502 
035 |a (NLM)21462367 
040 |a DE-627  |b ger  |c DE-627  |e rakwb 
041 |a eng 
100 1 |a Avaltroni, Fabrice  |e verfasserin  |4 aut 
245 1 0 |a Efficiency of random search procedures along the silicon cluster series  |b Si(n) (n=5-10, 15, and 20) 
264 1 |c 2011 
336 |a Text  |b txt  |2 rdacontent 
337 |a ƒaComputermedien  |b c  |2 rdamedia 
338 |a ƒa Online-Ressource  |b cr  |2 rdacarrier 
500 |a Date Completed 24.08.2011 
500 |a Date Revised 26.04.2011 
500 |a published: Print-Electronic 
500 |a Citation Status PubMed-not-MEDLINE 
520 |a Copyright © 2011 Wiley Periodicals, Inc. 
520 |a The efficiency of the simplest isomeric search procedure consisting in random generation of sets of atomic coordinates followed by density functional theory geometry optimization is tested on the silicon cluster series (Si(5-10, 15, 20)). Criteria such as yield, isomer distributions and recurrences are used to clearly establish the performance of the approach with respect to increasing cluster size. The elimination of unphysical candidate structures and the use of distinct box shapes and theoretical levels are also investigated. For the smaller Si(n) (n=5-10) clusters, the generation of random coordinates within a spherical box is found to offer a reasonable alternative to more complex algorithms by allowing straightforward identification of every known low-lying local minima. The simple stochastic search of larger clusters (i.e. Si(15) and Si(20)) is however complicated by the exponentially increasing number of both low- and high-lying minima leading to rather arbitrary and non-comprehensive results 
650 4 |a Journal Article 
700 1 |a Corminboeuf, Clemence  |e verfasserin  |4 aut 
773 0 8 |i Enthalten in  |t Journal of computational chemistry  |d 1984  |g 32(2011), 9 vom: 15. Juli, Seite 1869-75  |w (DE-627)NLM098138448  |x 1096-987X  |7 nnns 
773 1 8 |g volume:32  |g year:2011  |g number:9  |g day:15  |g month:07  |g pages:1869-75 
856 4 0 |u http://dx.doi.org/10.1002/jcc.21769  |3 Volltext 
912 |a GBV_USEFLAG_A 
912 |a SYSFLAG_A 
912 |a GBV_NLM 
912 |a GBV_ILN_350 
951 |a AR 
952 |d 32  |j 2011  |e 9  |b 15  |c 07  |h 1869-75