Sparse multifrontal rank revealing QR factorization

SIAM Journal on Matrix Analysis and Applications

Volumn 18, Issue 1, 1997, Pages 159-180

  Pierce, Daniel J ^a   Lewis, John G ^a  

^a BOEING COMPANY   (United States)

Author keywords

Least squares; Multifrontal; Rank deficient; Rank revealing; Sparse matrix

Indexed keywords

EID: 0031538763     PISSN: 08954798     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895479893244353     Document Type: Article

References (36)

1. J. L. BARLOW AND U. B. VEMULAPATI, Rank detection methods for sparse matrices, SIAM J. Matrix Anal. Appl., 13 (1992), pp. 1279-1297.
2. C. H. BISCHOF, Incremental condition estimation, SIAM J. Matrix Anal. Appl., 11 (1990), pp. 312-322.
3. C. H. BISCHOF AND P. C. HANSEN, A block algorithm for computing rank-revealing QR factorizations, Numer. Algorithms, 2 (1992), pp. 371-392.
4. C. H. BISCHOF, J. G. LEWIS, AND D. J. PIERCE. Incremental condition estimation for sparse matrices, SIAM J. Matrix Anal. Appl., 11 (1990), pp. 644-659.
5. C. H. BISCHOF AND P. T. P. TANG, Robust Incremental Condition Estimation, Technical Report, MCS-P225-0391, Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, IL, 1991.
6. C. H. BISCHOF AND C. VAN LOAN, The WY representation for products of Householder matrices, SIAM J. Sci. Statist. Comput., 8 (1987), pp. s2-s13.
7. J. R. BUNCH, C. R. NIELSEN, AND D. C. SORENSEN, Rank-one modification of the symmetric eigenproblem, Numer. Math., 31 (1978), pp. 31-48.
8. T. F. CHAN, Rank revealing QR factorizations, Linear Algebra Appl., 88/89 (1987), pp. 67-82.
9. S. CHANDRASEKARAN AND I. IPSEN, On Rank Revealing QR Factorizations, Research Report, YALEU/DCS/RR-880, Department of Computer Science, Yale University, New Haven, CT, December 1991.
10. T. F. CHAN AND P. C. HANSEN, Some applications of the rank revealing QR factorization, SIAM J. Sci. Statist. Comput., 13 (1992), pp. 724-741.
11. E. C.-H. L. CHU, Orthogonal Decomposition of Dense and Sparse Matrices on Multiprocessors, Ph.D. thesis, Technical Report CS-88-08, University of Waterloo, Waterloo, Ontario, Canada, March 1988.
12. I. S. DUFF AND J. K. REID, The multifrontal solution of indefinite sparse symmetric linear equations, ACM Trans. Math. Software, 9 (1983), pp. 302-325.
13. I. S. DUFF AND J. K. REID, The multifrontal solution of unsymmetric sets of linear equations, SIAM J. Sci. Statist. Comput., 5 (1984), pp. 633-641.
14. D. R. FERGUSON AND T. A. GRANDINE, On the Construction of Surfaces Interpolating Curves: 1. Gordon Surfaces Revisited, Technical Report SCA-TR-105, Boeing Computer Services, Seattle, WA, 1988.
15. L. V. FOSTER, Rank and null space calculations using matrix decompositions without column interchanges, Linear Algebra Appl., 74 (1986), pp. 47-71.
16. J. A. GEORGE AND M. T. HEATH, Solution of sparse linear least squares problems using Givens rotations, Linear Algebra Appl., 34 (1980), pp. 69-83.
17. J. A. GEORGE AND J. W. H. LIU, Computer Solution of Large Sparse Positive Definite Systems, Prentice-Hall Inc., Englewood Cliffs, NJ, 1981.
18. J. A. GEORGE AND J. W. H. LIU, Householder reflections versus Givens rotations in sparse orthogonal decompositions, Linear Algebra Appl., 88/89 (1987), pp. 223-238.
19. J. A. GEORGE AND E. NG, SPARSPAK: Waterloo Sparse Matrix Package User's Guide for SPARSPAK-B, Research Report No. CS-84-37, University of Waterloo, Dept. of Computer Science, Waterloo, Ontario, Canada, 1984.
20. G. H. GOLUB, Numerical methods for solving linear least squares problems, Numer. Math., 7 (1965), pp. 206-216.
21. G. H. GOLUB, V. KLEMA, AND G. W. STEWART, Rank Degeneracy and Least Squares Problems, Technical Report TR-456, Dept. of Computer Science, University of Maryland, Baltimore, MD, 1976.
22. T. A. GRANDINE, Rank Deficient Interpolation and Optimal Design: An Example, Technical Report SCA-TR-113, Boeing Computer Services, Seattle, WA, 1988.
23. M. T. HEATH, Some extensions of an algorithm for sparse linear least squares problems, SIAM J. Sci. Statist. Comput., 3 (1982), pp. 223-237.
24. P. HONG AND C.-T. PAN, The rank revealing QR decomposition and SVD, Math. Comp., 58 (1992), pp. 213-232.
25. J. G. LEWIS AND D. J. PIERCE, A robust sparse RRQR factorization, Presentation at the annual SIAM conference in Los Angeles, CA, July 1992.
26. J. G. LEWIS, D. J. PIERCE, AND D. K. WAH, Multifrontal Householder QR factorization, Technical Report ECA-TR-127, Boeing Computer Services, Seattle, WA, 1989.
27. J. W. H. LIU, Modification of the minimum degree algorithm by multiple elimination, ACM Trans. Math. Software, 11 (1985), pp. 141-153.
28. J. W. H. LIU, On general row merging schemes for sparse givens transformations, SIAM J. Sci. Statist. Comput., 7 (1986), pp. 1190-1211.
29. J. W. H. LIU, Equivalent sparse matrix reordering by elimination tree rotations, SIAM J. Sci. Statist. Comput., 9 (1988), pp. 424-444.
30. J. W. H. LIU, The role of elimination trees in sparse factorizations, SIAM J. Matrix Anal. Appl., 12 (1990), pp. 134-172.
31. P. MATSTOMS, The Multifrontal Solution of Sparse Linear Least, Squares Problems, Thesis, Department of Mathematics, Linkoping University, Linkoping, Sweden, October 1991.
32. C.-T. PAN AND P. T. P. TANG, Bounds on singular values revealed by QR factorizations, in SVD and Signal Processing III, M. Moonen and B. De Moor, eds., Elsevier, New York, 1995.
33. D. J. PIERCE AND J. G. LEWIS, Sparse Multifrontal Rank Revealing QR factorization, Technical Report MEA-TR-193, Boeing Computer Services, Seattle, WA, 1992.
34. D. J. PIERCE AND R. J. PLEMMONS, Fast adaptive condition estimation, SIAM J. Matrix Anal. Appl., 13 (1992), pp. 274-291.
35. Y. C. PIERCE, Iterative Refinement of Least Squares Solutions for Rank Deficient Problems, Technical Report MEA-TR-192, Boeing Computer Services, Seattle, WA, 1992.
36. D. C. SORENSEN AND P. T. P. TANG, On the orthogonality of eigenvectors computed by a divide-and-conquer method, SIAM J. Numer. Anal., 28 (1991), pp. 1752-1775.