Decomposition with simulated division for efficiently generating random numbers

DOI10.1016/0305-0548(94)90039-6zbMath0862.65004OpenAlexW2044986737MaRDI QIDQ1342945

Chiang Kao

Publication date: 15 January 1995

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0305-0548(94)90039-6

zbMATH Keywords

decomposition methodprime modulus multiplicative congruential random number generatorempirical speed comparisons

Mathematics Subject Classification ID

Random number generation in numerical analysis (65C10)

Related Items (5)

Systematic searches for good multiple recursive random number generators ⋮ Simulated division with approximate factoring for the multiple recursive generator with both unrestricted multiplier and non-Mersenne prime modulus ⋮ The revised recursive reduction for efficiently generating random numbers ⋮ Effective and efficient restriction on producing the multipliers for the multiple recursive random number generator ⋮ Random number generators with long period and sound statistical properties

Uses Software

• AS 183
• UNIRAN

Cites Work

• Unnamed Item
• An Exhaustive Analysis of Multiplicative Congruential Random Number Generators with Modulus $2^{31} - 1$
• A More Portable Fortran Random Number Generator
• Implementing a random number package with splitting facilities
• Coding the Lehmer pseudo-random number generator

This page was built for publication: Decomposition with simulated division for efficiently generating random numbers