The revised recursive reduction for efficiently generating random numbers
From MaRDI portal
The author provides an analysis of the number of operations of the recursive reduction method (RRM) for generating random numbers. He also proposes a modification of this method by considering the stop conditions and the order of the multiplier and multiplicand. Finally, he presents the results of a computational experiment revealing that the new method is more efficient than RRM.
Recommendations
- scientific article; zbMATH DE number 1834026
- An optimised implementation of MWC pseudo-random number generator analyzed with the NIST statistical test suite for randomness
- Simulated division with approximate factoring for the multiple recursive generator with both unrestricted multiplier and non-Mersenne prime modulus
- scientific article; zbMATH DE number 2051228
- Novel approaches in generating random numbers using graphics processing unit
Cites work
- A new class of random number generators
- A search for good multiple recursive random number generators
- An Implementation of the Lattice and Spectral Tests for Multiple Recursive Linear Random Number Generators
- Coding the Lehmer pseudo-random number generator
- Combined Multiple Recursive Random Number Generators
- Computer implementation of random number generators
- Decomposition with simulated division for efficiently generating random numbers
- Efficient and portable combined Tausworthe random number generators
- Good Parameters and Implementations for Combined Multiple Recursive Random Number Generators
- scientific article; zbMATH DE number 53679 (Why is no real title available?)
- scientific article; zbMATH DE number 854710 (Why is no real title available?)
- Implementing a random number package with splitting facilities
- Several extensively tested multiple recursive random number generators
- Some comments on computer implementation of random number generators
- Symmetry property of multiplicative congruential random number generator in chi-square test
- Systematic searches for good multiple recursive random number generators
- Tables of linear congruential generators of different sizes and good lattice structure
- The k -distribution of generalized feedback shift register pseudorandom numbers
- Twisted GFSR generators
Cited in
(12)- The use of Chebyshev mixing to generate pseudo-random numbers
- Bifurcating distributive system using Monte Carlo method
- Improved bounds in the multiple-recursive matrix method for pseudorandom number and vector generation
- An optimised implementation of MWC pseudo-random number generator analyzed with the NIST statistical test suite for randomness
- Implementing a multiple recursive generator with mersenne prime modulus
- Random arithmetic formulas can be reconstructed efficiently
- Visual and auditory cues significantly reduce human's intrinsic biases when tasked to generate a random number sequence
- Using irreducible polynomials for random number generation
- Simulated division with approximate factoring for the multiple recursive generator with both unrestricted multiplier and non-Mersenne prime modulus
- Replicated computational results (RCR) report for ``Fast random integer generation in an interval
- A revised forward and backward heuristic for two-term multiple recursive random number generators
- Optimized random number generation in an interval
This page was built for publication: The revised recursive reduction for efficiently generating random numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2740951)
