DATA TRANSPORT IN WANG PARTITION METHOD

The partition method of H. H. Wang, for the solution of tridiagonal linear systems, is analyzed with regard to data transport between the processors of a parallel (local memory) computer. We propose a modification which reduces the amount of data transport considerably without affecting the computational complexity and which has about the same degree of parallelism as the original version. We will also discuss the effects of this modificaton to a generalized version for banded systems. The parallel solution of a bidiagonal system is considered as a special case.