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 ² n) steps using a number of processors polynomial in n. (n is the order of the matrix of the problem.)
No takes yet. Share an insight, caveat, or question.
L. Csanky (1976) studied this question.