A fast uniform astronomical random number generator
ACM SIGSAC Review
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
Random numbers for stochastic simulation
ACM SIGBIO Newsletter
| Hi-index | 0.00 |
One of the two methods described has points in common with that of Starcenko L. P. (1959) who based his principle on a basic-property of transcendental numbers, namely that the fractional part of a logarithmic set of r prime numbers guaranties completely uniformly (0.,1.) distributed sequences of pseudo-random numbers O (e(LogN(k))**3)+1 for k=1,2,...rOur original method also generates uniform random sequences of real numbers in the interval (0., 1.). It uses a set of real numbers of 54-bit precision mantissa issued from the approximation of independent quotients from randomly chosen integers as dividends and their associated prime numbers as divisors.An aperiodic method: In practice, no period caused by irrationality or error-rounding of the numbers used should be encountered.A faster method: Because the method works only by the use of floating-point additions and subtractions, it provides a better velocity than congruential methods which use integer multiplications and modular reductions.A transportable method: Since the implementation of real numbers in double precision follows the same IEEE standard for binary floating-point arithmetic, this method should give the same results for all sequences and be qualified as transportable.