Stability of parallel algorithms for polynomial evaluation

Abstract

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.