A Rapid Dynamical Monte Carlo Algorithm for Glassy Systems

Details A Rapid Dynamical Monte Carlo Algorithm for Glassy Systems A Rapid Dynamical Monte Carlo Algorithm for Glassy Systems

1994-07-05

arxiv.org/abs/cond-mat/9407019v1

Physics

Condensed Matter

RevTex 7 pages + 4 figures (uuencoded) appended; LPS preprint

Scientific paper

10.1088/0305-4470/27/18/012

In this paper we present a dynamical Monte Carlo algorithm which is applicable to systems satisfying a clustering condition: during the dynamical evolution the system is mostly trapped in deep local minima (as happens in glasses, pinning problems etc.). We compare the algorithm to the usual Monte Carlo algorithm, using as an example the Bernasconi model. In this model, a straightforward implementation of the algorithm gives an improvement of several orders of magnitude in computational speed with respect to a recent, already very efficient, implementation of the algorithm of Bortz, Kalos and Lebowitz.

Affiliated with

Also associated with

No associations

Rating

A Rapid Dynamical Monte Carlo Algorithm for Glassy Systems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Rapid Dynamical Monte Carlo Algorithm for Glassy Systems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Rapid Dynamical Monte Carlo Algorithm for Glassy Systems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-615702