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.
Requires UFconfig.
Maintained by: Kyle Guinn
Keywords:
ChangeLog: COLAMD
Homepage:
http://www.cise.ufl.edu/research/sparse/colamd/
Download SlackBuild:
COLAMD.tar.gz
COLAMD.tar.gz.asc (FAQ)
(the SlackBuild does not include the source)
Individual Files: |
COLAMD.SlackBuild |
COLAMD.info |
README |
autotoolize.diff |
slack-desc |
© 2006-2024 SlackBuilds.org Project. All rights reserved.
Slackware® is a registered trademark of
Patrick Volkerding
Linux® is a registered trademark of
Linus Torvalds