Skip to main content
Log in

Minimum Inter-Particle Distance at Global Minimizers of Lennard-Jones Clusters

  • Published:
Journal of Global Optimization Aims and scope Submit manuscript

Abstract

In computer simulations of molecular conformation and protein folding, a significant part of computing time is spent in the evaluation of potential energy functions and force fields. Therefore many algorithms for fast evaluation of potential energy functions and force fields are proposed in the literature. However, most of these algorithms assume that the particles are uniformly distributed in order to guarantee good performance. In this paper, we prove that the minimum inter-particle distance at any global minimizer of Lennard-Jones clusters is bounded away from zero by a positive constant which is independent of the number of particles. As a by-product, we also prove that the global minimum of an n particle Lennard-Jones cluster is bounded between two linear functions. Our first result is useful in the design of fast algorithms for potential function and force field evaluation. Our second result can be used to decide how good a local minimizer is.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. A. W. Appel, An efficient program for many-body simulation, SIAM Journal on Scientific and Statistical Computing Vol. 6(1985), pp. 85–103.

    Google Scholar 

  2. J. E. Barnes and P. Hut, A hierarchical O(n log n) force-calculation algorithm, Nature 324(1986), pp. 446–449.

    Google Scholar 

  3. K. Esselink, The order of Appel's algorithm, Information Processing Letters Vol. 41(1992), pp. 141–147.

    Google Scholar 

  4. L. Greengard and V. I. Rokhlin, A fast algorithm for particle simulations, Journal of Computational Physics 73 (1987), 325–348.

    Google Scholar 

  5. M. R. Hoare, Structure and dynamics of simple microclusters, Advances in Chemical Physics Vol. 40(1979), pp. 49–135.

    Google Scholar 

  6. P.M. Pardalos, D. Shalloway and G.L. Xue, Optimization methods for computing global minima of non-convex potential energy functions, Journal of Global Optimization, Vol. 4(1994), pp. 117–133.

    Google Scholar 

  7. F.M. Richards, The protein folding problem, Scientific American, January 1991, pp. 54–63.

  8. G.L. Xue, R.S. Majer and J.B. Rosen, Minimizing the Lennard-Jones potential function on a massively parallel computer, Proceedings of the 1992 ACM International Conference on Supercomputing, pp. 409–416, ACM Press, 1992.

  9. G.L. Xue, A. Zall and P.M. Pardalos, Rapid evaluation of potential energy functions in molecular and protein conformations, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Vol. 23(1995), pp. 237–249.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Xue, G. Minimum Inter-Particle Distance at Global Minimizers of Lennard-Jones Clusters. Journal of Global Optimization 11, 83–90 (1997). https://doi.org/10.1023/A:1008284629099

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1008284629099

Navigation