An Exhaustive Analysis of Multiplicative Congruential Random Number Generators with Modulus 2³¹ - 1
From MaRDI portal
Publication:3740108
DOI10.1137/0907002zbMATH Open0603.65003OpenAlexW2022349318MaRDI QIDQ3740108FDOQ3740108
Authors: George S. Fishman, Louis R. Moore 
Publication date: 1986
Published in: SIAM Journal on Scientific and Statistical Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0907002
Recommendations
- Multiplicative Congruential Random Number Generators with Modulus 2 β : An Exhaustive Analysis for β = 32 and a Partial Analysis for β = 48
- Multiplicative, congruential random-number generators with multiplier ± 2 k 1 ± 2 k 2
- A Statistical Evaluation of Multiplicative Congruential Random Number Generators with Modulus 2 31 - 1
- Random number generators with long period and sound statistical properties
- Some good multipliers for random number generators for 16-bit microcomputers
Cited In (46)
- Several extensively tested random number generators
- Multivariate Estimation of Conditional Performance Measures in Regenerative Simulation
- Universal homophonic coding scheme using differential encoding and interleaving
- Tables of linear congruential generators of different sizes and good lattice structure
- Criteria for the assessment of random number generators
- A Random-number Generator for Microcomputers
- Large-order multiple recursive generators with modulus \(2^{31}-1\)
- Good random number generators are (not so) easy to find
- A brief and understandable guide to pseudo-random number generators and specific models for security
- Survey on hardware implementation of random number generators on FPGA: theory and experimental analyses
- Stochastic volatility in asset prices. Estimation with simulated maximum likelihood
- Simulated division with approximate factoring for the multiple recursive generator with both unrestricted multiplier and non-Mersenne prime modulus
- Efficient computer search of large-order multiple recursive pseudo-random number generators
- Searching for good two-term multiple recursive random number generators using a backpropagation algorithm
- Heuristics for the multi-resource generalized assignment problem
- An analysis of linear congruential random number generators when multiplier restrictions exist
- Testing random number generators by numerical modeling of an exactly solvable problem
- Random number generators with long period and sound statistical properties
- A new heuristic for second-order multiple recursive random number generator
- Upper bounds in spectral test for multiple recursive random number generators with missing terms
- Theoretical and empirical convergence results for additive congruential random number generators
- Several extensively tested multiple recursive random number generators
- A revised forward and backward heuristic for two-term multiple recursive random number generators
- Parallel use of multiplicative congruential random number generators
- Decomposition with simulated division for efficiently generating random numbers
- A study of 64-bit multipliers for Lehmer pseudorandom number generators
- ACORN - A new method for generating sequences of uniformly distributed pseudo-random numbers
- Distribution of lattice points
- A statistical analysis of the screening measure of multiple recursive random number generators of orders one and two
- Tests based on sum-functions of spacings for uniform random numbers
- JEROBOAM
- Systematic searches for good multiple recursive random number generators
- A Statistical Evaluation of Multiplicative Congruential Random Number Generators with Modulus 2 31 - 1
- A search for good pseudo-random number generators: survey and empirical studies
- Upper bound on the center density of a multiple recursive random number generator
- Recent trends in random number and random vector generation
- Thoughts on pseudorandom number generators
- Multiplicative Congruential Random Number Generators with Modulus 2 β : An Exhaustive Analysis for β = 32 and a Partial Analysis for β = 48
- An exhaustive analysis of prime modulus multiplicative congruential random number generators with modulus smaller than 215
- Uniform random number generation
- Feistel-inspired scrambling improves the quality of linear congruential generators
- Symmetry property of multiplicative congruential random number generator in chi-square test
- A new test of randomness for Lehmer generators based on the Manhattan distance between pairs of consecutive random numbers
- A parallel search for good lattice points using LLL-spectral tests
- A likelihood ratio test for three-mode singular values: Upper percentiles and an application to three-way ANOVA
- 32-bit multipliers for linear congruential random number generators
Uses Software
This page was built for publication: An Exhaustive Analysis of Multiplicative Congruential Random Number Generators with Modulus $2^{31} - 1$
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3740108)
