scientific article; zbMATH DE number 1746533
The author exposes an algorithm for constructing piecewise linear functions \(g_+(x)\) and \(g_-(x)\) which approximate a given finite probability density \(p(x)\) with an arbitrary accuracy. Let \(M\) denotes the number of grid intervals in \(x\) which are used for constructing piecewise linear functions. The algorithm proposed possesses the following properties: \[ \langle g_+ \rangle (M)= 1 + e_+(M),\quad \langle g_- \rangle (M) = 1 - e_-(M),\quad \tau[g](M) \approx \text{const}, \] where \(\tau[g](M)\) is the time for modeling a random variable, \(\langle g_+ \rangle (M)\) and \(\langle g_- \rangle (M) \) tend to zero as \(M\to\infty\). The algorithm is investigated in detail for the beta-distribution with nonnegative parameters. Moreover, a modification of the algorithm is presented both for infinite densities and infinite intervals.
- Rejection methods for modelling of beta-distribution
- An algorithm for the generation of random numbers with density C exp(- \(\lambda\) \(| x| ^{\nu})\)
- A note on transformed density rejection
- A one-table method for sampling from continuous and discrete distributions
- Random variate generation by numerical inversion when only the density is known
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 Q4532115)
