Quasi-Monte Carlo Node Sets from Linear Congruential Generators

  • Karl Entacher
  • Peter Hellekalek
  • Pierre L’Ecuyer
Conference paper


In this paper we present a new approach to finding good lattice points. We employ the spectral test, a well-known figure of merit for uniform random number generators. This concept leads to an assessment of lattice points g that is closely related to the classical Babenko-Zaremba quantity ρ(g,N). The associated lattice rules are good uniformly over a whole range of dimensions. Our numerical examples suggest that this simple approach leads to quasi-Monte Carlo node sets that perform very well in comparison to the best available (t,m,s)-nets.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    E. F. Beckenbach and R. Bellman. Inequalities. Ergebnisse der Mathematik und ihrer Grenzgebiete, Vol. 30. Springer-Verlag, Berlin, 1983.Google Scholar
  2. 2.
    . P. Bratley, B. L. Fox, and H. Niederreiter. Implementation and tests of low- discrepancy sequences. ACM Trans. Modeling and Computer Simulation, 2: 195 – 213, 1992.CrossRefzbMATHGoogle Scholar
  3. 3.
    R. R. Coveyou and R. D. MacPherson. Fourier analysis of uniform random number generators. J. Assoc. Comput. Mach., 14: 100 – 119, 1967.CrossRefzbMATHMathSciNetGoogle Scholar
  4. 4.
    J. Eichenauer-Herrmann. Statistical independence of a new class of inversive congruential pseudorandom numbers. Math. Comp., 60: 375 – 384, 1993.CrossRefzbMATHMathSciNetGoogle Scholar
  5. 5.
    K. Entacher. Generalized Haar function systems in the theory of uniform distribution of sequences modulo one. PhD thesis, Universität Salzburg, Austria, 1995.Google Scholar
  6. 6.
    K. Entacher. Quasi-Monte Carlo methods for numerical integration of multivariate Haar series. BIT, 37: 846 – 861, 1997.CrossRefzbMATHMathSciNetGoogle Scholar
  7. 7.
    U. Fincke and M. Pohst. Improved methods for calculating vectors of short length in a lattice, including a complexity analysis. Mathematics of Computation, 44: 463 – 471, 1985.CrossRefzbMATHMathSciNetGoogle Scholar
  8. 8.
    G. S. Fishman. Multiplicative congruential random number generators with modulus 2ß: an exhaustive analysis for ß = 32 and a partial analysis for ß = 48. Math. Comp., 54: 331 – 344, 1990.zbMATHMathSciNetGoogle Scholar
  9. 9.
    G. S. Fishman. Monte Carlo: Concepts, Algorithms, and Applications. Springer- Verlag, New York, 1996.CrossRefzbMATHGoogle Scholar
  10. 10.
    G. S. Fishman and L. R. Moore. An exhaustive analysis of multiplicative congruential random number generators with modulus 231 — 1. SIAM J. Sci. Statist. Comput, 7:24–45, 1986. Erratum, ibid. 7, 1058.Google Scholar
  11. 11.
    A. C. Genz. Testing multidimensional integration routines. In B. Ford, J. C. Rault, and F. Thomasset, editors, Tools, Methods, and Languages for Scientific and Engineering Computation, pages 81 – 94. North-Holland, Amsterdam, 1984.Google Scholar
  12. 12.
    A. C. Genz. A package for testing multiple integration subroutines. In P. Keast and G. Fairweather, editors, Numerical Integration: Recent Developments, Software and Applications, pages 337 - 340. D. Reidel, Dordrecht, 1987.CrossRefGoogle Scholar
  13. 13.
    P. Hellekalek. On the assessment of random and quasi-random point sets. In Hellekalek and Larcher [14].Google Scholar
  14. 14.
    P. Hellekalek and G. Larcher, editors. Random and Quasi-Random Point Sets, volume 138 of Springer Lecture Notes in Statistics. Springer-Verlag, New York, 1998.Google Scholar
  15. 15.
    F. J. Hickernell. Lattice rules: How well do they measure up? In Hellekalek and Larcher [14].Google Scholar
  16. 16.
    D. E. Knuth. The Art of Computer Programming, Vol. 2. Addison-Wesley, Reading, Mass., third edition, 1998.Google Scholar
  17. 17.
    N. M. Korobov. The approximate computation of multiple integrals. Dokl. Akad. Nauk SSSR, 124:1207–1210, 1959. (In Russian).zbMATHMathSciNetGoogle Scholar
  18. 18.
    N. M. Korobov. Number-Theoretic Methods in Approximate Analysis. Fizmat-giz, Moscow, 1963. (In Russian).Google Scholar
  19. 19.
    P. L’Ecuyer. Uniform random number generation. Ann. Oper. Res., 53: 77 – 120, 1994.CrossRefzbMATHMathSciNetGoogle Scholar
  20. 20.
    P. L’Ecuyer. Tables of linear congruential generators of different sizes and good lattice structure. Math. Comp., 68: 249 – 260, 1999.CrossRefzbMATHMathSciNetGoogle Scholar
  21. 21.
    P. L’Ecuyer and R. Couture. An implementation of the lattice and spectral tests for multiple recursive linear random number generators. INFORMS J. on Comput., 9: 206 – 217, 1997.CrossRefzbMATHMathSciNetGoogle Scholar
  22. 22.
    C. Lemieux and P. L’Ecuyer. Efficiency improvement by lattice rules for pricing Asian options. In Proceedings of the 1998 Winter Simulation Conference, pages 579–586, IEEE Press, 1998.Google Scholar
  23. 23.
    C. Lemieux and P. L’Ecuyer. A comparison of Monte Carlo, lattice rules and other low-discrepancy point sets. In this volume.Google Scholar
  24. 24.
    H. Niederreiter. Multidimensional numerical integration using pseudorandom numbers. Mathematical Programming Study, 27: 17 – 38, 1986.CrossRefzbMATHMathSciNetGoogle Scholar
  25. 25.
    H. Niederreiter. Low-discrepancy and low-dispersion sequences. J. Number Theory, 30: 51 – 70, 1988.CrossRefzbMATHMathSciNetGoogle Scholar
  26. 26.
    H. Niederreiter. Random Number Generation and Quasi-Monte Carlo Methods. SIAM, Philadelphia, 1992.CrossRefzbMATHGoogle Scholar
  27. 27.
    H. Niederreiter. New developments in uniform pseudorandom number and vector generation. In H. Niederreiter and P. J. -S. Shiue, editors, Monte Carlo and Quasi-Monte Carlo Methods in Scientific Computing, volume 106 of Lecture Notes in Statistics, pages 87 – 120. Springer-Verlag, New York, 1995.CrossRefGoogle Scholar
  28. 28.
    W. Ch. Schmid. The exact quality parameter of nets derived from Sobol’ and Niederreiter sequences. To appear in: Proc. Conf Numerical Methods and Applications ’98, Sofia. World Scientific Publishing, 1998.Google Scholar
  29. 29.
    H. Sloan and S. Joe. Lattice Methods for Multiple Integration. Clarendon Press, Oxford, 1994.zbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2000

Authors and Affiliations

  • Karl Entacher
    • 1
  • Peter Hellekalek
    • 1
  • Pierre L’Ecuyer
    • 2
  1. 1.Dept. of MathematicsUniversity of SalzburgSalzburgAustria
  2. 2.Dept. d’Informatique et de Recherche OpérationnelleUniversité de MontréalMontrealCanada

Personalised recommendations