Linear information versus function evaluations for \(L_2\)-approximation

From MaRDI portal
Publication:935085


DOI10.1016/j.jat.2008.02.003zbMath1181.65019MaRDI QIDQ935085

Aicke Hinrichs, Jan Vybíral, Erich Novak

Publication date: 31 July 2008

Published in: Journal of Approximation Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jat.2008.02.003


41A25: Rate of convergence, degree of approximation

65D15: Algorithms for approximation of functions

41A30: Approximation by other special function classes


Related Items

Tractability of Multivariate Problems for Standard and Linear Information in the Worst Case Setting: Part II, Random sections of ellipsoids and the power of random information, Liberating the Dimension for Function Approximation and Integration, New lower bounds for the integration of periodic functions, Optimal sampling points in reproducing kernel Hilbert spaces, Tractability of multivariate problems for standard and linear information in the worst case setting. I., Approximation of additive random fields based on standard information: average case and probabilistic settings, Liberating the dimension for function approximation: standard information, Lattice algorithms for multivariate \(L_{\infty}\) approximation in the worst-case setting, On the power of standard information for multivariate approximation in the worst case setting, New averaging technique for approximating weighted integrals, On the power of standard information for \(L_{\infty}\) approximation in the randomized setting, Enhancement of the algebraic precision of a linear operator and consequences under positivity, Optimal Monte Carlo methods for \(L^2\)-approximation, Function values are enough for \(L_2\)-approximation. II, Generalized sparse grid interpolation based on the fast discrete Fourier transform, Approximation of functions with small mixed smoothness in the uniform norm, On the power of standard information for tractability for \(L_2\)-approximation in the average case setting, A new upper bound for sampling numbers, Lower bounds for integration and recovery in \(L_2\), Function values are enough for \(L_2\)-approximation, Worst-case recovery guarantees for least squares approximation using random samples, A sharp upper bound for sampling numbers in \(L_2\)



Cites Work