Parallel recursive algorithm for tridiagonal systems

In this paper a parallel algorithm for solving tridiagonal equations based on recurrence is presented. Compared with the parallel prefix method (PP) [3] which is also based on the recursive method, the computation cost is reduced by a factor of two while maintaining the same communication cost. The method can be viewed as a modified prefix method or prefix with substructuring. The complexity of the algorithm is analysed using the BSP model(Bulk Synchronous Parallel). Experimental results are obtained on a Sun workstation using the Oxford BSP Library.