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 28 September 1993
  • Physics, Computer Science
  • Computer Physics Communications

Figures and Tables from this paper

Fast and Reliable Random Number Generators for Scientific Computing ( extended abstract )

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.

Fast and Reliable Random Number Generators for Scientific Computing

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.

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 random

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 pseudo

Random numbers for large scale distributed Monte Carlo simulations

  • H. BaukeS. Mertens
  • Computer Science
    Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2007
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.

Random number generators for massively parallel simulations on GPU

A broad review of existing CUDA variants of random-number generators is provided and the CUDA implementation of a new massively parallel high-quality, high-performance generator with a small memory load overhead is presented.

Chapter 3 Uniform Random Number Generation

Random Number Generation and Simulation on Vector and Parallel Computers

  • R. Brent
  • Computer Science, Mathematics
    Euro-Par
  • 1998
This work considers the requirements for a good parallel random number generator, and describes a new class of generators for the normal distribution (based on a proposal by Wallace), which can give very fast vector or parallel implementations.
...

References

SHOWING 1-10 OF 22 REFERENCES

Analysis of random number generators using Monte Carlo simulation

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.

Monte Carlo simulations: Hidden errors from "good" random number generators.

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.

On the lattice structure of the add-with-carry and subtract-with-borrow random number generators

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.

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) random

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 of

Semi-Numerical Algorithms

  • in: The Art of Computer Programming, vol. 2, 2nd ed.
  • 1981