Improved Qrginv algorithm for computing Moore-Penrose inverse matrices (Q469946): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (6 intermediate revisions by 6 users not shown) | |||
| Property / review text | |||
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.]. | |||
| Property / review text: 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.]. / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 65F20 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 15A09 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6368355 / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q59048756 / rank | |||
Normal rank | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: mctoolbox / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1155/2014/641706 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2056711209 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3207128 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Generalized inverses. Theory and applications. / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the Moore-Penrose generalized inverse matrix / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Method of elementary transformation to compute Moore-Penrose inverse / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5299431 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Fast computing of the Moore-Penrose inverse matrix / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A new method for computing Moore-Penrose inverse matrices / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An improved method for the computation of the Moore-Penrose inverse matrix / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 06:21, 9 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Improved Qrginv algorithm for computing Moore-Penrose inverse matrices |
scientific article |
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
