A Search for Good Multiple Recursive Random Number Generators

ACM Transactions on Modeling and Computer Simulation (TOMACS)

Volumn 3, Issue 2, 1993, Pages 87-98

  L'Ecuyer, Pierre ^a   Blouin, François ^b   Couture, Raymond ^b  

^a UNIVERSITÉ DE MONTRÉAL   (Canada)

^b UNIVERSITÉ LAVAL   (Canada)

Author keywords

full period; lattice structure; linear congruential; multiple recursive generators; portable code; spectral test

Indexed keywords

C (PROGRAMMING LANGUAGE); COMPUTERS; PASCAL (PROGRAMMING LANGUAGE); PROBABILITY; STATISTICAL METHODS;

COMPUTER CODES; LATTICE STRUCTURE; LINEAR CONGRUENTIAL GENERATORS; MULTIPLE RECURSIVE GENERATORS;

RANDOM NUMBER GENERATION;

EID: 0027575056     PISSN: 10493301     EISSN: 15581195     Source Type: Journal    
DOI: 10.1145/169702.169698     Document Type: Article

References (21)

1. AFFLERBACH, L., AND GROTHE, H. 1985. Calculation of Minkowski-reduced lattice bases. Computing 35, 269-276.
2. ALANEN, J. D., AND KNUTH, D. E. 1964. Tables of finite fields. SANKHY: Ind. J. Stat., Series A, 26, 305-328.
3. BRATLEY, P., FOX, B L., AND SCHRAGE, L E. 1987 A Guide to Simulation. 2nd ed. Springer-Verlag, New York.
4. DIETER, U. 1975. How to calculate shortest vectors in a lattice. Math. Comput. 29, 131, 827-833.
5. FINCKE, U., AND POHST, M. 1985. Improved methods for calculating vectors of short length in a lattice, including a complexity analysis. Math. Comput. 44, 170, 463-471.
6. FISHMAN, G. S. 1990. Multiplicative congruential random number generators with modulus 2 β: An exhaustive analysis for β = 32 and a partial analysis for β = 48. Math. Comput. 54, 189 (Jan.), 331-344.
7. FISHMAN, G. S., AND MOORE, L. S., III 1986. An exhaustive analysis of multiplicative congruential random number generators with modulus 231 - 1. SIAM J. Sci. Stat. Comput. 7, 1, 24-45.
8. GROTHE, H. 1988. Matrixgeneratoren zur erzeugung gleichverteilter pseudozufallsvektoren.
9. GRUBE, A. 1973. Mehrfach rekursiv-erzeugte pseudo-zufallszahlen. Zeitschrift fur angewandte Math. und Mechanik 53, T223-T225 In German.
10. KNUTH, D. E. 1981. The Art of Computer Programming. Vol. 2, Seminumerical Algorithms, 2nd ed. Addison-Wesley, Reading, Mass.
11. LIDL, R., AND NIEDERREITER, H. 1986. Introduction to Finite Fields and Their Applications. Cambridge University Press, Cambridge, Mass.
12. MONTGOMERY, P. L. 1987. Speeding the Pollard and elliptic curve methods of factorization. Math Comput. 48, 177, 243-264.
13. MORAIN, F. 1988. Implementation of the Atkin-Goldwasser-Kilian primality testing algorithm.
14. NIEDERREITER, H. 1992. Random Number Generation and Quasi-Monte Carlo Methods. In SIAM CBMS-NSF Regional Conference Series in Applied Mathematics, vol. 63. SIAM, Philadelphia, Penn.
15. NIEDERREITER, H. 1991. Recent trends in random number and random vector generation. Ann. Oper. Res. 31, 323-345.
16. NIEDERREITER, H. 1988. The serial test for digital k-step pseudorandom numbers. Math. J. Okayama univ. 30, 93-119.
17. NIEDERREITER, H. 1986. A pseudorandom vector generator based on finite field arithmetic. Math. Japonica 31, 5, 759-774.
18. NIEDERREITER, H. 1982 Statistical tests for Tausworthe pseudorandom numbers. In Probability and Statistical Inference. Reidel, Dordrecht, Boston, 265-274.
19. PARK, S. K., AND MILLER, K. W. 1988. Random number generators. Good ones are hard to find.
20. Commun. ACM 31, 10, 1192-1201.
21. RIPLEY, B D. 1987. Stochastic Simulation. Wiley, New York.