Package : libcolamd-devel
Package details
Summary: C 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.
This package contains the files needed to develop applications which
use colamd.
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.
This package contains the files needed to develop applications which
use colamd.
URL: http://www.cise.ufl.edu/research/sparse/colamd/
License: LGPL
Maintainer: nobody
List of RPMs
- libcolamd-devel-2.7.3-1.mga1.i586.rpm (Mageia 2, i586 media, core-release) Install