On the power of standard information for multivariate approximation in the worst case setting
From MaRDI portal
Publication:1019157
DOI10.1016/j.jat.2008.01.011zbMath1181.41038OpenAlexW2069230279MaRDI QIDQ1019157
Henryk Woźniakowski, Grzegorz W. Wasilkowski, Frances Y. Kuo
Publication date: 28 May 2009
Published in: Journal of Approximation Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jat.2008.01.011
Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65) Rate of convergence, degree of approximation (41A25) Approximation by operators (in particular, by integral operators) (41A35)
Related Items
On the power of standard information for tractability for \(L_2\)-approximation in the average case setting, \(\mathbb{L}_\infty\)-approximation in Korobov spaces with exponential weights, Optimal sampling points in reproducing kernel Hilbert spaces, Random sections of ellipsoids and the power of random information, Tractability of multivariate approximation over a weighted unanchored Sobolev space, Spline methods using integration lattices and digital nets, Lattice algorithms for multivariate \(L_{\infty}\) approximation in the worst-case setting, A new upper bound for sampling numbers, Lower bounds for integration and recovery in \(L_2\), A Note on Sampling Recovery of Multivariate Functions in the Uniform Norm, Tractability of the Fredholm problem of the second kind, A sharp upper bound for sampling numbers in \(L_2\), Tractability of Function Approximation with Product Kernels, On the power of standard information for tractability for \(L_{\infty}\) approximation of periodic functions in the worst case setting, A survey of average case complexity for linear multivariate problems, Tractability results for weighted Banach spaces of smooth functions, Multivariate \(L_{\infty}\) approximation in the worst case setting over reproducing kernel Hilbert spaces, Linear information versus function evaluations for \(L_2\)-approximation, Fast component-by-component construction of lattice algorithms for multivariate approximation with POD and SPOD weights, Function values are enough for \(L_2\)-approximation, Piecewise-Multilinear Interpolation of a Random Field, 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, Liberating the dimension for function approximation: standard information, Tractability through increasing smoothness, New averaging technique for approximating weighted integrals, On the power of standard information for \(L_{\infty}\) approximation in the randomized setting, Function integration, reconstruction and approximation using rank-$1$ lattices, Lattice algorithms for multivariate approximation in periodic spaces with general weight parameters, On the approximation of smooth functions using generalized digital nets, Tractability of the Helmholtz equation with non-homogeneous Neumann boundary conditions: the relation to the \(L_{2}\)-approximation
Cites Work
- On the average complexity of multivariate problems
- Multivariate \(L_{\infty}\) approximation in the worst case setting over reproducing kernel Hilbert spaces
- Linear information versus function evaluations for \(L_2\)-approximation
- Deterministic and stochastic error bounds in numerical analysis
- Explicit cost bounds of algorithms for multivariate tensor product problems
- Average-case analysis of numerical problems
- Applicability of Smolyak's algorithms to certain Banach spaces of multivariate functions.
- 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
- Lattice rule algorithms for multivariate approximation in the average case setting
- Theory of Reproducing Kernels
- On the power of standard information for weighted approximation
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
