Zolotarev's first problem - the best approximation by polynomials of degree n-2 to x^ n-n x^n-1 in [-1,1]

This problem, with approximation measured in the Chebyshev norm, stated and solved in 1874 by \textit{E. I. Zolotarev} [Complete Collected Works, Leningrad, 1921/2, vol. 1, 369-374, vol. 2, 1-59, 130-166, 357-361], was also solved by \textit{N. I. Achieser} [Vorlesungen über Approximationstheorie (1967; Zbl 0152.253)] and by \textit{P. Erdős} and \textit{G. Szegö} [Ann. Math., II. Ser. 43, 451-470 (1942; Zbl 0060.055), correction 74, 628 (1961; Zbl 0099.251)]. It has many interesting features. For instance, the character of the solution changes at \(| \sigma | =\sigma_ 0=\tan^ 2(\pi /2n):\) for \(| \sigma | \leq \sigma_ 0\) it is a distorted Chebyshev polynomial, while for \(| \sigma |>\sigma_ 0\) it is a very complicated conglomeration of elliptic functions, with modulus determined implicitly by n,\(\sigma\). Two solutions are presented. Using the equal-ripple theorem of Chebyshev, the qualitative behavior of the extremal can be obtained by curve-tracing methods and it is then possible to find a differential equation for the extremal. One solution is obtained using the R-functions introduced by \textit{B. C. Carlson} [Special functions of applied mathematics (1977; Zbl 0394.33001)]; the other is in the nature of a verification.

Recommendations

Cites work

Cited in

(21)

This page was built for publication: Zolotarev's first problem - the best approximation by polynomials of degree \(\leq n-2\) to \(x^ n-n\sigma x^{n-1}\) in [-1,1]

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