Method of elementary transformation to compute Moore-Penrose inverse
From MaRDI portal
(Redirected from Publication:972937)
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
- scientific article; zbMATH DE number 3781344 (Why is no real title available?)
- scientific article; zbMATH DE number 3477343 (Why is no real title available?)
- scientific article; zbMATH DE number 3548285 (Why is no real title available?)
- scientific article; zbMATH DE number 3195823 (Why is no real title available?)
- A unified approach for the recursive determination of generalized inverses
- An alternative proof of the Greville formula
- Cochran's statistical theorem revisited
- Computing generalized inverses of matrices by iterative methods based on splittings of matrices
- Erratum: Generalized Inverse of a Matrix Product
- Further Results on Generalized Inverses of Partitioned Matrices
- General forms for the recursive determination of generalized inverses: Unified approach
- Interval iterative methods for computing Moore-Penrose inverse
- Iterative methods for computing generalized inverses and splittings of operators
- Some Applications of the Pseudoinverse of a Matrix
- Upper and lower bounds for ranks of matrix expressions using generalized inverses
Cited in
(18)- Computing the outer and group inverses through elementary row operations
- 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 novel iterative method for computing generalized inverse
- 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
- scientific article; zbMATH DE number 633404 (Why is no real title available?)
- 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
- 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
- A novel method for computing core-EP inverse through elementary transformation
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)
