@article{doi:10.1137/0205040,
    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.)},
    Author = {Csanky, L.},
    EPrint = {https://doi.org/10.1137/0205040},
    File = {Fast Parallel Matrix Inversion Algorithms - 0205040.pdf},
    Journal = {SIAM Journal on Computing},
    Number = {4},
    Pages = {618-623},
    Title = {Fast Parallel Matrix Inversion Algorithms},
    URL = {https://doi.org/10.1137/0205040},
    Volume = {5},
    Year = {1976},
    bdsk-url-1 = {https://doi.org/10.1137/0205040},
    date-added = {2022-10-22 08:16:51 +0200},
    date-modified = {2022-10-22 08:16:51 +0200},
    doi = {10.1137/0205040}
}

@article{doi:10.1137/0205040, 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.)}, Author = {Csanky, L.}, EPrint = {https://doi.org/10.1137/0205040}, File = {Fast Parallel Matrix Inversion Algorithms - 0205040.pdf}, Journal = {SIAM Journal on Computing}, Number = {4}, Pages = {618-623}, Title = {Fast Parallel Matrix Inversion Algorithms}, URL = {https://doi.org/10.1137/0205040}, Volume = {5}, Year = {1976}, bdsk-url-1 = {https://doi.org/10.1137/0205040}, date-added = {2022-10-22 08:16:51 +0200}, date-modified = {2022-10-22 08:16:51 +0200}, doi = {10.1137/0205040} }