Answers are grounded in this paper and cite their sources.
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 when A is sparse symmetric positive definite, as well as in several other sparse matrix functions.
No takes yet. Share an insight, caveat, or question.
Chen et al. (2008) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: