Order-N Cluster Monte Carlo Method for Spin Systems with Long-range Interactions

Physics – Condensed Matter – Statistical Mechanics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

25 pages, 4 figures

Scientific paper

10.1016/j.jcp.2008.12.022

An efficient O(N) cluster Monte Carlo method for Ising models with long-range interactions is presented. Our novel algorithm does not introduce any cutoff for interaction range and thus it strictly fulfills the detailed balance. The realized stochastic dynamics is equivalent to that of the conventional Swendsen-Wang algorithm, which requires O(N^2) operations per Monte Carlo sweep if applied to long-range interacting models. In addition, it is shown that the total energy and the specific heat can also be measured in O(N) time. We demonstrate the efficiency of our algorithm over the conventional method and the O(N log N) algorithm by Luijten and Bloete. We also apply our algorithm to the classical and quantum Ising chains with inverse-square ferromagnetic interactions, and confirm in a high accuracy that a Kosterlitz-Thouless phase transition, associated with a universal jump in the magnetization, occurs in both cases.

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

Order-N Cluster Monte Carlo Method for Spin Systems with Long-range 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 Order-N Cluster Monte Carlo Method for Spin Systems with Long-range Interactions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Order-N Cluster Monte Carlo Method for Spin Systems with Long-range Interactions will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-216935

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