Parallel codes for computing the numerical rank

Linear Algebra and Its Applications

Volumn 275-276, Issue , 1998, Pages 451-470

  Quintana Ortí, Gregorio ^a   Quintana Ortí, Enrique S ^a  

^a UNIVERSITAT JAUME I   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0032392256     PISSN: 00243795     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0024-3795(97)10032-5     Document Type: Article

References (26)

1. E. Anderson, Z. Bai, C.H. Bischof, J. Demmel, J. Dongarra, J. DuCroz, A. Greenbaum, S. Hamnmarling, A. McKenney, S. Ostrouchov, 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: Proceedings SUPERCOMPUTING '89, Baltimore, ACM. New York, 1989, pp. 248-256.
3. C.H. Bischof, M. Shroff, On updating signal subspaces, IEEE Trans, on Signal Processing 40 (1992) 96-105.
4. C.H. Bischof, G. Quintana-Ortí, Computing rank-revealing QR factorizations of dense matrices, Argonne Preprint MCS-P559-0196, Mathematics and Computer Science Division, Argonne National Laboratory, 1996. To appear in ACM Trans math. Softw. 1998.
5. C.H. Bischof, Codes for rank-revealing QR factorizations of dense matrices, Argonne Preprint MCS-P560-0196, Mathematics and Computer Science Division, Argonne National Laboratory, 1996.
6. T.F. Chan, An improved algorithm for computing the SVD, ACM Trans. on Math. Soft. 8 (1982) 72-83.
7. S. Chandrasekaran, I. Ipsen, On rank-revealing QR factorizations, SIAM J. on Matrix Analysis and Applications 15 (1994) 592-622.
8. J. Demmel, W. Kahan, Computing small singular values of bidiagonal matrices with guaranteed high relative accuracy, SIAM J. on Scientific and Statistical Computing 11 (1990) 873-912.
9. J.J. Dongarra, J.R. Bunch, C.B. Moler, G.W. Stewart, LINPACK Users' Guide, SIAM. Philadelphia, 1979.
10. L. Eldén, R. Schreiber, An application of systolic arrays to linear discrete ill-posed problems, SIAM J. on Scientific and Statistical Computing 7 (1986) 892-903.
11. G.H. Golub, Numerical methods for solving linear least squares problems. Numerische Mathematik 7 (1965) 206-216.
12. G.H. Golub, W. Kahan, Calculating the singular values and pseudo-inverse of a matrix. SIAM J. on Numerical Analysis 2 (1965) 205-224.
13. G.H. Golub, V. Klema, G.W. Stewart, Rank degeneracy and least squares problems, Technical Report TR-456. University of Maryland, Dept. of Computer Science. 1976.
14. G.H. Golub, P. Manneback, P.L. Toint, A comparison between some direct and iterative methods for certain large scale geodetic least-squares problem, SIAM J. on Scientific and Statistical Computing 7 (1986) 799-816.
15. G.H. Golub, C.F. Van Loan, Matrix Computations, 2nd ed., Johns Hopkins University Press, Baltimore, MD, 1989.
16. 1 piecewise polynomial interpolants, Computer Aided Geometric Design 4 (1987) 307-319.
17. T.A. Grandine, Rank deficient interpolation and optimal design: An example, Technical Report SCA-TR 113, Boeing Computer Services, Engineering and Scientific Services Division, 1989.
18. P.C. Hansen, S. Takishi, S. Hiromoto, The modified truncated SVD-method for regularization in general form, SIAM J. on Scientific and Statistical Computing 13 (1991) 1142-1150.
19. N.J. Higham, A survey of condition number estimation of triangular matrices, SIAM Review 29 (1987) 575-596.
20. S.F. Hsieh, J.R. Liu, K. Yao, Comparisons of Truncated QR and SVD methods for AR spectral estimations, in: Proceedings SVD and Signal Processing II, Elsevier, Amsterdam. 1991, pp. 403-418.
21. J. Moré, The Levenberg-Marquardt algorithm: Implementation and theory, in: G.A. Watson (Ed.), Proceedings of the Dundee Conference on Numerical Analysis, Springer, Berlin, 1978.
22. C.-T. Pan, P.T.P. Tang, Bounds on singular values revealed by QR factorization. Argonne Preprint MCS-P332-1092, Mathematics and Computer Science Division, Argonne National Laboratory, 1992.
23. G. Quintana-Ortí, X. Sun, C.H. Bischof, A BLAS-3 version of the QR factorization with column pivoting, Argonne Preprint MCS-P551-1295, Mathematics and Computer Science Division, Argonne National Laboratory. 1995. To appear in SIAM J. Sci. Comp., 1998.
24. G. Quintana-Ortí, E.S. Quintana-Ortí, Guaranteeing termination of Chandrasekaran and Ipsen's algorithm for computing rank-revealing QR factorizations, Argonne Preprint MCS-P564-0196, Mathematics and Computer Science Division. Argonne National Laboratory, 1996.
25. R. Schreiber, C.F. van Loan, A storage efficient WY representation for products of householder transformations, Scientific and Statistical Computing 10 (1989) 53-57.
26. G.W. Stewart, An updating algorithm for subspace tracking, Technical Report CS-TR-2494, University of Maryland, Department of Computer Science, 1990.