libcolamd3 Library: colamd - 3 - Column Approximate Minimum Degree 3.6.0 2025-05-14 eisfair-64 the eisfair team, team(at)eisfair(dot)org stable

lib

glibc 3.6.0 libsuitesparseconfig7 3.6.0 libspex3 3.6.0 libcholmod5 3.6.0 suitesparse-dev 3.6.0 Internal Program Version: suitesparse 7.10.1 The COLAMD column approximate minimum degree ordering algorithm computes a permutation vector P such that the LU factorization of A (:,P) tends to be sparser than that of A. The Cholesky factorization of (A (:,P))'*(A (:,P)) will also tend to be sparser than that of A'*A. SYMAMD is a symmetric minimum degree ordering method based on COLAMD, available as a MATLAB-callable function. It constructs a matrix M such that M'*M has the same pattern as A, and then uses COLAMD to compute a column ordering of M. Colamd and symamd tend to be faster and generate better orderings than their MATLAB counterparts, colmmd and symmmd. COLAMD is part of the SuiteSparse sparse matrix suite. https://people.engr.tamu.edu/davis/suitesparse.html