Gauss-Jordan elimination method for computing all types of generalized inverses related to the {1}-inverse

DOI10.1016/j.cam.2017.02.010zbMath1366.65052OpenAlexW2589392445MaRDI QIDQ2357418

Jie Ma, Yongshu Li

Publication date: 13 June 2017

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cam.2017.02.010

zbMATH Keywords

computational complexitygeneralized inversenumerical experimentMoore-Penrose inverseGauss-Jordan elimination

Mathematics Subject Classification ID

Numerical solutions to overdetermined systems, pseudoinverses (65F20) Complexity and performance of numerical algorithms (65Y20) Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items

Performance and stability of direct methods for computing generalized inverses of the graph Laplacian ⋮ An efficient method to compute different types of generalized inverses based on linear transformation

Cites Work

• Unnamed Item
• A new method for computing Moore-Penrose inverse through Gauss-Jordan elimination
• Gauss-Jordan elimination methods for the Moore-Penrose inverse of a matrix
• Method of elementary transformation to compute Moore-Penrose inverse
• Execute elementary row and column operations on the partitioned matrix to compute M-P inverse \(A^!\)
• Generalized inverses. Theory and applications.
• Incremental numerical recipes for the high efficient inversion of the confluent Vandermonde matrices
• Gauss-Jordan elimination method for computing outer inverses
• Computing the outer and group inverses through elementary row operations
• Rank-profile revealing Gaussian elimination and the CUP matrix decomposition
• The representation and computation of generalized inverse \(A^{(2)}_{T,S}\)
• Innovation based on Gaussian elimination to compute generalized inverse \(A_{T,S}^{(2)}\)
• A note of computation for M-P inverseA^†