Predicting structure in nonsymmetric sparse matrix factorizations

Many computations on sparse matrices have a phase that predicts the nonzero structure of the output, followed by a phase that actually performs the numerical computation. We study structure prediction for computations that involve nonsymmetric row and column permutations and nonsymmetric or non-square matrices. Our tools are bipartite graphs, matchings, and alternating paths.

[1]  S. Parter.  The Use of Linear Graphs in Gauss Elimination , 1961 .

[2]  H. Schwarz.  Tridiagonalization of a symetric band matrix , 1968 .

[3]  Frank Harary,et al.  Graph Theory , 2016 .

[4]  R. Willoughby,et al.  Some results on sparse matrices , 1970 .

[5]  D. Rose.  Triangulated graphs and the elimination process , 1970 .

[6]  D. Rose,et al.  Algorithmic aspects of vertex elimination on directed graphs. , 1975 .

[7]  Robert E. Tarjan,et al.  Algorithmic Aspects of Vertex Elimination on Graphs , 1976, SIAM J. Comput..

[8]  John K. Reid,et al.  Some Design Features of a Sparse Matrix Code , 1979, TOMS.

[9]  M. Golumbic.  CHAPTER 3 – Perfect Graphs , 1980 .

[10]  J. Gilbert.  Graph separator theorems and sparse Gaussian elimination , 1980 .

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

[12]  M. Golumbic.  Algorithmic graph theory and perfect graphs , 1980 .

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

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

[15]  A. George,et al.  Row-ordering schemes for sparse givens transformations. II. implicit graph model , 1984 .

[16]  M. Heath.  Numerical Methods for Large Sparse Linear Least Squares Problems , 1984 .

[17]  H. Elman.  A stability analysis of incomplete LU factorizations , 1986 .

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

[19]  J. Gilbert,et al.  Sparse Partial Pivoting in Time Proportional to Arithmetic Operations , 1986 .

[20]  A. George,et al.  Householder reflections versus givens rotations in sparse orthogonal decomposition , 1987 .

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

[22]  Kazuo Murota,et al.  Combinatorial canonical form of layered mixed matrices and its application to block-triangularization of systems of linear/nonlinear equations , 1987 .

[23]  A. George,et al.  A data structure for sparse QR and LU factorizations , 1988 .

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

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

[26]  Richard A. Brualdi,et al.  Combinatorial matrix theory , 1991 .

[27]  E. Ng,et al.  A tight and explicit representation of Q in sparse QR factorization , 1992 .

[28]  Charles R. Johnson,et al.  Sparsity Analysis of the $QR$ Factorization , 1993, SIAM J. Matrix Anal. Appl..

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

[30]  Strong Hall Matrices , 1994 .

[31]  J. Gilbert.  Predicting Structure in Sparse Matrix Computations , 1994 .