Interpolatory estimates for convex piecewise polynomial approximation (Q2414833)

Interpolatory estimates for convex piecewise polynomial approximation are discussed. Among other results, it is shown that, given $r \in \mathbb{N},$ there is a constant $c=c(r)>0$ such that if $f \in C^{r}[-1,1]$ is convex, then there is a number $\mathcal{N}=\mathcal{N}(f,r),$ depending on $f$ and $r,$ such that for $n \ge \mathcal{N}$ there are convex piecewise polynomials $S$ of order $r+2$ with knots at the $n$th Chebyshev partition satisfying \[ \vert f(x)-S(x) \vert \leq c \left( \min \left\{ 1-x^{2},n^{-1}\sqrt{1-x^{2}} \right\} \right)^{r} \omega_{2}\left( f^{(r)},n^{-1}\sqrt{1-x^{2}} \right) \] for all $x \in [-1,1].$ Here, $\mathcal{N}$ cannot be made independent of $f.$