scientific article; zbMATH DE number 3883485

From MaRDI portal
Publication:3217508





One of fastest methods for computer generation of random variables, consists of reducing the problem to generating of the most simple random variables, which are uniform random variables. The generation method is based on a rejection-type procedure using uniform random vectors over a bounded domain \(D\subset R^ 2\), of the form: \(D=\{(u,v);\quad \gamma (u,v)\leq 0\},\) properly choosen for every kind of a random variable. In this paper a lemma is fundamental, which connects uniform distribution over a bounded domain, with the random variable which is to be generated by the computer. Based on this lemma, there are built-up algorithms for computer generation of sampling values for gamma and beta random variables. Finally, results of testing algorithms by the computer are presented and comparisons with other known generation methods are mentioned.











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3217508)