Index | index by Group | index by Distribution | index by Vendor | index by creation date | index by Name | Mirrors | Help | Search |
Name: lib64colamd3 | Distribution: Mageia |
Version: 7.11.0 | Vendor: Mageia.Org |
Release: 1.mga10 | Build date: Sun Oct 12 14:52:51 2025 |
Group: Development/C | Build host: localhost |
Size: 77400 | Source RPM: suitesparse-7.11.0-1.mga10.src.rpm |
Packager: aurr <aurr> | |
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+
* Sun Oct 12 2025 aurr <aurr> 7.11.0-1.mga10 + Revision: 2277590 - new version: 7.11.0 - switch to direct cmake build - add support for 64-bit integer interface * 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/02 /usr/lib/.build-id/02/3041297564a843de159818c4ca46ef454299f0 /usr/lib/.build-id/33 /usr/lib/.build-id/33/d5c5a379babdb4209103f4ca41b028315d0094 /usr/lib64/libcolamd.so.3 /usr/lib64/libcolamd.so.3.3.5 /usr/lib64/libcolamd64_.so.3 /usr/lib64/libcolamd64_.so.3.3.5 /usr/share/doc/lib64colamd3 /usr/share/doc/lib64colamd3/ChangeLog /usr/share/doc/lib64colamd3/README.txt /usr/share/licenses/lib64colamd3 /usr/share/licenses/lib64colamd3/License.txt
Generated by rpm2html 1.8.1
Fabrice Bellet, Wed Oct 15 09:40:47 2025