A modified fast Fourier transform for polynomial evaluation and the Jenkins-Traub algorithm
The Cooley-Tukey algorithm for the fast Fourier transformation is modified to evaluate a polynomial at equally spaced points on a circle with its center at the origin in the complex plane. This scheme is developed to give a starting point for the Jenkins-Traub algorithm for computing the zeros of a polynomial.
scientific article; zbMATH DE number 3992774