Loop algorithm for classical antiferromagnetic Heisenberg models with biquadratic interactions

Physics – Condensed Matter – Statistical Mechanics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

6 pages, 3 figures (accepted for publication in the proceedings of ICFCM)

Scientific paper

10.1088/1742-6596/320/1/012009

Monte Carlo simulation using the standard single-spin flip algorithm often fails to sample over the entire configuration space at low temperatures for frustrated spin systems. A typical example is a class of spin-ice type Ising models. In this case, the difficulty can be avoided by introducing a global-flip algorithm, the loop algorithm. Similar difficulty is encountered in O(3) Heisenberg models in the presence of biquadratic interaction. The loop algorithm, however, is not straightforwardly applied to this case, since the system does not have a priori spin-anisotropy axis for constructing the loops. We propose an extension of the loop algorithm to the bilinear-biquadratic models. The efficiency is tested for three different ways to flip spins on a loop in Monte Carlo simulation. We show that the most efficient method depends on the strength of the biquadratic interaction.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Loop algorithm for classical antiferromagnetic Heisenberg models with biquadratic interactions 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 Loop algorithm for classical antiferromagnetic Heisenberg models with biquadratic interactions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Loop algorithm for classical antiferromagnetic Heisenberg models with biquadratic interactions will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-680477

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.