A Parallel Method for Tridiagonal Equations

Abstract

A new (partition) method for solving a tndiagonal system of lmear equations is presented in this paper The method is suitable for both parallel and vector computers. Although the partition method has a shghtly higher vector operatmn count than those of the two competing methods (the recursive doubling method and the cychc reduction method), it has a scalar count much smaller than that of the recursive doubling. The scalar counts between the partition method and the cyclic reduction method are so close as to make a timing evaluation inconclusive without considering the data management problem, especmlly when large systems are solved. Various situations under which the partmon method can be preferable are described. © 1981, ACM. All rights reserved.