README 312 B

1234567
  1. The COLAMD column approximate minimum degree ordering algorithm computes
  2. a permutation vector P such that the LU factorization of A (:,P)
  3. tends to be sparser than that of A. The Cholesky factorization of
  4. (A (:,P))'*(A (:,P)) will also tend to be sparser than that of A'*A.
  5. This package is part of SuiteSparse.