Method of elementary transformation to compute Moore-Penrose inverse
From MaRDI portal
Publication:972937
DOI10.1016/J.AMC.2010.03.016zbMATH Open1200.65027OpenAlexW1992529167MaRDI QIDQ972937FDOQ972937
Publication date: 21 May 2010
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2010.03.016
Recommendations
- A new method for computing Moore-Penrose inverse through Gauss-Jordan elimination
- On the Moore-Penrose generalized inverse matrix
- scientific article; zbMATH DE number 633404
- An improved method for the computation of the Moore-Penrose inverse matrix
- Gauss-Jordan elimination methods for the Moore-Penrose inverse of a matrix
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Further Results on Generalized Inverses of Partitioned Matrices
- Upper and lower bounds for ranks of matrix expressions using generalized inverses
- Interval iterative methods for computing Moore-Penrose inverse
- Computing generalized inverses of matrices by iterative methods based on splittings of matrices
- Some Applications of the Pseudoinverse of a Matrix
- Iterative methods for computing generalized inverses and splittings of operators
- Cochran's statistical theorem revisited
- Title not available (Why is that?)
- An alternative proof of the Greville formula
- A unified approach for the recursive determination of generalized inverses
- Title not available (Why is that?)
- General forms for the recursive determination of generalized inverses: Unified approach
- Erratum: Generalized Inverse of a Matrix Product
Cited In (17)
- One-sided weighted outer inverses of tensors
- An improved method for the computation of the Moore-Penrose inverse matrix
- Exact solutions and convergence of gradient based dynamical systems for computing outer inverses
- Discrete-time noise-tolerant Zhang neural network for dynamic matrix pseudoinversion
- A new method for computing Moore-Penrose inverse through Gauss-Jordan elimination
- 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
- Execute elementary row and column operations on the partitioned matrix to compute M-P inverse \(A^!\)
- Improved Qrginv algorithm for computing Moore-Penrose inverse matrices
- Title not available (Why is that?)
- A divide-and-conquer approach for the computation of the Moore-Penrose inverses
- Composite outer inverses for rectangular matrices
- A parallel computing method based on zeroing neural networks for time-varying complex-valued matrix Moore-Penrose inversion
- A Novel Iterative Method for Computing Generalized Inverse
- Two closed novel formulas for the generalized inverse \(A_{T,S}^{(2)}\) of a complex matrix with given rank
- Neural network for computing pseudoinverses and outer inverses of complex-valued matrices
- Computing the outer and group inverses through elementary row operations
This page was built for publication: Method of elementary transformation to compute Moore-Penrose inverse
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q972937)
