Gaussian random number generators

  • Authors:
  • David B. Thomas;Wayne Luk;Philip H.W. Leong;John D. Villasenor

  • Affiliations:
  • Imperial College;Imperial College;The Chinese University of Hong Kong and Imperial College;University of California, Los Angeles

  • Venue:
  • ACM Computing Surveys (CSUR)
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

Rapid generation of high quality Gaussian random numbers is a key capability for simulations across a wide range of disciplines. Advances in computing have brought the power to conduct simulations with very large numbers of random numbers and with it, the challenge of meeting increasingly stringent requirements on the quality of Gaussian random number generators (GRNG). This article describes the algorithms underlying various GRNGs, compares their computational requirements, and examines the quality of the random numbers with emphasis on the behaviour in the tail region of the Gaussian probability density function.