Multiplicative, congruential random-number generators with multiplier ± 2 k 1 ± 2 k 2

DOI10.1145/264029.264056zbMath0887.65003OpenAlexW2031859776MaRDI QIDQ4375504

Pei-Chi Wu

Publication date: 8 February 1998

Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)

Full work available at URL: http://www.acm.org/pubs/contents/journals/toms/1997-23/

zbMATH Keywords

cycle lengthempirical testsspectral testsfrequency testrun testmaximum-of-\(t\) testmultiplicative, congruential random number generators

Mathematics Subject Classification ID

Random number generation in numerical analysis (65C10)

Related Items (6)

A brief and understandable guide to pseudo-random number generators and specific models for security ⋮ Parallel use of multiplicative congruential random number generators ⋮ Improving random number generators in the Monte Carlo simulations via twisting and combining ⋮ Relative merits of random number generators: Indirect approach ⋮ Large-Order Multiple Recursive Generators with Modulus 2³¹ − 1 ⋮ Bit-parallel random number generation for discrete uniform distributions

This page was built for publication: Multiplicative, congruential random-number generators with multiplier ± 2 ^{k 1} ± 2 ^{k 2}