Best \(L^ 1\)-approximation by polynomials. II (Q805950)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Best L^ 1-approximation by polynomials. II |
scientific article; zbMATH DE number 4205052
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Best \(L^ 1\)-approximation by polynomials. II |
scientific article; zbMATH DE number 4205052 |
Statements
Best \(L^ 1\)-approximation by polynomials. II (English)
0 references
1990
0 references
The paper is the continuation of [\textit{H. Fiedler}, \textit{W. B. Jurkat}, J. Approximation Theory 37, 269-292 (1983; Zbl 0526.41011)]. It is given the bound from above of the difference between the value of best \(L^ 1\)-approximation of \(f\in C^ n[-1;1]\) \((f^{(n)}(x)\geq 0\) for \(| x| \leq \delta \leq 1)\) by real polynomials of degree not exceeding n and doubled nth coefficient of Fourier series expansion of f by Chebyshev polynomials of second kind.
0 references
Markov class of functions
0 references
coefficients of Fourier-Chebyshev expansions
0 references
best \(L^ 1\)-approximation
0 references
Chebyshev polynomials
0 references
0.8435364365577698
0 references
0.820176899433136
0 references
0.8134527206420898
0 references
