Efficient table-free sampling methods for the exponential, Cauchy, and normal distributions

22Citations
Citations of this article
11Readers
Mendeley users who have this article in their library.

Abstract

Three algorithms for sampling from exponential, Cauchy and normal distributions are developed. They are based on the “exact approximation” method, and their expected numbers of consumed uniform deviates are less than 1.04 per sample from the target distributions. The algorithms are simple and easily implemented in any desired precision. They require no space for long tables of auxiliary vectors, merely a few constants are needed. Nevertheless, their speed compares well with the performance of much more complex and table-aided sampling procedures. © 1988, ACM. All rights reserved.

Cite

CITATION STYLE

APA

Ahrens, J. H., & Dieter, U. (1988). Efficient table-free sampling methods for the exponential, Cauchy, and normal distributions. Communications of the ACM, 31(11), 1330–1337. https://doi.org/10.1145/50087.50094

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free