Interpolatory estimates for convex piecewise polynomial approximation

Abstract: In this paper, among other things, we show that, given

r i n N

, there is a constant

c = c (r)

such that if

f i n C^{r} [- 1, 1]

is convex, then there is a number

m a t h c a l N = m a t h c a l N (f, r)

, depending on

f

and

r

, such that for

n g e m a t h c a l N

, there are convex piecewise polynomials

S

of order

r + 2

with knots at the Chebyshev partition, satisfying [ |f(x)-S(x)|le c(r)left( minleft{ 1-x^2, n^{-1}sqrt{1-x^2} ight} ight)^r omega_2left(f^{(r)}, n^{-1}sqrt{1-x^2} ight), ] for all

x i n [- 1, 1]

. Moreover,

m a t h c a l N

cannot be made independent of

f

.

Review text

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.$

Recommendations

Cites work

Cited in

(17)

This page was built for publication: Interpolatory estimates for convex piecewise polynomial approximation

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