A Modified Fast Fourier Transform for Polynomial Evaluation and the Jenkins-Traub Algorithm.
Numerische Mathematik, Tome 50 (1986), pp. 253-262
Cet article a éte moissonné depuis la source European Digital Mathematics Library
Mots-clés :
recurrence scheme, evaluation of polynomial, Cooley-Tukey algorithm, fast Fourier transformation, Jenkins-Traub algorithm, zeros of a polynomial
@article{NUMA_1986__50_133151,
author = {William W. Hager},
title = {A {Modified} {Fast} {Fourier} {Transform} for {Polynomial} {Evaluation} and the {Jenkins-Traub} {Algorithm.}},
journal = {Numerische Mathematik},
pages = {253--262},
year = {1986},
volume = {50},
zbl = {0613.65015},
url = {http://geodesic.mathdoc.fr/item/NUMA_1986__50_133151/}
}
William W. Hager. A Modified Fast Fourier Transform for Polynomial Evaluation and the Jenkins-Traub Algorithm.. Numerische Mathematik, Tome 50 (1986), pp. 253-262. http://geodesic.mathdoc.fr/item/NUMA_1986__50_133151/