Affiliation:
1. Computer Techniques Laboratory, Stanford Research Institute, Menlo Park, California
Abstract
Two general methods of matrix inversion, Gauss's algorithm and the method of bordering, are analyzed from the viewpoint of their adaptability for parallel computation. The analysis is not based on any specific type of parallel processor; its purpose is rather to see if parallel capabilities could be used effectively in matrix inversion.
It is shown that both methods are indeed able to make effective use of parallel capability. With reasonable assumptions on the parallelism that is available, the speeds of the two methods are roughly comparable. The two methods, however, make use of different kinds of parallelism.
To implement Gauss's algorithm we would like to have (a) parallel transfer capability for
n
numbers, if the matrix is
n
X
n
, (b) the capability for parallel multiplication of the accessed numbers by a common multiplier, and (c) parallel additive read-in capability. For the method of bordering, we need, primarily, the capability of forming the Euclidean inner product of two
n
-dimensional real vectors. The latter seems somewhat harder to implement, but, because it is an operation that is fundamental to linear algebra in general, it is one that might be made available for other purposes. If so, then the method of bordering becomes of interest.
Publisher
Association for Computing Machinery (ACM)
Subject
Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software
Reference5 articles.
1. PEASE M. C Meshed of Matrix Algebra Academic Press New York 1965. (This is a good source for geerM matrix theory.) PEASE M. C Meshed of Matrix Algebra Academic Press New York 1965. (This is a good source for geerM matrix theory.)
2. GANTHAMACHER F. R. The Theory of Matrices (2 vols.). Chelsea New York 1960. (This is a good source for genera{ mrix theory ) GANTHAMACHER F. R. The Theory of Matrices (2 vols.). Chelsea New York 1960. (This is a good source for genera{ mrix theory )
3. CHANE B. A uo GITHENS J. A. Balk processing in distributed logic memory. IEEE Tras EC46 2 (April 1965) 186-I96. CHANE B. A uo GITHENS J. A. Balk processing in distributed logic memory. IEEE Tras EC46 2 (April 1965) 186-I96.
4. FADDERVA V. N Computational Methods of Linear Algebra. Dover New York 1959. FADDERVA V. N Computational Methods of Linear Algebra. Dover New York 1959.
Cited by
25 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Low-Latency Parallel Hermitian Positive-Definite Matrix Inversion for Massive MIMO;2021 IEEE Workshop on Signal Processing Systems (SiPS);2021-10
2. A Flexible Divide-and-Conquer MPSoC Architecture for MIMO Interference Cancellation;IEEE Transactions on Very Large Scale Integration (VLSI) Systems;2017-10
3. Locality-sensitive and Re-use Promoting Personalized PageRank computations;Knowledge and Information Systems;2015-06-18
4. The UNB-RISC16 Object File Format;2012 31st International Conference of the Chilean Computer Science Society;2012-11
5. Batch Mode Active Learning for Networked Data;ACM Transactions on Intelligent Systems and Technology;2012-02