An Efficient Parallel Algorithm for the Solution of a Tridiagonal Linear System of Equations
- 1 January 1973
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 20 (1) , 27-38
- https://doi.org/10.1145/321738.321741
Abstract
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.Keywords
This publication has 3 references indexed in Scilit:
- On Direct Methods for Solving Poisson’s EquationsSIAM Journal on Numerical Analysis, 1970
- Random Matrices in PhysicsSIAM Review, 1967
- XLV. On a fundamental rule in the algorithm of continued fractionsJournal of Computers in Education, 1853