On the existence and computation of rank-revealing LU factorizations

Linear Algebra and Its Applications

Volumn 316, Issue 1-3, 2000, Pages 199-222

  Pan, C T ^a  

^a NORTHERN ILLINOIS UNIVERSITY   (United States)

Author keywords

Low rank matrix approximation; Rank estimation; Rank revealing LU factorization; Rank revealing QR factorization; Singular values

Indexed keywords

EID: 0034392123     PISSN: 00243795     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0024-3795(00)00120-8     Document Type: Article

References (20)

1. Ben-Israel A. A volume associated with. m×n matrices Linear Algebra Appl. 167:1992;87-111.
2. Bischof C.H., Quintana-Orti G. Codes for rank-revealing QR factorizations of dense matrice. ACM Trans. Mathematical Software. 24:1998;254-257.
3. C.H. Bischof, G. Quintana-Orti, Computing rank-revealing QR factorizations of dense matrice, ACM Trans. Mathematical Software 24 (1998) 226-253.
4. T.F. Chan, On the existence and computation of LU-factorizations with small pivots, Math. Comp. 42 (1984) 535- 547.
5. Chandrasekaran S., Ipsen I. On rank-revealing QR factorizations. SIAM J. Matrix Anal. Appl. 15:1994;592-622.
6. Cottle R.W. Manifestations of the Schur complement. Linear Algebra Appl. 8:1974;189-211.
7. J.W. Demmel, Applied Numerical Linear Algebra, SIAM, Philadelphia, PA, 1997.
8. G.H. Golub, V. Klema, G.W. Stewart, Rank degeneracy and least-squares problems, Technical Report TR-456, Department of Computer Science, University of Maryland, MD, USA, 1976.
9. G.H. Golub, C.F. VanLoan, Matrix Computations, second ed., Johns Hopkins University Press, Baltimore, MD, USA, 1989.
10. Goreinov S.A., Tyrtyshnikov E.E., Zamarashkin N.L. A theory of pseudoskeleton approximations. Linear Algebra Appl. 261:1997;1-22.
11. Gu M., Eisenstat S.C. An efficient algorithm for computing a strong rank-revealing QR factorization. SIAM J. Sci. Comput. 17:1996;848-869.
12. N.J. Higham, Analysis of the Cholesky decomposition of a semi-definite matrix, in: M.G. Cox, S.J. Hammarling (Eds.), Reliable Numerical Computation, Oxford University Press, Oxford, 1990, pp. 161-185.
13. Hong Y.P., Pan C.-T. Rank-revealing QR factorizations and the singular value decomposition. Math. Comp. 58:1992;213-232.
14. R.A. Horn, C.A. Johnson, Matrix Analysis, Cambridge University Press, New York, 1985.
15. Hwang T.-M., Lin W.-W., Pierce D. Improved bound for rank-revealing LU factorizations. Linear Algebra Appl. 261:1997;173-186.
16. Hwang T.-S., Lin W.-W., Yang E.K. Rank revealing LU factorizations. Linear Algebra Appl. 175:1992;115-141.
17. C.-T. Pan, P.T.P. Tang, Bounds on singular values revealed by QR factorizations, Technical Report MCS-P332-1092, Argonne National Laboratory, Mathematics and Computer Science Division, 1992.
18. C.-T. Pan, P.T.P. Tang, Bounds on singular values revealed by QR factorizations, BIT 39 (1999) 740-756.
19. Peters G., Wilkinson J.H. The least-squares problem and pseudo-inverses. Comput. J. 13:1970;309-316.
20. G.W. Stewart, Matrix Algorithms - vol. I. Basic Decompositions, SIAM, Philadelphia, PA, 1998.