A divide-and-conquer approach for the computation of the Moore-Penrose inverses

DOI10.1016/j.amc.2020.125265OpenAlexW3016281326MaRDI QIDQ2180674

Xu-Zhou 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

zbMATH Keywords

parallel algorithmMoore-Penrose inversedivide-and-conquer

Mathematics Subject Classification ID

Theory of matrix inversion and generalized inverses (15A09) Direct numerical methods for linear systems and matrix inversion (65F05)

Cites Work

• A new method for computing Moore-Penrose inverse through Gauss-Jordan elimination
• Gauss-Jordan elimination methods for the Moore-Penrose inverse of a matrix
• Computing \(\{2,4\}\) and \(\{2,3\}\)-inverses by using the Sherman-Morrison formula
• Method of elementary transformation to compute Moore-Penrose inverse
• Execute elementary row and column operations on the partitioned matrix to compute M-P inverse \(A^!\)
• Computing the pseudoinverse of specific Toeplitz matrices using rank-one updates
• Relationships between generalized inverses of a matrix and generalized inverses of its rank-one-modifications
• A note of computation for M-P inverseA^†
• Inverse of a perturbed matrix
• The generalized inverses of perturbed matrices
• Some Applications of the Pseudoinverse of a Matrix
• Unnamed Item

This page was built for publication: A divide-and-conquer approach for the computation of the Moore-Penrose inverses