๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A new random-number generator for multispin Monte Carlo algorithms

โœ Scribed by L. Pierre; T. Giamarchi; H. J. Schulz

Publisher
Springer
Year
1987
Tongue
English
Weight
684 KB
Volume
48
Category
Article
ISSN
0022-4715

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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

Testing a new Monte Carlo algorithm for
Testing a new Monte Carlo algorithm for protein folding
โœ Ugo Bastolla; Helge Frauenkron; Erwin Gerstner; Peter Grassberger; Walter Nadler ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 397 KB ๐Ÿ‘ 1 views

We demonstrate that the recently proposed pruned-enriched Rosenbluth method (PERM) (Grassberger, Phys. Rev. E 56:3682, 1997) leads to extremely efficient algorithms for the folding of simple model proteins. We test it on several models for lattice heteropolymers, and compare it to published Monte Ca