Description of extremal polynomials on several intervals and their computation. I (Q1307412): Difference between revisions

There are many recent publications which are devoted to the Chebyshev (minimal) polynomials over several intervals \(E=\bigcup_{k=1}^p[a_{2k-1}, a_{2k}]\) and their computation. Here the whole theory of stability and unicity with respect to given data, such as a subset of \(\{a_k\}_{k=1}^{2p}\), numbers of alternation points on \([a_{2k-1},a_{2k}]\), \(k=1,\ldots,p\), and so on, for the minimal polynomials with maximal number of extremal points (\(T\)-polynomials) is developed. The case of two and (the most interesting case) three intervals is considered and described completely. Finally, the choice of starting values for the numerical computation of \(T\)-polynomials on two intervals by Newton's algorithm is discussed.