An error analysis of Goertzel's (Watt's) method for computing Fourier coefficients
From MaRDI portal
Publication:5577971
DOI10.1093/comjnl/12.2.160zbMath0185.40802OpenAlexW2126619277WikidataQ57484267 ScholiaQ57484267MaRDI QIDQ5577971
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
Related Items (17)
A method for computing Bessel function integrals ⋮ On the application of Newbery's transformation to the Reinsch polynomial evaluation scheme ⋮ The three-term recursion for Chebyshev polynomials is mixed forward-backward stable ⋮ Evaluation schemes in the ring of quaternionic polynomials ⋮ Accurate evaluation of a polynomial in Chebyshev form ⋮ On improving the accuracy of Horner's and Goertzel's algorithms ⋮ Stability of parallel algorithms to evaluate Chebyshev series ⋮ On the sensitivity to rounding errors of Chebyshev series approximations ⋮ Rounding error bounds for the Clenshaw and Forsythe algorithms for the evaluation of orthogonal polynomial series ⋮ Rounding error propagation in polynomial evaluation schemes ⋮ A Higher-Order Structure Tensor ⋮ Error Analysis for Polynomial Evaluation ⋮ Product integration with the Clenshaw-Curtis points: Implementation and error estimates ⋮ Error Analysis for Fourier Series Evaluation ⋮ Computation of spherical harmonic expansion coefficients via FFT's ⋮ Evaluation of Chebyshev Polynomials on Intervals and Application to Root Finding ⋮ Reliable determination of interpolating polynomials
This page was built for publication: An error analysis of Goertzel's (Watt's) method for computing Fourier coefficients
