SlackBuilds Repository

14.1 > Academic > colamd (2.9.1)

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:
http://faculty.cse.tamu.edu/davis/suitesparse.html

Source Downloads:
SuiteSparse-4.4.4.tar.gz (e0af74476935c9ff6d971df8bb6b82fc)

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

© 2006-2015 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