The revised recursive reduction for efficiently generating random numbers
From MaRDI portal
Publication:2740951
DOI10.1080/00207160108805060zbMath0983.65003OpenAlexW2090567134MaRDI QIDQ2740951
Publication date: 3 April 2002
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207160108805060
Random number generation in numerical analysis (65C10) Pseudo-random numbers; Monte Carlo methods (11K45)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- A new class of random number generators
- Computer implementation of random number generators
- Several extensively tested multiple recursive random number generators
- Some comments on computer implementation of random number generators
- Decomposition with simulated division for efficiently generating random numbers
- Systematic searches for good multiple recursive random number generators
- The k -distribution of generalized feedback shift register pseudorandom numbers
- Tables of linear congruential generators of different sizes and good lattice structure
- Combined Multiple Recursive Random Number Generators
- An Implementation of the Lattice and Spectral Tests for Multiple Recursive Linear Random Number Generators
- Implementing a random number package with splitting facilities
- Good Parameters and Implementations for Combined Multiple Recursive Random Number Generators
- Symmetry property of multiplicative congruential random number generator in chi-square test
- A search for good multiple recursive random number generators
- Twisted GFSR generators
- Efficient and portable combined Tausworthe random number generators
- Coding the Lehmer pseudo-random number generator
This page was built for publication: The revised recursive reduction for efficiently generating random numbers