Predicting Structure in Nonsymmetric Sparse Matrix Factorizations
- 1 January 1993
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 21 references indexed in Scilit:
- Combinatorial Matrix TheoryPublished by Cambridge University Press (CUP) ,1991
- Sparse Partial Pivoting in Time Proportional to Arithmetic OperationsSIAM Journal on Scientific and Statistical Computing, 1988
- A Data Structure for Sparse $QR$ and $LU$ FactorizationsSIAM Journal on Scientific and Statistical Computing, 1988
- Symbolic Factorization for Sparse Gaussian Elimination with Partial PivotingSIAM Journal on Scientific and Statistical Computing, 1987
- Householder reflections versus givens rotations in sparse orthogonal decompositionLinear Algebra and its Applications, 1987
- Predicting fill for sparse orthogonal factorizationJournal of the ACM, 1986
- Row-ordering schemes for sparse givens transformations. I. bipartite graph modelLinear Algebra and its Applications, 1984
- Solution of sparse linear least squares problems using givens rotationsLinear Algebra and its Applications, 1980
- Some Design Features of a Sparse Matrix CodeACM Transactions on Mathematical Software, 1979
- Some results on sparse matricesMathematics of Computation, 1970