summaryrefslogtreecommitdiff
path: root/libraries/COLAMD/README
diff options
context:
space:
mode:
authorKyle Guinn <elyk03@gmail.com>2010-08-24 00:02:25 -0400
committerErik Hanson <erik@slackbuilds.org>2010-08-29 15:32:11 -0500
commit5ab59a9afb00a0094059d0ccc902dd3f9ac2dbcc (patch)
tree98cec69668427378e2946dc4c0778f2e5c9e646f /libraries/COLAMD/README
parent0bf8f75918917093b9799cbcb4ead947e15d7dfc (diff)
downloadslackbuilds-5ab59a9afb00a0094059d0ccc902dd3f9ac2dbcc.tar.gz
libraries/COLAMD: Added (sparse matrix ordering routines)
Signed-off-by: dsomero <xgizzmo@slackbuilds.org>
Diffstat (limited to 'libraries/COLAMD/README')
-rw-r--r--libraries/COLAMD/README8
1 files changed, 8 insertions, 0 deletions
diff --git a/libraries/COLAMD/README b/libraries/COLAMD/README
new file mode 100644
index 0000000000..51c1047aed
--- /dev/null
+++ b/libraries/COLAMD/README
@@ -0,0 +1,8 @@
+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.