Abstract
The inversion method (see Sect. 2.1) is one of the most important key-stones of random variate generation. In this chapter we try to demonstrate how the inversion principle can be applied to obtain universal algorithms. If the inverse of the cumulative distribution function F -1 is computable, we can generate variates of the desired distribution without any additional information. So we could speak of a “true” black-box algorithm in this case, as we simply can return F -1 (U). Unfortunately most important distributions have a cdf that cannot be expressed in terms of elementary functions and the inverse cdf is even more difficult. Hence the assumption that F -1 is available as a black-box is often of little practical relevance.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Hörmann, W., Leydold, J., Derflinger, G. (2004). Numerical Inversion. In: Automatic Nonuniform Random Variate Generation. Statistics and Computing. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-05946-3_7
Download citation
DOI: https://doi.org/10.1007/978-3-662-05946-3_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-07372-4
Online ISBN: 978-3-662-05946-3
eBook Packages: Springer Book Archive