Two inverse-of-\(N\)-free methods for \(A_{M,N}^\dagger\)

DOI10.1016/j.amc.2014.01.049zbMath1410.65116OpenAlexW1805512304MaRDI QIDQ1646069

Jun Ji

Publication date: 22 June 2018

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

Full work available at URL: https://doi.org/10.1016/j.amc.2014.01.049

zbMATH Keywords

weighted Moore-Penrose inverseMoore-Penrose inverseQR decompositionexplicit expressionGauss-Jordan elimination

Mathematics Subject Classification ID

Numerical solutions to overdetermined systems, pseudoinverses (65F20) Theory of matrix inversion and generalized inverses (15A09) Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items

Methods of Gauss–Jordan elimination to compute core inverse and dual core inverse ⋮ The Core-EP, Weighted Core-EP Inverse of Matrices and Constrained Systems of Linear Equations ⋮ Computation of weighted Moore-Penrose inverse through Gauss-Jordan elimination on bordered matrices ⋮ Two closed novel formulas for the generalized inverse \(A_{T,S}^{(2)}\) of a complex matrix with given rank

Uses Software

• mctoolbox

Cites Work

• Unnamed Item
• Unnamed Item
• Gauss-Jordan elimination methods for the Moore-Penrose inverse of a matrix
• Full-rank representations of outer inverses based on the QR decomposition
• An improved method for the computation of the Moore-Penrose inverse matrix
• Rehabilitation of the Gauss-Jordan algorithm
• Generalized inverses. Theory and applications.
• Gauss-Jordan elimination method for computing outer inverses
• The representation and computation of generalized inverse \(A^{(2)}_{T,S}\)
• Full-rank representation of generalized inverse \(A_{T,S}^{(2)}\) and its application
• Explicit expressions of the generalized inverses and condensed Cramer rules
• A note of computation for M-P inverseA^†
• On the stability of Gauss-Jordan elimination with pivoting