Zeroing on zeros of polynomials

There are a lot of root finding algorithms to find zeroes of polynomials. 2nd degree and 3rd degree polynomials can be solved very easily, but higher degree complex polynomials of nth degree, n>3, one requires efficient algorithms to find the zeroes. This paper proposes an approach for finding zeroes of polynomials using Graeffe’s Algorithm, Bairstow’s algorithm and Bisection method. Graeffe’s algorithm focuses on squaring the roots of the original polynomial, and then effectively approximating the polynomial using its coefficients. Bairstow algorithm on the other hand finds a quadratic factor of the polynomial, and thus finds 2 roots in each instance. The roots found are then narrowed down using bisection method. The efficiency of the method is tested and the results are encouraging.