Improved Qrginv algorithm for computing Moore-Penrose inverse matrices
From MaRDI portal
Recommendations
- 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
Cites work
- scientific article; zbMATH DE number 3648910 (Why is no real title available?)
- 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.
- Method of elementary transformation to compute Moore-Penrose inverse
- On the Moore-Penrose generalized inverse matrix
Cited in
(12)- A note on the usage of the \texttt{pinv} MATLAB function
- An improved method for the computation of the Moore-Penrose inverse matrix
- Numerical aspects of computing the Moore-Penrose inverse of full column rank matrices
- A new method for computing Moore-Penrose inverse matrices
- Fast multiple rank-constrained matrix approximation
- A note of computation for M-P inverse \(A^{\dagger }\)
- scientific article; zbMATH DE number 3510459 (Why is no real title available?)
- scientific article; zbMATH DE number 1389095 (Why is no real title available?)
- Matrix factorizations with prescribed ranges and null spaces
- A robust Moore-Penrose pseudoinverse-based static finite-element solver for simulating non-local fracture in solids
- Effective implementation to reduce execution time of a low-rank matrix approximation problem
- Fast computing of the Moore-Penrose inverse matrix
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)