Rank structures preserved by the \(QR\)-algorithm: the singular case (Q818169): Difference between revisions
From MaRDI portal
Normalize DOI. |
Normalize DOI. |
||
Property / DOI | |||
Property / DOI: 10.1016/J.CAM.2005.03.027 / rank | |||
Property / DOI | |||
Property / DOI: 10.1016/J.CAM.2005.03.027 / rank | |||
Normal rank |
Latest revision as of 04:04, 10 December 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
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
QR-algorithm
0 references
rank structure
0 references
Givens transformations
0 references
effectively eliminating QR-decompositions
0 references
sparse Givens patterns
0 references
0 references