Best approximation of analytic functions from information about their values at a finite number of points
From MaRDI portal
Publication:1226627
DOI10.1007/BF01147612zbMath0328.30031OpenAlexW1991342088MaRDI QIDQ1226627
Publication date: 1976
Published in: Mathematical Notes (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01147612
Related Items
A survey of information-based complexity, Are linear algorithms always good for linear problems?, Worst case identification of continuous time systems via interpolation, Computing a quantity of interest from observational data, Linear problems (with extended range) have linear optimal algorithms, Recovering linear operators and Lagrange function minimality condition, On the existence of optimal affine methods for approximating linear functionals, Optimal interpolation of convergent algebraic series, Recent developments in information-based complexity, Optimal recovery and extremum theory, Linear algorithms for recovering linear functionals from jittered information, Optimal information for approximating periodic analytic functions, Computational (numerical) diameter in a context of general theory of a recovery, Optimal recovery from a finite set in Banach spaces of entire functions, Optimal recovery of the derivative of periodic analytic functions from Hardy classes, Optimal quadrature algorithms in \(H_ p\) spaces
Cites Work
