An improved parallel algorithm for computing the generalized inverse \(A^ +\) (Q1197972)

The author improves a parallel algorithm for computing the generalized inverse \(A^ +\) of a matrix \(A\in \mathbb{R}^{n\times n}\). In fact, it is shown that the time complexity and the number of processors using the improved parallel algorithm are \(O(\log r\log n)\) and \(\max\{[m/n]n^ \alpha/\log n\), \(2r^{1/2} n^ \alpha /(\log r\log n)\}\), respectively. To illustrate the results, examples are given.