Modified decomposition method for multiple recursive random number generator
From MaRDI portal
Recommendations
- Decomposition with simulated division for efficiently generating random numbers
- A search 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
- Systematic searches for good multiple recursive random number generators
- Several extensively tested multiple recursive random number generators
Cites work
- scientific article; zbMATH DE number 1178976 (Why is no real title available?)
- A random number generator based on the combination of four LCGs
- Combined random number generator via the generalized Chinese remainder theorem
- Good random number generators are (not so) easy to find
- Implementing a multiple recursive generator with mersenne prime modulus
- Implementing a random number package with splitting facilities
- Lower bounds in spectral tests for vectors of nonsuccessive values produced by multiple recursive generator with some zero multipliers
- Tables of linear congruential generators of different sizes and good lattice structure
Cited in
(3)- Simulated division with approximate factoring for the multiple recursive generator with both unrestricted multiplier and non-Mersenne prime modulus
- Decomposition with simulated division for efficiently generating random numbers
- Effective and efficient restriction on producing the multipliers for the multiple recursive random number generator
This page was built for publication: Modified decomposition method for multiple recursive random number generator
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1614040)
