Infinite-dimensional integration in weighted Hilbert spaces: anchored decompositions, optimal deterministic algorithms, and higher-order convergence (Q486680): Difference between revisions

The authors study the numerical integration of functions depending on an infinite number of variables. Lower error bounds are provided for general deterministic algorithms and matching upper error bounds are given with the help of suitable multilevel algorithms. Two cost models for function evaluations and two classes of weights, namely product and order-dependent weights and the newly introduced finite projective dimension weights are discussed. It is shown that for these classes of weights 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, the authors discuss the anchored Sobolev space with smoothness parameter and provide new optimal quasi-Monte Carlo multilevel algorithms and quasi-Monte Carlo changing-dimension algorithms based on higher-order polynomial lattice rules.