On the Numerical Properties of an Iterative Method for Computing the Moore–Penrose Generalized Inverse
- 1 March 1974
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Numerical Analysis
- Vol. 11 (1), 61-74
- https://doi.org/10.1137/0711008
Abstract
In this paper some of the numerical problems associated with computing the generalized inverse of a matrix are discussed and illustrated by a detailed analysis of an iteration of Ben-Israel and Cohen.Keywords
This publication has 8 references indexed in Scilit:
- A Hyperpower Iterative Method for Computing Matrix Products Involving the Generalized InverseSIAM Journal on Numerical Analysis, 1971
- Singular value decomposition and least squares solutionsNumerische Mathematik, 1970
- The least squares problem and pseudo-inversesThe Computer Journal, 1970
- Algorithm 358: singular value decomposition of a complex matrix [F1, 4, 5]Communications of the ACM, 1969
- Stability of general systems of linear equationsAequationes mathematicae, 1969
- On the Continuity of the Generalized InverseSIAM Journal on Applied Mathematics, 1969
- On Iterative Computation of Generalized Inverses and Associated ProjectionsSIAM Journal on Numerical Analysis, 1966
- Calculating the Singular Values and Pseudo-Inverse of a MatrixJournal of the Society for Industrial and Applied Mathematics Series B Numerical Analysis, 1965