On the power of standard information for weighted approximation
From MaRDI portal
Publication:5956410
DOI10.1007/s102080010016zbMath1001.41013OpenAlexW17488683WikidataQ126579834 ScholiaQ126579834MaRDI QIDQ5956410
Grzegorz W. Wasilkowski, Henryk Woźniakowski
Publication date: 15 December 2002
Published in: Foundations of Computational Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s102080010016
Multidimensional problems (41A63) Algorithms for approximation of functions (65D15) Approximation by arbitrary linear expressions (41A45)
Related Items (25)
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 ⋮ Finite-order weights imply tractability of linear multivariate problems ⋮ Random sections of ellipsoids and the power of random information ⋮ Sampling discretization and related problems ⋮ Tractability of multivariate approximation over a weighted unanchored Sobolev space ⋮ 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\) ⋮ Tractability of the Fredholm problem of the second kind ⋮ A sharp upper bound for sampling numbers in \(L_2\) ⋮ Tractability of \(L_2\)-approximation and integration in weighted Hermite spaces of finite smoothness ⋮ On the power of standard information for tractability for \(L_{\infty}\) approximation of periodic functions in the worst case setting ⋮ Multivariate \(L_{\infty}\) approximation in the worst case setting over reproducing kernel Hilbert spaces ⋮ Linear information versus function evaluations for \(L_2\)-approximation ⋮ Tractability of approximation in the weighted Korobov space in the worst-case setting -- a complete picture ⋮ Worst-case recovery guarantees for least squares approximation using random samples ⋮ Lattice rule algorithms for multivariate approximation in the average case setting ⋮ Liberating the dimension for function approximation: standard information ⋮ On the optimal convergence rate of universal and nonuniversal algorithms for multivariate integration and approximation ⋮ On the power of standard information for multivariate approximation in the worst case setting ⋮ \(L_2\)-norm sampling discretization and recovery of functions from RKHS with finite trace ⋮ Function integration, reconstruction and approximation using rank-$1$ lattices ⋮ On the approximation of smooth functions using generalized digital nets ⋮ The power of standard information for multivariate approximation in the randomized setting
This page was built for publication: On the power of standard information for weighted approximation
