Numerische Mathematik

, Volume 103, Issue 1, pp 63–97 | Cite as

Good Lattice Rules in Weighted Korobov Spaces with General Weights

  • Josef Dick
  • Ian H. Sloan
  • Xiaoqun Wang
  • Henryk Woźniakowski


We study the problem of multivariate integration and the construction of good lattice rules in weighted Korobov spaces with general weights. These spaces are not necessarily tensor products of spaces of univariate functions. Sufficient conditions for tractability and strong tractability of multivariate integration in such weighted function spaces are found. These conditions are also necessary if the weights are such that the reproducing kernel of the weighted Korobov space is pointwise non-negative. The existence of a lattice rule which achieves the nearly optimal convergence order is proven. A component-by-component (CBC) algorithm that constructs good lattice rules is presented. The resulting lattice rules achieve tractability or strong tractability error bounds and achieve nearly optimal convergence order for suitably decaying weights. We also study special weights such as finite-order and order-dependent weights. For these special weights, the cost of the CBC algorithm is polynomial. Numerical computations show that the lattice rules constructed by the CBC algorithm give much smaller worst-case errors than the mean worst-case errors over all quasi-Monte Carlo rules or over all lattice rules, and generally smaller worst-case errors than the best Korobov lattice rules in dimensions up to hundreds. Numerical results are provided to illustrate the efficiency of CBC lattice rules and Korobov lattice rules (with suitably chosen weights), in particular for high-dimensional finance problems.


Quasi-Monte Carlo methods lattice rules multivariate integration 

Mathematics Subject Classification (2000)

65C05 65D30 65D32 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Acworth, P., Broadie M., Glasserman, P.: A comparison of some Monte Carlo and quasi-Monte Carlo techniques for option pricing. In: Hellekallek, P., Niederreiter H. (eds) Monte Carlo and Quasi-Monte Carlo Methods in Scientific Computing. Spring-Verlag, pp 1–18, 1997Google Scholar
  2. 2.
    Brown, G., Chandler, G.A., Sloan, I.H., Wilson, D.C.: Properties of certain trigonometric series arising in numerical analysis. J. Math. Anal. Appl. 371–380 (1991)Google Scholar
  3. 3.
    Caflisch, R.E., Morokoff, W., Owen, A.B.: Valuation of Mortgage backed securities using Brownian bridges to reduce effective dimension. J. Comp. Finance 1, 27–46 (1997)Google Scholar
  4. 4.
    Dick, J.: On the convergence order of the component-by-component construction of good lattice rules. J. Complexity 20, 493–522 (2004)CrossRefMathSciNetGoogle Scholar
  5. 5.
    Dick, J., Sloan, I.H., Wang, X., Woźniakowski, H.: Liberating the weights. J. Complexity 20, 593–623 (2004)CrossRefMATHMathSciNetGoogle Scholar
  6. 6.
    Hickernell, F.J., Wang, X.: The error bounds and tractability of quasi-Monte Carlo algorithms in infinite dimension. Math. Comp. 71, 1641–1661 (2002)CrossRefMATHMathSciNetGoogle Scholar
  7. 7.
    Hickernell, F.J., Woźniakowski, H.: Integration and approximation in arbitrary dimensions. Adv. Comput. Math. 12, 25–58 (2000)CrossRefMATHMathSciNetGoogle Scholar
  8. 8.
    Kuo, F.Y.: Component-by-component constructions achieve the optimal rate of convergence for multivariate integration in weighted Korobov and Sobolev spaces. J. Complexity 19, 301–320 (2003)CrossRefMATHMathSciNetGoogle Scholar
  9. 9.
    Kuo, F.Y., Joe, S.: Component-by-component construction of good lattice points with composite number of points. J. Complexity 18, 943–976 (2002)CrossRefMATHMathSciNetGoogle Scholar
  10. 10.
    Niederreiter, H.: Random Number Generation and Quasi-Monte Carlo Methods. Philadelphia: SIAM, 1992Google Scholar
  11. 11.
    Novak, E., Woźniakowski, H.: Intractability results for integration and discrepancy. J. Complexity 17, 388–441 (2001)CrossRefMATHMathSciNetGoogle Scholar
  12. 12.
    Sloan, I.H., Joe, S.: Lattice Methods for Multiple Integration. Oxford: Oxford University Press, 1994Google Scholar
  13. 13.
    Sloan, I.H., Kuo, F.Y., Joe, S.: Constructing randomly shifted lattice rules in weighted Sobolev spaces. SIAM J. Numer. Anal. 40, 1650–1665 (2002)CrossRefMATHMathSciNetGoogle Scholar
  14. 14.
    Sloan, I.H., Wang, X., Woźniakowski, H.: Finite-order weights imply tractability of multivariate integration. J. Complexity 20, 46–74 (2004)CrossRefMATHMathSciNetGoogle Scholar
  15. 15.
    Sloan, I.H., Woźniakowski, H.: When are quasi-Monte Carlo algorithms efficient for high dimensional integrals?. J. Complexity 14, 1–33 (1998)CrossRefMATHMathSciNetGoogle Scholar
  16. 16.
    Sloan, I.H., Woźniakowski, H.: Tractability of multivariate integration for weighted Korobov classes. J. Complexity 17, 697–721 (2001)CrossRefMATHMathSciNetGoogle Scholar
  17. 17.
    Sobol', I.M.: On the distribution of points in a cube and the approximate evaluation of integrals. Zh. Vychisli. Mat. i Mat. Fiz. 7, 784–802 (1967)MATHMathSciNetGoogle Scholar
  18. 18.
    Traub, J.F., Wasilkowski, G.W., Woźniakowski, H.: Information-Based Complexity. New York: Academic Press, 1988Google Scholar
  19. 19.
    Wang, X., Fang, K.T.: Effective dimensions and quasi-Monte Carlo integration. J. Complexity 19, 101–124 (2003)CrossRefMATHMathSciNetGoogle Scholar
  20. 20.
    Wang, X., Sloan, I.H.: Why are high-dimensional finance problems often of low effective dimension?. SIAM J. Sci. Comput. 27, 159–183 (2005)CrossRefMATHMathSciNetGoogle Scholar
  21. 21.
    Wang, X., Sloan, I.: Efficient weighted lattice rules with application to finance. SIAM J. Sci. Comput. (to appear)Google Scholar
  22. 22.
    Wang, X., Sloan, I.H., Dick, J.: On Korobov lattice rules in weighted spaces. SIAM J. Numer. Anal. 42, 1760–1779 (2004)CrossRefMATHMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Josef Dick
    • 1
  • Ian H. Sloan
    • 1
  • Xiaoqun Wang
    • 1
    • 2
  • Henryk Woźniakowski
    • 3
    • 4
  1. 1.School of MathematicsUniversity of New South WalesSydneyAustralia
  2. 2.Department of Mathematical SciencesTsinghua UniversityBeijingChina
  3. 3.Department of Computer ScienceColumbia UniversityNew YorkUSA
  4. 4.Institute of Applied Mathematics and MechanicsUniversity of WarsawPoland

Personalised recommendations