Improved bound for rank revealing LU factorizations (Q1362659)
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 bound for rank revealing LU factorizations |
scientific article; zbMATH DE number 1044252
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Improved bound for rank revealing LU factorizations |
scientific article; zbMATH DE number 1044252 |
Statements
Improved bound for rank revealing LU factorizations (English)
0 references
29 March 1998
0 references
Rank revealing (RR) factorizations normally produce two components -- the full rank portion and the redundant column (rank defficient) portion. The authors derive new tighter bounds for the two components of the RRLU factorization. Their result is based on the RRQR analysis published elsewhere. The new bounds for the RRLU factorization are proved and compared to earlier results.
0 references
rank of a matrix
0 references
rank revealing LU factorization
0 references
sparse matrices
0 references
rank deficient linear systems of equations
0 references
rank revealing QR factorization
0 references
0 references
0.9247824
0 references
0.9146213
0 references
0 references
0.8930162
0 references
0.8689264
0 references
0.86548364
0 references
0.86527693
0 references
0 references
