Global Minimization of Lennard-Jones Functions on Transputer Networks
- 220 Downloads
This paper presents a three-phase computational procedure for minimizing molecular energy potential functions of the pure Lennard-Jones type. The first phase consists of a special heuristic for generating an initial atomic configuration. In the second phase a global minimization method is applied to compute a configuration close to the optimal solution. Finally, the third phase uses this configuration as the starting point for a local minimization method. Since the second and third phases are very suitable for parallel implementation, we describe briefly our implementation of the method in a parallel version of C on a transputer network, and we exhibit numerical results for approximate optimization of clusters with up to 20,000 atoms.
Key wordsglobal optimization Lennard-Jones potential transputer networks parallel computing
Unable to display preview. Download preview PDF.
- R.H. Byrd, E. Eskow, and R.B. Schnabel, A new large-scale global optimization method and its application to Lennard-Jones problems, Technical report, University of Colorado at Boulder (1992).Google Scholar
- T. Coleman, D. Shalloway, and Z. Wu, Isotropic effective energy simulated annealing searches for low energy molecular cluster states, Technical Report, Cornell Theory Center, Cornell University, Ithaca, NY (1992).Google Scholar
- T. Coleman, D. Shalloway, and Z. Wu, A parallel build-up algorithm for global energy minimization of molecular clusters using effective energy simulated an-nealing,Technical Report, Cornell Theory Center, Cornell University, Ithaca, NY (1993).Google Scholar
- R.S. Maier, J.B. Rosen, and G.L. Xue, A discrete-continuous algorithm for molecular energy minimization,Technical report, U. S. Army High-Performance Computing Research Center, University of Minnesota, Minneapolis, MN (1992).Google Scholar