On Certain Parallel Toeplitz Linear System Solvers
Joseph F. Grcar, Ahmed Sameh · SIAM Journal on Scientific and Statistical Computing · 1981
In this paper we describe three algorithms for solving positive-definite banded Toeplitz systems of linear equations on parallel computers. Assuming we have $4mn$ processors, where n is the order of the system and m is the number of super- or subdiagonals, each system may be solved in $O(m\log n)$ time steps. Numerical experiments that compare the behavior of these algorithms in solving pentadiagonal Toeplitz systems are presented.