Improved bound for rank revealing LU factorizations (Q1362659): Difference between revisions
From MaRDI portal
Removed claims |
Changed an Item |
||
| Property / author | |||
| Property / author: Daniel J. Pierce / rank | |||
Normal rank | |||
| Property / reviewed by | |||
| Property / reviewed by: Nikolai L. Vulchanov / rank | |||
Normal rank | |||
Revision as of 20:46, 19 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Improved bound for rank revealing LU factorizations |
scientific article |
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
