Fast Parallel Matrix Inversion Algorithms
L. Csanky
Abstract
L. Csanky
Abstract
The parallel arithmetic complexities of matrix inversion, solving systems of linear equations, computing determinants and computing the characteristic polynomial of a matrix are shown to have the same growth rate. Algorithms are given that compute these problems in $O(\log ^2 n)$ steps using a number of processors polynomial in n. (n is the order of the matrix of the problem.)
OpenAlex reports 402 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
The parallel arithmetic complexities of matrix inversion, solving systems of linear equations, computing determinants and computing the characteristic polynomial of a matrix are shown to have the same growth rate. Algorithms are given that compute these problems in $O(\log ^2 n)$ steps using a number of processors polynomial in n. (n is the order of the matrix of the problem.)
Key concepts: Inversion (geology), Matrix polynomial, Polynomial matrix, Matrix (chemical analysis), Algorithm, Mathematics, Polynomial, Computer science