Index | index by Group | index by Distribution | index by Vendor | index by creation date | index by Name | Mirrors | Help | Search |
Name: libcolamd2 | Distribution: Mageia |
Version: 4.4.6 | Vendor: Mageia.Org |
Release: 4.mga8 | Build date: Fri Feb 14 05:55:56 2020 |
Group: Development/C | Build host: localhost |
Size: 26956 | Source RPM: suitesparse-4.4.6-4.mga8.src.rpm |
Packager: umeabot <umeabot> | |
Url: http://faculty.cse.tamu.edu/davis/suitesparse.html | |
Summary: Routines for computing column approximate minimum degree ordering |
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.
(LGPLv2+ or BSD) and LGPLv2+ and GPLv2+
* Fri Feb 14 2020 umeabot <umeabot> 4.4.6-4.mga8 + Revision: 1517262 - Mageia 8 Mass Rebuild * Sun Sep 23 2018 umeabot <umeabot> 4.4.6-3.mga7 + Revision: 1301236 - Mageia 7 Mass Rebuild * Sat Apr 14 2018 wally <wally> 4.4.6-2.mga7 + Revision: 1218684 - build using our optflags and ldflags + neoclust <neoclust> - Use %global - New version 4.4.6 - New version 4.4.5
/usr/lib/.build-id /usr/lib/.build-id/4a /usr/lib/.build-id/4a/f7a040910877ff2746809d4e3f6da7da776790 /usr/lib/libcolamd.so.2 /usr/lib/libcolamd.so.2.9.0
Generated by rpm2html 1.8.1
Fabrice Bellet, Tue Jul 9 14:57:28 2024