Key | Value |
---|---|
FileName | snap-hashlookup-import/usr/share/doc/libumfpack5/copyright |
FileSize | 14744 |
MD5 | 3ACAA34256FD6A13307FE6554019AB0E |
RDS:package_id | 289328 |
SHA-1 | 7AA757605FA7399CA8F2AFA2BE9A6F29584D9D4F |
SHA-256 | 64EB7941A9A5FDA406EF2D1F14A0F1112C390F2053D8D95BDE0CE5A57B05AAE5 |
SHA-512 | 5E73A4F3785874E2A19419AE5B5CBF95E62D52D07DB4ABCE0E167784161C57BDC24AA22ED5233C274AB3C438838F4EB9C716D534B07F0B982E53BDEEC0CF7818 |
SSDEEP | 384:SNuGOyrkVbWMWrs6rs/P3jTPThyfrsYrsUPExM3pfl3P6YGAXV4q:wkygWtc3jpyfHhExM3Fl3SYXXCq |
TLSH | T19262D90E1A408BF75AD013D17D4ADFDAF126AADA326B550D380CC2499F2692F15F32E5 |
insert-timestamp | 1728232007.909393 |
mimetype | text/plain |
source | snap:7KmGS1V786zcoQjSqrYsW1fwEuuESP35_9 |
hashlookup:parent-total | 168 |
hashlookup:trust | 100 |
The searched file hash is included in 168 parent files which include package known and seen by metalookup. A sample is included below:
Key | Value |
---|---|
FileSize | 27960 |
MD5 | A50EB014D83DD8AD93E35ACB386A6BF7 |
PackageDescription | column approximate minimum degree ordering library for sparse matrices Suitesparse is a collection of libraries for computations involving sparse matrices. . The COLAMD library implements the "COLumn Approximate Minimum Degree ordering" algorithm. It 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 | Debian Science Team <debian-science-maintainers@lists.alioth.debian.org> |
PackageName | libcolamd2 |
PackageSection | libs |
PackageVersion | 1:5.10.1+dfsg-2 |
SHA-1 | 01359552EB9995E74790007D6D6A03245BF2DA88 |
SHA-256 | 4282A975E4E965F57CDE4335706745CF9467DD9FAB87B7C499ADE9058FFEA7A7 |
Key | Value |
---|---|
FileSize | 9922736 |
MD5 | 0001CBAD31112705703B28206E9097E6 |
PackageDescription | graph algorithms via sparse matrix operations on semirings Suitesparse is a collection of libraries for computations involving sparse matrices. . SuiteSparse:GraphBLAS is an full implementation of the GraphBLAS standard, which defines a set of sparse matrix operations on an extended algebra of semirings using an almost unlimited variety of operators and types. When applied to sparse adjacency matrices, these algebraic operations are equivalent to computations on graphs. GraphBLAS provides a powerful and expressive framework for creating graph algorithms based on the elegant mathematics of sparse matrix operations on a semiring. |
PackageMaintainer | Debian Science Team <debian-science-maintainers@lists.alioth.debian.org> |
PackageName | libgraphblas5 |
PackageSection | libs |
PackageVersion | 1:5.10.1+dfsg-2 |
SHA-1 | 017A02BAACF5F37EEC9F4B25DF1981A870F435F1 |
SHA-256 | A63526C89A7E03724E53D6713240F447E37C2C17EE3CD1ABF6F375E4F49050BA |
Key | Value |
---|---|
FileSize | 75936 |
MD5 | CAB85273183820DC27E08916B72C647B |
PackageDescription | concise sparse matrix library Suitesparse is a collection of libraries for computations involving sparse matrices. . The CXSparse library provides several matrix algorithms. The focus is on direct methods; iterative methods and solvers for eigenvalue problems are beyond the scope of this package. . The performance of the sparse factorization methods in CXSparse will not be competitive with UMFPACK or CHOLMOD, but the codes are much more concise and easy to understand. Other methods are competitive. |
PackageMaintainer | Debian Science Team <debian-science-maintainers@lists.alioth.debian.org> |
PackageName | libcxsparse3 |
PackageSection | libs |
PackageVersion | 1:5.10.1+dfsg-2 |
SHA-1 | 0252B2A3B12BCEE8B55B0FE0201D74A97815FB29 |
SHA-256 | 1BDBB0FBB79CF5976A94799CAE09A1F56DA412A066B5A61B93787267CAEAF701 |
Key | Value |
---|---|
FileSize | 33700 |
MD5 | 34B41E26EE19998E822FCC292CC876A8 |
PackageDescription | read/write sparse matrices in Rutherford/Boeing format Suitesparse is a collection of libraries for computations involving sparse matrices. . RBio is a library for reading/writing sparse matrices in the Rutherford/Boeing format. |
PackageMaintainer | Debian Science Team <debian-science-maintainers@lists.alioth.debian.org> |
PackageName | librbio2 |
PackageSection | libs |
PackageVersion | 1:5.10.1+dfsg-2 |
SHA-1 | 0362EA073BC26A6CFCEA03A6CC1F36174348DB89 |
SHA-256 | 2EFACF1C7C99011EF986D597EA1DCB7F542879A55C06AB3CA7FB8E4DC34D85A3 |
Key | Value |
---|---|
FileSize | 37624 |
MD5 | AC23EDD35DC17009D31A5D9CE364D245 |
PackageDescription | symmetric approximate minimum degree library for sparse matrices Suitesparse is a collection of libraries for computations involving sparse matrices. . The CAMD library provides a set of routines for pre-ordering sparse matrices prior to Cholesky or LU factorization, using the approximate minimum degree ordering algorithm with optional ordering constraints. |
PackageMaintainer | Debian Science Team <debian-science-maintainers@lists.alioth.debian.org> |
PackageName | libcamd2 |
PackageSection | libs |
PackageVersion | 1:5.10.1+dfsg-2 |
SHA-1 | 062F69C4F0B745E5A08739E2BDA36F3DDB5C71A6 |
SHA-256 | 4CAC516C4420335A294B0119C1A09AB43609BD5016FDCE39F13E9650DC8D6C30 |
Key | Value |
---|---|
FileSize | 34240 |
MD5 | 7747F5BC8F5A983E8D154E908DA9CCF3 |
PackageDescription | column approximate minimum degree ordering library for sparse matrices Suitesparse is a collection of libraries for computations involving sparse matrices. . The COLAMD library implements the "COLumn Approximate Minimum Degree ordering" algorithm. It 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 | Debian Science Team <debian-science-maintainers@lists.alioth.debian.org> |
PackageName | libcolamd2 |
PackageSection | libs |
PackageVersion | 1:5.10.1+dfsg-2 |
SHA-1 | 0A45B33A545975E8D5419BC4AFF6B1C5A49483A9 |
SHA-256 | 1057EE84F8FAABFDAAC33B293E5C95AA3F68A93E5F13BFCB78970504EF164D5A |
Key | Value |
---|---|
FileSize | 72936 |
MD5 | B121EA3F27CE85D380F5189F776FC4A4 |
PackageDescription | concise sparse matrix library Suitesparse is a collection of libraries for computations involving sparse matrices. . The CXSparse library provides several matrix algorithms. The focus is on direct methods; iterative methods and solvers for eigenvalue problems are beyond the scope of this package. . The performance of the sparse factorization methods in CXSparse will not be competitive with UMFPACK or CHOLMOD, but the codes are much more concise and easy to understand. Other methods are competitive. |
PackageMaintainer | Debian Science Team <debian-science-maintainers@lists.alioth.debian.org> |
PackageName | libcxsparse3 |
PackageSection | libs |
PackageVersion | 1:5.10.1+dfsg-2 |
SHA-1 | 0B776384EEFA2CF6FFD2B2F60F29F7252882092F |
SHA-256 | 3422312A75A93B0476B8CE7B3ECB577D6D5231F6FCAD160125B47AC6316966E8 |
Key | Value |
---|---|
FileSize | 8902988 |
MD5 | 4A309ADE5A12207E2C292A9867AE88FD |
PackageDescription | graph algorithms via sparse matrix operations on semirings Suitesparse is a collection of libraries for computations involving sparse matrices. . SuiteSparse:GraphBLAS is an full implementation of the GraphBLAS standard, which defines a set of sparse matrix operations on an extended algebra of semirings using an almost unlimited variety of operators and types. When applied to sparse adjacency matrices, these algebraic operations are equivalent to computations on graphs. GraphBLAS provides a powerful and expressive framework for creating graph algorithms based on the elegant mathematics of sparse matrix operations on a semiring. |
PackageMaintainer | Debian Science Team <debian-science-maintainers@lists.alioth.debian.org> |
PackageName | libgraphblas5 |
PackageSection | libs |
PackageVersion | 1:5.10.1+dfsg-2 |
SHA-1 | 10C641AD05F14EA421C72E04F19E60A42A9E1152 |
SHA-256 | 249086FF20FA81FDAEC798F8A080BECBDB9C4463C49BBAB368ECFB726C2BEA65 |
Key | Value |
---|---|
FileSize | 42944 |
MD5 | 3C66A3B0980AED77464AF312FAE75631 |
PackageDescription | read/write sparse matrices in Rutherford/Boeing format Suitesparse is a collection of libraries for computations involving sparse matrices. . RBio is a library for reading/writing sparse matrices in the Rutherford/Boeing format. |
PackageMaintainer | Debian Science Team <debian-science-maintainers@lists.alioth.debian.org> |
PackageName | librbio2 |
PackageSection | libs |
PackageVersion | 1:5.10.1+dfsg-2 |
SHA-1 | 128C18BF4124ABFAE2F6CD5AB5BDA5D013E41380 |
SHA-256 | F5575547E49DA51FE0ED5ED71FAC4A9F4CC9DB29467936438D7C624DF06E34D8 |
Key | Value |
---|---|
FileSize | 49736 |
MD5 | BA84FA2991D990F6DEDE832425837085 |
PackageDescription | graph partitioning tool that can quickly compute edge cuts (shared library) Suitesparse is a collection of libraries for computations involving sparse matrices. . Mongoose is a graph partitioning library that can quickly compute edge cuts in arbitrary graph. Given a graph with a vertex set and edge set, an edge cut is a partitioning of the graph into two subgraphs that are balanced (contain the same number of vertices) and the connectivity between the subgraphs is minimized (few edges are in the cut). . This package contains the shared C++ library. |
PackageMaintainer | Debian Science Team <debian-science-maintainers@lists.alioth.debian.org> |
PackageName | libmongoose2 |
PackageSection | libs |
PackageVersion | 1:5.10.1+dfsg-2 |
SHA-1 | 18710D6190BDD4E211751864DECBEFAE07B8FC30 |
SHA-256 | 79067815927E0B1A515164E76F415AB2059467DAA541AFB2183D74EDE301F789 |