On the accuracy of solving triangular systems in parallel

Abstract

An error complexity analysis of two algorithms for solving a unit-diagonal triangular system is given. The results show that the unusual sequential algorithm is optimal in terms of having the minimal maximum and cumulative error complexity measures. The parallel algorithm described by Sameh and Brent is shown to be essentially equivalent to the optimal sequential one. Some numerical experiments are also taught.