A discrete-continuous algorithm for molecular energy minimization

R. S. Maier, J. B. Rosen, G. L. Xue

Research output: Chapter in Book/Report/Conference proceedingConference contribution

5 Scopus citations

Abstract

We present a parallel algorithm for minimizing molecular energy potential functions applied to the case of pure Lennard-Jones clusters. The algorithm demonstrates the combination of discrete, latticebased optimization with continuous optimization (relaxation) techniques. The suggested approach is not restricted to the Lennard-Jones potential and is aimed at problems in which the potential of interest may be significantly more costly than the Lennard-Jones. The intended audience includes researchers interested in practical computational problems involving minimum energy cluster conformation, such as may arise in catalysis, and those interested in algorithm development. The advantage of the algorithm is that the time required to find the minimum-energy structure for a relatively large cluster reduces to that of an interactive session. Our parallel implementation is capable of determining the best-known, previously published binding energies for n ≤ 150 LJ clusters in a matter of seconds and has provided new results on minimum energies for clusters of up to n - 1000 atoms using a massivelyparallel processor, the Thinking Machines CM-5.

Original languageEnglish (US)
Title of host publicationProceedings of the 1992 ACM/IEEE conference on Supercomputing, Supercomputing 1992
EditorsRobert Werner
PublisherAssociation for Computing Machinery
Pages778-786
Number of pages9
ISBN (Electronic)0818626305
DOIs
StatePublished - Dec 1 1992
Externally publishedYes
Event1992 ACM/IEEE conference on Supercomputing, Supercomputing 1992 - Minneapolis, United States
Duration: Nov 16 1992Nov 20 1992

Publication series

NameProceedings of the International Conference on Supercomputing
VolumePart F129723

Other

Other1992 ACM/IEEE conference on Supercomputing, Supercomputing 1992
Country/TerritoryUnited States
CityMinneapolis
Period11/16/9211/20/92

ASJC Scopus subject areas

  • General Computer Science

Fingerprint

Dive into the research topics of 'A discrete-continuous algorithm for molecular energy minimization'. Together they form a unique fingerprint.

Cite this