, Volume 79, Issue 1, pp 79–91 | Cite as

The construction of good extensible Korobov rules



In this paper, we introduce construction algorithms for Korobov rules for numerical integration which work well for a given set of dimensions simultaneously. The existence of such rules was recently shown by Niederreiter. Here we provide a feasible construction algorithm and an upper bound on the worst-case error in certain reproducing kernel Hilbert spaces for such quadrature rules. The proof is based on a sieve principle recently used by the authors to construct extensible lattice rules. We only treat classical lattice rules. The same ideas apply for polynomial lattice rules.

AMS Subject Classifications

11K45 65C05 65D30 


Quasi-Monte Carlo methods Lattice rules Korobov rules 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. Aronszajn, N. 1950Theory of reproducing kernelsTrans. Amer. Math. Soc.68337404MATHCrossRefMathSciNetGoogle Scholar
  2. Dick, J. 2004On the convergence rate of the component-by-component construction of good lattice rulesJ. Complexity20493522CrossRefMathSciNetGoogle Scholar
  3. Dick, J.: The construction of extensible polynomial lattice rules with small weighted star discrepancy (submitted 2006).Google Scholar
  4. Dick, J., Pillichshammer, F., Waterhouse, B. J.: The construction of good extensible lattices (submitted 2006).Google Scholar
  5. Dick, J., Sloan, I. H., Wang, X., Woźniakowski, H. 2004Liberating the weightsJ. Complexity20593623MATHCrossRefMathSciNetGoogle Scholar
  6. Hickernell, F. J. 1998A generalized discrepancy and quadrature error boundMath. Comp.67299322MATHCrossRefMathSciNetGoogle Scholar
  7. Hickernell, F. J.: Lattice rules: how well do they measure up? In: Random and quasi-random point sets (Hellekalek, P. and Larcher, G., eds.). Lecture Notes in Statistics, vol. 138. New York: Springer, pp. 109–166 (1998).Google Scholar
  8. Hlawka, E. 1962Zur angenäherten Berechnung mehrfacher IntegraleMonatsh. Math.66140151MATHCrossRefMathSciNetGoogle Scholar
  9. Joe, S. 2006Construction of good rank-1 lattice rules based on the weighted star discrepancyNiederreiter, H.Talay, D. eds. Monte Carlo and quasi-Monte Carlo methods 2004SpringerBerlin Heidelberg New York181196CrossRefGoogle Scholar
  10. Kuo, F. Y. 2003Component-by-component constructions achieve the optimal rate of convergence for multivariate integration in weighted Korobov and Sobolev spacesJ. Complexity19301320MATHCrossRefMathSciNetGoogle Scholar
  11. Kuo, F. Y., Joe, S. 2002Component-by-component construction of good lattice rules with composite number of pointsJ. Complexity18943976MATHCrossRefMathSciNetGoogle Scholar
  12. Korobov, N. M. 1959The approximate computation of multiple integralsDokl. Akad. Nauk SSSR12412071210(in Russian)MATHMathSciNetGoogle Scholar
  13. Korobov, N. M. 1960Properties and calculation of optimal coefficientsDokl. Akad. Nauk SSSR13210091012(in Russian)MathSciNetGoogle Scholar
  14. Niederreiter, H. 1992Random number generation and quasi-Monte Carlo methods. CBMS-NSF Series in Applied Mathematics, vol. 63SIAMPhiladelphiaGoogle Scholar
  15. Niederreiter, H. 2003The existence of good extensible polynomial lattice rulesMonatsh. Math.139295307MATHCrossRefMathSciNetGoogle Scholar
  16. Nuyens, D., Cools, R. 2006Fast algorithms for component-by-component construction of rank-1 lattice rules in shift-invariant reproducing kernel Hilbert spacesMath. Comp.75903920MATHCrossRefMathSciNetGoogle Scholar
  17. Nuyens, D., Cools, R. 2006Fast construction of rank-1 lattice rules with non-prime number of pointsJ. Complexity22428MATHCrossRefMathSciNetGoogle Scholar
  18. Sloan, I. H., Joe, S. 1994Lattice methods for multiple integrationOxford University PressOxfordMATHGoogle Scholar
  19. Sloan, I. H., Kuo, F. Y., Joe, S. 2002Constructing randomly shifted lattice rules in weighted Sobolev spacesSIAM J. Numer. Anal.4016501655MATHCrossRefMathSciNetGoogle Scholar
  20. Sloan, I. H., Kuo, F. Y., Joe, S. 2002On the step-by-step construction of quasi-Monte Carlo integration rules that achieve strong tractability error bounds in weighted Sobolev spacesMath. Comp.7116091640MATHCrossRefMathSciNetGoogle Scholar
  21. Sloan, I. H., Woźniakowski, H. 1998When are quasi-Monte Carlo algorithms efficient for high-dimensional integrals?J. Complexity14133MATHCrossRefMathSciNetGoogle Scholar
  22. Sloan, I. H., Woźniakowski, H. 2001Tractability of multivariate integration for weighted Korobov classesJ. Complexity17697721MATHCrossRefMathSciNetGoogle Scholar
  23. Wang, X., Sloan, I. H., Dick, J. 2004On Korobov lattice rules in weighted spacesSIAM J. Numer. Anal.4217601779MATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Wien 2007

Authors and Affiliations

  1. 1.University of New South Wales AsiaSingapore
  2. 2.Institut für FinanzmathematikUniversität LinzLinzAustria
  3. 3.School of Mathematics and StatisticsUniversity of New South WalesSydneyAustralia

Personalised recommendations