Summary
The iterative methods by Ben-Israel and others for computing the Moore-Penrose inverse of a matrix are examined. Ill conditioned test matrices are inverted by the methods and some difficulties are found out. The iterative methods do not seem superior to direct ones.
Similar content being viewed by others
References
Ben-Israel, A and Cohen, D. (1966). On iterative computation of generalized inverses and associated projections,SIAM Jour. Numer. Anal.,3, 410–419.
Boullion, T. L. and Odell, P. L. (1971).Generalized Inverse Matrices, Wiley-Interscience, New York.
Garnett, J. M., III, Ben-Israel, A. and Yau, S. S. (1971). A hyperpower iterative method for computing matrix products involving the generalized inverse,SIAM Jour. Numer. Anal.,8, 104–109.
Petryshyn, W. V. (1967). On generalized inverses and on the uniform convergence of (1−βK)n with application to, iterative methods,Jour. Math. Anal. Appl.,18, 417–439.
Pringle, R. M. and Rayner, A. A. (1972).Generalized Inverse Matrices with Applications to Statistics, Charles Griffin, London.
Rao, C. R. and Mitra, S. K. (1971)Generalized Inverse Matrices and Its Applications, Wiley, New York.
Shinozaki, N., Sibuya, M. and Tanabe, K. (1972). Numerical algorithms for the Moore-Penrose inverse of a matrix: Direct methods,Ann. Inst. Statist. Math.,24, 193–203.
Tanabe, K. (1971). An adaptive acceleration of general linear iterative processes for solving systems of linear equations,Res. Memo. Inst. Statist. Math., No. 43.
Zlobec, S. (1967). On computing the generalized inverse of a linear operator,Glasnik Matematicki,2(22), 265–271.
Author information
Authors and Affiliations
About this article
Cite this article
Shinozaki, N., Sibuya, M. & Tanabe, K. Numerical algorithms for the moore-penrose inverse of a matrix: Iterative methods. Ann Inst Stat Math 24, 621–629 (1972). https://doi.org/10.1007/BF02479787
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02479787