- Name: colamd
- Version: 2.7.3
- Release: 1
- Epoch: 0
- Group: System/Libraries
- License: LGPL
- Url: http://www.cise.ufl.edu/research/sparse/colamd/
- Summary: Routines for computing column approximate minimum degree ordering
- Architecture: i586
- Size: 60145
- Distribution: Mandriva Linux
- Vendor: Mandriva
- Packager: Lev Givon <lev@mandriva.org>
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.
- BuildArch:
- ExcludeArch:
- ExclusiveArch:
- Cookie: n4.mandriva.com 1299517657
- Buildhost: n4.mandriva.com
Generated packages:
- colamd-debug-2.7.3-1.i586
- libcolamd-devel-2.7.3-1.i586
- libcolamd2.7.3-2.7.3-1.i586
- colamd-debug-2.7.3-1.x86_64
- lib64colamd-devel-2.7.3-1.x86_64
- lib64colamd2.7.3-2.7.3-1.x86_64
Other version of this rpm: