Toward a universal random number generator

From MaRDI portal





This paper presents a ``universal random number generator that is able to produce the same sequence of random variables in a wide variety of computers and that passes some tests of randomness and independence. The generator combines two different generators: a lagged-Fibonacci generator F(97,33.\(\cdot)\) and a simple arithmetic sequence for the prime modulus \(2^{24}-3\). Results of a randomness test are presented and a Fortran implementation of the generator is suggested.




Cited in
(81)








This page was built for publication: Toward a universal random number generator

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