Improved Qrginv algorithm for computing Moore-Penrose inverse matrices
From MaRDI portal
Publication:469946
DOI10.1155/2014/641706zbMath1298.65067OpenAlexW2056711209WikidataQ59048756 ScholiaQ59048756MaRDI QIDQ469946
Publication date: 11 November 2014
Published in: ISRN Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2014/641706
Numerical solutions to overdetermined systems, pseudoinverses (65F20) Theory of matrix inversion and generalized inverses (15A09)
Related Items
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
Uses Software
Cites Work
- An improved method for the computation of the Moore-Penrose inverse matrix
- Method of elementary transformation to compute Moore-Penrose inverse
- A new method for computing Moore-Penrose inverse matrices
- Generalized inverses. Theory and applications.
- On the Moore-Penrose generalized inverse matrix
- Fast computing of the Moore-Penrose inverse matrix
- Unnamed Item
- Unnamed Item
This page was built for publication: Improved Qrginv algorithm for computing Moore-Penrose inverse matrices