Numerical factorization of polynomials via a fast transversalfilter

摘要

A fast transversal filter for the numerical factorization ofnpolynomials is presented. When all zeros of a polynomial are ofndifferent modulus, this algorithm can be used for the simultaneousndetermination of all zeros. The main feature of this method is that itnis globally convergent and can be modified to compute all zeros of anyngiven polynomial by shifting the zeros. The numerical efficiency of thenproposed method is inherited from the reduced computational costnassociated with certain implementation of transversal filters, whichnrequire only O(N) operations per sample, where N is the order of thenfilter. The behavior of the algorithm is demonstrated through severalnexamples