An error analysis of Goertzel's (Watt's) method for computing Fourier coefficients

DOI10.1093/COMJNL/12.2.160zbMATH Open0185.40802DBLPjournals/cj/Gentleman69OpenAlexW2126619277WikidataQ57484267 ScholiaQ57484267MaRDI QIDQ5577971FDOQ5577971

Authors: W. M. Gentleman 

Publication date: 1969

Published in: The Computer Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/comjnl/12.2.160

zbMATH Keywords

numerical analysis

Cited In (17)

• On the sensitivity to rounding errors of Chebyshev series approximations
• Evaluation of Chebyshev Polynomials on Intervals and Application to Root Finding
• Evaluation schemes in the ring of quaternionic polynomials
• Product integration with the Clenshaw-Curtis points: Implementation and error estimates
• A method for computing Bessel function integrals
• Rounding error propagation in polynomial evaluation schemes
• On the application of Newbery's transformation to the Reinsch polynomial evaluation scheme
• Accurate evaluation of a polynomial in Chebyshev form
• Reliable determination of interpolating polynomials
• A Higher-Order Structure Tensor
• On improving the accuracy of Horner's and Goertzel's algorithms
• The three-term recursion for Chebyshev polynomials is mixed forward-backward stable
• Computation of spherical harmonic expansion coefficients via FFT's
• Stability of parallel algorithms to evaluate Chebyshev series
• Rounding error bounds for the Clenshaw and Forsythe algorithms for the evaluation of orthogonal polynomial series
• Error Analysis for Fourier Series Evaluation
• Error Analysis for Polynomial Evaluation

This page was built for publication: An error analysis of Goertzel's (Watt's) method for computing Fourier coefficients

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5577971)