Rank structures preserved by the QR-algorithm: The singular case

Citations of this article
Mendeley users who have this article in their library.


In an earlier paper we introduced the classes of polynomial and rank structures, both of them preserved by applying a (shifted) QR-step on a matrix A. In the present paper we further investigate the case of rank structures. We show that even if A is a singular matrix, a new QR-iterate can be constructed having the same rank structure as the matrix A itself. To this end we introduce the concepts of effectively eliminating QR-decompositions and sparse Givens patterns, both of them being of independent interest. © 2005 Elsevier B.V. All rights reserved.




Delvaux, S., & Van Barel, M. (2006). Rank structures preserved by the QR-algorithm: The singular case. In Journal of Computational and Applied Mathematics (Vol. 189, pp. 157–178). https://doi.org/10.1016/j.cam.2005.03.027

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free