Lower bounds for the complexity of linear functionals in the randomized setting
From MaRDI portal
Publication:617652
DOI10.1016/j.jco.2010.08.002zbMath1210.65005MaRDI QIDQ617652
Erich Novak, Henryk Woźniakowski
Publication date: 21 January 2011
Published in: Journal of Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jco.2010.08.002
complexity in the randomized settings; decomposable kernels; integration over reproducing kernel Hilbert spaces; optimal Monte Carlo method
65C05: Monte Carlo methods
46E22: Hilbert spaces with reproducing kernels (= (proper) functional Hilbert spaces, including de Branges-Rovnyak and other structured spaces)
65Y20: Complexity and performance of numerical algorithms
Cites Work
- Unnamed Item
- Unnamed Item
- Tractability of multivariate problems. Volume I: Linear information
- Optimal importance sampling for the approximation of integrals
- Tractability of multivariate problems. Volume II: Standard information for functionals.
- Variational properties of averaged equations for periodic media
- Deterministic and stochastic error bounds in numerical analysis
- The power of standard information for multivariate approximation in the randomized setting
- Theory of Reproducing Kernels
- Intractability results for integration and discrepancy