Projects per year
Abstract
A new algorithm for sampling from largely arbitrary 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 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 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.
| Original language | German |
|---|---|
| Pages (from-to) | 18/1 - 18/16 |
| Journal | ACM Transactions on Modelling and Computer Simulation |
| Volume | 17 |
| Issue number | 4 |
| DOIs | |
| Publication status | Published - 1 Nov 2007 |
Austrian Classification of Fields of Science and Technology (ÖFOS)
- 102009 Computer simulation
Projects
- 1 Finished
-
Random Variate Generation and Markov Chain Monte Carlo
Leydold, J. (PI - Project head), Derflinger, G. (researchers ), Hörmann, W. (researchers ), Karawatzki, R. (researchers ) & Tirler, G. (researchers )
1/11/03 → 31/10/06
Project: Research funding
Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver