- Name: libcolamd-devel
- Version: 2.7.1
- Release: 6mdv2009.0
- Epoch:
- Group: Development/C
- License: LGPL
- Url: http://www.cise.ufl.edu/research/sparse/colamd/
- Summary: C routines for computing column approximate minimum degree ordering
- Architecture: i586
- Size: 131031
- Distribution: Mandriva Linux
- Vendor: Mandriva
- Packager: Thierry Vignaud <tvignaud@mandriva.com>
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.
- OptFlags: -O2 -g -pipe -Wp,-D_FORTIFY_SOURCE=2 -fexceptions -fstack-protector --param=ssp-buffer-size=4 -fomit-frame-pointer -march=i586 -mtune=generic -fasynchronous-unwind-tables
- Cookie: n4.mandriva.com 1216844019
- Buildhost: n4.mandriva.com
Sources packages:
Other version of this rpm:
