A simple efficient parallel method of time-varying polynomials rooting

A new simple effective algorithm, which determines all roots of polynomial and also updates all roots of time-varying polynomials simultaneously, is presented. It is a generalization of the modified Newton method and has quadratic convergence rate. The total number operations of algorithm is less than in the classical Newton method. The proposed method is usefully for parallel computing.