Interpolatory pointwise estimates for monotone polynomial approximation

From MaRDI portal




Abstract: Given a nondecreasing function f on [1,1], we investigate how well it can be approximated by nondecreasing algebraic polynomials that interpolate it at pm1. We establish pointwise estimates of the approximation error by such polynomials that yield interpolation at the endpoints (i.e., the estimates become zero at pm1). We call such estimates "interpolatory estimates". In 1985, DeVore and Yu were the first to obtain this kind of results for monotone polynomial approximation. Their estimates involved the second modulus of smoothness omega2(f,cdot) of f evaluated at sqrt1x2/n and were valid for all nge1. The current paper is devoted to proving that if finCr[1,1], rge1, then the interpolatory estimates are valid for the second modulus of smoothness of f(r), however, only for ngeN with N=N(f,r), since it is known that such estimates are in general invalid with N independent of f. Given a number alpha>0, we write where r is a nonnegative integer and , and denote by Lipalpha the class of all functions f on [1,1] such that . Then, one important corollary of the main theorem in this paper is the following result that has been an open problem for alphageq2 since 1985: If alpha>0, then a function f is nondecreasing and in Lipalpha, if and only if, there exists a constant C such that, for all sufficiently large n, there are nondecreasing polynomials Pn, of degree n, such that [ |f(x)-P_n(x)| leq C left(frac{sqrt{1-x^2}}{n} ight)^alpha, quad xin [-1,1]. ]









This page was built for publication: Interpolatory pointwise estimates for monotone polynomial approximation

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