Extensions of Forsythe’s method for random sampling from the normal distribution
Open Access
- 1 January 1973
- journal article
- Published by American Mathematical Society (AMS) in Mathematics of Computation
- Vol. 27 (124) , 927-937
- https://doi.org/10.1090/s0025-5718-1973-0329190-8
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 N ¯ \bar {N} of uniform deviates required drops to 2.53947 in spite of a shorter program. In a further series of algorithms, N ¯ \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.Keywords
This publication has 8 references indexed in Scilit:
- A combinatorial method for the generation of normally distributed random numbersComputing, 1973
- Computer methods for sampling from the exponential and normal distributionsCommunications of the ACM, 1972
- Von Neumann's Comparison Method for Random Sampling from the Normal and Other DistributionsMathematics of Computation, 1972
- The Art of Computer Programming. Vol. II: Seminumerical AlgorithmsMathematics of Computation, 1970
- Pseudo-random numbersComputing, 1970
- Generating a Variable from the Tail of the Normal DistributionTechnometrics, 1964
- A fast procedure for generating normal random variablesCommunications of the ACM, 1964
- A Note on the Generation of Random Normal DeviatesThe Annals of Mathematical Statistics, 1958