Improved Qrginv algorithm for computing Moore-Penrose inverse matrices
Summary: \textit{V. N. Katsikis} et al. [Appl. Math. Comput. 217, No. 23, 9828--9834 (2011; Zbl 1220.65049)] presented a computational method in order to calculate the Moore-Penrose inverse of an arbitrary matrix (including singular and rectangular). In this paper, an improved version of this method is presented for computing the pseudo inverse of an \(m\times n\) real matrix \(A\) with rank \(r>0\). Numerical experiments show that the resulting pseudoinverse matrix is reasonably accurate and its computation time is significantly less than that obtained in [loc. cit.].
- An improved method for the computation of the Moore-Penrose inverse matrix
- A new method for computing Moore-Penrose inverse matrices
- scientific article; zbMATH DE number 1389095
- Gauss-Jordan elimination methods for the Moore-Penrose inverse of a matrix
- Fast computing of the Moore-Penrose inverse matrix
- A new method for computing Moore-Penrose inverse matrices
- An improved method for the computation of the Moore-Penrose inverse matrix
- Fast computing of the Moore-Penrose inverse matrix
- Generalized inverses and special type operator algebras
- Generalized inverses. Theory and applications.
- scientific article; zbMATH DE number 3648910 (Why is no real title available?)
- Method of elementary transformation to compute Moore-Penrose inverse
- On the Moore-Penrose generalized inverse matrix
- A new method for computing Moore-Penrose inverse matrices
- Effective implementation to reduce execution time of a low-rank matrix approximation problem
- A robust Moore-Penrose pseudoinverse-based static finite-element solver for simulating non-local fracture in solids
- A note of computation for M-P inverse \(A^{\dagger }\)
- Fast computing of the Moore-Penrose inverse matrix
- scientific article; zbMATH DE number 3510459 (Why is no real title available?)
- Numerical aspects of computing the Moore-Penrose inverse of full column rank matrices
- scientific article; zbMATH DE number 1389095 (Why is no real title available?)
- An improved method for the computation of the Moore-Penrose inverse matrix
- A note on the usage of the \texttt{pinv} MATLAB function
- Matrix factorizations with prescribed ranges and null spaces
- Fast multiple rank-constrained matrix approximation
This page was built for publication: Improved Qrginv algorithm for computing Moore-Penrose inverse matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q469946)
