Chebyshev's recursion: Analytic principles and applications (Q1335984)

Different algebraic and algorithmic constructions related to the scalar product \(\langle,\rangle\) on the linear space \(\{P_{R^ 1}\}\) of polynomials in one variable on the real axis and on the space \(\{P_ C\}\) of trigonometric polynomials on the unit circle and to the Chebyshev procedure (and the corresponding modifications of the Chebyshev procedure) are studied. Modern version of the Chebyshev's recursion (\((m)\)-\(T\)-recursion) is applied to check whether the Hankel and Toeplitz quadratic forms of different kinds are positive definite, to determine the number of real (complex conjugate) roots of the polynomials, to localize the ordering of these roots, and to find bounds for the values of a function on a given set. The moment methods in the study of the Schrödinger operator for special classes of potentials are also considered.