Rank structures preserved by the \(QR\)-algorithm: the singular case (Q818169): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: On the shifted QR iteration applied to companion matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structures preserved by the QR-algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structures preserved by matrix inversion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structures Preserved by Schur Complementation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Smooth Decompositions of Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rational Krylov matrices and <i>QR</i> steps on Hermitian diagonal‐plus‐semiseparable matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unitary Hessenberg \(QR\)-based algorithm via semiseparable matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: The QR algorithm for unitary Hessenberg matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: An implicit <i>QR</i> algorithm for symmetric semiseparable matrices / rank
 
Normal rank

Revision as of 11:29, 24 June 2024

scientific article
Language Label Description Also known as
English
Rank structures preserved by the \(QR\)-algorithm: the singular case
scientific article

    Statements

    Rank structures preserved by the \(QR\)-algorithm: the singular case (English)
    0 references
    0 references
    0 references
    24 March 2006
    0 references
    In a previous paper the authors have shown that when the matrix \(A\) is nonsingular, the QR iterates share the same rank structure, which is defined through its blocks by Rank \(A_{k}(i_{k}:n,1:j_{k})\leq r_{k}\) where \(A_{k}=A-\lambda _{k}I.\) In this paper, it is shown that even when \(A\) is singular, they can still construct QR iterates that preserve the rank structure.
    0 references
    0 references
    QR-algorithm
    0 references
    rank structure
    0 references
    Givens transformations
    0 references
    effectively eliminating QR-decompositions
    0 references
    sparse Givens patterns
    0 references

    Identifiers