A fast transversal filter for the numerical factorization of polynomials

A fast transversal filter (FTF) for the numerical factorization of polynomials having zeros of different modulus is presented. When all zeros of a polynomial are of different modulus, this algorithm can be used for the simultaneous determination of all zeros. This method is globally convergent in that it does not require initial conditions to start. Additionally, this can be modified to compute all zeros of any given polynomial by shifting the zeros. The numerical efficiency of this algorithm is inherited from the reduced computational cost associated with the transversal filters which require O(N) operations per sample and N is the order of the filter