Stability of parallel algorithms to evaluate Chebyshev series

DOI10.1016/S0898-1221(01)00102-XMaRDI QIDQ5948792zbMATH OpenOpenAlexFDO

Authors R. Barrio

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

zbMATH Keywords

error boundsnumerical examplesparallel algorithmstabilityChebyshev polynomialsparallel computationClenshaw algorithmpolynomial evaluationroundoff errorForsythe algorithm

Mathematics Subject Classification ID

Computation of special functions and constants, construction of tables (65D20) Numerical summation of series (65B10) Parallel numerical computation (65Y05) Roundoff error (65G50) Orthogonal polynomials and functions of hypergeometric type (Jacobi, Laguerre, Hermite, Askey scheme, etc.) (33C45) Numerical approximation and evaluation of special functions (33F05)

Recommendations

• 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

Cites work

• 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?)
• A Parallel Algorithm to Evaluate Chebyshev Series on a Message Passing Environment
• A Simple Parallel Algorithm for Polynomial Evaluation
• An Error Analysis of the Modified Clenshaw Method for Evaluating Chebyshev and Fourier Series
• An error analysis of Goertzel's (Watt's) method for computing Fourier coefficients
• Error Analysis for Polynomial Evaluation
• Error Control with Polynomial Approximations
• Error analysis of an algorithm for summing certain finite series
• Generalizations of Horner's Rule for Polynomial Evaluation
• Generation and Use of Orthogonal Polynomials for Data-Fitting with a Digital Computer
• 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 Parallel Triangular System Solvers
• Stability of a partitioning algorithm for bidiagonal systems

Cited in

(10)

• scientific article; zbMATH DE number 1547082 (Why is no real title available?)
• Stability of parallel algorithms for polynomial evaluation
• scientific article; zbMATH DE number 1617952 (Why is no real title available?)
• scientific article; zbMATH DE number 1512841 (Why is no real title available?)
• Accurate evaluation of Chebyshev polynomials in floating-point arithmetic
• scientific article; zbMATH DE number 1543291 (Why is no real title available?)
• The three-term recursion for Chebyshev polynomials is mixed forward-backward stable
• Stability aspects in using parallel algorithms
• Rounding error bounds for the Clenshaw and Forsythe algorithms for the evaluation of orthogonal polynomial series
• scientific article; zbMATH DE number 1950380 (Why is no real title available?)

Describes a project that uses

Uses Software

• mctoolbox

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)