A fast normal random number generator

  title={A fast normal random number generator},
  author={Joseph L. Leva},
  journal={ACM Trans. Math. Softw.},
  • J. L. Leva
  • Published 1 December 1992
  • Computer Science
  • ACM Trans. Math. Softw.
A method is presented for generating pseudorandom numbers with a normal distribution. The technique uses the ratio of uniform deviates method discovered by Kinderman and Monahan with an improved set of bounding curves. An optimized quadratic fit reduces the expected number of logarithm evaluations to 0.012 per normal deviate. The method gives a theoretically correct distribution and can be implemented in 15 lines of FORTRAN. Timing and source size comparisons are made with other methods for… 

Figures and Tables from this paper

Fast pseudorandom generators for normal and exponential variates

Fast algorithms for generating pseudorandom numbers from the unit-normal and unit-exponential distributions are described. The methods are unusual in that they do not rely on a source of uniform

The Ziggurat Method for Generating Random Variables

We provide a new version of our ziggurat method for generating a random variable from a given decreasing density. It is faster and simpler than the original, and will produce, for example, normal or

Fast normal random number generators on vector processors

  • R. Brent
  • Computer Science, Mathematics
  • 2010
We consider pseudo-random number generators suitable for vector processors. In particular, we describe vectorised implementations of the Box-Muller and Polar methods, and show that they give good

Sampling Exactly from the Normal Distribution

An algorithm for sampling exactly from the normal distribution that reads some number of uniformly distributed random digits in a given base and generates an initial portion of the representation of a normal deviate in the same base with mean cost that scales linearly in the precision.

Some Comments on C. S. Wallace's Random Number Generators

This work considers Chris Wallace’s recent idea for generating normally distributed variates without relying on a source of uniform random numbers, and compares it with more conventional methods for generating normal random numbers.

A fast vectorised implementation of Wallace's normal random number generator

  • R. Brent
  • Computer Science, Mathematics
  • 2010
A vectorised implementation of Wallace's pseudo-random generators for normal variates RANN4 is described which is more than three times faster than its best competitors (the Polar and Box-Muller methods) on the Fujitsu VP2200 and VPP300.

Gaussian random number generators

The algorithms underlying various GRNGs are described, their computational requirements are compared, and the quality of the random numbers are examined with emphasis on the behaviour in the tail region of the Gaussian probability density function.

Universal Algorithms as an Alternative for Generating Non-Uniform Continuous Random Variates

An overview of the most powerful universal methods, based on acceptance/rejection techniques where hat and squeezes are constructed automatically, which can be used for variance reduction techniques, and they produce random numbers of predictable quality.

Random Number Generation and Simulation on Vector and Parallel Computers

  • R. Brent
  • Computer Science, Mathematics
  • 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.

Twister Generator of Arbitrary Uniform Sequences

A novel approach to generate complete stochastic sequences which don’t need a congruential twisting array is proposed and combination of this novel approach with an algorithm of tuning for twisting generation affords the length extension of created sequences without requiring additional computer random access memory.



Computer Generation of Random Variables Using the Ratio of Uniform Deviates

The ratio-of-uniforms method for generating random variables having continuous nonuniform distributions is presented and can be used for generating short and often as fast algorithms as well as longer algorithms.

Algorithm 488: A Gaussian pseudo-random number generator

  • R. Brent
  • Mathematics, Computer Science
  • 1974
The algorithm calculates the exact cumulative distribution of the two-sided Kolmogorov-Smirnov statistic for samples with few observations for data sampling and discrete system simulation.

Computer methods for sampling from the exponential and normal distributions

The authors' primary conwiba~ion is the rise of polynomiaI sampling (as ex~ p/tiffed in Section 2) to eliminate any dependency on standard&ruction programs.

Applied Statistics Algorithms.

The Art of Computer Programmmg

  • 2nd ed.,
  • 1981

Seminumerical Algo- rithms

  • Seminumerical Algo- rithms
  • 1981

ED.) Applied Statistics Algorithms

  • ED.) Applied Statistics Algorithms
  • 1985

Received February ACM TransactIons on Mathematical Software

  • Received February ACM TransactIons on Mathematical Software
  • 1986