Systematic searches for good multiple recursive random number generators
From MaRDI portal
Recommendations
- Several extensively tested multiple recursive random number generators
- A search for good multiple recursive random number generators
- Efficient computer search of large-order multiple recursive pseudo-random number generators
- Large-order multiple recursive generators with modulus \(2^{31}-1\)
- A partial exhaustive search for good two-term third-order multiple recursive random number generators
Cites work
- scientific article; zbMATH DE number 3750146 (Why is no real title available?)
- A review of pseudorandom number generators
- A search for good multiple recursive random number generators
- An Exhaustive Analysis of Multiplicative Congruential Random Number Generators with Modulus $2^{31} - 1$
- An Introduction to the Geometry of Numbers
- Computer implementation of random number generators
- Decomposition with simulated division for efficiently generating random numbers
- Fourier Analysis of Uniform Random Number Generators
- Generation of Uniform Variates from Several Nearly Uniformly Distributed Variables
- Implementing a random number package with splitting facilities
- Multiplicative Congruential Random Number Generators with Modulus 2 β : An Exhaustive Analysis for β = 32 and a Partial Analysis for β = 48
- On combining pseudorandom number generators
- Pseudorandom number generators for personal computers. II
- RANDOM NUMBERS FALL MAINLY IN THE PLANES
- Random Number Generators on Vector Supercomputers and Other Advanced Architectures
- Random number generators with long period and sound statistical properties
- Some comments on computer implementation of random number generators
- Thoughts on pseudorandom number generators
Cited in
(20)- Combined random number generator via the generalized Chinese remainder theorem
- Modified decomposition method for multiple recursive random number generator
- The revised recursive reduction for efficiently generating random numbers
- Lower bounds in spectral tests for vectors of nonsuccessive values produced by multiple recursive generator with some zero multipliers
- Searching for good two-term fifth-order multiple recursive random number generators
- 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
- A new heuristic for second-order multiple recursive random number generator
- Parallel random number generators based on large order multiple recursive generators
- A revised forward and backward heuristic for two-term multiple recursive random number generators
- Several extensively tested multiple recursive random number generators
- Design and implementation of efficient and portable multiple recursive generators with few zero coefficients
- A statistical analysis of the screening measure of multiple recursive random number generators of orders one and two
- Effective and efficient restriction on producing the multipliers for the multiple recursive random number generator
- Theoretical analyses of forward and backward heuristics of multiple recursive random number generators
- A 4217th-order multiple recursive random number generator with modulus \(2^{31} - 69\)
- An exhaustive analysis of two-term multiple recursive random number generators with efficient multipliers
- Issues on Computer Search for Large Order Multiple Recursive Generators
- Searching for good multiple recursive random number generators via a genetic algorithm
This page was built for publication: Systematic searches for good multiple recursive random number generators
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1366700)
