Improved Qrginv algorithm for computing Moore-Penrose inverse matrices
From MaRDI portal
Publication:469946
DOI10.1155/2014/641706zbMATH Open1298.65067OpenAlexW2056711209WikidataQ59048756 ScholiaQ59048756MaRDI QIDQ469946FDOQ469946
Authors: Alireza Ataei 
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
Recommendations
Numerical solutions to overdetermined systems, pseudoinverses (65F20) Theory of matrix inversion and generalized inverses (15A09)
Cites Work
- Generalized inverses. Theory and applications.
- Title not available (Why is that?)
- Method of elementary transformation to compute Moore-Penrose inverse
- An improved method for the computation of the Moore-Penrose inverse matrix
- A new method for computing Moore-Penrose inverse matrices
- On the Moore-Penrose generalized inverse matrix
- Fast computing of the Moore-Penrose inverse matrix
- Generalized inverses and special type operator algebras
Cited In (9)
- 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
- A note of computation for M-P inverse \(A^{\dagger }\)
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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
Uses Software
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)
