aboutsummaryrefslogtreecommitdiff
path: root/math/suitesparse-colamd/pkg-descr
diff options
context:
space:
mode:
authorThierry Thomas <thierry@FreeBSD.org>2021-05-24 16:40:15 +0000
committerThierry Thomas <thierry@FreeBSD.org>2021-05-25 10:00:05 +0000
commitc05dc3502abadf29b8d965676d96e57e209e2bf4 (patch)
treeac58b4844018f9ccbf1d2319eac175941da05dc0 /math/suitesparse-colamd/pkg-descr
parent4c7a0350174db78fa20d967f2dcac5605f740eb7 (diff)
downloadports-c05dc3502abadf29b8d965676d96e57e209e2bf4.tar.gz
ports-c05dc3502abadf29b8d965676d96e57e209e2bf4.zip
suitesparse-colamd: new port for the module COLAMD of SuiteSparse
Diffstat (limited to 'math/suitesparse-colamd/pkg-descr')
-rw-r--r--math/suitesparse-colamd/pkg-descr11
1 files changed, 11 insertions, 0 deletions
diff --git a/math/suitesparse-colamd/pkg-descr b/math/suitesparse-colamd/pkg-descr
new file mode 100644
index 000000000000..ffe0b994bacd
--- /dev/null
+++ b/math/suitesparse-colamd/pkg-descr
@@ -0,0 +1,11 @@
+This port installs the module COLAMD of SuiteSparse.
+
+The CCOLAMD 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. CSYMAMD is a symmetric minimum degree
+ordering method based on CCOLAMD, also available as a MATLAB-callable function.
+It constructs a matrix M such that M'*M has the same pattern as A, and then uses
+CCOLAMD to compute a column ordering of M.
+
+WWW: http://faculty.cse.tamu.edu/davis/suitesparse.html