No label defined (Q3217508)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3883485
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 3883485 |
Statements
1984
0 references
gamma and beta random variables
0 references
rejection-type procedure
0 references
testing algorithms
0 references
0.9992038
0 references
0.86784804
0 references
0.8583203
0 references
0 references
0.8442745
0 references
0.8338241
0 references
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.
0 references