Improved bound for rank revealing LU factorizations (Q1362659)

From MaRDI portal
Revision as of 18:01, 27 May 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    0 references
    0 references
    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
    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