Method of elementary transformation to compute Moore-Penrose inverse
From MaRDI portal
Publication:972937
DOI10.1016/j.amc.2010.03.016zbMath1200.65027MaRDI QIDQ972937
Publication date: 21 May 2010
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2010.03.016
65F20: Numerical solutions to overdetermined systems, pseudoinverses
Related Items
A new method for computing Moore-Penrose inverse through Gauss-Jordan elimination, Improved Qrginv algorithm for computing Moore-Penrose inverse matrices, An improved method for the computation of the Moore-Penrose inverse matrix, Gauss-Jordan elimination method for computing all types of generalized inverses related to the {1}-inverse, Computing the outer and group inverses through elementary row operations
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Interval iterative methods for computing Moore-Penrose inverse
- Iterative methods for computing generalized inverses and splittings of operators
- General forms for the recursive determination of generalized inverses: Unified approach
- An alternative proof of the Greville formula
- Computing generalized inverses of matrices by iterative methods based on splittings of matrices
- Upper and lower bounds for ranks of matrix expressions using generalized inverses
- A unified approach for the recursive determination of generalized inverses
- Cochran's statistical theorem revisited
- Further Results on Generalized Inverses of Partitioned Matrices
- Erratum: Generalized Inverse of a Matrix Product
- Some Applications of the Pseudoinverse of a Matrix
