Stability of parallel algorithms to evaluate Chebyshev series
Chebyshev polynomialsClenshaw algorithmerror boundsForsythe algorithmnumerical examplesparallel algorithmparallel computationpolynomial evaluationroundoff errorstability
Orthogonal polynomials and functions of hypergeometric type (Jacobi, Laguerre, Hermite, Askey scheme, etc.) (33C45) Numerical approximation and evaluation of special functions (33F05) Numerical summation of series (65B10) Computation of special functions and constants, construction of tables (65D20) Roundoff error (65G50) Parallel numerical computation (65Y05)
The rounding error bounds of the parallel versions of Forsythe's and Clenshaw's algorithms for the evaluation of finite series of Chebyshev polynomials are studied. Both backward and forward errors are studied and a stable behavior is proved. Several numerical tests are presented to compare the theoretical bounds and the simulated rounding errors.
- scientific article; zbMATH DE number 1617952
- Parallel evaluation of Chebyshev and trigonometric series
- Parallel Algorithms to Evaluate Orthogonal Polynomial Series
- Stability of parallel algorithms for polynomial evaluation
- A Parallel Algorithm to Evaluate Chebyshev Series on a Message Passing Environment
- A Parallel Algorithm to Evaluate Chebyshev Series on a Message Passing Environment
- A Simple Parallel Algorithm for Polynomial Evaluation
- An error analysis of Goertzel's (Watt's) method for computing Fourier coefficients
- An Error Analysis of the Modified Clenshaw Method for Evaluating Chebyshev and Fourier Series
- Error Analysis for Polynomial Evaluation
- Error analysis of an algorithm for summing certain finite series
- Error Control with Polynomial Approximations
- Generalizations of Horner's Rule for Polynomial Evaluation
- Generation and Use of Orthogonal Polynomials for Data-Fitting with a Digital Computer
- scientific article; zbMATH DE number 1113877 (Why is no real title available?)
- scientific article; zbMATH DE number 1547082 (Why is no real title available?)
- scientific article; zbMATH DE number 846277 (Why is no real title available?)
- scientific article; zbMATH DE number 862514 (Why is no real title available?)
- scientific article; zbMATH DE number 3230499 (Why is no real title available?)
- scientific article; zbMATH DE number 3110365 (Why is no real title available?)
- On the Parallel Evaluation of Polynomials
- Optimal algorithms for parallel polynomial evaluation
- Parallel evaluation of Chebyshev and trigonometric series
- Rounding error propagation in polynomial evaluation schemes
- Scaling for Numerical Stability in Gaussian Elimination
- Stability of a partitioning algorithm for bidiagonal systems
- Stability of Parallel Triangular System Solvers
- Stability aspects in using parallel algorithms
- Parallel evaluation of Chebyshev and trigonometric series
- Accurate evaluation of Chebyshev polynomials in floating-point arithmetic
- scientific article; zbMATH DE number 1617952 (Why is no real title available?)
- A Parallel Algorithm to Evaluate Chebyshev Series on a Message Passing Environment
- scientific article; zbMATH DE number 1950380 (Why is no real title available?)
- scientific article; zbMATH DE number 1512841 (Why is no real title available?)
- scientific article; zbMATH DE number 1543291 (Why is no real title available?)
- scientific article; zbMATH DE number 1547082 (Why is no real title available?)
- The three-term recursion for Chebyshev polynomials is mixed forward-backward stable
- Rounding error bounds for the Clenshaw and Forsythe algorithms for the evaluation of orthogonal polynomial series
- Stability of parallel algorithms for polynomial evaluation
This page was built for publication: Stability of parallel algorithms to evaluate Chebyshev series
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5948792)
