A block algorithm for computing rank-revealing QR factorizations
The authors present a block algorithm for computing rank-revealing \(QR\) factorizations of rank deficient matrices. The algorithm clearly identifies groups of small singular values. It is shown that the proposed algorithm produces the correct solution under very weak assumptions for the orthogonal factorization used for the nullspace matrix. Numerical experiments are given showing the reliability of the algorithms, which is particularly attractive for sparse matrices and high performance computer architectures.
scientific article; zbMATH DE number 95470
scientific article