1 |
Inverse Transformed Density Rejection for Unbounded Monotone DensitiesHörmann, Wolfgang, Leydold, Josef, Derflinger, Gerhard January 2007 (has links) (PDF)
A new algorithm for sampling from largely abitrary monotone, unbounded densities is presented. The user has to provide a program to evaluate the density and its derivative and the location of the pole. Then the setup of the new algorithm constructs different hat functions for the pole region and for the tail region, respectively. For the pole region a new method is developed that uses a transformed density rejection hat function of the inverse density. As the order of the pole is calculated in the setup, conditions that guarantee the correctness of the constructed hat functions are provided. Numerical experiments indicate that the new algorithm works correctly and moderately fast for many different unbounded densities. (c) ACM, (2007). This is the author's version of the work. It is posted here by permission of ACM for your personal use. Not for redistribution. (author's abstract) / Series: Research Report Series / Department of Statistics and Mathematics
|
2 |
Random Variate Generation by Numerical Inversion when only the Density Is KnownDerflinger, Gerhard, Hörmann, Wolfgang, Leydold, Josef January 2008 (has links) (PDF)
We present a numerical inversion method for generating random variates from continuous distributions when only the density function is given. The algorithm is based on polynomial interpolation of the inverse CDF and Gauss-Lobatto integration. The user can select the required precision which may be close to machine precision for smooth, bounded densities; the necessary tables have moderate size. Our computational experiments with the classical standard distributions (normal, beta, gamma, t-distributions) and with the noncentral chi-square, hyperbolic, generalized hyperbolic and stable distributions showed that our algorithm always reaches the required precision. The setup time is moderate and the marginal execution time is very fast and the same for all distributions. Thus for the case that large samples with fixed parameters are required the proposed algorithm is the fastest inversion method known. Speed-up factors up to 1000 are obtained when compared to inversion algorithms developed for the specific distributions. This makes our algorithm especially attractive for the simulation of copulas and for quasi-Monte Carlo applications. (author´s abstract) / Series: Research Report Series / Department of Statistics and Mathematics
|
Page generated in 0.0358 seconds