FFT-based fast polynomial rooting

A fast root finding algorithm based on an FFT implementation is proposed, thus avoiding the need for a computationally heavy polynomial rooting technique that estimates the eigenvalues of a companion matrix. The minimum-phase polynomial factorisation proposed by Oppenheim and Schafer (1989) is first extended to an arbitrary radius factorisation, then used to extract the roots in an iterative manner