Adaptive polynomial factorization by coefficient matching

A polynomial factorization algorithm is presented which updates all roots simultaneously and efficiently in response to coefficient perturbations. The algorithm requires approximately 2n/sup 2/ complex floating point operations to update all roots of nth order polynomial. Close to the true root vector, the algorithm's convergence rate is quadratic. The root update requires only the solution of two sets of structured linear equations and a convolution. The algorithm can be used to track the roots of time-varying polynomials which is useful for application in adaptive signal processing.>