A genetic algorithm for Lennard-Jones atomic clusters
In regard to the problem of determining minimum L-J configurations for clusters of n atoms, we present here a genetic algorithm able to reproduce all best-known solutions in the 13 < n < 147 size range. These include not only the classical structures adhering to the icosahedral-growth, but als...
| Autores: | , , , |
|---|---|
| Tipo de recurso: | artículo |
| Estado: | Versión publicada |
| Fecha de publicación: | 1999 |
| País: | México |
| Institución: | Universidad Nacional Autónoma de México |
| Repositorio: | Sistema de Información de la Facultad de Ciencias, UNAM |
| OAI Identifier: | oai:repositorio.fciencias.unam.mx:11154/2636 |
| Acceso en línea: | http://hdl.handle.net/11154/2636 |
| Access Level: | acceso abierto |
| Palabra clave: | Mathematics, Applied atomic cluster Lennard-Jones genetic algorithm global optimization |
| Sumario: | In regard to the problem of determining minimum L-J configurations for clusters of n atoms, we present here a genetic algorithm able to reproduce all best-known solutions in the 13 < n < 147 size range. These include not only the classical structures adhering to the icosahedral-growth, but also seven icosahedral structures with incomplete core, six more following the Marks decahedron geometry, and the unique (n = 38) face-centered cubic configuration that has been found in this range. (C) 1999 Elsevier Science Ltd. All rights reserved. |
|---|