✦ LIBER ✦

Monte Carlo parallel algorithm for long range interactions

✍ Scribed by F. Fucito; S. Solomon

Publisher: Elsevier Science
Year: 1985
Tongue: English
Weight: 440 KB
Volume: 34
Category: Article
ISSN: 0010-4655
DOI: 10.1016/0010-4655(85)90001-3

No coin nor oath required. For personal study only.

✦ Synopsis

We show the use of the homogenous architecture in the parallel processing of long range interactions. We describe the implementation of a Monte Carlo algorithm for a two-dimensional Coulomb system on a parallel processor with hypercubic geometry (the 8-node concurrent processor at Caltech).

Our results indicate that long range problems can be efficiently implemented on parallel machines. * Work supported in part by the U.S. Department of Energy under Contract DEAC 03-81-ER400SO. ** Weingart Fellow in Theoretical Physics.

where J is the inverse temperature. The statistical ~Bantrell Fellow in Theoretical Physics.

averages of different observablees -q(r)

📜 SIMILAR VOLUMES

Parallel and interacting Markov chain Mo

Parallel and interacting Markov chain Monte Carlo algorithm

✍ Fabien Campillo; Rivo Rakotozafy; Vivien Rossi 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 426 KB

Quasirandom Number Generators for Parall

Quasirandom Number Generators for Parallel Monte Carlo Algorithms

✍ B.C. Bromley 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 191 KB

A method for generating sequences of quasirandom numbers allows conventional serial Monte Carlo algorithms to be parallelized using a leapfrog scheme. Specifically, a Sobol' sequence can be broken up into interleaved subsets; with each processing node calculating a unique subset of the full sequence

Order-N cluster Monte Carlo method for s

Order-N cluster Monte Carlo method for spin systems with long-range interactions

✍ Kouki Fukui; Synge Todo 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 765 KB

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 conventio

The Hybrid Monte Carlo algorithm on para

The Hybrid Monte Carlo algorithm on parallel computers

✍ A.D. Kennedy 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 253 KB

I give a pedagogical introduction to the generalised Hybrid Monte Carlo and related algorithms. I shall explain why they work, how their performance depends upon the number of degrees of freedom and the correlation length, and how they can be tuned to reduce critical slowing down.

Parallelization strategies for molecular

Parallelization strategies for molecular simulation using the Monte Carlo algorithm

✍ Douglas M. Jones; Julia M. Goodfellow 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 1012 KB

We describe the development of Metropolis Monte Carlo algorithms for a general network of multiple instruction multiple data (MIMD) parallel processors. The implementation of farm, event, and systolic parallel algorithms on transputer-based computers is detailed and their relative performance discus

Parallel computing of a quasi-Monte Carl

Parallel computing of a quasi-Monte Carlo algorithm for valuing derivatives

✍ Jenny X. Li; Gary L. Mullen 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 172 KB

The performance of the standard Monte Carlo method is compared with the performance obtained through the use of tY mY s-nets in base b in the approximation of several high dimensional integral problems in valuing derivatives and other securities. The tY mY s-nets are generated by a parallel algorith