Algorithm 887
Yanqing Chen, Timothy A. Davis, William W. Hager et al. · ACM Transactions on Mathematical Software · 2008
CHOLMOD is a set of routines for factorizing sparse symmetric positive definite matrices of the form A or AA T , updating/downdating a sparse Cholesky factorization, solving linear systems, updating/downdating the solution to the triangular system Lx = b , and many other sparse matrix functions for both symmetric and unsymmetric matrices. Its supernodal Cholesky factorization relies on LAPACK and the Level-3 BLAS, and obtains a substantial fraction of the peak performance of the BLAS. Both real and complex matrices are supported. CHOLMOD is written in ANSI/ISO C, with both C and MATLAB TM interfaces. It appears in MATLAB 7.2 as x = A\b when A is sparse symmetric positive definite, as well as in several other sparse matrix functions.
Cited by 751 works. doi:10.1145/1391989.1391995
Authors
References
- Basic Linear Algebra Subprograms for Fortran Usage
- LAPACK Users' Guide
- A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
- Computer Solution of Large Sparse Positive Definite Systems.
- A set of level 3 basic linear algebra subprograms
- Direct Methods for Sparse Matrices
- An extended set of FORTRAN basic linear algebra subprograms
- Methods for Modifying Matrix Factorizations
- Computer Solution of Large Sparse Positive Definite
- Direct Methods for Sparse Linear Systems