Boundedness of minimax series from values of the function and its derivative
The so-called ``minimax series given by the expression \(S(f)= \sum^\infty_{k= 0} E_k(f)\), represents the sum of all the errors \(E_k(f)\), \(k=0,1,2, \dots\), corresponding to the best approximations of a function \(f\) (continuous on an interval \([a,b])\) on the set \(\Pi_k\) of all polynomials of degree \(\leq k\), with the uniform norm. In this paper the author proves that if \(f\) is a continuous function on \([0,1]\) with \(S(f) <\infty\), then the well-known Bernstein polynomials \((B_nf)(x) =\sum^n_{k=0} {n\choose k} f(k/n) x^k(1-x)^{n-k}\) converge to \(f\) in the norm \(S\). As a consequence it follows \(\lim_{n\to\infty} S(B_nf) =S(f)\) and this result is used to establish certain computable and useful bounds of \(S(f)\) which involve only values of \(f\) and its derivative.
- Comparison of inequalities for the minimax series via Tchebychev polynomials
- Best polynomial approximation in Besov spaces
- scientific article; zbMATH DE number 65771 (Why is no real title available?)
- scientific article; zbMATH DE number 176424 (Why is no real title available?)
- scientific article; zbMATH DE number 1270072 (Why is no real title available?)
- scientific article; zbMATH DE number 825186 (Why is no real title available?)
- Polynomial approximation errors for functions of low-order continuity
- Dini bounds for differentiated Bernstein polynomials
This page was built for publication: Boundedness of minimax series from values of the function and its derivative
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1362350)
