SlackBuilds Repository

14.1 > Academic > colamd (2.8.0)

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.

This requires: suitesparseconfig

Maintained by: Kyle Guinn
Keywords:

Homepage:
https://www.cise.ufl.edu/research/sparse/colamd/

Source Downloads:
COLAMD-2.8.0.tar.gz (482dc4f958c2dafdd430d4c3148d15c5)

Download SlackBuild:
colamd.tar.gz
colamd.tar.gz.asc (FAQ)

(the SlackBuild does not include the source)

Individual Files:
README
autotoolize.diff
colamd.SlackBuild
colamd.info
slack-desc

See our HOWTO for instructions on how to use the contents of this repository.

Access to the repository is available via:
ftp git cgit http rsync

[  Exec: 0.0499 sec  |  Load: 0.13 0.12 0.14  ]

© 2006-2014 SlackBuilds.org Project. All rights reserved.
Slackware® is a registered trademark of Patrick Volkerding
Linux® is a registered trademark of Linus Torvalds
Web Design by WebSight Designs |  Managed Hosting by OnyxLight Communications