Foundations of Computational Mathematics

, Volume 14, Issue 5, pp 1027–1077 | Cite as

Infinite-Dimensional Integration in Weighted Hilbert Spaces: Anchored Decompositions, Optimal Deterministic Algorithms, and Higher-Order Convergence



We study the numerical integration of functions depending on an infinite number of variables. We provide lower error bounds for general deterministic algorithms and provide matching upper error bounds with the help of suitable multilevel algorithms and changing-dimension algorithms. More precisely, the spaces of integrands we consider are weighted, reproducing kernel Hilbert spaces with norms induced by an underlying anchored function space decomposition. Here the weights model the relative importance of different groups of variables. The error criterion used is the deterministic worst-case error. We study two cost models for function evaluations that depend on the number of active variables of the chosen sample points, and we study two classes of weights, namely product and order-dependent weights and the newly introduced finite projective dimension weights. We show for these classes of weights that multilevel algorithms achieve the optimal rate of convergence in the first cost model while changing-dimension algorithms achieve the optimal convergence rate in the second model. As an illustrative example, we discuss the anchored Sobolev space with smoothness parameter \(\alpha \) and provide new optimal quasi-Monte Carlo multilevel algorithms and quasi-Monte Carlo changing-dimension algorithms based on higher-order polynomial lattice rules.


Path integration Multilevel algorithms Changing-dimension algorithms  Quasi-Monte Carlo methods Polynomial lattice rules Reproducing kernel Hilbert spaces 

Mathematics Subject Classification

