In this work, Chebyshev polynomials of the first and the second kind, their properties and the Chebyshev series will be examined. We will use Chebyshev polynomials of the first kind to find roots of the smooth function f on the given interval. At first the function will be approximated and then the polynomial root-finders on the truncated Chebyshev series will be used. In the next chapter we will study how to find roots of a polynomial function on the interval which we will, with some algorithms, divide on subintervals with the purpose of more accurate and faster finding of the roots. Different algorithms and their use, their complexity and their strengths and weaknesses will be presented. During this work we have also programmed these algorithms in Matlab. We will show their practical application on some examples.
|
