Some Results on the Complexity of Numerical Integration
arXiv:1409.6714
Abstract
This is a survey (21 pages, 124 references) written for the MCQMC 2014 conference in Leuven, April 2014. We start with the seminal paper of Bakhvalov (1959) and end with new results on the curse of dimension and on the complexity of oscillatory integrals. Some small errors of earlier versions are corrected.
References in corpus (11)
- Explicit error bounds for Markov chain Monte Carlo
- Efficient calculation of the worst-case error and (fast) component-by-component construction of higher order polynomial lattice rules
- Calculation of Discrepancy Measures and Applications
- The Curse of Dimensionality for Numerical Integration of Smooth Functions II
- A Lower Bound for the Discrepancy of a Random Point Set
- Infinite-Dimensional Integration in Weighted Hilbert Spaces: Anchored Decompositions, Optimal Deterministic Algorithms, and Higher Order Convergence
- Complexity of Oscillatory Integration for Univariate Sobolev Spaces
- On Weak Tractability of the Clenshaw-Curtis Smolyak Algorithm
- The Cost of Deterministic, Adaptive, Automatic Algorithms: Cones, Not Balls
- Computation of expectations by Markov chain Monte Carlo methods
- The weighted star discrepancy of Korobov's -sets