ACM Home Page
Please provide us with feedback. Feedback
Generating gamma variates by a modified rejection technique
Full text PdfPdf (723 KB)
Source
Communications of the ACM archive
Volume 25 ,  Issue 1  (January 1982) table of contents
Pages: 47 - 54  
Year of Publication: 1982
ISSN:0001-0782
Authors
J. H. Ahrens  Univ. of Kiel, West Germany
U. Dieter  Technical Univ., Graz, Austria
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 11,   Downloads (12 Months): 111,   Citation Count: 10
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/358315.358390
What is a DOI?

ABSTRACT

A suitable square root transformation of a gamma random variable with mean a ≥ 1 yields a probability density close to the standard normal density. A modification of the rejection technique then begins by sampling from the normal distribution, being able to accept and transform the initial normal observation quickly at least 85 percent of the time (95 percent if a ≥ 4). When used with efficient subroutines for sampling from the normal and exponential distributions, the resulting accurate method is significantly faster than competing algorithms.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
 
2
Ahrens, J.H., and Dieter, U. Computer methods for sampling from gamma, beta, Poisson, and binomial distributions. Computing 12 (1974), 223-246.
 
3
Ahrens, J.H., and Dieter, U. Extensions of Forsythe's method for random sampling from the normal distribution. Math. Comput. 27, 124 (Oct. 1973), 927-937.
 
4
Ahrens, J,H., and Dieter, U. Sampling from standard gamma distributions. Submitted to A CM Trans. Math. Softw.
 
5
Ahrens, J,H., and Kohrt, K.D. Computer methods for efficient sampling from largely arbitrary statistical distributions. Computing 26 (1981), 19-31.
 
6
Atkinson, A.C. An easily programmed algorithm for generating gamma random variables. J. Roy. Stat. Soc. A 140 (1977), 232-234.
 
7
Atkinson, A.C., and Pearce, M.C. The computer generation of beta, gamma and normal random variables. J. Roy. Stat Soc, A 139 (1976), 431--461.
 
8
Best, D.J. A new method for the computer generation of gamma or chi-squared pseudo-random variables. To appear in J. Amer. Stat. Assoc.
 
9
Best, D.J. Letter to the editors. Appl. Star. 27 (1978), 181.
 
10
Cheng, R.C.H. The generation of gamma variables with nonintegral shape parameter. Appl. Stat. 26 (1977), 71-75.
11
 
12
Cheng, R.C.H., and Feast, G.M. Some simple gamma variate generators. Appl. Stat. 28 (1979), 290-295.
 
13
Dieter, U. Optimal acceptance-rejection envelopes for sampling from various distributions. Submitted to Math. Comput. (1981).
 
14
Dieter, U., and Ahrens, J.H. Acceptance-rejection techniques for sampling from the gamma and beta distributions. Tech. Rep. 83, Dep. Statistics, Stanford University, Stanford, CA, 1974.
 
15
16
 
17
Greenwood, A.J. A fast generator for gamma distributed random variables. COMPSTAT(1974), 19-27.
18
 
19
 
20
Marsaglia, G. The squeeze method for generating gamma variates. Comput, Math. Appl. 3 (1977), 321-325.
 
21
yon Neumann, J. Various techniques used in connection with random digits. Collected Works, Vol. 5, 768-770. Pergamon Press, New York, 1963.
 
22
23
 
24
Vaduva, I. On computer generation of gamma random variables by rejection and composition procedures. Math. Oper.-forsehung und Stat., Set. Star. 4 (1977), 545-576.

CITED BY  10