The power of standard information for multivariate approximation in the randomized setting
From MaRDI portal
Publication:3426031
DOI10.1090/S0025-5718-06-01944-2zbMath1116.65003OpenAlexW1504437704MaRDI QIDQ3426031
Henryk Woźniakowski, Grzegorz W. Wasilkowski
Publication date: 7 March 2007
Published in: Mathematics of Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1090/s0025-5718-06-01944-2
Monte Carlo methodsrandomized algorithmsreproducing kernel Hilbert spacetractabilityKorobov spaceweighted multivariate approximation
Monte Carlo methods (65C05) Multidimensional problems (41A63) Algorithms for approximation of functions (65D15) Complexity and performance of numerical algorithms (65Y20)
Related Items
On the power of standard information for tractability for \(L_2\)-approximation in the average case setting, Optimal sampling points in reproducing kernel Hilbert spaces, Lower bounds for integration and recovery in \(L_2\), Liberating the Dimension for Function Approximation and Integration, Lower bounds for the complexity of linear functionals in the randomized setting, A sharp upper bound for sampling numbers in \(L_2\), On the power of standard information for tractability for \(L_{\infty}\) approximation of periodic functions in the worst case setting, Multivariate Approximation in Downward Closed Polynomial Spaces, Tractability of infinite-dimensional integration in the worst case and randomized settings, Optimal Monte Carlo methods for \(L^2\)-approximation, Linear information versus function evaluations for \(L_2\)-approximation, Function values are enough for \(L_2\)-approximation, Approximation of additive random fields based on standard information: average case and probabilistic settings, Worst-case recovery guarantees for least squares approximation using random samples, Quasi-polynomial tractability, Optimal pointwise sampling for \(L^2\) approximation, New averaging technique for approximating weighted integrals, On the power of standard information for \(L_{\infty}\) approximation in the randomized setting
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the average complexity of multivariate problems
- Stochastic properties of quadrature formulas
- Randomization for continuous problems
- Random approximation of Sobolev embeddings
- Optimal linear randomized methods for linear operators in Hilbert spaces
- Lower bounds for the complexity of Monte Carlo function approximation
- Deterministic and stochastic error bounds in numerical analysis
- Monte Carlo complexity of global solution of integral equations
- Tractability and strong tractability of linear multivariate problems
- Average-case analysis of numerical problems
- Tractability of approximation for weighted Korobov spaces on classical and quantum computers
- Weighted tensor product algorithms for linear multivariate problems
- Integration and approximation in arbitrary dimensions
- Some nonlinear problems are as easy as the approximation problem
- Good lattice rules in weighted Korobov spaces with general weights
- Noisy Information and Computational Complexity
- On the optimal convergence rate of universal and nonuniversal algorithms for multivariate integration and approximation
- Theory of Reproducing Kernels
- On the power of standard information for weighted approximation
