New algorithms for generating Poisson variates

From MaRDI portal





The author discusses three algorithms for generating Poisson (\(\lambda\)) random variates. The first one is the KPFRAC algorithm, designed for \(\lambda <0\), the second one is KPLOW, for \(0<\lambda \leq 30\) and the third one is KEMPOIS, for 10\(\leq \lambda \leq 5000\). The conclusions of the work is that these algorithms prove that new features can be incorporated into the search approach and make it more competitive. A mixed routine which uses KPLOW, when \(\lambda <30\) and KEMPOIS, when \(\lambda\geq 30\) is indicated and so the speed of calculus is higher.





Describes a project that uses

Uses Software






This page was built for publication: New algorithms for generating Poisson variates

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