Random Variate Generation by Numerical Inversion When Only the Density Is Known

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 c...

Full description

Bibliographic Details
Main Authors: Derflinger, Gerhard, Hörmann, Wolfgang, Leydold, Josef
Format: Others
Language:en
Published: Department of Statistics and Mathematics, WU Vienna University of Economics and Business 2009
Subjects:
Online Access:http://epub.wu.ac.at/162/1/document.pdf
id ndltd-VIENNA-oai-epub.wu-wien.ac.at-epub-wu-01_f41
record_format oai_dc
spelling ndltd-VIENNA-oai-epub.wu-wien.ac.at-epub-wu-01_f412017-09-21T05:22:52Z Random Variate Generation by Numerical Inversion When Only the Density Is Known Derflinger, Gerhard Hörmann, Wolfgang Leydold, Josef CCS G.3 non-uniform random variates / inversion method / universal method / black-box algorithm / Newton interpolation / Gauss-Lobatto integration 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 nearly 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. <P> This paper is the revised final version of the working paper no. 78 of this research report series. Department of Statistics and Mathematics, WU Vienna University of Economics and Business 2009 Paper NonPeerReviewed en application/pdf http://epub.wu.ac.at/162/1/document.pdf Series: Research Report Series / Department of Statistics and Mathematics http://epub.wu.ac.at/162/
collection NDLTD
language en
format Others
sources NDLTD
topic CCS G.3
non-uniform random variates / inversion method / universal method / black-box algorithm / Newton interpolation / Gauss-Lobatto integration
spellingShingle CCS G.3
non-uniform random variates / inversion method / universal method / black-box algorithm / Newton interpolation / Gauss-Lobatto integration
Derflinger, Gerhard
Hörmann, Wolfgang
Leydold, Josef
Random Variate Generation by Numerical Inversion When Only the Density Is Known
description 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 nearly 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. <P> This paper is the revised final version of the working paper no. 78 of this research report series. === Series: Research Report Series / Department of Statistics and Mathematics
author Derflinger, Gerhard
Hörmann, Wolfgang
Leydold, Josef
author_facet Derflinger, Gerhard
Hörmann, Wolfgang
Leydold, Josef
author_sort Derflinger, Gerhard
title Random Variate Generation by Numerical Inversion When Only the Density Is Known
title_short Random Variate Generation by Numerical Inversion When Only the Density Is Known
title_full Random Variate Generation by Numerical Inversion When Only the Density Is Known
title_fullStr Random Variate Generation by Numerical Inversion When Only the Density Is Known
title_full_unstemmed Random Variate Generation by Numerical Inversion When Only the Density Is Known
title_sort random variate generation by numerical inversion when only the density is known
publisher Department of Statistics and Mathematics, WU Vienna University of Economics and Business
publishDate 2009
url http://epub.wu.ac.at/162/1/document.pdf
work_keys_str_mv AT derflingergerhard randomvariategenerationbynumericalinversionwhenonlythedensityisknown
AT hormannwolfgang randomvariategenerationbynumericalinversionwhenonlythedensityisknown
AT leydoldjosef randomvariategenerationbynumericalinversionwhenonlythedensityisknown
_version_ 1718539799038525440