Fast Parallel Matrix Inversion Algorithms
SIAM Journal on ComputingPublished 1 December 1976
L. Csanky
Citations398
SJR quartileQ1
SJR score1.40
SNIP1.55
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
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.)
Keywords
Computer Science
SIAM Journal on Numerical AnalysisA Determinant Theorem with Applications to Parallel Algorithms
22 Citations1974Don Heller
An expansion theorem for the determinant of any Hessenberg matrix is state and proved and the expansion is expressed as a vector-matrix-vector product which can be efficiently evaluated on a parallel machine.