IABSD.fr/ports/math/colamd
Branch :
Log
| Author | Commit | Date | CI | Message |
|---|---|---|---|---|
 |
80dfe7cf | 2010-07-18 10:30:41 | REVISION | |
 |
1de45afd | 2010-06-14 07:15:10 | - fix build on mips64 | |
 |
78b3167a | 2010-05-11 17:11:32 | Import colamd, needed for upcoming octave update. 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. |