01320427

j

01320427 Bischof, Christian H. Quintana-Ort\'{\i}, Gregorio Algorithm 782: Codes for rank-revealing QR factorizations of dense matrices. ACM Trans. Math. Softw. 24, No.2, 254-257 (1998). 1998 Association for Computing Machinery, New York EN numerical rank rank-revealing QR factorizations dense matrices block algorithm pivoting strategy Zbl 0932.65033 Zbl 0142.11502 Zbl 0796.65030 Zbl 0826.65032

doi:10.1145/290200.287638

Summary: 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 [cf. the authors paper, ibid. 24, No. 2, 226-253 (1998; reviewed above)]. The main contribution is an efficient block algorithm for approximating an RRQR factorization, employing a windowed version of the commonly used pivoting strategy proposed by {\it G. Golub} [Numer. Math. 7, 206-216 (1965; Zbl 0142.11502)] and improved versions of the RRQR algorithms for triangular matrices originally suggested by {\it S. Chandrasekaran} and {\it I. C. F. Ipsen} [SIAM J. Matrix Anal. Appl. 15, No. 2, 592-622 (1994; Zbl 0796.65030)] and by {\it C.-T. Pan} and {\it P. T. P. Tang} [SVD and signal processing III, 157-165 (1995; Zbl 0826.65032)], respectively. We highlight usage and features of these codes.