2000 character limit reached
Computationally easy, spectrally good multipliers for congruential pseudorandom number generators
Published 15 Jan 2020 in cs.DS | (2001.05304v3)
Abstract: Congruential pseudorandom number generators rely on good multipliers, that is, integers that have good performance with respect to the spectral test. We provide lists of multipliers with a good lattice structure up to dimension eight and up to lag eight for generators with typical power-of-two moduli, analyzing in detail multipliers close to the square root of the modulus, whose product can be computed quickly.
Paper Prompts
Sign up for free to create and run prompts on this paper.