b0ddf82840
Signed-off-by: Kyle Guinn <elyk03@gmail.com> |
||
|---|---|---|
| .. | ||
| patches | ||
| README | ||
| colamd.SlackBuild | ||
| colamd.info | ||
| slack-desc | ||
README
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. This package is part of SuiteSparse.