Type: Article
Publication Date: 1973-01-01
Citations: 321
DOI: https://doi.org/10.1145/321738.321741
Tridiagonal linear systems of equations can be solved on conventional serial machines in a time proportional to N , where N is the number of equations. The conventional algorithms do not lend themselves directly to parallel computation on computers of the ILLIAC IV class, in the sense that they appear to be inherently serial. An efficient parallel algorithm is presented in which computation time grows as log 2 N . The algorithm is based on recursive doubling solutions of linear recurrence relations, and can be used to solve recurrence relations of all orders.