Improvement of the formal and numerical estimation of the constant in some Markov-Bernstein inequalities (Q1587023): Difference between revisions

The author gives an improvement of lower and upper bounds for the smallest zero of a polynomial defined by a three-term recurrence relation. Such an improvement is obtained by applying the \(qd\) algorithm or by the fixed point method of increasing order. The results are not only numerical but there are also formal improvements.Namely, the author uses Mathematica for formal calculations of first steps for the above-mentioned algorithms. Applications of the estimations for new formal lower and upper bounds of the constant in Markov-Bernstein inequalities in \(L^2\) with the Laguerre and Gegenbauer weights are discussed too. An interesting new sufficient condition is given in order that a polynomial has some complex zeros.