Chebyshev approximation in the coefficient inverse problem for an algebraic polynomial with a prescribed lowest coefficient
https://doi.org/10.22405/2226-8383-2024-25-4-106-119
Abstract
In the article, by means of specially designed approximation grid nodes, the class of polynomials 𝐿𝑛(𝑧, 𝑢) of degree 𝑛 ⩾ 1 is determined, which deviate least from zero on the interval −1 ⩽ 𝑢 ⩽ 1, equal to zero at 𝑢 = −1. For polynomials 𝐿𝑛(𝑧, 𝑢) a connection with Chebyshev polynomials of the first kind is described; the 𝑛-point Chebyshev alternance was studied; extrema are found; exact expressions for the roots and coordinates of the maximum and minimum points are obtained; the formula of the senior coefficient is derived; a segment
is found where the polynomial increases monotonically and tends to +∞ as 𝑢 → +∞. Specific examples of the Chebyshev alternance of the second, third and fourth order are given.
We consider algebraic polynomials of degree n with real coefficients. When processing the input data, a uniform continuous rate of absolute error was used. The influence of input data error on the quality of approximation in the coefficient inverse problem for an algebraic polynomial with a prescribed lowest coefficient is studied. In the problem of minimizing the influence of the input data error, the objective function is described as an absolute condition number of the problem, equal to the value of the Lebesgue function. The graphical material shows the level of increase in the numerical value of the absolute condition number of the problem when the coordinates of the approximation grid nodes deviate from the optimal ones.
To minimize the influence of the input data error on the accuracy of calculating the coefficients of the studied algebraic polynomial, the location of the nodes of the approximation grid was specially designed. With the Chebyshev approximation, the connection of the nodes with the alternance points of the polynomials 𝐿𝑛(𝑧, 𝑢) by a linear function is obtained.
About the Authors
Askold Petrovich Loktionov
Southwest State University
Russian Federation
Russian Federation
doctor of technical sciences
Sergey Gennadievich Emelyanov
Southwest State University
Russian Federation
Russian Federation
doctor of technical sciences, professor
References
1. Bakushinsky, A. B., Kokurin, M. M. & Kokurin, M.Yu. 2018, Regulariz,tion Algorithms for Ill-Posed Problems. Inverse and Ill-Posed Problems Series, 61, De Gruyter, Boston, USA.
2. Vatulyan, A. O., Plotnikov, D. K. 2019, “Inverse coefficient problems in mechanics”, Vestnik Permskogo nacional‘nogo issledovatel‘skogo politexnicheskogo universiteta. Mexanika (PNRPU MECHANICS BULLETIN), no. 3, pp. 37-47. doi: 10.15593/perm.mech/2019.3.04.
3. Samarskii, A .A, Vabishevich, P .N. 2009, “Numerical methods for solving inverse problems of mathematical physics”, ”, Izd. LKI, Moscow, 480 p.
4. Dobrovol’skii, N. N., Larin, N. V., Skobel’tsyn, S. A. & Tolokonnikov L. A. 2019, “About solutions of inverse problems sound waves diffraction”, Chebyshevskii sbornik, vol. 20, no. 3, pp. 220-245. doi: 10.22405/2226-8383-2019-20-3-220-245
5. Cheney, E. W., Kincaid, D. R. 2013, “Numerical Mathematics and Computing”, Thomson Brooks/Cole, Belmont, California, USA.
6. Gorelik, V. A., Zolotova, T. V. 2020, “Method of parametric correction in data transformation and approximation problems”, Lecture Notes in Computer Science (LNCS). Vol. 12422. P.122-133. doi: 10.22405/2226-8383-2022-23-4-52-63
7. Turchak, L. I., Plotnikov, P. V. 2005, “Fundamentals of Numerical Methods”, Fizmatlit, Moscow, 304 p.
8. Denisov, A. M. 1994, “Introduction to the theory of inverse problems”, Izd-vo MGU, Moscow, 208 p.
9. Bernshtejn, S. N. 1954, “On the restrictions on the values of the polynomial 𝑃𝑛(𝑥), squeeze 𝑛 on the entire segment by its values at 𝑛 + 1 points of the segment”, // In: Bernshtejn, S.N. Sobr.soch., 2. [Bernshtejn, S.N. Collected works, 2], Izdat. Akad. Nauk SSSR, Moscow, 107-126. p.
10. Babenko, K. I. 2002, “Fundamentals of Numerical Analysis”, NiTs Regul. Khaot. Dinamika, Moscow, Izhevsk, 848 p.
11. Verzhbickij, V. M. 2021, “Fundamentals of numerical methods”, Direkt-Media, Moscow, Berlin, 850 p.
12. Loktionov, A. P. 2013, “Regularization of the lattice time function of the signal in the communication channel”, Telecommunications and Radio Engineering, vol. 72, no. 2, pp. 161-171. doi: 10.1615/TelecomRadEng.v72.i2.70.
13. Loktionov, A. P. 2021, “Chebyshev Alternance when Approximating Initial Conditions of the Inverse Cauchy Problem”, Izvestiya Yugo-Zapadnogo gosudarstvennogo universiteta(Proceedings of the Southwest State University). vol. 25(3), pp. 86-102. https://doi.org/ 10.21869/2223-1560-2021-25-3-86-102.
14. Zolotarev, E.I. 1932, “Application of elliptic functions to questions about functions deviating least and most from zero”, Zolotarev E.I., Sobr.soch., Vypusk 2. [Zolotarev E.I., Collected works, Issue 2], Izdat. Akad. Nauk SSSR; Leningrad, pp. 1-59.
15. Agafonova, I. V., Malozemov, V. N. 2016, “Extremal polynomials connected with Zolotarev polynomials”, Doklady Akademii nauk (Dokl. Akad. Nauk). vol. 467(5), pp.255-256. doi: 10.7868/S0869565216090036.
16. Malozemov, V. N. 2017, “What does information about alternance give?”, Malozemov V.N. Selected lectures on extremal problems. Part two. [Selected lectures on extremal problems. Part two]. Izd-vo VVM, St. Petersburg, pp. 259-267.
17. Malozemov, V. N., Tamasyan, G. Sh. 2017, “Etude on the theme of the polynomial filter problem (𝑛 = 3)”, Malozemov V.N. Selected lectures on extremal problems. Part two. [Selected lectures on extremal problems. Part two] Izd-vo VVM, St. Petersburg, pp. 305-315.
18. Prasolov, V. V. 2004, “Polynomials”, Springer-Verlag, Berlin, 316 p.
19. Agafonova, I. V., Malozemov, V. N. 2020, “Extremal polynomials connected with Zolotarev polynomials”, Vestnik Sankt-Peterburgskogo universiteta. Matematika. Mekhanika. Astronomiya (Vestnik of Saint Petersburg University. Mathematics. Mechanics. Astronomy). Vol. 7 (65), issue 1, pp. 3-14.
20. Soloviev, S. Y. 2021, “On a class of factors of the Chebyshev polynomials”, Chebyshevskii sbornik, Vol. 22, № 4, pp. 241-252. doi: 10.22405/2226-8383-2021-22-4-241-252.
Review
For citations:
Loktionov A.P., Emelyanov S.G. Chebyshev approximation in the coefficient inverse problem for an algebraic polynomial with a prescribed lowest coefficient. Chebyshevskii Sbornik. 2024;25(4):106-119. (In Russ.) https://doi.org/10.22405/2226-8383-2024-25-4-106-119
Views:
61
Email this article 