Gauss-Jordan elimination methods for the Moore-Penrose inverse of a matrix (Q445846)
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: Gauss-Jordan elimination methods for the Moore-Penrose inverse of a matrix |
scientific article; zbMATH DE number 6072635
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Gauss-Jordan elimination methods for the Moore-Penrose inverse of a matrix |
scientific article; zbMATH DE number 6072635 |
Statements
Gauss-Jordan elimination methods for the Moore-Penrose inverse of a matrix (English)
0 references
27 August 2012
0 references
An algorithm for computing the Moore-Penrose inverse based on the reduced row echelon form (Gauss-Jordan elimination) is presented. Compared to one existing algorithm, the new variant (which does not require explicitly computing the normal equations matrix) is superior in terms of the complexity.
0 references
computational complexity
0 references
Gauss-Jordan elimination
0 references
Moore-Penrose inverse
0 references
algorithm
0 references
0.8692881464958191
0 references
0.8418601751327515
0 references
0.8380721211433411
0 references
0.8375051617622375
0 references
