Remote Access Mathematics of Computation
Green Open Access

Mathematics of Computation

ISSN 1088-6842(online) ISSN 0025-5718(print)



Extensions of Forsythe's method for random sampling from the normal distribution

Authors: J. H. Ahrens and U. Dieter
Journal: Math. Comp. 27 (1973), 927-937
MSC: Primary 65C10
MathSciNet review: 0329190
Full-text PDF Free Access

Abstract | References | Similar Articles | Additional Information

Abstract: This article is an expansion of G. E. Forsythe's paper "Von Neumann's comparison method for random sampling from the normal and other distributions" [5]. It is shown that Forsythe's method for the normal distribution can be adjusted so that the average number $ \bar{N}$ of uniform deviates required drops to 2.53947 in spite of a shorter program. In a further series of algorithms, $ \bar{N}$ is reduced to values close to 1 at the expense of larger tables. Extensive computational experience is reported which indicates that the new methods compare extremely well with known sampling algorithms for the normal distribution.

References [Enhancements On Off] (What's this?)

Similar Articles

Retrieve articles in Mathematics of Computation with MSC: 65C10

Retrieve articles in all journals with MSC: 65C10

Additional Information

Keywords: Random number generation, normal distribution
Article copyright: © Copyright 1973 American Mathematical Society