Gauss-Jordan elimination methods for the Moore-Penrose inverse of a matrix
From MaRDI portal
(Redirected from Publication:445846)
An algorithm for computing the Moore-Penrose inverse based on the reduced row echelon form (Gauss-Jordan elimination) is presented. Compared to one existing algorithm, the new variant (which does not require explicitly computing the normal equations matrix) is superior in terms of the complexity.
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
Cites work
- A note of computation for M-P inverse \(A^{\dagger }\)
- Bordered Matrices
- Explicit expressions of the generalized inverses and condensed Cramer rules
- Generalized inverses. Theory and applications.
- scientific article; zbMATH DE number 3648910 (Why is no real title available?)
- scientific article; zbMATH DE number 3111121 (Why is no real title available?)
- The representation and computation of generalized inverse \(A^{(2)}_{T,S}\)
Cited in
(33)- A new method for computing Moore-Penrose inverse matrices
- On the backward stability of Gauss-Jordan elimination
- Concise row-pruning algorithm to invert a matrix
- Remarks on a formula for the pseudoinverse by the modified Huang algorithm
- Two inverse-of-\(N\)-free methods for \(A_{M,N}^\dagger\)
- 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 the Moore-Penrose inverse
- 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
- Theory of functional connections applied to quadratic and nonlinear programming under equality constraints
- A divide-and-conquer approach for the computation of the Moore-Penrose inverses
- An efficient method for computing the outer inverse \(A_{T,S}^{(2)}\) through Gauss-Jordan elimination
- Two closed novel formulas for the generalized inverse \(A_{T,S}^{(2)}\) of a complex matrix with given rank
- 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
- Computation of weighted Moore-Penrose inverse through Gauss-Jordan elimination on bordered matrices
- Innovation based on Gaussian elimination to compute generalized inverse \(A_{T,S}^{(2)}\)
- A new method for computing Moore-Penrose inverse through Gauss-Jordan elimination
- A note of computation for M-P inverse \(A^{\dagger }\)
- Die exakte Berechnung der Moore-Penrose-Inversen einer Matrix durch Residuenarithmetik
- Method of solving a system of linear algebraic equations and its application
- The Gauss‐Bordering Method for Generalized Inversion of Matrices
- scientific article; zbMATH DE number 727774 (Why is no real title available?)
- scientific article; zbMATH DE number 741202 (Why is no real title available?)
- Numerical aspects of computing the Moore-Penrose inverse of full column rank matrices
- Improved Qrginv algorithm for computing Moore-Penrose inverse matrices
- Computing the Moore–Penrose Inverse for the Covariance Matrix in Constrained Nonlinear Estimation
- scientific article; zbMATH DE number 1389095 (Why is no real title available?)
- Methods of Gauss-Jordan elimination to compute core inverse \(A^{\text{\textcircled{\#}}}\) and dual core inverse \(A_{\text{\textcircled{\#}}}\)
- The core-EP, weighted core-EP inverse of matrices and constrained systems of linear equations
- A novel method for computing core-EP inverse through elementary transformation
- Method of elementary transformation to compute Moore-Penrose inverse
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)
