Stability of parallel algorithms for polynomial evaluation

Citations of this article
Mendeley users who have this article in their library.
Get full text


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.




Barrio, R., & Yalamov, P. (2003). Stability of parallel algorithms for polynomial evaluation. Computers and Mathematics with Applications, 46(5–6), 769–781.

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free