Predicting the structure of sparse orthogonal factors

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

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

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

[4]  Iain S. Duff,et al.  Remarks on implementation of O(n1/2τ) assignment algorithms , 1988, TOMS.

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

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

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

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

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

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

[11]  N. S. Mendelsohn,et al.  Two Algorithms for Bipartite Graphs , 1963 .

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

[13]  John R. Gilbert,et al.  Sparse Matrices in MATLAB: Design and Implementation , 1992, SIAM J. Matrix Anal. Appl..

[14]  A. Pothen.  Sparse null bases and marriage theorems , 1984 .

[15]  Iain S. Duff,et al.  MA28 --- A set of Fortran subroutines for sparse unsymmetric linear equations , 1980 .

[16]  D. Rose.  A GRAPH-THEORETIC STUDY OF THE NUMERICAL SOLUTION OF SPARSE POSITIVE DEFINITE SYSTEMS OF LINEAR EQUATIONS , 1972 .

[17]  R. Brualdi.  Term Rank of the Direct Product of Matrices , 1966, Canadian Journal of Mathematics.

[18]  N. S. Mendelsohn,et al.  Connectivity and Reducibility of Graphs , 1962, Canadian Journal of Mathematics.

[19]  N. S. Mendelsohn,et al.  Coverings of Bipartite Graphs , 1958, Canadian Journal of Mathematics.