Chebyshev's problem on extremal values of moments of nonnegative algebraic polynomials

V. I. Ivanov

Trudy Instituta matematiki i mehaniki, Trudy Instituta Matematiki i Mekhaniki UrO RAN, Tome 26 (2020) no. 4, pp. 138-154

Résumé

The paper is devoted to the study of the 1883 Chebyshev problem on the maximum and minimum values of the moments of nonnegative algebraic polynomials with a fixed zero moment on finite and infinite intervals with weight. For the first moment on the segment $[-1,1]$, the problem was solved by P.L. Chebyshev in the case of unit weight and by G. Szegö in the general case. The extreme values of the first moment were the largest and smallest zeros of some orthogonal polynomials. Their solution used the representation of non-negative polynomials and the Gauss quadrature formula of the highest accuracy. We solve the Chebyshev problem on the extreme values of the moments of order $k\ge2$ for any intervals $(a, b)$ if $k$ is odd and for intervals with $a\ge 0$ or $b\le 0$ if $k$ is even. These intervals are characterized by the fact that the function $x^k$ is monotone on them. As for $k=1$, the extremal values of moments of order $k$ are the $k$th powers of the largest and least zeros of some orthogonal polynomials. The other zeros of these polynomials are also extreme. They give extreme values in a generalization of the Chebyshev problem to the case of polynomials with fixed zeros. To solve the generalized Chebyshev problem, we constructed special quadrature formulae. The solution to the Chebyshev problem is obtained as a special case of the solution to the generalized Chebyshev problem. In some cases, due to the absence of the second endpoint for an infinite interval, it is not possible to construct the necessary quadrature formulae and one has to directly solve the Chebyshev problem, relying on the representation of non-negative polynomials. In addition to the cases noted above, for moments of even order, it is possible to solve the Chebyshev problem on an interval $(-a,a)$ if the weight is even. In the general case, the question of solving the Chebyshev problem for moments of even order remains open.

Détail

Keywords: moments of algebraic polynomials, Chebyshev's problem
Mots-clés : quadrature formulae, orthogonal polynomials.

Bibliographie

[1] Chebyshev P.L., “Ob otnoshenii dvukh integralov, rasprostranennykh na odni i te zhe velichiny peremennoi (1883)”, Polnoe sobranie sochinenii, v. 3, Izd-vo AN SSSR, M., 1948, 132–156

[2] Sege G., Ortogonalnye mnogochleny, Fizmatgiz, M., 1962, 500 pp.

[3] Gorbachev D.V., Ivanov V.I., Lektsii o kvadraturnykh formulakh i ikh primenenii v ekstremalnykh zadachakh, Izd-vo TulGU, Tula, 2016, 131 pp.

[4] Krylov V.I., Priblizhennoe vychislenie integralov, Nauka, M., 1967, 500 pp.

[5] Ivanov V.I., “Ekstremalnye znacheniya momentov neotritsatelnykh mnogochlenov”, Mat. zametki, 108:4 (2020), 625–628

[6] Ostrovskii A.M., Reshenie uravnenii i sistem uravnenii, IL, M., 1963, 220 pp.

[7] Gautschiy W., “Orthogonal polynomials and quadrature”, Electronic Transactions on Numerical Analysis, 9 (1999), 65–76

[8] Shashkin Yu.A., Nepodvizhnye tochki, Nauka, M., 1989, 80 pp.

[9] Polia G., Sege G., Zadachi i teoremy iz analiza, v. 2, Nauka, M., 1978, 432 pp.

[10] Levenshtein V.I., “Universal bounds for codes and designs”, Handbook of Coding Theory, eds. V. S. Pless and W. C. Huffman, Elsevier, Amsterdam, 1998, 499–648