A divide-and-conquer approach for the computation of the Moore-Penrose inverses
From MaRDI portal
Publication:2180674
DOI10.1016/J.AMC.2020.125265OpenAlexW3016281326MaRDI QIDQ2180674FDOQ2180674
Authors: Xuzhou Chen, Jun Ji 
Publication date: 14 May 2020
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2020.125265
Recommendations
- scientific article; zbMATH DE number 4176353
- An efficient quadratically convergent iterative method to find the Moore-Penrose inverse
- A new method for computing Moore-Penrose inverse matrices
- Computing Moore–Penrose Inverses with Polynomials in Matrices
- An improved method for the computation of the Moore-Penrose inverse matrix
Direct numerical methods for linear systems and matrix inversion (65F05) Theory of matrix inversion and generalized inverses (15A09)
Cites Work
- Execute elementary row and column operations on the partitioned matrix to compute M-P inverse \(A^!\)
- A new method for computing Moore-Penrose inverse through Gauss-Jordan elimination
- A note of computation for M-P inverse \(A^{\dagger }\)
- Title not available (Why is that?)
- Gauss-Jordan elimination methods for the Moore-Penrose inverse of a matrix
- Method of elementary transformation to compute Moore-Penrose inverse
- Some Applications of the Pseudoinverse of a Matrix
- The generalized inverses of perturbed matrices
- Relationships between generalized inverses of a matrix and generalized inverses of its rank-one-modifications
- Computing \(\{2,4\}\) and \(\{2,3\}\)-inverses by using the Sherman-Morrison formula
- Computing the pseudoinverse of specific Toeplitz matrices using rank-one updates
- Inverse of a perturbed matrix
Cited In (1)
This page was built for publication: A divide-and-conquer approach for the computation of the Moore-Penrose inverses
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2180674)
