On the power of function values for the approximation problem in various settings

zbMATH Open1286.41006arXiv1011.3682MaRDI QIDQ5404063FDOQ5404063

Authors: Erich Novak, H. Woźniakowski 

Publication date: 21 March 2014

Abstract: This is an expository paper on approximating functions from general Hilbert or Banach spaces in the worst case, average case and randomized settings with error measured in the $L_p$ sense. We define the power function as the ratio between the best rate of convergence of algorithms that use function values over the best rate of convergence of algorithms that use arbitrary linear functionals for a worst possible Hilbert or Banach space for which the problem of approximating functions is well defined. Obviously, the power function takes values at most one. If these values are one or close to one than the power of function values is the same or almost the same as the power of arbitrary linear functionals. We summarize and supply a few new estimates on the power function. We also indicate eight open problems related to the power function since this function has not yet been studied for many cases. We believe that the open problems will be of interest to a general audience of mathematicians.

Full work available at URL: https://arxiv.org/abs/1011.3682

Recommendations

• The power of standard information for multivariate approximation in the randomized setting
• On the power of standard information for \(L_{\infty}\) approximation in the randomized setting
• Function values are enough for \(L_2\)-approximation. II
• Approximation of Functions from a Hilbert Space Using Function Values or General Linear Information
• scientific article; zbMATH DE number 2161076

zbMATH Keywords

degree of approximationcomplexity of numerical algorithmswidths and sampling numbers

Mathematics Subject Classification ID

Complexity and performance of numerical algorithms (65Y20) Rate of convergence, degree of approximation (41A25) Approximation by arbitrary nonlinear expressions; widths and entropy (41A46)

Cited In (8)

• A Comparative Study on the Power of van Lieshout and Baddeley's J-Function
• Generalized sparse grid interpolation based on the fast discrete Fourier transform
• Multivariate approximation in downward closed polynomial spaces
• Joint spectra of Toeplitz operators and optimal recovery of analytic functions
• Average sampling numbers of multivariate periodic function spaces with a Gaussian measure
• Liberating the dimension for function approximation and integration
• Worst-case recovery guarantees for least squares approximation using random samples
• Approximation of additive random fields based on standard information: average case and probabilistic settings

This page was built for publication: On the power of function values for the approximation problem in various settings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5404063)