A Neural-Network Algorithm Finding Zeros of Polynomials of High Degree

A fast and exact neural-network algorithm is proposed to find zeros of polynomials which were not solved by the most other methods. Its convergence rule was presented and proved. The computation is carried out by simple steepest descent rule with variable step-size. The specific examples illustrated that the proposed method can find the roots of polynomials at a very rapid convergence and very high accuracy with less computation. Furthermore, it has also the added advantage of being able to compute exactly multiple real or complex roots.