The lid method for exhaustive exploration of metastable states of complex systems

The ‘lid’ algorithm is designed for the exhaustive exploration of neighborhoods of local energy minima of energy landscapes. This paper describes an implementation of the algorithm, including issues of parallel performance and scalability. To illustrate the versatility of the approach and to stress...

Full description

Saved in:
Bibliographic Details
Published in:Computer physics communications 1999-01, Vol.116 (1), p.17-27
Main Authors: Sibani, Paolo, van der Pas, Ruud, Schön, J. Christian
Format: Article
Language:English
Subjects:
Classical statistical mechanics
Computational techniques
Condensed matter: electronic structure, electrical, magnetic, and optical properties
Exact sciences and technology
General theory and models of magnetic ordering
Lattice theory and statistics (ising, potts, etc.)
Magnetic properties and materials
Mathematical methods in physics
Physics
Spin-glass and other random models
Statistical physics, thermodynamics, and nonlinear dynamical systems
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The ‘lid’ algorithm is designed for the exhaustive exploration of neighborhoods of local energy minima of energy landscapes. This paper describes an implementation of the algorithm, including issues of parallel performance and scalability. To illustrate the versatility of the approach and to stress the common features present in landscapes of quite different systems, we present selected results for (1) a spin glass, (2) a ferromagnet, (3) a covalent network model for glassy systems, and (4) a polymer. The exponential nature of the local density of states found in these systems and its relation to the ordering transition is briefly commented upon.
ISSN:0010-4655
1879-2944
DOI:10.1016/S0010-4655(98)00176-3