Answers are grounded in this paper and cite their sources.
Apth order iterative method for computing A^ B is studied, where p 2, A and B are arbitrary complex matrices with equal number of rows and A^ 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.
No takes yet. Share an insight, caveat, or question.
Garnett et al. (1971) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: