Decomposition with simulated division for efficiently generating random numbers
From MaRDI portal
Recommendations
- Modified decomposition method for multiple recursive random number generator
- A portable random number generator well suited for the rejection method
- Simulated division with approximate factoring for the multiple recursive generator with both unrestricted multiplier and non-Mersenne prime modulus
- Multiplicative, congruential random-number generators with multiplier ± 2 k 1 ± 2 k 2
- Some good multipliers for random number generators for 16-bit microcomputers
Cites work
- A More Portable Fortran Random Number Generator
- An Exhaustive Analysis of Multiplicative Congruential Random Number Generators with Modulus $2^{31} - 1$
- Coding the Lehmer pseudo-random number generator
- scientific article; zbMATH DE number 3750146 (Why is no real title available?)
- Implementing a random number package with splitting facilities
Cited in
(6)- Systematic searches for good multiple recursive random number generators
- Modified decomposition method for multiple recursive random number generator
- 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
- The revised recursive reduction for efficiently generating random numbers
- Simulated division with approximate factoring for the multiple recursive generator with both unrestricted multiplier and non-Mersenne prime modulus
This page was built for publication: Decomposition with simulated division for efficiently generating random numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1342945)
