Package : colamd
Package details
Summary: Routines for computing column approximate minimum degree ordering
Description:
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.
URL: http://www.cise.ufl.edu/research/sparse/colamd/
License: LGPL
Maintainer: nobody
Description:
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.
URL: http://www.cise.ufl.edu/research/sparse/colamd/
License: LGPL
Maintainer: nobody
List of RPMs
- colamd-2.8.0-2.mga3.src.rpm (Mageia 3, x86_64 media, core-release)