colamd: COLAMD (sparse matrix ordering routines) colamd: colamd: The COLAMD column approximate minimum degree ordering algorithm colamd: computes a permutation vector P such that the LU factorization of colamd: A (:,P) tends to be sparser than that of A. The Cholesky colamd: factorization of (A (:,P))'*(A (:,P)) will also tend to be sparser colamd: than that of A'*A. colamd: colamd: colamd: colamd: