The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
| Hi-index | 0.01 |
This study discusses and presents some comments on a portable random number generator of very large period based on a generalised multi-moduli congruential method. It also shows that by using 50 generators it is possible to extend the period to 1.01*10105 in a 16 bit machine and by 100 generators to 1.39* 10592 in a 32 bit machine. For each linear congruential parent generator a prime modulus is determined to achieve the maximum period and the best multiplier is found by applying Spectral Test. Some weaknesses and problems are pointed out.