On the accuracy of solving triangular systems in parallel-III

Abstract

In this paper we present a component-wise error analysis of two different algorithms - one sequential and the other parallel - for solving triangular systems. The results show that each of the computed components of the solution vector using the parallel algorithm is an extended sum of slightly perturbed exact terms whose relative error bounds are comparable to those generated by the usual sequential algorithm. Hence in a backward sense the parallel algorithms are equivalent to the usual sequential algorithm.