Package : libccolamd2
Package details
Summary: Routines for computing column approximate minimum degree ordering
Description:
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.
URL: http://faculty.cse.tamu.edu/davis/suitesparse.html
License: (LGPLv2+ or BSD) and LGPLv2+ and GPLv2+
Maintainer: nobody
Description:
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.
URL: http://faculty.cse.tamu.edu/davis/suitesparse.html
License: (LGPLv2+ or BSD) and LGPLv2+ and GPLv2+
Maintainer: nobody
List of RPMs
- libccolamd2-4.4.6-4.mga8.i586.rpm (Mageia 8, i586 media, core-release) Install