An Error Analysis of the Modified Clenshaw Method for Evaluating Chebyshev and Fourier Series
From MaRDI portal
Publication:4181176
DOI10.1093/imamat/20.3.379zbMath0397.65013OpenAlexW2167643490MaRDI QIDQ4181176
No author found.
Publication date: 1977
Published in: IMA Journal of Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1093/imamat/20.3.379
Fourier series in special orthogonal functions (Legendre polynomials, Walsh functions, etc.) (42C10) Roundoff error (65G50) Computation of special functions and constants, construction of tables (65D20) Algorithms for approximation of functions (65D15) Convergence and absolute convergence of Fourier and trigonometric series (42A20) Numerical summation of series (65B10)
Related Items
Evaluation of Chebyshev polynomials by a three-term recurrence in floating-point arithmetic ⋮ Uniform convergence and computation of the generalized exponential integrals ⋮ A stable method for the evaluation of a polynomial and of a rational function of one variable ⋮ Iterative refinement enhances the stability of \(QR\) factorization methods for solving linear equations ⋮ 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 ⋮ Evaluation of generalized exponential integrals using multinomial expansion theorems ⋮ Rounding error propagation in polynomial evaluation schemes ⋮ Evaluation of Chebyshev Polynomials on Intervals and Application to Root Finding ⋮ The efficient computation of some generalised exponential integrals ⋮ Reliable determination of interpolating polynomials ⋮ Numerical evaluation of the \(p\)th derivative of Jacobi series
