A Hyperpower Iterative Method for Computing Matrix Products Involving the Generalized Inverse
James Mercer Garnett, Adi Ben-Israel, Stephen S. Yau · SIAM Journal on Numerical Analysis · 1971
Apth order iterative method for computing $A^\dag B$ is studied, where $p \geqq 2$, A and B are arbitrary complex matrices with equal number of rows and $A^\dag $ is the Moore–Penrose generalized inverse of A. The rate of convergence and the computational effort in the pth order method are studied, and the optimum p is given in terms of the numbers of columns of A and B.