Algorithm 849
- 1 December 2005
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Mathematical Software
- Vol. 31 (4) , 587-591
- https://doi.org/10.1145/1114268.1114277
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Algorithm 837ACM Transactions on Mathematical Software, 2004
- An Approximate Minimum Degree Ordering AlgorithmSIAM Journal on Matrix Analysis and Applications, 1996
- An Efficient Algorithm to Compute Row and Column Counts for Sparse Cholesky FactorizationSIAM Journal on Matrix Analysis and Applications, 1994
- A Supernodal Cholesky Factorization Algorithm for Shared-Memory MultiprocessorsSIAM Journal on Scientific Computing, 1993
- Sparse Matrices in MATLAB: Design and ImplementationSIAM Journal on Matrix Analysis and Applications, 1992
- A generalized envelope method for sparse factorization by rowsACM Transactions on Mathematical Software, 1991
- The Role of Elimination Trees in Sparse FactorizationSIAM Journal on Matrix Analysis and Applications, 1990
- Sparse Partial Pivoting in Time Proportional to Arithmetic OperationsSIAM Journal on Scientific and Statistical Computing, 1988
- A compact row storage scheme for Cholesky factors using elimination treesACM Transactions on Mathematical Software, 1986
- The Design of a User Interface for a Sparse Matrix PackageACM Transactions on Mathematical Software, 1979