Stability of parallel algorithms for polynomial evaluation

  • Barrio R
  • Yalamov P
  • 2


    Mendeley users who have this article in their library.
  • 0


    Citations of this article.


In this paper, we analyse the stability of parallel algorithms for the evaluation of polynomials written as a finite series of orthogonal polynomials. The basic part of the computation is the solution of a triangular tridiagonal linear system. This fact allows us to present a more detailed analysis. The theoretical results show that the parallel algorithms are almost as stable as their sequential counterparts for practical applications. Extensive numerical experiments confirm the theoretical conclusions.

Author-supplied keywords

  • Numerical stability
  • Parallel algorithm
  • Polynomial evaluation

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document


Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free