Comparing the degree of constrained and unconstrained trigonometric approximation
Denote by $C=C^0$ the space of continuous $2\pi$-periodic functions $f$ on $R$, endowed with the uniform norm, and for $r\in N$, let $C^{r}\subseteq C$ be the subspace of $r$ times continuously differentiable functions. Denote by $E_{n}(f):=\inf f-T_{n}$, where the infimum is taken over all trigonometric polynomials $T_{n}$ of degree $<n$, the degree of approximation of $f$ by these polynomials. Let $Y_{s}:={y_{i}}_{i\in Z}$, $s\in N, y_{i}\in R$, be such that $y_{i}<y_{i+1}$ and $y_{i+2s}=y_{i}+2\pi$, $i\in Z$. Denote by $\Delta^{(1)}(Y_{s})$, the collection of functions $f\in C$, such that $(-1)^{i-1}f$ is monotone nondecreasing in the intervals $[y_{i-1},y_{i}]$. For $f\in\Delta^{(1)}(Y_{s})$, let $E_{n}^{(1)}(f,Y_{s}):=\inf_{T_{n}\in\Delta^{(1)}(Y_{s})}f-T_{n}$, denote the error of best approximation of $f$ by comonotone trigonometric polynomials $T_{n}$ of degree $<n$. The authors apply very interesting techniques to prove the surprising result that if $r\in\{1,\dots,2s-2\}$, then there is a constant $c=c(r)>0$, such that for each $m\in N$ there are a collection $Y_{s}$ and a function $F\in\Delta^{(1)}(Y_{s})$, such that\N\[\Nn^{r}E_{n}(F)\leq1,\quad n\geq 1,\tag{\(\ast\)}\N\]\Nwhile\N\[\Nm^{r}E_{m}^{(1)}(F,Y_{s})\geq c\ln m.\N\]\NOne should compare the above to what the first two authors have earlier established, that is, that for all other $r>0$, the opposite is valid. Say, if $r>2s-2$ and $F\in\Delta^{(1)}(Y_{s})$ satisfies \((\ast)\), then\N\[\Nn^{r}E_{n}^{(1)}(F,Y_{s})\leq c(r),\quad n\geq 1,\N\]\Nwhere $c(r)$ is a constant depending only on $r$.
- Degree of approximation by monotone polynomials. I
- Efficient co-monotone approximation
- scientific article; zbMATH DE number 477682 (Why is no real title available?)
- scientific article; zbMATH DE number 3246460 (Why is no real title available?)
- Shape preserving approximation of periodic functions: conclusion
- Smooth functions
- Uniform and pointwise shape preserving approximation by algebraic polynomials
This page was built for publication: Comparing the degree of constrained and unconstrained trigonometric approximation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6931119)
