Computing the outer and group inverses through elementary row operations
From MaRDI portal
Publication:2397293
DOI10.1016/J.CAMWA.2014.07.016zbMATH Open1362.65032OpenAlexW1968300345MaRDI QIDQ2397293FDOQ2397293
Publication date: 22 May 2017
Published in: Computers & Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.camwa.2014.07.016
Recommendations
- The representations and computations of generalized inverses \(A^{(1)}_{T,S}\), \(A^{(1,2)}_{T,S}\) and the group inverse
- An Efficient Factorization for the Group Inverse
- An efficient method for computing the outer inverse \(A_{T,S}^{(2)}\) through Gauss-Jordan elimination
- Successive matrix squaring algorithm for computing outer inverses
- scientific article
Direct numerical methods for linear systems and matrix inversion (65F05) Theory of matrix inversion and generalized inverses (15A09)
Cites Work
- Generalized inverses. Theory and applications.
- 2-inverses and their statistical application
- On moment-discretization and least-squares solutions of linear integral equations of the first kind
- Representation and approximation of the outer inverse \(A_{T,S}^{(2)}\) of a matrix \(A\)
- Full-rank representation of generalized inverse \(A_{T,S}^{(2)}\) and its application
- Successive matrix squaring algorithm for computing outer inverses
- A note on computing the generalized inverse \(A_{T,S}^{(2)}\) of a matrix \(A\)
- The representation and computation of generalized inverse \(A^{(2)}_{T,S}\)
- A new method for computing Moore-Penrose inverse through Gauss-Jordan elimination
- A note of computation for M-P inverseA†
- Title not available (Why is that?)
- Gauss-Jordan elimination methods for the Moore-Penrose inverse of a matrix
- Full-rank representations of outer inverses based on the QR decomposition
- Method of elementary transformation to compute Moore-Penrose inverse
- Convergence of Newton-like methods for singular operator equations using outer inverses
- Gauss-Jordan elimination method for computing outer inverses
- Computing generalized inverses of matrices by iterative methods based on splittings of matrices
- Successive matrix squaring algorithm for computing the generalized inverse \(A^{(2)}_{T, S}\)
- Title not available (Why is that?)
- Innovation based on Gaussian elimination to compute generalized inverse \(A_{T,S}^{(2)}\)
Cited In (8)
- An efficient method to compute different types of generalized inverses based on linear transformation
- Gauss-Jordan elimination method for computing all types of generalized inverses related to the {1}-inverse
- The representations and computations of generalized inverses \(A^{(1)}_{T,S}\), \(A^{(1,2)}_{T,S}\) and the group inverse
- 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
- An Efficient Factorization for the Group Inverse
- Two closed novel formulas for the generalized inverse \(A_{T,S}^{(2)}\) of a complex matrix with given rank
- Title not available (Why is that?)
This page was built for publication: Computing the outer and group inverses through elementary row operations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2397293)
