No label defined (Q4936664)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1396711
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 1396711 |
Statements
31 January 2000
0 references
polynomials with least deviations from zero
0 references
approximation by polynomials
0 references
\(L_1\)-metric
0 references
extremal polynomials
0 references
number of sign changes
0 references
0.9384720921516418
0 references
0.8629953265190125
0 references
0.8379252552986145
0 references
0.82797771692276
0 references
Let \(l\in\mathbb N\), \(n\in\mathbb Z_+\), and reals \(A_0=1\), \(A_1,\dots, A_{l-1}\) be given. The following problem is posed: Find a sequence \(a_l\), \(a_{l+1},\dots, a_{l+n}\in\mathbb R\) satisfying the condition \[ \int_{-1}^{+1}|x^{n+l} + A_1x^{n+l-1} + \dots + A_{l-1}x^{n+1} + a_lx^n +\dots + a_{n+l}|dx\to\min. \] Typically this problem is called Zolotorev's problem in \(L[-1, 1]\) metrics. A.~Korkin and E.~Zolotarev solved the problem in the case \(l=1\). Then E.~Galeev obtained a solution to Zolotarev's problem for \(l=2\). In the article under review, the author exposes a new method for solving this problem and translates the result to the case \(l=3\). For polynomials of the form \(R_{n+l}(x) = R_{n+l}(x, A_1,\dots, A_{l-1})\) with least deviations from zero in \(L[-1,1]\) metrics with prescribed leading part \(f(x) = x^{n+l} + A_1x^{n+l-1}+ \dots + A_{l-1}x^{n+1}\), the author obtains a representation via the so-called extremal polynomials with least deviations whose number of sign changes equals their degree.
0 references