On improving the accuracy of Horner's and Goertzel's algorithms

DOI10.1007/s11075-004-4570-4zbMath1075.65034arXivmath/0407177OpenAlexW2015800985MaRDI QIDQ1773083

Iwona Wróbel, Alicja Smoktunowicz

Publication date: 25 April 2005

Published in: Numerical Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0407177

zbMATH Keywords

fast Fourier transformnumerical stabilitypolynomial evaluationdivide-and-conquer techniquesGoertzel's algorithmHorners algorithms

Mathematics Subject Classification ID

Roundoff error (65G50) Computation of special functions and constants, construction of tables (65D20) Numerical computation of matrix norms, conditioning, scaling (65F35) Numerical methods for discrete and fast Fourier transforms (65T50) Elementary functions (26A09)

Related Items (3)

A new efficient algorithm for polynomial interpolation ⋮ The number of zeros of unilateral polynomials over coquaternions revisited ⋮ Evaluation schemes in the ring of quaternionic polynomials

Uses Software

• Matlab
• mctoolbox

Cites Work

• Backward stability of Clenshaw's algorithm
• Error Analysis for Fourier Series Evaluation
• An Error Analysis of the Modified Clenshaw Method for Evaluating Chebyshev and Fourier Series
• An error analysis of Goertzel's (Watt's) method for computing Fourier coefficients
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On improving the accuracy of Horner's and Goertzel's algorithms