A BLAS-3 version of the QR factorization with column pivoting

SIAM Journal on Scientific Computing

Volumn 19, Issue 5, 1998, Pages 1486-1494

  Quintana Ortí, Gregorio ^a,b   Sun, Xiaobai ^c,d   Bischof, Christian H ^e  

^a UNIVERSITAT JAUME I   (Spain)

^b DUKE UNIVERSITY   (United States)

^c Duke University   (United States)

^d University of Tennessee   (United States)

^e ARGONNE NATIONAL LABORATORY   (United States)

Author keywords

Block algorithm; Column pivoting; QR factorization; Rank revealing factorization

Indexed keywords

EID: 0000841184     PISSN: 10648275     EISSN: None     Source Type: Journal    
DOI: 10.1137/S1064827595296732     Document Type: Article

References (27)

1. E. ANDERSON, Z. BAI, C. BISCHOF, J. DEMMEL, J. DONGARRA, J. DUCROZ, A. GREENBAUM, S. HAMMARLING, A. MCKENNEY, S. OSTROUCHOV, AND D. SORENSEN, LAPACK User's Guide Release 2.0, SIAM, Philadelphia, 1994.
2. C. H. BISCHOF, A block QR factorization algorithm using restricted pivoting, in Proc. SUPER-COMPUTING '89, Baltimore, MD, ACM Press, New York, 1989, pp. 248-256.
3. C. H. BISCHOF, A parallel QR factorization algorithm with controlled local pivoting, SIAM J. Sci. Statist. Comput., 12 (1991), pp. 36-57.
4. C. H. BISCHOF AND P. C. HANSEN, Structure-preserving and rank-revealing QR factorizations, SIAM J. Sci. Statist. Comput., 12 (1991), pp. 1332-1350.
5. C. H. BISCHOF AND P. C. HANSEN, A block algorithm for computing rank-revealing QR factorizations, Numer. Algorithms, 2 (1992), pp. 371-392.
6. C. H. BISCHOF AND G. M. SHROFF, On updating signal subspaces, IEEE Trans. Signal Processing, 40 (1992), pp. 96-105.
7. T. F. CHAN, Rank revealing QR factorizations, Linear Algebra Appl., 88/89 (1987), pp. 67-82.
8. S. GHANDRASEKARAN AND I. C. F. IPSEN, On rank-revealing QR factorizations, SIAM J. Matrix Anal. Appl., 15 (1994), pp. 592-622.
9. J. DONGARRA, J. D. CROZ, I. DUFF, AND S. HAMMARLING, A set of Level 3 Basic Linear Algebra Subprograms, ACM Trans. Math. Software, 16 (1990), pp. 1-17.
10. J. J. DONGARRA, J. R. BUNCH, C. B. MOLER, AND G. W. STEWART, LINPACK Users' Guide, SIAM, Philadelphia, 1979.
11. J. J. DONGARRA, J. D. CROZ, S. HAMMARLING, AND R. J. HANSON, An extended set of Fortran basic linear algebra subprograms, ACM Trans. Math. Software, 14 (1988), pp. 1-17.
12. L. ELDÉN AND R. SCHREIBER, An application of systolic arrays to linear discrete ill-posed problems, SIAM J. Sci. Statist. Comput., 7 (1986), pp. 892-903.
13. G. H. GOLUB, Numerical methods for solving linear least squares problems, Numer. Math., 7 (1965), pp. 206-216.
14. G. H. GOLUB AND C. F. V. LOAN, Matrix Computations, 2nd ed., The Johns Hopkins University Press, Baltimore, MD, 1989.
15. G. H. GOLUB, P. MANNEBACK, AND P. L. TOINT, A comparison between some direct and iterative methods for certain large scale geodetic least-squares problem, SIAM J. Sci. Statist. Comput., 7 (1986), pp. 799-816.
16. 1 piecewise polynomial interpolants, Computer Aided Geometric Design, 4 (1987), pp. 307-319.
17. T. A. GRANDINE, Rank Deficient Interpolation and Optimal Design: An Example, Tech. Report SCA-TR-113, Engineering and Scientific Services Division, Boeing Computer Services, Seattle, WA, February 1989.
18. M. GU AND S. EISENSTAT, An Efficient Algorithm for Computing a Strong Rank-Revealing Factorization, Tech. Report YALEU/DCS/RR-967, Department of Computer Science, Yale University, New Haven, CT, 1994.
19. P. C. HANSEN, Truncated SVD solutions to discrete ill-posed problems with ill-determined numerical rank, SIAM J. Matrix Anal. Appl., 11 (1990), pp. 503-518.
20. Y. P. HONG AND C.-T. PAN, The rank revealing QR decomposition and SVD, Math. Comp., 58 (1992), pp. 213-232.
21. H. HOTELLING, The relations of the newer multivariate statistical methods to factor analysis, British J. Stat. Psych., 10 (1957), pp. 69-79.
22. S. F. HSIEH, K. J. R. LIU, AND K. YAO, Comparisons of truncated QR and SVD methods for AR spectral estimations, in SVD and Signal Processing II, R. J. Vaccaro, ed., Elsevier Science Publishers, New York, 1991, pp. 403-418.
23. C. L. LAWSON, R. J. HANSON, R. J. KINCAID, AND F. T. KROGH, Basic linear algebra subprograms for Fortran usage, ACM Trans. Math. Software, 5 (1979), pp. 308-323.
24. J. MORÉ, The Levenberg-Marquardt algorithm: Implementation and theory, in Proc. Dundee Conference on Numerical Analysis, G. A. Watson, ed., Springer-Verlag, Berlin, 1978.
25. C.-T. PAN AND P. T. P. TANG, Bounds on Singular Values Revealed by QR Factorization, Tech. Report MCS-P332-1092, Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, IL, 1992.
26. D. PIERCE AND J. G. LEWIS, Sparse Rank Revealing QR Factorization, Tech. Report MEATR-193, Engineering and Scientific Services Division, Boeing Computer Services, Seattle, WA, 1992.
27. R. SCHREIBER AND C. VAN LOAN, A storage efficient WY representation for products of House-holder transformations, SIAM J. Sci. Statist. Comput., 10 (1989), pp. 53-57.