论文信息 - Implementing a multiple recursive generator with mersenne prime modulus

Implementing a multiple recursive generator with mersenne prime modulus

This paper considers the problem of efficiently and correctly generating random numbers for the multiple recursive generators with Mersenne prime modulus. For the appropriate Mersenne prime modulus, simulated division is an efficient way to generate random numbers. The general algorithm for any Mersenne prime modulus is also presented.

Hui-Chin Tang | Hui-Chin Tang

[1] Pierre L'Ecuyer,et al. Implementing a random number package with splitting facilities , 1991, TOMS.

[2] S. K. Park,et al. Random number generators: good ones are hard to find , 1988, CACM.

[3] Paul Bratley,et al. A guide to simulation , 1983 .

[4] Stephen D. Roberts,et al. Implementing a portable FORTRAN Uniform (0,1) generator , 1983 .

[5] H. Riesel. Prime numbers and computer methods for factorization (2nd ed.) , 1994 .

[6] Richard E. Nance,et al. Some Experimental Observations on the Behavior of Composite Random Number Generators , 1978, Oper. Res..

[7] Chiang Kao,et al. Symmetry property of multiplicative congruential random number generator in chi-square test , 1995, Int. J. Comput. Math..

[8] W. H. Payne,et al. Coding the Lehmer pseudo-random number generator , 1969, CACM.

[9] Donald Ervin Knuth,et al. The Art of Computer Programming , 1968 .

[10] B. Fagin,et al. Discrete weighted transforms and large-integer arithmetic , 1994 .

[11] Paul Bratley,et al. A guide to simulation (2nd ed.) , 1986 .

[12] David G. Carta,et al. Two fast implementations of the “minimal standard” random number generator , 1990, CACM.

[13] H. Riesel. Prime numbers and computer methods for factorization , 1985 .

[14] Pierre L'Ecuyer,et al. A search for good multiple recursive random number generators , 1993, TOMC.