New algorithms for generating Poisson variates (Q915333): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Changed an Item
Property / describes a project that uses
 
Property / describes a project that uses: IMSL Numerical Libraries / rank
 
Normal rank

Revision as of 13:25, 28 February 2024

scientific article
Language Label Description Also known as
English
New algorithms for generating Poisson variates
scientific article

    Statements

    New algorithms for generating Poisson variates (English)
    0 references
    1990
    0 references
    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.
    0 references
    0 references
    varying-parameter algorithms
    0 references
    sequential searches
    0 references
    J-fraction approximations
    0 references
    Poisson random variates
    0 references
    0 references

    Identifiers