An improved method for the computation of the Moore-Penrose inverse matrix
Vasilios N. Katsikis, Dimitrios Pappas, Athanassios Petralias

TL;DR
This paper introduces a faster and more accurate computational method for calculating the Moore-Penrose inverse of both singular square and rectangular matrices, applicable to full and sparse matrices.
Contribution
The paper presents a novel computational technique that outperforms existing methods in speed and accuracy for Moore-Penrose inverse calculation.
Findings
Significantly faster computation times
Improved accuracy over previous methods
Effective for full and sparse matrices
Abstract
In this article we provide a fast computational method in order to calculate the Moore-Penrose inverse of singular square matrices and of rectangular matrices. The proposed method proves to be much faster and has significantly better accuracy than the already proposed methods, while works for full and sparse matrices.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMatrix Theory and Algorithms · Mathematics and Applications · Electromagnetic Scattering and Analysis
