Information-based complexity
Explicit cost bounds of algorithms for multivariate tensor product problems
Journal of Complexity
When are quasi-Monte Carlo algorithms efficient for high dimensional integrals?
Journal of Complexity
Weighted tensor product algorithms for linear multivariate problems
Journal of Complexity
Finite-order weights imply tractability of multivariate integration
Journal of Complexity
Journal of Complexity
Quasi-Monte Carlo methods can be efficient for integration over products of spheres
Journal of Complexity
Randomly shifted lattice rules on the unit cube for unbounded integrands in high dimensions
Journal of Complexity - Special issue: Algorithms and complexity for continuous problems Schloss Dagstuhl, Germany, September 2004
Randomly shifted lattice rules on the unit cube for unbounded integrands in high dimensions
Journal of Complexity - Special issue: Algorithms and complexity for continuous problems Schloss Dagstuhl, Germany, September 2004
Optimal importance sampling for the approximation of integrals
Journal of Complexity
Hi-index | 0.00 |
We study strong tractability and tractability of multivariate integration in the worst case setting. This problem is considered in weighted tensor product reproducing kernel Hilbert spaces. We analyze three variants of the classical Sobolev space of non-periodic and periodic functions whose first mixed derivatives are square integrable. We obtain necessary and sufficient conditions on strong tractability and tractability in terms of the weights of the spaces. For the three Sobolev spaces periodicity has no significant effect on strong tractability and tractability. In contrast, for general reproducing kernel Hilbert spaces anything can happen: we may have strong tractability or tractability for the non-periodic case and intractability for the periodic one, or vice versa.