Key | Value |
---|---|
CRC32 | 735631C2 |
FileName | ./usr/share/doc/libsuitesparseconfig5/NEWS.Debian.gz |
FileSize | 477 |
MD5 | B73F568D625B203AB463C9B6A662CDAD |
OpSystemCode | {'MfgCode': '1006', 'OpSystemCode': '362', 'OpSystemName': 'TBD', 'OpSystemVersion': 'none'} |
ProductCode | {'ApplicationType': 'Operating System', 'Language': 'Multilanguage', 'MfgCode': '2529', 'OpSystemCode': '910', 'ProductCode': '217853', 'ProductName': 'Linux Mint - Tricia', 'ProductVersion': '19.3'} |
RDS:package_id | 222721 |
SHA-1 | 2C4D7B6CF5DD0117FC55C263D895605D6E75C4EF |
SHA-256 | 9B845CFAF92846977E2D4DFA703AF13B6805CE4CEC5F9C0E717B31AFFA7F25D5 |
SHA-512 | 43E870CD66BB1189CE924B40D58DF6512F2A194ADF5C5055948023D4BFAB84A438507B873165BD101FFC0957702E16247F0C4729B97F8A723FF4B7EA9828BAAD |
SSDEEP | 12:Xp2NHDIqfniTAA5Cl/+3/5EVVF29lGzkjwm:X4NHD9fwAsClW3/aVV09l8qwm |
SpecialCode | |
TLSH | T135F054A3448C0DEFE112915C340DE4C1B5F8A6A067B108709C721987A02B3258E81614 |
db | nsrl_modern_rds |
insert-timestamp | 1728989949.7833545 |
mimetype | inode/symlink |
source | snap:LqkzEeUVKowZQXKarpGbLdnB0e7u3lPt_7 |
hashlookup:parent-total | 912 |
hashlookup:trust | 100 |
The searched file hash is included in 912 parent files which include package known and seen by metalookup. A sample is included below:
Key | Value |
---|---|
FileSize | 31192 |
MD5 | 1524F44ED5708876B08754B4A6B174E4 |
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.8.1+dfsg-2 |
SHA-1 | 010F0876F8CDAC7DAF98D91236EB8A07372FCA98 |
SHA-256 | A0E58BDDB4DE677BEF38A028C1B0E0C131F920A650AFCFC82BB441C25356DF8E |
Key | Value |
---|---|
FileSize | 18900 |
MD5 | C581423750F833CC8198589E3BA35EFD |
PackageDescription | configuration routines for all SuiteSparse modules Suitesparse is a collection of libraries for computations involving sparse matrices. . The SuiteSparse_config library provides configuration routines that are common to all SuiteSparse libraries. |
PackageMaintainer | Debian Science Team <debian-science-maintainers@lists.alioth.debian.org> |
PackageName | libsuitesparseconfig4 |
PackageSection | libs |
PackageVersion | 1:4.5.4-1 |
SHA-1 | 0115177E710613D3D4C6359FF15769579C73B83A |
SHA-256 | F91E65ED15CF22C1E7A659BBE0F4BA701195B2F3D70B2BB66EB382A9EDDFFA85 |
Key | Value |
---|---|
FileSize | 68102 |
MD5 | 367B8B1FBE02D2856582B8A68508309E |
PackageDescription | concise sparse matrix library (complex, int and long int support) Suitesparse is a collection of libraries for computations involving sparse matrices. This package includes the following dynamic library: . CXSparse CSparse extended: complex matrix, int and long int support |
PackageMaintainer | Ubuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com> |
PackageName | libcxsparse3.1.2 |
PackageSection | libs |
PackageVersion | 1:4.2.1-3ubuntu1 |
SHA-1 | 0125A638358AC55631673919950ACCE54FF45226 |
SHA-256 | 26F00B0C8194E947C1F6B88D748AF1E579ECAE3CCA4702120C5D3CBEA34BE3D6 |
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 | 1813522 |
MD5 | 49D081931E3133824BAEF38F436D06D3 |
PackageDescription | libraries for sparse matrices computations (debugging symbols) Suitesparse is a collection of libraries for computations involving sparse matrices. This package includes the following libraries: . AMD approximate minimum degree ordering . CAMD symmetric approximate minimum degree . BTF permutation to block triangular form (beta) . COLAMD column approximate minimum degree ordering . CCOLAMD constrained column approximate minimum degree ordering . CHOLMOD sparse Cholesky factorization . CSparse a concise sparse matrix package . CXSparse CSparse extended: complex matrix, int and long int support . KLU sparse LU factorization, primarily for circuit simulation . LDL a simple LDL' factorization . UMFPACK sparse LU factorization . SPQR sparse QR factorization . SuiteSparse_config configuration file for all the above packages. . This package contains the debug libraries (stored in /usr/lib/debug). |
PackageMaintainer | Debian Science Team <debian-science-maintainers@lists.alioth.debian.org> |
PackageName | libsuitesparse-dbg |
PackageSection | debug |
PackageVersion | 1:4.2.1-3 |
SHA-1 | 018EA9F5436B533C6A0AB09B8C823100C434CBC0 |
SHA-256 | 30181C5F34781014B95F4ABA3C6563D58D143F1D57427A311C88872616F78B7D |
Key | Value |
---|---|
FileSize | 60712 |
MD5 | A6D0E595F206F7106EC9F51E48CC51EA |
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.8.1+dfsg-2 |
SHA-1 | 01A394CF892B5264EC2F92734D198FEBA1AEB86E |
SHA-256 | 36D2EA73FF2669F5F546304B756758B40F393FFFFA54A6CA912125B048E2BB81 |
Key | Value |
---|---|
FileSize | 27316 |
MD5 | 358662380EE5D56F5A678DE9475F98CF |
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.8.1+dfsg-2 |
SHA-1 | 01AED205E03151F28666D5399CE2C63402F49C24 |
SHA-256 | 6FD88E54812D59962E9C57A4453A8028B303ADD5A575B778C96DA8845C701756 |
Key | Value |
---|---|
FileSize | 18970 |
MD5 | 6FAD48BCAECA8E5887EA3282FDED90A2 |
PackageDescription | configuration routines for all SuiteSparse modules Suitesparse is a collection of libraries for computations involving sparse matrices. . The SuiteSparse_config library provides configuration routines that are common to all SuiteSparse libraries. |
PackageMaintainer | Debian Science Team <debian-science-maintainers@lists.alioth.debian.org> |
PackageName | libsuitesparseconfig4 |
PackageSection | libs |
PackageVersion | 1:4.5.4-1 |
SHA-1 | 0238B3E84E6B04068D97DB6FA6AFA4DEF065D965 |
SHA-256 | F4CC3F722450A4989EDAF3FB808D71362F1352CF7C75C468ABA61ECCF2B7DEAA |
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 |