Symbolic Factorization for Sparse Gaussian Elimination with Partial Pivoting
- 1 November 1987
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Scientific and Statistical Computing
- Vol. 8 (6) , 877-898
- https://doi.org/10.1137/0908072
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Predicting fill for sparse orthogonal factorizationJournal of the ACM, 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
- A Comparison of Some Methods for Solving Sparse Linear Least-Squares ProblemsSIAM Journal on Scientific and Statistical Computing, 1983
- Sparse matrix test problemsACM SIGNUM Newsletter, 1982
- On Algorithms for Obtaining a Maximum TransversalACM Transactions on Mathematical Software, 1981
- An Optimal Agorithm for Symbolic Factorization of Symmetric MatricesSIAM Journal on Computing, 1980
- Some Design Features of a Sparse Matrix CodeACM Transactions on Mathematical Software, 1979
- Algorithms for Matrix Partitioning and the Numerical Solution of Finite Element SystemsSIAM Journal on Numerical Analysis, 1978