A modified fast Fourier transform for polynomial evaluation and the Jenkins-Traub algorithm (Q1819535)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A modified fast Fourier transform for polynomial evaluation and the Jenkins-Traub algorithm |
scientific article; zbMATH DE number 3992774
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A modified fast Fourier transform for polynomial evaluation and the Jenkins-Traub algorithm |
scientific article; zbMATH DE number 3992774 |
Statements
A modified fast Fourier transform for polynomial evaluation and the Jenkins-Traub algorithm (English)
0 references
1987
0 references
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.
0 references
recurrence scheme
0 references
evaluation of polynomial
0 references
Cooley-Tukey algorithm
0 references
fast Fourier transformation
0 references
Jenkins-Traub algorithm
0 references
zeros of a polynomial
0 references
0 references
