This article describes a suite of codes as well as associated testing and timing drivers for computing rank-revealing QR (RRQR) factorizations of dense matrices. The main contribution is an efficient block algorithm for approximating an RRQR factorization, employing a windowed version of the commonly used Golub pivoting strategy and improved versions of the RRQR algorithms for triangular matrices orginally suggersted by Chandrasekaran and Ipsen and by Pan and Tang, respectively, We highlight usage and features of these codes.
No takes yet. Share an insight, caveat, or question.
Bischof et al. (1998) studied this question.
Synapse has enriched 2 closely related papers on similar clinical questions. Consider them for comparative context: