Gauss-Jordan elimination methods for the Moore-Penrose inverse of a matrix

DOI10.1016/J.LAA.2012.05.017zbMATH Open1255.65081OpenAlexW2053973332MaRDI QIDQ445846FDOQ445846

Jun Ji

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

Recommendations

• A new method for computing Moore-Penrose inverse through Gauss-Jordan elimination
• Gauss-Jordan elimination method for computing all types of generalized inverses related to the {1}-inverse
• Two inverse-of-\(N\)-free methods for \(A_{M,N}^\dagger\)
• A note of computation for M-P inverse \(A^{\dagger }\)
• An efficient method for computing the outer inverse \(A_{T,S}^{(2)}\) through Gauss-Jordan elimination

zbMATH Keywords

computational complexityalgorithmMoore-Penrose inverseGauss-Jordan elimination

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Generalized inverses. Theory and applications.
• The representation and computation of generalized inverse \(A^{(2)}_{T,S}\)
• Explicit expressions of the generalized inverses and condensed Cramer rules
• A note of computation for M-P inverseA^†
• Title not available (Why is that?)
• Bordered Matrices

Cited In (24)

• Method of solving a system of linear algebraic equations and its application
• Innovation based on Gaussian elimination to compute generalized inverse \(A_{T,S}^{(2)}\)
• Title not available (Why is that?)
• A new method for computing Moore-Penrose inverse through Gauss-Jordan elimination
• Using Gauss-Jordan elimination to compute the index, generalized nullspaces, and Drazin inverse
• An efficient method to compute different types of generalized inverses based on linear transformation
• Die exakte Berechnung der Moore-Penrose-Inversen einer Matrix durch Residuenarithmetik
• Gauss-Jordan elimination method for computing all types of generalized inverses related to the {1}-inverse
• Two inverse-of-\(N\)-free methods for \(A_{M,N}^\dagger\)
• Execute elementary row and column operations on the partitioned matrix to compute M-P inverse \(A^!\)
• The representations and computations of generalized inverses \(A^{(1)}_{T,S}\), \(A^{(1,2)}_{T,S}\) and the group inverse
• Computing the Moore–Penrose Inverse for the Covariance Matrix in Constrained Nonlinear Estimation
• Title not available (Why is that?)
• Title not available (Why is that?)
• An efficient method for computing the outer inverse \(A_{T,S}^{(2)}\) through Gauss-Jordan elimination
• Computation of weighted Moore-Penrose inverse through Gauss-Jordan elimination on bordered matrices
• On the backward stability of Gauss-Jordan elimination
• A divide-and-conquer approach for the computation of the Moore-Penrose inverses
• Theory of functional connections applied to quadratic and nonlinear programming under equality constraints
• Two closed novel formulas for the generalized inverse \(A_{T,S}^{(2)}\) of a complex matrix with given rank
• The Gauss‐Bordering Method for Generalized Inversion of Matrices
• The Core-EP, Weighted Core-EP Inverse of Matrices and Constrained Systems of Linear Equations
• Methods of Gauss–Jordan elimination to compute core inverse and dual core inverse
• Computing the outer and group inverses through elementary row operations

This page was built for publication: Gauss-Jordan elimination methods for the Moore-Penrose inverse of a matrix

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q445846)