A modified fast Fourier transform for polynomial evaluation and the Jenkins-Traub algorithm (Q1819535): Difference between revisions
From MaRDI portal
Revision as of 18:53, 17 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A modified fast Fourier transform for polynomial evaluation and the Jenkins-Traub algorithm |
scientific article |
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
