Izvestiya of Saratov University.

Mathematics. Mechanics. Informatics

ISSN 1816-9791 (Print)
ISSN 2541-9005 (Online)


For citation:

Dudov S. I., Osiptsev M. A. On one consequence of the Chebyshev alternance. Izvestiya of Saratov University. Mathematics. Mechanics. Informatics, 2025, vol. 25, iss. 1, pp. 4-14. DOI: 10.18500/1816-9791-2025-25-1-4-14, EDN: BELGZJ

This is an open access article distributed under the terms of Creative Commons Attribution 4.0 International License (CC-BY 4.0).
Published online: 
28.02.2025
Full text:
(downloads: 47)
Language: 
Russian
Heading: 
Article type: 
Article
UDC: 
517.2+519.853
EDN: 
BELGZJ

On one consequence of the Chebyshev alternance

Autors: 
Dudov Sergei Ivanovitch, Saratov State University
Osiptsev Mikhail Anatolievich, Saratov State University
Abstract: 

The classical problem of the best approximation of a continuous function by a polynomial over a Chebyshev system of functions is considered. It is known that the solution of the problem is characterized by alternance. In addition, there is a linear growth function of the deviation of the target function of the coefficients of the polynomial from its minimum value with respect to the deviation of the vector of coefficients from the optimal one. In this article, the formula for the exact coefficient of this linear growth function is obtained by means of convex analysis. In contrast to those obtained earlier, it is expressed in a form constructive for realization through the values of the Chebyshev system functions at the points realizing alternance.

Acknowledgments: 
The authors express their deep gratitude to the reviewer for constructive comments and to M. V. Balashov for the works related to the topic under consideration.
References: 
  1. Newman D. J., Shapiro H. S. Some theorems on Cebysev approximation. Duke Mathematical Journal, 1963, vol. 30, iss. 4, pp. 673–681. https://doi.org/10.1215/S0012-7094-63-03071-0
  2. Cline A. K. Lipschitz conditions on uniform approximation operators. Journal of Approximation Theory, 1973, vol. 8, iss. 2, pp. 160–172. https://doi.org/10.1016/0021-9045(73)90025-7
  3. Bartelt M. On Lipschitz conditions, strong unicity and a theorem of A. K. Cline. Journal of Approximation Theory, 1975, vol. 14, iss. 4, pp. 245–250. https://doi.org/10.1016/0021-9045(75)90072-6
  4. Marinov A. V. On uniform constants of strong uniqueness in Chebyshev approximations and fundamental results of N. G. Chebotarev. Izvestiya: Mathematics, 2011, vol. 75, iss. 3, pp. 603–630. https://doi.org/10.1070/IM2011v075n03ABEH002546
  5. Cebotarev N. G. On a general criterion of the minimax. Doklady Academy of Science URSS, 1943, vol. 39, iss. 9, pp. 373–376 (in Russian).
  6. Chebotarev N. G. Sobranie socineniy [Collected works]. Vol. 2. Moscow, Leningrad, Academy of Sciences of the USSR Publ., 1949. 588 p. (in Russian).
  7. Karlin S., Studden W. J. Tchebycheff systems: With applications in analysis and statistics. Interscience Publishers, 1966. 586 p. (Russ. ed.: Moscow, Nauka, 1976. 568 p.).
  8. Pshenichnyy B. N. Vypuklyy analiz i ekstremal’nye zadachi [Convex analysis and extremal problems]. Moscow, Nauka, 1980. 320 p. (in Russian).
  9. Dem’yanov V. F., Malozemov V. N. Introduction to minimax. New York, Dover Publications, 1990. 307 p. (Russ. ed.: Moscow, Nauka, 1972. 368 p.).
  10. Dzyadyk V. K. Vvedenie v teoriyu ravnomernogo priblizheniya funkciy polinomami [Introduction to the theory of uniform approximation of functions by polynomials]. Moscow, Nauka, 1977. 510 p. (in Russian).
  11. Polyak B. T. Introduction to optimization. New York, Optimization Software, Inc., Publications Division, 1987. 438 p. (Russ. ed.: Moscow, Nauka, 1983. 383 p.).
  12. Demyanov V. F., Vasiliev L. V. Nondifferentiable optimization. New York, Springer-Optimization Software, 1985. 452 p. (Russ. ed.: Moscow, Nauka, 1981. 384 p.).
  13. Vygodchikova I. Yu., Dudov S. I., Sorina E. V. External estimation of a segment function by a polynomial strip. Computational Mathematics and Mathematical Physics, 2009, vol. 49, iss. 7, pp. 1119–1127. https://doi.org/10.1134/S0965542509070057
  14. Dudov S. I., Sorina E. V. Uniform estimation of a segment function by a polynomial strip of fixed width. Computational Mathematics and Mathematical Physics, 2011, vol. 51, iss. 11, pp. 1864–1877. https://doi.org/10.1134/S0965542511110066
  15. Dudov S. I., Sorina E. V. Uniform estimate for a segment function in terms of a polynomial strip. St. Petersburg Mathematical Journal, 2013, vol. 24, iss. 5, pp. 723–742. https://doi.org/10.1090/S1061-0022-2013-01262-3
  16. Volosivets S. S., Dudov S. I., Prokhorov D. V., Khromova G. V. Novye metody approksimatsii i optimizatsii v zadachakh deystvitel’nogo i kompleksnogo analiza [New methods of approximation and optimization in the problems of real and complex analysis]. Saratov, Saratov State University Publ., 2016. 296 p. (in Russian). EDN: XSCTLV
Received: 
23.01.2023
Accepted: 
02.09.2024
Published: 
28.02.2025