Key | Value |
---|---|
FileName | changelog.gz |
FileSize | 5772 |
MD5 | 8E0EADB0F4A9DFAE52D10B6CFC0AB671 |
RDS:package_id | 294729 |
SHA-1 | 1987388BFA858353444DBC37F4BC42CFE378E8A6 |
SHA-256 | 4CBBF2CAF39520A247BEEA735AACECF4FD44A1D8B190F3631D11345EDA547DFF |
SSDEEP | 96:QcgyTiSjuLNsKewean5I/cbCnCZBTxSMynOpP6box2aH3lmTgTr9ggD2yy:QcjFAnIEO6BTUMyOP8UTraI2yy |
TLSH | T19AC18F6D0314A6B36309256201BA1AC39ACFDAE423CD55A5CDAF913DAD79E00870719E |
insert-timestamp | 1696432821.329536 |
source | db.sqlite |
hashlookup:parent-total | 163 |
hashlookup:trust | 100 |
The searched file hash is included in 163 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 | 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 | 81216 |
MD5 | 037F3FA1A1ACE7BCEDD09899BBF8C5E9 |
PackageDescription | circuit simulation sparse LU factorization library Suitesparse is a collection of libraries for computations involving sparse matrices. . The KLU library provides routines for LU factorization, primarily for circuit simulation. |
PackageMaintainer | Debian Science Team <debian-science-maintainers@lists.alioth.debian.org> |
PackageName | libklu1 |
PackageSection | libs |
PackageVersion | 1:5.8.1+dfsg-2 |
SHA-1 | 0288AF3E7983C60EDFF7C6724E1D2774E410F963 |
SHA-256 | C43812B0B2E5E9DFF7BD807F23C893771F053AE898F2FB13E678921161B54FC0 |
Key | Value |
---|---|
FileSize | 33472 |
MD5 | 3CE34CC2B37D3DF6FA7AA98A756A4FD7 |
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.8.1+dfsg-2 |
SHA-1 | 0379DDB73000C4C23CF78DF61CE898B8676CBA9C |
SHA-256 | B51FC5D5F6ADB0637E15E37036B37C7E71298814AA1E5875E34C577A4B8275F5 |
Key | Value |
---|---|
FileSize | 6444024 |
MD5 | 368D0976E3C54C2E3252AA6A3F0D0994 |
PackageDescription | libraries for sparse matrices computations (development files) 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 . CXSparse a concise sparse matrix package . KLU sparse LU factorization, primarily for circuit simulation . LDL a simple LDL' factorization . UMFPACK sparse LU factorization . RBio read/write sparse matrices in Rutherford/Boeing format . SPQR sparse QR factorization . GraphBLAS graph algorithms via sparse matrix operations on semirings . Mongoose graph partitioning library that can quickly compute edge cuts . SLIP_LU solves sparse linear systems in exact arithmetic . SuiteSparse_config configuration routines for all the above packages. . This package contains the static libraries and header files. |
PackageMaintainer | Debian Science Team <debian-science-maintainers@lists.alioth.debian.org> |
PackageName | libsuitesparse-dev |
PackageSection | libdevel |
PackageVersion | 1:5.8.1+dfsg-2 |
SHA-1 | 06D28B27613B1E5423339D7A4CE52B67BB04D7FA |
SHA-256 | 49A8630EBF0A6F340E99FBD9E0025CC693492270B767CC06B2326B438FFF550A |
Key | Value |
---|---|
FileSize | 62332 |
MD5 | 8C33996C8C752D9DFA210816BFDB2663 |
PackageDescription | circuit simulation sparse LU factorization library Suitesparse is a collection of libraries for computations involving sparse matrices. . The KLU library provides routines for LU factorization, primarily for circuit simulation. |
PackageMaintainer | Debian Science Team <debian-science-maintainers@lists.alioth.debian.org> |
PackageName | libklu1 |
PackageSection | libs |
PackageVersion | 1:5.8.1+dfsg-2 |
SHA-1 | 081F2302235EBC546E0CC60E2BEF8F50BA36A127 |
SHA-256 | C383A34AAE5DFD536AC44A503CAAAE82773F2498CB88D345A963F4CB183285DB |
Key | Value |
---|---|
FileSize | 24416 |
MD5 | E92BF01FF89FA07E6BC70F1480D65402 |
PackageDescription | simple LDL' factorization library for sparse matrices Suitesparse is a collection of libraries for computations involving sparse matrices. . The LDL library provides routines for sparse LDL' factorization and solving. These routines are not terrifically fast (they do not use dense matrix kernels), but the code is very short and concise. The purpose is to illustrate the algorithms in a very concise and readable manner, primarily for educational purposes. |
PackageMaintainer | Debian Science Team <debian-science-maintainers@lists.alioth.debian.org> |
PackageName | libldl2 |
PackageSection | libs |
PackageVersion | 1:5.8.1+dfsg-2 |
SHA-1 | 0B26AACCCB9C6C65EABA763655E24E616362FC89 |
SHA-256 | 5212D8FF82FC35D5089FBA2D86C56A9892D577B867311D2E23F73777F31DA558 |
Key | Value |
---|---|
FileSize | 24744 |
MD5 | FB45735B8F8D6035803328C0FD8B65CF |
PackageDescription | graph partitioning tool that can quickly compute edge cuts (executable) 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 standalone executable. |
PackageMaintainer | Debian Science Team <debian-science-maintainers@lists.alioth.debian.org> |
PackageName | mongoose |
PackageSection | math |
PackageVersion | 1:5.8.1+dfsg-2 |
SHA-1 | 0F439A4F27F1D0656A60BA65BAEDF3FB49A77BF3 |
SHA-256 | 4C5628CB7807E1953DFD63CAAEDA840B9CE4CC43851FB3525F3B51FB3916A3EB |
Key | Value |
---|---|
FileSize | 73364 |
MD5 | 7806C693BCFC309F6EE1F9916A13A2D9 |
PackageDescription | sparse QR factorization library Suitesparse is a collection of libraries for computations involving sparse matrices. . SuiteSparseQR (SPQR) is a multithreaded, multifrontal, rank-revealing sparse QR factorization method. |
PackageMaintainer | Debian Science Team <debian-science-maintainers@lists.alioth.debian.org> |
PackageName | libspqr2 |
PackageSection | libs |
PackageVersion | 1:5.8.1+dfsg-2 |
SHA-1 | 114366B0AE4B92AD3BC40B6F20D789B783AFD3C7 |
SHA-256 | ABC513892A6AE0B9AAB11F8B97D3144BD90C6E2DB21ED46B0C8AEFCE0065DA45 |