A tight and explicit representation of Q in sparse QR factorization

In QR factorization of a sparse m{times}n matrix A (m {ge} n) the orthogonal factor Q is often stored implicitly as a lower trapezoidal matrix H known as the Householder matrix. This paper presents a simple characterization of the row structure of Q, which could be used as the basis for a sparse data structure that can store Q explicitly. The new characterization is a simple extension of a well known row-oriented characterization of the structure of H. Hare, Johnson, Olesky, and van den Driessche have recently provided a complete sparsity analysis of the QR factorization. Let U be the matrix consisting of the first n columns of Q. Using results from, we show that the data structures for H and U resulting from our characterizations are tight when A is a strong Hall matrix. We also show that H and the lower trapezoidal part of U have the same sparsity characterization when A is strong Hall. We then show that this characterization can be extended to any weak Hall matrix that has been permuted into block upper triangular form. Finally, we show that permuting to block triangular form never increases the fill incurred during the factorization.

[1]  P. Hall.  On Representatives of Subsets , 1935 .

[2]  Iain S. Duff,et al.  On Permutations to Block Triangular Form , 1977 .

[3]  John K. Reid,et al.  An Implementation of Tarjan's Algorithm for the Block Triangularization of a Matrix , 1978, TOMS.

[4]  John K. Reid,et al.  Algorithm 529: Permutations To Block Triangular Form [F1] , 1978, TOMS.

[5]  R. MacQueen,et al.  National-Center Atmospheric Research , 1980 .

[6]  A. George,et al.  Solution of sparse linear least squares problems using givens rotations , 1980 .

[7]  Iain S. Duff,et al.  On Algorithms for Obtaining a Maximum Transversal , 1981, TOMS.

[8]  Iain S. Duff,et al.  Algorithm 575: Permutations for a Zero-Free Diagonal [F1] , 1981, TOMS.

[9]  Robert Schreiber,et al.  A New Implementation of Sparse Gaussian Elimination , 1982, TOMS.

[10]  J. Pasciak,et al.  Computer solution of large sparse positive definite systems , 1982 .

[11]  Gene H. Golub,et al.  Matrix computations , 1983 .

[12]  John R. Gilbert,et al.  Predicting fill for sparse orthogonal factorization , 1986, JACM.

[13]  A. George,et al.  Orthogonal Reduction of Sparse Matrices to Upper Triangular Form Using Householder Transformations , 1986 .

[14]  Joseph W. Liu,et al.  A compact row storage scheme for Cholesky factors using elimination trees , 1986, TOMS.

[15]  A. George,et al.  Symbolic factorization for sparse Gaussian elimination with partial pivoting , 1987 .

[16]  Joseph W. H. Liu.  The role of elimination trees in sparse factorization , 1990 .

[17]  Alex Pothen,et al.  Computing the block triangular form of a sparse matrix , 1990, TOMS.

[18]  A. Pothen.  Predicting the structure of sparse orthogonal factors , 1993 .