- Name: libcolamd2
- Version: 4.4.4
- Release: 3.mga6
- Epoch:
- Group: Development/C
- License: LGPLv2+ and GPLv2+
- Url: http://faculty.cse.tamu.edu/davis/suitesparse.html
- Summary: Routines for computing column approximate minimum degree ordering
- Architecture: i586
- Size: 35176
- Distribution: Mageia
- Vendor: Mageia.Org
- Packager: neoclust <neoclust>
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.
- 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: rabbit.mageia.org 1475057281
- Buildhost: rabbit.mageia.org
Sources packages:
Other version of this rpm:
