Some results on structure prediction in sparse QR factorization

SIAM Journal on Matrix Analysis and Applications

Volumn 17, Issue 2, 1996, Pages 443-459

  Ng, Esmond G ^a   Peyton, Barry W ^a  

^a OAK RIDGE NATIONAL LABORATORY   (United States)

Author keywords

Block upper triangular form; Elimination tree; Hall property; QR factorization; Sparse matrix computations; Structure prediction

Indexed keywords

EID: 0030560294     PISSN: 08954798     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895479892230973     Document Type: Article

References (18)

1. T. COLEMAN, A. EDENBRANDT, AND J. GILBERT, Predicting fill for sparse orthogonal factorization, J. Assoc. Comput. Mach., 33 (1986), pp. 517-532.
2. J. DONGARRA, J. BUNCH, C. MOLER, AND G. STEWART, LINPACK Users' Guide, Society for Industrial and Applied Mathematics, Philadelphia, PA, 1979.
3. I. DUFF, Algorithm 575. Permutations for a zero-free diagonal, ACM Trans. Math. Software, 7 (1981), pp. 387-390.
4. _, On algorithms for obtaining a maximum transversal, ACM Trans. Math. Software, 7 (1981), pp. 315-330.
5. I. DUFF AND J. REID, Algorithm 529. Permutations to block triangular form, ACM Trans. Math. Software, 4 (1978), pp. 189-192.
6. A. GEORGE AND F. GUSTAVSON, A new proof on permuting to block triangular form, Tech. report RC 8238, IBM T. J. Watson Research Center, Yorktown Heights, NY, 1980.
7. A. GEORGE AND J. W. H. LIU, Computer Solution of Large Sparse Positive Definite Systems, Prentice-Hall Inc., Englewood Cliffs, NJ, 1981.
8. A. GEORGE, J. W. H. LIU, AND E. G.-Y. NG, A data structure for sparse QR and LU factorizations, SIAM J. Sci. Statist. Comput., 9 (1988), pp. 100-121.
9. A. GEORGE AND E. G.-Y. NG, Symbolic factorization for sparse Gaussian elimination with partial pivoting, SIAM J. Sci. Statist. Comput., 8 (1987), pp. 877-898.
10. J. GILBERT, E. NG, AND B. PEYTON, Separators and structure prediction in sparse orthogonal factorization, Tech. report CSL-93-15, Xerox Palo Alto Research Center, Palo Alto, CA, 1993, submitted to Linear Algebra Appl.
11. G. GOLUB AND C. VAN LOAN, Matrix Computations, The Johns Hopkins University Press, Baltimore, MD, 1983.
12. P. HALL, On representatives of subsets, J. Lond. Math. Soc., 10 (1935), pp. 26-30.
13. D. HARE, C. JOHNSON, D. OLESKY, AND P. VAN DEN DRIESSCHE, Sparsity analysis of the QR factorization, SIAM J. Matrix Anal. Appl., 14 (1993), pp. 655-669.
14. J. W. H. LIU, A compact row storage scheme for Cholesky factors using elimination trees, ACM Trans. Math. Software, 12 (1986), pp. 127-148.
15. _, The role of elimination trees in sparse factorization, SIAM J. Matrix Anal. Appl., 11 (1990), pp. 134-172.
16. L. LOVASZ AND M. PLUMMER, Matching Theory, North-Holland, Amsterdam, 1986.
17. A. POTHEN, Predicting the structure of sparse orthogonal factors, Linear Algebra Appl., 194 (1993), pp. 183-204.
18. A. POTHEN AND C.-J. FAN, Computing the block triangular form of a sparse matrix, ACM Trans. Math. Software, 16 (1990), pp. 303-324.