Numerical algorithms for the Moore-Penrose inverse of a matrix: iterative methods
From MaRDI portal
Publication:1220782
DOI10.1007/BF02479787zbMath0314.65016OpenAlexW4246010261MaRDI QIDQ1220782
Kunio Tanabe, Nobuo Shinozaki, Masaaki Sibuya
Publication date: 1972
Published in: Annals of the Institute of Statistical Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02479787
Numerical solutions to overdetermined systems, pseudoinverses (65F20) Theory of matrix inversion and generalized inverses (15A09) Iterative numerical methods for linear systems (65F10)
Related Items
The hyperpower iteration revisited, Computational methods of linear algebra, Conjugate gradient method for computing the Moore-Penrose inverse and rank of a matrix, Application of constrained generalized inverse to pattern classification
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Numerical algorithms for the Moore-Penrose inverse of a matrix: direct methods
- On generalized inverses and on the uniform convergence of \((I-\beta K)_ n\) with application to iterative methods
- Projection method for solving a singular system of linear equations and its applications
- On Iterative Computation of Generalized Inverses and Associated Projections
- A Hyperpower Iterative Method for Computing Matrix Products Involving the Generalized Inverse