@Article{JCM-6-4,
author = {Wang, Guo-Rong and Sen-Quan, Lu},
title = {Fast Parallel Algorithms for Computing Generalized Inverses $A^+$ and $A_{MN}^+$},
journal = {Journal of Computational Mathematics},
year = {1988},
volume = {6},
number = {4},
pages = {348--354},
abstract = {<p style="text-align: justify;">The parallel arithmetic complexities for computing generalized inverse $A^+$, computing the minimum-norm least-squares solution of $Ax=b$, computing order $m+n-r$ determinants and finding the characteristic polynomials of order $m+n-r$ matrices are shown to have the same grawth rate. Algorithms are given that compute $A^+$ and $A_{MN}^+$ in $O(\log r\dot \log n+\log m)$ and $O(\log^2n+\log m)$ steps using a number of processors which is a polynomial in $m, \ n$ and $r$ $(A\in B_r^{m\times n},r=rank \ A)$.</p>},
issn = {1991-7139},
doi = {https://doi.org/1988-JCM-9523},
url = {https://global-sci.com/article/86159/fast-parallel-algorithms-for-computing-generalized-inverses-a-and-a-mn}
}