A fast normal random number generator

  • Authors:
  • Joseph L. Leva

  • Affiliations:
  • MITRE Corp., Bedford, MA

  • Venue:
  • ACM Transactions on Mathematical Software (TOMS)
  • Year:
  • 1992

Quantified Score

Hi-index 0.00

Visualization

Abstract

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 generating normal deviates. The proposed algorithm compares favorably with some of the better algorithms.