A Data Structure for Sparse $QR$ and $LU$ Factorizations
- 1 January 1988
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Scientific and Statistical Computing
- Vol. 9 (1), 100-121
- https://doi.org/10.1137/0909008
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- 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
- A compact row storage scheme for Cholesky factors using elimination treesACM Transactions on Mathematical Software, 1986
- Predicting fill for sparse orthogonal factorizationJournal of the ACM, 1986
- Orthogonal Reduction of Sparse Matrices to Upper Triangular Form Using Householder TransformationsSIAM Journal on Scientific and Statistical Computing, 1986
- Modification of the minimum-degree algorithm by multiple eliminationACM Transactions on Mathematical Software, 1985
- An Implementation of Gaussian Elimination with Partial Pivoting for Sparse SystemsSIAM Journal on Scientific and Statistical Computing, 1985
- Sparse matrix test problemsACM SIGNUM Newsletter, 1982
- Algorithm 575: Permutations for a Zero-Free Diagonal [F1]ACM Transactions on Mathematical Software, 1981
- The economical storage of plane rotationsNumerische Mathematik, 1976