A Review of Pseudorandom Number Generators

  title={A Review of Pseudorandom Number Generators},
  author={F. James},
  journal={Computer Physics Communications},
  • F. James
  • Published 1990
  • Mathematics
  • Computer Physics Communications
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 the required properties are now available, but the generators actually used are often not good enough. Portable Fortran code is given for three different pseudorandom number generators, all of which have much better properties than any of the traditional generators commonly supplied in most program libraries. 
New methods for pseudorandom numbers and pseudorandom vector generation
A brief survey of recent developments in uniform pseudorandom number generation, with an emphasis on nonlinear congruential methods, and some new results on the explicit inversive congruentials method are established. 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
New Developments in Uniform Pseudorandom Number and Vector Generation
A survey of recent and new developments in the areas of uniform pseudorandom number and uniform pseudorandom vector generation is presented. The emphasis is on generators for which a detailedExpand
A Repetition Test for Pseudo-Random Number Generators
A new statistical test for uniform pseudo-random number generators (PRNGs) is presented, showing that some PRNGs considered to have good statistical properties fail. Expand
A Collection of Selected Pseudorandom Number Generators With Linear Structures
This is a collection of selected linear pseudorandom number that were implemented in commercial software, used in applications, and some of which have extensively been tested, to study the applicability of linear congruential generators on parallel architectures. Expand
A new inversive congruential pseudorandom number generator with power of two modulus
In the present paper a new inversive congruential generator with power of two modulus is introduced and periodicity and statistical independence properties of the generated sequences are analyzed. Expand
From Mersenne Primes to Random Number Generators
Fast and reliable pseudo-random number generators are required for simulation and other applications in Scientific Computing. Because of Moore’s law, random number generators that were satisfactoryExpand
Uniform Random Number Generators for Vector and Parallel Computers
A proposal for a class of random number generators which have good statistical properties and can be implemented eciently on vector processors and parallel machines is made. Expand
A study of 64-bit multipliers for Lehmer pseudorandom number generators
Abstract A study was conducted of multipliers for 64-bit congruential pseudorandom number generators. Extensive analysis and testing resulted in the identification of over 200 good multipliers of theExpand
Uniform random number generators for supercomputers
A class of random number generators which have good statistical properties and can be implemented eciently on vector processors and parallel machines is proposed. Expand


Toward a universal random number generator
An approach towards a random number generator that passes all of the stringent tests for randomness the authors have put to it, and that is able to produce exactly the same sequence of uniform random variables in a wide variety of computers. Expand
A random number generator for PC's
Abstract It is now possible to do serious scientific work on personal computers (PC's). Many simulation studies, whether exploratory or for production runs, call for random numbers. We offer here aExpand
Efficient and portable combined random number generators
An efficient way to combine two or more Multiplicative Linear Congruential Generators (MLCGs) is presented and a generator whose period is the least common multiple of the individual periods is produced. Expand
The Structure of Linear Congruential Sequences
Publisher Summary This chapter discusses the structure of linear congruential sequences and their suitability as a source of random integers in a computer. Every congruential sequence is made up ofExpand
Monte Carlo Theory and Practice
The Monte Carlo method has long been recognised as a powerful technique for performing certain calculations, generally those too complicated for a more classical approach. Since the use of high-speedExpand
The Mathematical Basis of Monte Carlo and Quasi-Monte Carlo Methods
The proper justification of the normal practice of Monte Carlo integration must be based not on the randomness of the procedure, which is spurious, but on equidistribution properties of the sets ofExpand
Matrices and the structure of random number sequences
Abstract This note provides a short, self-contained treatment, using linear algebra and matrix theory, for establishing maximal periods, underlying structure, and choice of starting values forExpand