A portable high-quality random number generator for lattice field theory simulations

@article{Luescher1994APH,
  title={A portable high-quality random number generator for lattice field theory simulations},
  author={Martin Luescher},
  journal={Computer Physics Communications},
  year={1994},
  volume={79},
  pages={100-110}
}
  • M. Luescher
  • Published 1994
  • Mathematics, Physics
  • Computer Physics Communications
Abstract The theory underlying a proposed random number generator for numerical simulations in elementary particle physics and statistical mechanics is discussed. The generator is based on an algorithm introduced by Marsaglia and Zaman, with an important added feature leading to demonstrably good statistical properties. It can be implemented exactly on any computer complying with the IEEE-754 standard for single-precision floating-point arithmetic. 
Fast and Reliable Random Number Generators for Scientific Computing ( extended abstract )
Fast and reliable pseudo-random number generators are required for simulation and other applications in Scientific Computing. We outline the requirements for good uniform random number generators,Expand
Fast and Reliable Random Number Generators for Scientific Computing
TLDR
The requirements for good uniform random number generators are outlined, and a class of generators having very fast vector/parallel implementations with excellent statistical properties are described. Expand
Parallel Computations Reveal Hidden Errors of Commonly Used Random Number Generators
This paper reports that in parallel Monte-Carlo simulations of the 2D Ising-Model, commonly used pseudo-random number generators (PRNG) lead to manifestly erroneous results. When parallel randomExpand
Pseudo-random number generators for Monte Carlo simulations on ATI Graphics Processing Units
  • V. Demchik
  • Computer Science, Physics
  • Comput. Phys. Commun.
  • 2011
TLDR
Basic uniform pseudo-random number generators are implemented on ATI Graphics Processing Units (GPU) and RANLUX generator is found to be the most appropriate for using on GPU in Monte Carlo simulations. Expand
An Introduction to Monte Carlo Simulation of Statistical physics Problem
A brief introduction to the technique of Monte Carlo for simulation of statistical physics problems is presented. Ising spin model is taken as an example. The topics covered include random and pseudoExpand
Random numbers for large scale distributed Monte Carlo simulations
  • H. Bauke, S. Mertens
  • Computer Science, Physics
  • Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2007
TLDR
It is demonstrated that multiple linear recurrences in finite fields are an ideal method to produce high quality pseudorandom numbers in sequential and parallel algorithms. Expand
Random number generators for massively parallel simulations on GPU
High-performance streams of (pseudo) random numbers are crucial for the efficient implementation of countless stochastic algorithms, most importantly, Monte Carlo simulations and molecular dynamicsExpand
Chapter 3 Uniform Random Number Generation
TLDR
This chapter covers the basic design principles and methods for uniform random number generators used in simulation, and focuses on the methods based on linear recurrences modulo a large integer, or modulo 2. Expand
A comparative study of some pseudorandom number generators
Abstract We present results of a test program of a group of pseudorandom number generators which are commonly used in the applications of physics, in particular in Monte Carlo simulations. TheExpand
Multidimensional sampling for simulation and integration: measures, discrepancies, and quasi-random numbers
Abstract This is basically a review of the field of Quasi-Monte Carlo intended for computational physicists and other potential users of quasi-random numbers. As such, much of the material is notExpand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 17 REFERENCES
A comparative study of some pseudorandom number generators
Abstract We present results of a test program of a group of pseudorandom number generators which are commonly used in the applications of physics, in particular in Monte Carlo simulations. TheExpand
A random number generator for parallel computers
TLDR
An efficient parallelization of the Generalized Feedback Shift Register (GFSR) algorithm for generating pseudorandom numbers is presented and works on any parallel computer where the number of processors is a power of two and requires the same amount of memory per processor as required by the sequential GFSR algorithm. Expand
Analysis of random number generators using Monte Carlo simulation
TLDR
The performance of some popular random number generators is compared by high precision Monte Carlo simulation of the 2-d Ising model, for which exact results are known, using the Metropolis, Swendsen-Wang, and Wolff Monte Carlo algorithms. Expand
A Review of Pseudorandom Number Generators
This is a brief review of the current situation concerning practical pseudorandom number generation for Monte Carlo calculations. The conclusion is that pseudorandom number generators with theExpand
Monte Carlo simulations: Hidden errors from "good" random number generators.
TLDR
This work shows how the Wolff algorithm, now accepted as the best cluster-flipping Monte Carlo algorithm for beating ``critical slowing down,'' can yield incorrect answers due to subtle correlations in ``high quality'' random number generators. Expand
RANLUX: A Fortran implementation of the high-quality pseudorandom number generator of Lüscher
TLDR
A portable Fortran 77 implementation of a high-quality generator called RANLUX (for LUXury RANdom numbers), using the algorithm of Martin Luscher described in an accompanying article. Expand
A review talk about computers and theoretical physics
TLDR
The present status of home made and commercial super-computers, and their use in theoretical physics are reviewed, and strategies to make good use of computers are discussed. Expand
On the lattice structure of the add-with-carry and subtract-with-borrow random number generators
TLDR
It is shown that these sequences are essentially equivalent to linear congruential sequences with very large prime moduli, and how the equivalence can be exploited to implement efficient jumping-ahead facilities for the AWC and SWB sequences. Expand
On the lattice structure of certain linear congruential sequences related to AWC/SWB generators
We analyze the lattice structure of certain types of linear congru- ential generators (LCGs), which include close approximations to the add-with- carry and subtract-with-borrow (AWC/SWB) randomExpand
Hamiltonian Systems: Chaos and Quantization
Preface 1. Linear dynamical systems 2. Nonlinear systems 3. Chaotic systems 4. Normal forms 5. Maps of the circle 6. Integrable and quasi-integrable systems 7. Torus quantization 8. Quantization ofExpand
...
1
2
...