Gauss-Jordan elimination methods for the Moore-Penrose inverse of a matrix
From MaRDI portal
Publication:445846
DOI10.1016/j.laa.2012.05.017zbMath1255.65081OpenAlexW2053973332MaRDI QIDQ445846
Publication date: 27 August 2012
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2012.05.017
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
A new method for computing Moore-Penrose inverse through Gauss-Jordan elimination ⋮ Innovation based on Gaussian elimination to compute generalized inverse \(A_{T,S}^{(2)}\) ⋮ Two inverse-of-\(N\)-free methods for \(A_{M,N}^\dagger\) ⋮ Computing the outer and group inverses through elementary row operations ⋮ A divide-and-conquer approach for the computation of the Moore-Penrose inverses ⋮ 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 ⋮ An efficient method for computing the outer inverse \(A_{T,S}^{(2)}\) through Gauss-Jordan elimination ⋮ The representations and computations of generalized inverses \(A^{(1)}_{T,S}\), \(A^{(1,2)}_{T,S}\) and the group inverse ⋮ Execute elementary row and column operations on the partitioned matrix to compute M-P inverse \(A^!\) ⋮ An efficient method to compute different types of generalized inverses based on linear transformation ⋮ Two closed novel formulas for the generalized inverse \(A_{T,S}^{(2)}\) of a complex matrix with given rank ⋮ Theory of functional connections applied to quadratic and nonlinear programming under equality constraints ⋮ Gauss-Jordan elimination method for computing all types of generalized inverses related to the {1}-inverse
Cites Work
