- Name: colamd
- Version: 2.8.0
- Release: 2.mga3
- 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: 59061
- Distribution: Mageia
- Vendor: Mageia.Org
- Packager: umeabot <umeabot>
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: sucuk.mageia.org 1357920504
- Buildhost: sucuk.mageia.org
