Affiliation:
1. Stanford University, Department of Electrical Engineering and Computer Science, ERL 416, Stanford, California
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.
Publisher
Association for Computing Machinery (ACM)
Subject
Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software
Reference10 articles.
1. On Direct Methods for Solving Poisson’s Equations
2. EULER LEONHARD. Introduct~o ~n Analys~n infin~torum Lausanne 1748 Sec. 359. EULER LEONHARD. Introduct~o ~n Analys~n infin~torum Lausanne 1748 Sec. 359.
3. FORSYTHE G. E. AND MOLEa C. B. Computer Solution of Linear Algebraic Systems. Prentice-Hall Englewood Cliffs N. J. 1967. FORSYTHE G. E. AND MOLEa C. B. Computer Solution of Linear Algebraic Systems. Prentice-Hall Englewood Cliffs N. J. 1967.
4. Random Matrices in Physics
Cited by
215 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献