Improved Qrginv algorithm for computing Moore-Penrose inverse matrices (Q469946)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Improved Qrginv algorithm for computing Moore-Penrose inverse matrices |
scientific article; zbMATH DE number 6368355
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Improved Qrginv algorithm for computing Moore-Penrose inverse matrices |
scientific article; zbMATH DE number 6368355 |
Statements
Improved Qrginv algorithm for computing Moore-Penrose inverse matrices (English)
0 references
11 November 2014
0 references
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.].
0 references