Parents (Total: 4)
The searched file hash is included in 4 parent files which include package known and seen by metalookup. A sample is included below:
Key |
Value |
MD5 | 0C85BCE83BD6FE7F43AD4030B0E43EA0 |
PackageArch | x86_64 |
PackageDescription | 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. |
PackageMaintainer | umeabot <umeabot> |
PackageName | lib64colamd2 |
PackageRelease | 3.mga7 |
PackageVersion | 4.4.6 |
SHA-1 | 092E5C8A092FCA0202045DEF0494BF4B6D5A9E8B |
SHA-256 | B9CC086E56D0C76222B384D6FB4214DC7C50EB3ADFB95FD816CB535523F2CCB5 |
Key |
Value |
MD5 | 0501DE06FB5CA727FFA7C16994419E9A |
PackageArch | aarch64 |
PackageDescription | 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. |
PackageMaintainer | umeabot <umeabot> |
PackageName | lib64colamd2 |
PackageRelease | 3.mga7 |
PackageVersion | 4.4.6 |
SHA-1 | 8F79E1D0127B44F8C09304AD21DB2F26692B06A1 |
SHA-256 | 406B0A64217EE47FEF44CC9CBD1F73C2348484CD96D22779DE370266B453BAFA |
Key |
Value |
MD5 | 517C7ECDB924F47D74EF3E66AD2F35A8 |
PackageArch | x86_64 |
PackageDescription | 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. |
PackageMaintainer | umeabot <umeabot> |
PackageName | lib64colamd2 |
PackageRelease | 4.mga8 |
PackageVersion | 4.4.6 |
SHA-1 | 11FD8CA7C659BADC40BF14F97C3F81353A4E442E |
SHA-256 | 3B5B5553E2C18F6AC6E12A7F8E34E451D6C2E313C2624AAB0FA301D2F95AACBB |
Key |
Value |
MD5 | 615B9615600A4CB0AB22497E626A16C5 |
PackageArch | aarch64 |
PackageDescription | 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. |
PackageMaintainer | umeabot <umeabot> |
PackageName | lib64colamd2 |
PackageRelease | 4.mga8 |
PackageVersion | 4.4.6 |
SHA-1 | B4BE6D76337D0679ABE44FCFD48B6AF2B65B3DFF |
SHA-256 | 3B456C1F46091DC71DAB9A2535F684D570E820C63D0A405373F1688D314F6E43 |