Stable Extrapolation of Analytic Functions

This paper examines the problem of extrapolation of an analytic function for $$x > 1$$ given $$n+1$$ perturbed samples from an equally spaced grid on $$[-1,1]$$ . for a function f on $$[-1,1]$$ that is analytic in a bernstein ellipse with parameter $$rho > 1$$ , and for a uniform perturbation level $$varepsilon $$ on the function samples, we construct an asymptotically best extrapolant e(x) as a least squares polynomial approximant of degree $$m^*$$ determined explicitly. we show that the extrapolant e(x) converges to f(x) pointwise in the interval $$i_rho in [1,(rho +rho ^{-1})/2)$$ as $$varepsilon rightarrow 0$$ , at a rate given by a x-dependent fractional power of $$varepsilon $$ . more precisely, for each $$x in i_{rho }$$ we have $$begin{aligned} |f(x) - e(x)| = mathcal {o}left( varepsilon ^{-log r(x) / log rho } right) , quad r(x) = frac{x+sqrt{x^2-1}}{rho }, end{aligned}$$ up to log factors, provided that an oversampling conditioning is satisfied, viz. $$begin{aligned} m^* le frac{1}{2} sqrt{n}, end{aligned}$$ which is known to be needed from approximation theory. in short, extrapolation enjoys a weak form of stability, up to a fraction of the characteristic smoothness length. the number of function samples does not bear on the size of the extrapolation error provided that it obeys the oversampling condition. we also show that one cannot construct an asymptotically more accurate extrapolant from equally spaced samples than e(x), using any other linear or nonlinear procedure. the proofs involve original statements on the stability of polynomial approximation in the chebyshev basis from equally spaced samples and these are expected to be of independent interest.