The Hybrid Monte Carlo algorithm on parallel computers
โ Scribed by A.D. Kennedy
- Publisher
- Elsevier Science
- Year
- 1999
- Tongue
- English
- Weight
- 253 KB
- Volume
- 25
- Category
- Article
- ISSN
- 0167-8191
No coin nor oath required. For personal study only.
โฆ Synopsis
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.
๐ SIMILAR VOLUMES
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
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 res