On generalized cluster algorithms for frustrated spin models

Details On generalized cluster algorithms for frustrated spin models On generalized cluster algorithms for frustrated spin models

1994-02-07

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

Physics

Condensed Matter

34 pages in RevTeX. No figures included. A compressed postscript file for the paper with figures can be obtained via anonymous

Scientific paper

10.1103/PhysRevB.50.3058

Standard Monte Carlo cluster algorithms have proven to be very effective for many different spin models, however they fail for frustrated spin systems. Recently a generalized cluster algorithm was introduced that works extremely well for the fully frustrated Ising model on a square lattice, by placing bonds between sites based on information from plaquettes rather than links of the lattice. Here we study some properties of this algorithm and some variants of it. We introduce a practical methodology for constructing a generalized cluster algorithm for a given spin model, and investigate apply this method to some other frustrated Ising models. We find that such algorithms work well for simple fully frustrated Ising models in two dimensions, but appear to work poorly or not at all for more complex models such as spin glasses.

Affiliated with

Also associated with

No associations

Rating

On generalized cluster algorithms for frustrated spin models 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 On generalized cluster algorithms for frustrated spin models, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On generalized cluster algorithms for frustrated spin models will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-361357