Simulation of order transitions on a parallel computer

David Handscomb

Mathematics and Computers in Simulation (MATCOM), 1998, vol. 47, issue 2, 319-327

Abstract: The traditional Monte Carlo simulation of order transitions in a ferromagnet (or in a binary crystalline alloy) is carried out by generating a sequence of local swaps (spin reversals or exchanges of atoms) on a finite lattice, each of which in turn is accepted or rejected according to probabilities prescribed by Metropolis et al., and thus creating a sample from the limit distribution of the resulting Markov chain. The limit can, however, take a long time to reach, especially near critical temperatures, if the lattice used is large enough to mask boundary effects. Since the probability is fairly small that successive swaps in the sequence involve directly interacting lattice sites, it makes sense to save time by performing them simultaneously where possible, by running the simulation on a parallel computer. This report discusses, at an elementary level, some of the theoretical and practical questions that can arise in doing so.

Keywords: Ising lattice; Metropolis sampling scheme; Parallel computation; Bulk synchronous parallel (BSP) model (search for similar items in EconPapers)
Date: 1998
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0378475498001086
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:matcom:v:47:y:1998:i:2:p:319-327

DOI: 10.1016/S0378-4754(98)00108-6

Access Statistics for this article

Mathematics and Computers in Simulation (MATCOM) is currently edited by Robert Beauwens

More articles in Mathematics and Computers in Simulation (MATCOM) from Elsevier
Bibliographic data for series maintained by Catherine Liu ().