summaryrefslogtreecommitdiff
path: root/academic/colamd/README
diff options
context:
space:
mode:
authorKyle Guinn <elyk03@gmail.com>2014-01-24 20:35:26 -0600
committerRobby Workman <rworkman@slackbuilds.org>2014-01-31 00:53:33 -0600
commit928fce8faa704aaf0a03021ff58c21eaea1ee967 (patch)
treed531801cc42a5be62e8c8c6b6de8863426897f7e /academic/colamd/README
parentffffac9b041e2c6d745ba31c868c0e08f8f92912 (diff)
downloadslackbuilds-928fce8faa704aaf0a03021ff58c21eaea1ee967.tar.gz
academic/colamd: Renamed and moved from libraries.
Signed-off-by: Robby Workman <rworkman@slackbuilds.org>
Diffstat (limited to 'academic/colamd/README')
-rw-r--r--academic/colamd/README6
1 files changed, 6 insertions, 0 deletions
diff --git a/academic/colamd/README b/academic/colamd/README
new file mode 100644
index 0000000000..caa522b0e7
--- /dev/null
+++ b/academic/colamd/README
@@ -0,0 +1,6 @@
+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.