Weighted QMC rules - Stop anywhere
Dirk Nuyens
Abstract
We study the worst case integration error of combinations of quadrature rules in a reproducing kernel Hilbert space. We show that the error, with respect to the total number $N$ of function evaluations used, cannot decrease faster than $O(N^{-1})$ for an equal-weight rule. However, if the errors of the quadrature rules constituting a compound rule have an order of convergence $O(N^{-\alpha})$ for $\alpha>1$ then, by introducing weights, this order of convergence can be shown to be recovered for the compound rule. The theory applies to lattice sequences as well as digital sequences.