Simulated division with approximate factoring for the multiple recursive generator with both unrestricted multiplier and non-Mersenne prime modulus

DOI10.1016/S0898-1221(03)90209-4zbMath1049.65008OpenAlexW2039432923MaRDI QIDQ597246

Huey-Chin Tang

Publication date: 6 August 2004

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0898-1221(03)90209-4

zbMATH Keywords

algorithmNumerical examplesApproximate factoringDecompositionMultiple recursive generatorRandom number generationSimulated division method

Mathematics Subject Classification ID

Random number generation in numerical analysis (65C10) Pseudo-random numbers; Monte Carlo methods (11K45)

Uses Software

• UNIRAN

Cites Work

• 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
• Prime numbers and computer methods for factorization.
• The revised recursive reduction for efficiently generating random numbers
• An Exhaustive Analysis of Multiplicative Congruential Random Number Generators with Modulus $2^{31} - 1$
• Tables of linear congruential generators of different sizes and good lattice structure
• An Implementation of the Lattice and Spectral Tests for Multiple Recursive Linear Random Number Generators
• Implementing a random number package with splitting facilities
• Implementing a multiple recursive generator with mersenne prime modulus
• A search for good multiple recursive random number generators
• Is There Any Regularity in the Distribution of Prime Numbers at the Beginning of the Sequence of Positive Integers?
• Coding the Lehmer pseudo-random number generator
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Simulated division with approximate factoring for the multiple recursive generator with both unrestricted multiplier and non-Mersenne prime modulus