- Name: libccolamd-devel
- Version: 2.7.3
- Release: 1.mga1
- Epoch: 0
- Group: Development/C
- License: LGPL
- Url: http://www.cise.ufl.edu/research/sparse/ccolamd/
- Summary: C routines for computing column approximate minimum degree ordering
- Architecture: i586
- Size: 191654
- Distribution: Mageia
- Vendor: Mageia.Org
- Packager: Mageia Team <http://www.mageia.org>
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.
This package contains the files needed to develop applications which
use ccolamd.
- OptFlags: -O2 -g -pipe -Wformat -Werror=format-security -Wp,-D_FORTIFY_SOURCE=2 -fstack-protector --param=ssp-buffer-size=4 -fomit-frame-pointer -march=i586 -mtune=generic -fasynchronous-unwind-tables
- Cookie: ecosse 1302615377
- Buildhost: ecosse
Sources packages:
Other version of this rpm:
