AN EFFECTIVE PARALLEL ALGORITHM FOR TRIDIAGONAL LINEAR EQUATIONS
Chi Li · Chinese Journal of Computers · 1999
This paper gives a parallel algorithm,PPD algorithm, for the solution of diagonally dominant tridiagonal linear systems. Its computation complexity is about as same as the best sequential algorithm and its communication complexity is a constant. But now the computation and communication complexity of the best parallel algorithm are about 17 n and log P . It implements PPD algorithm on a MPP supercomputer. The results show that speedup improves linearly and the efficiency of our method is up to 90%.