Data transport in Wang's partition method (Q1099581)

The partition method of \textit{H. H. Wang} [ACM Trans. Math. Software 7, 170-183 (1981; Zbl 0473.65010)] for the solution of tridiagonal linear systems is analysed 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 modification to a generalized version for banded systems. The parallel solution of a bidiagonal system is considered as a special case.