Stability of parallel algorithms for polynomial evaluation

DOI10.1016/S0898-1221(03)90140-4zbMath1049.65016OpenAlexW2043079996MaRDI QIDQ597320

Sumit K. Garg

Publication date: 6 August 2004

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0898-1221(03)90140-4

zbMATH Keywords

numerical experimentsParallel algorithmNumerical stabilityPolynomial evaluation

Mathematics Subject Classification ID

Computation of special functions and constants, construction of tables (65D20) Parallel numerical computation (65Y05) Real polynomials: analytic properties, etc. (26C05)

Uses Software

• mctoolbox

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Stability of a partitioning algorithm for bidiagonal systems
• Parallel evaluation of Chebyshev and trigonometric series
• Generation and Use of Orthogonal Polynomials for Data-Fitting with a Digital Computer
• Scaling for Numerical Stability in Gaussian Elimination
• A Parallel Algorithm to Evaluate Chebyshev Series on a Message Passing Environment
• On the Sensitivity of Solution Components in Linear Systems of Equations
• Parallel Algorithms to Evaluate Orthogonal Polynomial Series
• Stability of Parallel Triangular System Solvers
• A Simple Parallel Algorithm for Polynomial Evaluation
• Generalizations of Horner's Rule for Polynomial Evaluation
• On the Parallel Evaluation of Polynomials
• Stability of parallel algorithms to evaluate Chebyshev series

This page was built for publication: Stability of parallel algorithms for polynomial evaluation