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

DOI10.1093/COMJNL/12.2.160MaRDI QIDQ5577971zbMATHOpenAlexDBLPWikidataFDO

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)

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

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)