Computer implementation of random number generators
From MaRDI portal
Good theoretical work on algorithms is often defeated by a poor computer implementation. This is particularly true of random number generators for two reasons: the overwhelming concern for speed and the inherent ill- conditioning of the problem. The author concentrates on the coding considerations of a multiplicative congruential generator with properly chosen multiplier and modulus. Implementation of recursive generators on vector processors is also addressed.
Recommendations
- Some comments on computer implementation of random number generators
- scientific article; zbMATH DE number 953075
- A search for good multiple recursive random number generators
- A Statistical Evaluation of Multiplicative Congruential Random Number Generators with Modulus 2 31 - 1
- A portable random number generator well suited for the rejection method
Cited in
(11)- Implementation of a random number generator in OCCAM
- Some comments on computer implementation of random number generators
- A comparative study of some pseudorandom number generators
- Systematic searches for good multiple recursive random number generators
- Effective and efficient restriction on producing the multipliers for the multiple recursive random number generator
- Pseudorandom number generators for personal computers
- The revised recursive reduction for efficiently generating random numbers
- Finding the best portable congruential random number generators
- Random number generators for microcomputers
- scientific article; zbMATH DE number 26619 (Why is no real title available?)
- 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: Computer implementation of random number generators
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q916298)