Numerical aspects of computing the Moore-Penrose inverse of full column rank matrices (Q438724)
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: Numerical aspects of computing the Moore-Penrose inverse of full column rank matrices |
scientific article; zbMATH DE number 6062475
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Numerical aspects of computing the Moore-Penrose inverse of full column rank matrices |
scientific article; zbMATH DE number 6062475 |
Statements
Numerical aspects of computing the Moore-Penrose inverse of full column rank matrices (English)
0 references
31 July 2012
0 references
The authors present a comparison of certain direct algorithms for computing the Moore-Penrose inverse, for matrices of full column rank, from the point of view of numerical stability. Their theoretical analysis is combined with reliable numerical experiments on Pascal and random matrices.
0 references
Moore-Penrose inverse
0 references
numerical stability
0 references
condition number
0 references
singular value decomposition
0 references
algorithm
0 references
numerical experiments
0 references
random matrices
0 references
0 references
0 references
