IMPROVEMENT ON THE NORTHBY ALGORITHM FOR MOLECULAR-CONFORMATION - BETTER SOLUTIONS

In 1987, Northby presented an efficient lattice based search and optimization procedure to compute ground states of n-atom Lennard-Jones clusters and reported putative global minima for 13 less-than-or-equal-to n less-than-or-equal-to 150. In this paper, we introduce simple data structures which reduce the time complexity of the Northby algorithm for lattice search from O(n5/3) per move to O(n2/3) per move for an n-atom cluster involving full Lennard-Jones potential function. If nearest neighbor potential function is used, the time complexity can be further reduced to O(log n) per move for an n-atom cluster. The lattice local minimizers with lowest potential function values are relaxed by a powerful Truncated Newton algorithm. We are able to reproduce the minima reported by Northby. The improved algorithm is so efficient that less than 3 minutes of CPU time on the Cray-XMP is required for each cluster size in the above range. We then further improve the Northby algorithm by relaxing every lattice local minimizer found in the process. This certainly requires more time. However, lower energy configurations were found with this improved algorithm for n = 65, 66, 75, 76, 77 and 134. These findings also show that in some cases, the relaxation of a lattice local minimizer with a worse potential function value may lead to a local minimizer with a better potential function value.