Abstract
In this paper we solve the problem of the determination of a polynomial of degree n with given two leading coefficients which has the least deviation from zero in the metric of L1 ([−1, 1]). The extremal polynomial is expressed in the form of some linear combination of Chebyshev polynomials of the second kind.
Similar content being viewed by others
Literature cited
P. L. Chebyshev, “The theory of mechanisms known under the name of parallelograms,” in: Complete Collected Works [in Russian], Vol. II, Moscow-Leningrad (1947), pp. 23–51.
P. L. Chebyshev, “On interpolation in the case of a large number of data furnished by the observations,” in: Complete Collected Works [in Russian], Vol. II, Moscow-Leningrad (1947), pp. 244–313.
E. I. Zolotarev, “On a problem on minimal quantities,” in: Complete Collected Works [in Russian], No. 2, Leningrad (1932), pp. 130–166.
N. I. Akhiezer, Theory of Approximations, F. Ungar, New York (1956).
I. M. Vinogradov, The Method of Trigonometric Sums in the Theory of Numbers [in Russian], Moscow (1971).
D. D. Oblomievskii, Symmetric Functions [in Russian], SPB (1903).
Author information
Authors and Affiliations
Additional information
Translated from Matematicheskie Zametki, Vol. 17, No. 1, pp. 13–20, January, 1975.
In conclusion, the author expresses his gratitude to V. M. Tikhomirov and S. B. Stechkin for their help and interest in this paper.
Rights and permissions
About this article
Cite this article
Galeev, É.M. Zolotarev problem in the metric of L1([−1, 1]). Mathematical Notes of the Academy of Sciences of the USSR 17, 9–13 (1975). https://doi.org/10.1007/BF01093834
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01093834