Optimal sampling rates for approximating analytic functions from pointwise samples

DOI10.1093/imanum/dry024zbMath1462.65024arXiv1610.04769OpenAlexW2963813846MaRDI QIDQ5854358

Rodrigo B. Platte, A. Yu. Shadrin, Ben Adcock

Publication date: 16 March 2021

Published in: IMA Journal of Numerical Analysis (Search for Journal in Brave)

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

zbMATH Keywords

polynomial approximationleast-squaresdiscrete approximationexponential convergence

Mathematics Subject Classification ID

Approximation by polynomials (41A10) Algorithms for approximation of functions (65D15)

Related Items

Infinite-dimensional \(\ell ^1\) minimization and function approximation from pointwise data, Near-Optimal Sampling Strategies for Multivariate Function Approximation on General Domains, Computing a quantity of interest from observational data, A Fast Algorithm for the Convolution of Functions with Compact Support Using Fourier Extensions, APPROXIMATING SMOOTH, MULTIVARIATE FUNCTIONS ON IRREGULAR DOMAINS, Full recovery from point values: an optimal algorithm for Chebyshev approximability prior, Exponential tractability of \(L_2\)-approximation with function values, Fast and stable approximation of analytic functions from equispaced samples via polynomial frames, The Fourier extension method and discrete orthogonal polynomials on an arc of the circle, CAS4DL: Christoffel adaptive sampling for function approximation via deep learning