Stability of parallel algorithms to evaluate Chebyshev series
DOI10.1016/S0898-1221(01)00102-XzbMath1002.65002OpenAlexW2080361077MaRDI QIDQ5948792
No author found.
Publication date: 12 November 2001
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0898-1221(01)00102-x
stabilityChebyshev polynomialsnumerical examplesparallel computationerror boundsparallel algorithmroundoff errorClenshaw algorithmForsythe algorithmpolynomial evaluation
Orthogonal polynomials and functions of hypergeometric type (Jacobi, Laguerre, Hermite, Askey scheme, etc.) (33C45) Roundoff error (65G50) Computation of special functions and constants, construction of tables (65D20) Parallel numerical computation (65Y05) Numerical summation of series (65B10) Numerical approximation and evaluation of special functions (33F05)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Rounding error propagation in polynomial evaluation schemes
- Stability of a partitioning algorithm for bidiagonal systems
- Parallel evaluation of Chebyshev and trigonometric series
- Optimal algorithms for parallel polynomial evaluation
- Generation and Use of Orthogonal Polynomials for Data-Fitting with a Digital Computer
- Scaling for Numerical Stability in Gaussian Elimination
- Error Control with Polynomial Approximations
- Error Analysis for Polynomial Evaluation
- An Error Analysis of the Modified Clenshaw Method for Evaluating Chebyshev and Fourier Series
- A Parallel Algorithm to Evaluate Chebyshev Series on a Message Passing Environment
- Stability of Parallel Triangular System Solvers
- A Simple Parallel Algorithm for Polynomial Evaluation
- Generalizations of Horner's Rule for Polynomial Evaluation
- Error analysis of an algorithm for summing certain finite series
- An error analysis of Goertzel's (Watt's) method for computing Fourier coefficients
- On the Parallel Evaluation of Polynomials
