Index | index by Group | index by Distribution | index by Vendor | index by creation date | index by Name | Mirrors | Help | Search |
Name: lib64colamd4 | Distribution: Mageia |
Version: 5.13.0 | Vendor: Mageia.Org |
Release: 3.mga10 | Build date: Sat Jun 28 12:42:07 2025 |
Group: Development/C | Build host: localhost |
Size: 68394 | Source RPM: suitesparse-5.13.0-3.mga10.src.rpm |
Packager: umeabot <umeabot> | |
Url: https://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+
* Sat Jun 28 2025 umeabot <umeabot> 5.13.0-3.mga10 + Revision: 2217468 - Mageia 10 Mass Rebuild
/usr/lib/.build-id /usr/lib/.build-id/b9 /usr/lib/.build-id/b9/855f30b8a94442d969755b7e7cad8c56e3fa99 /usr/lib64/libcolamd.so.4 /usr/lib64/libcolamd.so.4.5.6
Generated by rpm2html 1.8.1
Fabrice Bellet, Sun Jun 29 03:20:03 2025