Some comments on computer implementation of random number generators
From MaRDI portal
The note, inspired by a paper of \textit{J. E. Gentle} [(*) ibid. 31, No. 1, 119-125 (1990; Zbl 0703.65008)], summarizes some implementation dependent portability problems for multiplicative random number generators presented by several authors but not mentioned in (*).
Recommendations
Cites work
Cited in
(10)- Implementation of a random number generator in OCCAM
- Systematic searches for good multiple recursive random number generators
- Effective and efficient restriction on producing the multipliers for the multiple recursive random number generator
- Some remarks on a new composite random number generator
- The revised recursive reduction for efficiently generating random numbers
- Finding the best portable congruential random number generators
- scientific article; zbMATH DE number 953075 (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
- Thoughts on pseudorandom number generators
- Computer implementation of random number generators
This page was built for publication: Some comments on 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 Q1196840)