Primary 65C05 65D30 Secondary 11K38 


  1. 1.
    K. Appel, W. Haken, Every planar map is four colorable, I. Discharging, Illinois J. Math. 21 (1977), 429–490.MathSciNetMATHGoogle Scholar
  2. 2.
    K. Appel, W. Haken, Every planar map is four colorable, II. Reducibility, Illinois J. Math. 21 (1977), 491–567.MathSciNetMATHGoogle Scholar
  3. 3.
    N. Aronszajn, Theory of reproducing kernels, Trans. Amer. Math. Soc. 68 (1950), 337–404.MathSciNetCrossRefMATHGoogle Scholar
  4. 4.
    J. Baldeaux, Scrambled polynomial lattice rules for infinite-dimensional integration, in: L. Plaskota, H. Woźniakowski (Eds.), Monte Carlo and Quasi-Monte Carlo Methods 2010, 255–263, Springer, Heidelberg, 2012.Google Scholar
  5. 5.
    J. Baldeaux, J. Dick, G. Leobacher, D. Nuyens, F. Pillichshammer, Efficient calculation of the worst-case error and (fast) component-by-component construction of higher order polynomial lattice rules, Numer. Algorithms 59 (2012), 403–431.MathSciNetCrossRefMATHGoogle Scholar
  6. 6.
    J. Baldeaux, J. Dick, J. Greslehner, F. Pillichshammer, Construction algorithms for higher order polynomial lattice rules, J. Complexity 27 (2011), 281–299.MathSciNetCrossRefMATHGoogle Scholar
  7. 7.
    J. Baldeaux, M. Gnewuch, Optimal randomized multilevel algorithms for infinite-dimensional integration on function spaces with ANOVA-type decomposition. arXiv:1209.0882v1 [math.NA], Preprint 2012. To appear. In: SIAM J. Numer. Anal.
  8. 8.
    J. M. Borwein, D. M. Bradley, D. J. Broadhurst, Evaluations of k-fold Euler/Zagier sums: a compendium of results for arbitrary k. The Wilf Festschrift (Philadelphia, PA, 1996), Electron. J. Combin. 4 (1997), no. 2, Research Paper 5, approx. 21 pp.Google Scholar
  9. 9.
    H.E. Chrestenson, A class of generalized Walsh functions, Pacific J. Math. 5 (1955), 17–31.MathSciNetCrossRefMATHGoogle Scholar
  10. 10.
    J. Creutzig, S. Dereich, T. Müller-Gronbach, K. Ritter, Infinite-dimensional quadrature and approximation of distributions, Found. Comput. Math. 9 (2009), 391–429.MathSciNetCrossRefMATHGoogle Scholar
  11. 11.
    J. Dick, Walsh spaces containing smooth functions and quasi-Monte Carlo rules of arbitrary high order, SIAM J. Numer. Anal. 46 (2008), 1519–1553.MathSciNetCrossRefMATHGoogle Scholar
  12. 12.
    J. Dick, The decay of the Walsh coefficients of smooth functions, Bull. Austral. Math. Soc. 80 (2009), 430–453.MathSciNetCrossRefMATHGoogle Scholar
  13. 13.
    J. Dick, M. Gnewuch, Optimal randomized changing dimension algorithms for infinite-dimensional integration on function spaces with ANOVA-type decomposition. J. Approx. Theory (2013, to appear).Google Scholar
  14. 14.
    J. Dick, F. Y. Kuo, F. Pillichshammer, I. H. Sloan, Construction algorithms for polynomial lattice rules for multivariate integration, Math. Comp. 74 (2005), 1895–1921.MathSciNetCrossRefMATHGoogle Scholar
  15. 15.
    J. Dick, F. Pillichshammer, Strong tractability of multivariate integration of arbitrary high order using digitally shifted polynomial lattice rules, J. Complexity 23 (2007), 436–453.MathSciNetCrossRefMATHGoogle Scholar
  16. 16.
    J. Dick, F. Pillichshammer, Digital nets and sequences. Discrepancy Theory and quasi-Monte Carlo integration, Cambridge University Press, Cambridge, 2010.Google Scholar
  17. 17.
    J. Dick, I. H. Sloan, X. Wang, H. Woźniakowski, Good lattice rules in weighted Korobov spaces with general weights, Numer. Math. 103 (2006), 63–97.MathSciNetCrossRefMATHGoogle Scholar
  18. 18.
    R. Diestel, Graph Theory, Springer Verlag, Berlin, Heidelberg, 3rd Edition, 2005.Google Scholar
  19. 19.
    N. J. Fine, On the Walsh functions, Trans. Amer. Math. Soc. 65 (1949), 372–414.MathSciNetCrossRefMATHGoogle Scholar
  20. 20.
    M. B. Giles, Multilevel Monte Carlo path simulation, Oper. Res. 56 (2008), 607–617.MathSciNetCrossRefMATHGoogle Scholar
  21. 21.
    M. B. Giles. Improved multilevel Monte Carlo convergence using the Milstein scheme, in: A. Keller, S. Heinrich, H. Niederreiter (Eds.), Monte Carlo and Quasi-Monte Carlo Methods 2006, 343–358, Springer, Berlin, 2008.Google Scholar
  22. 22.
    M. B. Giles, B. J. Waterhouse, Multilevel quasi-Monte Carlo path simulation, Radon Ser. Comput. Appl. Math. 8 (2009), 165–181.MathSciNetGoogle Scholar
  23. 23.
    M. Gnewuch, Weighted geometric discrepancies and numerical integration on reproducing kernel Hilbert spaces, J. Complexity 28 (2012), 2–17.MathSciNetCrossRefMATHGoogle Scholar
  24. 24.
    M. Gnewuch, Infinite-dimensional integration on weighted Hilbert spaces, Math. Comp. 81 (2012), 2175–2205.MathSciNetCrossRefMATHGoogle Scholar
  25. 25.
    M. Gnewuch. Lower error bounds for randomized multilevel and changing dimension algorithms. In: J. Dick, F. Y. Kuo, G. W. Peters, I. H. Sloan (Eds.), Monte Carlo and Quasi-Monte Carlo Methods 2012, 399–415, Springer, Heidelberg, 2013.Google Scholar
  26. 26.
    M. Gnewuch, S. Mayer, K. Ritter, On weighted Hilbert spaces and integration of functions of infinitely many variables, J. Complexity 30 (2014), 29–47.MathSciNetCrossRefMATHGoogle Scholar
  27. 27.
    M. Gnewuch, H. Woźniakowski, Generalized tractability for multivariate problems, Part I: Linear tensor product problems and linear information, J. Complexity 23 (2007), 262–295.CrossRefMATHGoogle Scholar
  28. 28.
    M. Griebel, M. Holtz, Dimension-wise integration of high-dimensional functions with applications to finance, J. Complexity 26 (2010), 455–489.MathSciNetCrossRefMATHGoogle Scholar
  29. 29.
    S. Heinrich, Monte Carlo complexity of global solution of integral equations, J. Complexity 14 (1998), 151–175.MathSciNetCrossRefMATHGoogle Scholar
  30. 30.
    S. Heinrich, E. Sindambiwe. Monte Carlo complexity of parametric integration, J. Complexity 15 (1999), 317–341.MathSciNetCrossRefMATHGoogle Scholar
  31. 31.
    F. J. Hickernell, T. Müller-Gronbach, B. Niu, K. Ritter, Multi-level Monte Carlo algorithms for infinite-dimensional integration on \(\mathbb{R}^{\mathbb{N}}\), J. Complexity 26 (2010), 229–254.CrossRefMATHGoogle Scholar
  32. 32.
    F. J. Hickernell, X. Wang, The error bounds and tractability of quasi-Monte Carlo algorithms in infinite dimension, Math. Comp. 71 (2001), 1641–1661.MathSciNetCrossRefGoogle Scholar
  33. 33.
    F. Y. Kuo, Component-by-component constructions achieve the optimal rate of convergence for multivariate integration in weighted Korobov and Sobolev spaces, J. Complexity 19 (2003), 301–320.CrossRefMATHGoogle Scholar
  34. 34.
    F. Y. Kuo, C. Schwab, I. H. Sloan, Quasi-Monte Carlo finite element methods for a class of elliptic partial differential equations with random coefficients, SIAM J. Numer. Anal. 50 (2012), 3351–3374.MathSciNetCrossRefMATHGoogle Scholar
  35. 35.
    F. Y. Kuo, C. Schwab, I. H. Sloan, Multi-level quasi-Monte Carlo finite element methods for a class of elliptic partial differential equations with random coefficients, preprint 2012.Google Scholar
  36. 36.
    F. Y. Kuo, I. H. Sloan, G. Wasilkowski, H. Woźniakowski, Liberating the dimension, J. Complexity 26 (2010), 422–454.CrossRefMATHGoogle Scholar
  37. 37.
    F. Y. Kuo, I. H. Sloan, G. Wasilkowski, H. Woźniakowski, On decompositions of multivariate functions, Math. Comp. 79 (2010), 953–966.MathSciNetCrossRefMATHGoogle Scholar
  38. 38.
    H. Niederreiter, Low-discrepancy point sets obtained by digital constructions over finite fields, Czechoslovak Math. J. 42 (1992), 143–166.MathSciNetMATHGoogle Scholar
  39. 39.
    H. Niederreiter, Random Number Generation and Quasi-Monte Carlo Methods. No. 63 in CBMS-NSF Series in Applied Mathematics. SIAM, Philadelphia, 1992.Google Scholar
  40. 40.
    B. Niu, F. J. Hickernell, Monte Carlo simulation of stochastic integrals when the cost of function evaluations is dimension dependent, in: P. L’Ecuyer, A. B. Owen (Eds.), Monte Carlo and Quasi-Monte Carlo Methods 2008, 545–560, Springer, Heidelberg, 2009.Google Scholar
  41. 41.
    B. Niu, F. J. Hickernell, T. Müller-Gronbach, K. Ritter, Deterministic multi-level algorithms for infinite-dimensional integration on \(\mathbb{R}^n\), J. Complexity 27 (2011), 331–351.CrossRefMATHGoogle Scholar
  42. 42.
    E. Novak, H. Woźniakowski, Tractability of Multivariate Problems, Volume I, European Mathematical Society, Zürich, 2008.Google Scholar
  43. 43.
    E. Novak, H. Woźniakowski, Tractability of Multivariate Problems, Volume II, European Mathematical Society, Zürich, 2010.Google Scholar
  44. 44.
    L. Plaskota, G. W. Wasilkowski, Tractability of infinite-dimensional integration in the worst case and randomized settings, J. Complexity 27 (2011), 505–518.MathSciNetCrossRefMATHGoogle Scholar
  45. 45.
    I. H. Sloan, X. Wang, H. Woźniakowski, Finite-order weights imply tractability of multivariate integration, J. Complexity 20 (2004), 46–74.CrossRefMATHGoogle Scholar
  46. 46.
    I. H. Sloan, H. Woźniakowski, When are quasi-Monte Carlo algorithms efficient for high-dimensional integrals?, J. Complexity 14 (1998), 1–33.CrossRefMATHGoogle Scholar
  47. 47.
    V. N. Temlyakov, Cubature formulas, discrepancy, and nonlinear approximation. Numerical integration and its complexity (Oberwolfach, 2001). J. Complexity 19 (2003), 352–391.MathSciNetCrossRefMATHGoogle Scholar
  48. 48.
    J. F. Traub, G. W. Wasilkowski, H. Woźniakowski, Information-Based Complexity, Academic Press, New York, 1988.Google Scholar
  49. 49.
    J.L. Walsh, A closed set of normal orthogonal functions, Amer. J. Math. 55 (1923), 5–24.CrossRefGoogle Scholar
  50. 50.
    G. W. Wasilkowski, Liberating the dimension for \(L_2\)-approximation, J. Complexity 28 (2012), 304–319.MathSciNetCrossRefMATHGoogle Scholar
  51. 51.
    G. W. Wasilkowski, H. Woźniakowski, On tractability of path integration, J. Math. Physics 37 (1996), 2071–2088.CrossRefMATHGoogle Scholar

Copyright information

© SFoCM 2014

Authors and Affiliations

  1. 1.School of Mathematics and StatisticsUniversity of New South WalesSydneyAustralia

Personalised recommendations