An exhaustive analysis of prime modulus multiplicative congruential random number generators with modulus smaller than 215

DOI10.1080/00949659608811717MaRDI QIDQ4355589zbMATH OpenOpenAlexFDO

Authors

Publication date 14 April 1998

Published in Journal of Statistical Computation and Simulation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00949659608811717

zbMATH Keywords

spectral testprime modulusmultiplicative congruential random number generators

Mathematics Subject Classification ID

Random number generation in numerical analysis (65C10)

Recommendations

• An Exhaustive Analysis of Multiplicative Congruential Random Number Generators with Modulus $2^{31} - 1$
• Erratum: An Exhaustive Analysis of Multiplicative Congruential Random Number Generators with Modulus $2^{31} - 1$
• Multiplicative Congruential Random Number Generators with Modulus 2 β : An Exhaustive Analysis for β = 32 and a Partial Analysis for β = 48
• A Statistical Evaluation of Multiplicative Congruential Random Number Generators with Modulus 2 31 - 1
• scientific article; zbMATH DE number 5367488
• Multiplicative, congruential random-number generators with multiplier ± 2 ^{k 1} ± 2 ^{k 2}
• Optimal multipliers for linear congruential pseudorandom number generators with prime moduli
• On the discrepancy of inversive congruential pseudorandom numbers with prime power modulus
• On the discrepancy of inversive congruential pseudorandom numbers with prime power modulus. II

Cites work

• scientific article; zbMATH DE number 3141365 (Why is no real title available?)
• scientific article; zbMATH DE number 3854477 (Why is no real title available?)
• scientific article; zbMATH DE number 3658960 (Why is no real title available?)
• A More Portable Fortran Random Number Generator
• A Random-number Generator for Microcomputers
• An Exhaustive Analysis of Multiplicative Congruential Random Number Generators with Modulus $2^{31} - 1$
• An Introduction to the Geometry of Numbers
• Fourier Analysis of Uniform Random Number Generators
• Implementation of fortran random number generators on computers with one's complement arithmetic †
• Implementing a random number package with splitting facilities
• RANDOM NUMBERS FALL MAINLY IN THE PLANES
• Uniform Random Number Generators

Cited in

(8)

• A study of 128-bit multipliers for congruential pseudorandom number generators
• Upper bounds in spectral test for multiple recursive random number generators with missing terms
• An analysis of linear congruential random number generators when multiplier restrictions exist
• Multiplicative Congruential Random Number Generators with Modulus 2 β : An Exhaustive Analysis for β = 32 and a Partial Analysis for β = 48
• Distribution of lattice points
• Random number generators with long period and sound statistical properties
• Several extensively tested random number generators
• A statistical analysis of the screening measure of multiple recursive random number generators of orders one and two

This page was built for publication: An exhaustive analysis of prime modulus multiplicative congruential random number generators with modulus smaller than 2¹⁵

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4355589)