Root finding for a function or a polynomial that is smooth on the interval [a; b], but otherwise arbitrary, is done by the following procedure. First, approximate it by a Chebyshev polynomial series. Second, find the zeros of the truncated Chebyshev series. Finding roots of the Chebyshev polynomial is done by eigenvalues of a nXn matrix such as companion or comrade matrices. There are some methods for finding eigenvalues of these matrices such as companion matrix and chasing procedures.We derive another algorithm by second kind of Chebyshev polynomials.We computed the numerical results of these methods for some special and ill-conditioned polynomials.
Solary, M. S.
Numerical Experiments for Finding Roots of the Polynomials in Chebyshev Basis,
Applications and Applied Mathematics: An International Journal (AAM), Vol. 12,
2, Article 22.
Available at: https://digitalcommons.pvamu.edu/aam/vol12/iss2/22