Tractability of infinite-dimensional integration in the worst case and randomized settings
Publication:647921
DOI10.1016/j.jco.2011.01.006zbMath1230.65037MaRDI QIDQ647921
Leszek Plaskota, Grzegorz W. Wasilkowski
Publication date: 21 November 2011
Published in: Journal of Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jco.2011.01.006
complexity; algorithms; randomization; reproducing kernel Hilbert space; worst case error; polynomial tractability; exponent of tractability; infinite dimensional integration
41A63: Multidimensional problems
46E22: Hilbert spaces with reproducing kernels (= (proper) functional Hilbert spaces, including de Branges-Rovnyak and other structured spaces)
41A55: Approximate quadratures
65D32: Numerical quadrature and cubature formulas
65Y20: Complexity and performance of numerical algorithms
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Deterministic multi-level algorithms for infinite-dimensional integration on \(\mathbb R^{\mathbb N}\)
- Liberating the dimension for function approximation: standard information
- Liberating the dimension
- Average case optimality for linear problems
- Infinite-dimensional quadrature and approximation of distributions
- 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.
- Multi-level Monte Carlo algorithms for infinite-dimensional integration on \(\mathbb R^{\mathbb N}\)
- Deterministic and stochastic error bounds in numerical analysis
- Explicit cost bounds of algorithms for multivariate tensor product problems
- Average-case analysis of numerical problems
- Infinite-dimensional integration on weighted Hilbert spaces
- The error bounds and tractability of quasi-Monte Carlo algorithms in infinite dimension
- Monte Carlo Simulation of Stochastic Integrals when the Cost of Function Evaluation Is Dimension Dependent
- The power of standard information for multivariate approximation in the randomized setting
- On decompositions of multivariate functions
- On tractability of path integration
- Liberating the Dimension for Function Approximation and Integration
- A new algorithm and worst case complexity for Feynman-Kac path integration.