A modified fast Fourier transform for polynomial evaluation and the Jenkins-Traub algorithm

DOI10.1007/BF01390703zbMath0613.65015MaRDI QIDQ1819535

William W. Hager

Publication date: 1987

Published in: Numerische Mathematik (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/133151

zbMATH Keywords

zeros of a polynomial; fast Fourier transformation; Cooley-Tukey algorithm; Jenkins-Traub algorithm; evaluation of polynomial; recurrence scheme

Mathematics Subject Classification ID

30E10: Approximation in the complex plane

30C15: Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral)

65D20: Computation of special functions and constants, construction of tables

65E05: General theory of numerical methods in complex analysis (potential theory, etc.)

65H05: Numerical computation of solutions to single equations

Related Items

Approximating complex polynomial zeros: modified Weyl's quadtree construction and improved Newton's iteration.

Uses Software

• NAPACK

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Die numerische Berechnung der Wurzeln eines Polynoms
• A three-stage variable-shift iteration for polynomial zeros and its relation to generalized Rayleigh iteration
• Ein konvergentes Iterationsverfahren zur Bestimmung der Nullstellen eines Polynoms
• An Algorithm for the Machine Calculation of Complex Fourier Series
• On computing the fast Fourier transform
• Practical Problems Arising in the Solution of Polynomial Equations
• A Three-Stage Algorithm for Real Polynomials Using Quadratic Iteration