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

DOI10.1080/00949659608811717zbMath0884.65004OpenAlexW1972464662MaRDI QIDQ4355589

No author found.

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)

Related Items (4)

A statistical analysis of the screening measure of multiple recursive random number generators of orders one and two ⋮ Distribution of lattice points ⋮ Upper bounds in spectral test for multiple recursive random number generators with missing terms ⋮ Random number generators with long period and sound statistical properties

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An Introduction to the Geometry of Numbers
• An Exhaustive Analysis of Multiplicative Congruential Random Number Generators with Modulus $2^{31} - 1$
• Implementation of fortran random number generators on computers with one's complement arithmetic †
• A More Portable Fortran Random Number Generator
• A Random-number Generator for Microcomputers
• Implementing a random number package with splitting facilities
• Uniform Random Number Generators
• Fourier Analysis of Uniform Random Number Generators
• RANDOM NUMBERS FALL MAINLY IN THE PLANES

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