Resource title

A Note on the Performance of the "Ahrens Algorithm"

Resource image

image for OpenScout resource :: A Note on the Performance of the "Ahrens Algorithm"

Resource description

This short note discusses performance bounds for "Ahrens" algorithm, that can generate random variates from continuous distributions with monotonically decreasing density. This rejection algorithms uses constant hat-functions and constant squeezes over many small intervals. The choice of these intervals is important. Ahrens has demonstrated that the equal area rule that uses strips of constant area leads to a very simple algorithm. We present bounds on the rejection constant of this algorithm depending only on the number of intervals. (author's abstract) ; Series: Preprint Series / Department of Applied Statistics and Data Processing

Resource author

Wolfgang Hörmann

Resource publisher

Resource publish date

Resource language


Resource content type


Resource resource URL

Resource license

Adapt according to the license agreement. Always reference the original source and author.