Key points are not available for this paper at this time.
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 (² n) steps using a number of processors polynomial in n. (n is the order of the matrix of the problem. )
L. Csanky (Wed,) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: