Improved bound for rank revealing LU factorizations (Q1362659): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 2 users not shown)
Property / author
 
Property / author: Daniel J. Pierce / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Nikolai L. Vulchanov / rank
Normal rank
 
Property / author
 
Property / author: Daniel J. Pierce / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Nikolai L. Vulchanov / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rank Detection Methods for Sparse Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structure-Preserving and Rank-Revealing QR-Factorizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Existence and Computation of LU-Factorizations with Small Pivots / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rang revealing QR factorizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Applications of the Rank Revealing QR Factorization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Rank-Revealing Factorisations / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Probability of Large Diagonal Elements in the $QR$ Factorization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numerical methods for solving linear least squares problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3359644 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rank-Revealing QR Factorizations and the Singular Value Decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rank revealing \(LU\) factorizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Bordering Algorithm and Path Following Near Singular Points of Higher Nullity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse Multifrontal Rank Revealing <i>QR</i> Factorization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Error Analysis of Direct Methods of Matrix Inversion / rank
 
Normal rank

Latest revision as of 17:01, 27 May 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
    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
    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

    Identifiers