A Rapid & Precise Algorithm Finding Zeros of Polynomials

A rapid & precise algorithm was proposed to find zeros of polynomials which were not solved by some traditional methods. Its convergence theorem was presented and proved. The computation was carried out by simple steepest descent rule with the variable learning rate. The specific examples illustrated that the proposed method can find the roots of polynomials with less computation, rapid convergence and high accuracy. Furthermore, it had also the added advantage of being able to compute exactly complex roots.