Key | Value |
---|---|
CRC32 | 3FA08C36 |
FileName | ./usr/share/doc/libumfpack5.7.1/copyright |
FileSize | 7590 |
MD5 | E6A30B79AA09C10D54DD60D96B32921D |
OpSystemCode | {'MfgCode': '1006', 'OpSystemCode': '362', 'OpSystemName': 'TBD', 'OpSystemVersion': 'none'} |
ProductCode | {'ApplicationType': 'Operating System', 'Language': 'English', 'MfgCode': '1111', 'OpSystemCode': '999', 'ProductCode': '187092', 'ProductName': 'Ubuntu LTS (Xenial Xerus) 32-bit PC (i386) Desktop', 'ProductVersion': '16.04.4'} |
RDS:package_id | 222721 |
SHA-1 | B1F7C0E3220932160F96E4914F40A2A23F86C8B6 |
SHA-256 | EC0B5B6CC25EA2C884D3B326BACBD090909E53B720A707F77B48A63CF9CAAC3E |
SSDEEP | 192:fK+fZ5+VPXYrs6rs//3n3sQx/BViSCflorsYrsWt/363xCPb3pfl3P6YGAXg:Hfxrs6rs/P3TrsYrsUPExM3pfl3P6YG3 |
SpecialCode | |
TLSH | T1D1F1D60E0680CBFBAAD023E13916CFD9F165BAAA352A5805744DD35A9F1793F21F31E4 |
db | nsrl_modern_rds |
insert-timestamp | 1727040704.093111 |
source | RDS.db |
hashlookup:parent-total | 29 |
hashlookup:trust | 100 |
The searched file hash is included in 29 parent files which include package known and seen by metalookup. A sample is included below:
Key | Value |
---|---|
FileSize | 11468 |
MD5 | 846A8CA5DF6ED82E8B190E1C6B0846ED |
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 | Ubuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com> |
PackageName | libcolamd2.9.1 |
PackageSection | libs |
PackageVersion | 1:4.4.6-1 |
SHA-1 | 08C114349C16B56BCED0C59069F9D5E3D188180D |
SHA-256 | FE0EDD7C5E008D2AECA2B44069CE49617C6E65742ABD9CB80538F0295DE21C10 |
Key | Value |
---|---|
FileSize | 71550 |
MD5 | 64D71E936D860A1B04C643B14A56C20A |
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 | Ubuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com> |
PackageName | libklu1.3.3 |
PackageSection | libs |
PackageVersion | 1:4.4.6-1 |
SHA-1 | 09292DE8FF8BABA6FD0D112034C4AB4096723839 |
SHA-256 | 1641A4125CC9E52495B4991C93D405E3717EC090ECB01A9DB304E3A1BB8E2171 |
Key | Value |
---|---|
FileSize | 20028 |
MD5 | 6FAEDE14210EFD541DA237F31ABF6387 |
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 | Ubuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com> |
PackageName | libcamd2.4.1 |
PackageSection | libs |
PackageVersion | 1:4.4.6-1 |
SHA-1 | 0CB59CAAF0AACE14B7D389EFAC493C239D99DE8F |
SHA-256 | 70E64BFAE2EE15B3B8D7FD7E9A6F781EFE7D0F492B37CC1CE26B69EFA6247C21 |
Key | Value |
---|---|
FileSize | 10766 |
MD5 | 5398DEC5E1801EBABC695749538351AD |
PackageDescription | permutation to block triangular form library for sparse matrices Suitesparse is a collection of libraries for computations involving sparse matrices. . The BTF library is a software package for permuting a matrix into Block upper Triangular Form. It includes a maximum transversal algorithm, which finds a permutation of a square or rectangular matrix so that it has a zero-free diagonal (if one exists); otherwise, it finds a maximal matching which maximizes the number of nonzeros on the diagonal. The package also includes a method for finding the strongly connected components of a graph. These two methods together give the permutation to block upper triangular form. |
PackageMaintainer | Ubuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com> |
PackageName | libbtf1.2.1 |
PackageSection | libs |
PackageVersion | 1:4.4.6-1 |
SHA-1 | 1634F31BA891676715F6CF54DD605EE8F1503404 |
SHA-256 | AB531EED77ED41F37853A58A6F5B452CD2FF48AE39F7940298FBF019911B7F1D |
Key | Value |
---|---|
FileSize | 9322 |
MD5 | 66773D8B869F77905127FCC1877FFF35 |
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 | Ubuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com> |
PackageName | libsuitesparseconfig4.4.6 |
PackageSection | libs |
PackageVersion | 1:4.4.6-1 |
SHA-1 | 1DF5B8F9553294769BE7AC2130DFA0E8C1C0DCAA |
SHA-256 | 5CD9F510722F585DB98CCC7D0E3C953E6D2AB5F357FBA284CB6678AC5EA88EEF |
Key | Value |
---|---|
FileSize | 898524 |
MD5 | 6105E9C7BF43B5E58A58BED7ABD5FE81 |
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 . 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 routines for all the above packages. . This package contains the static libraries and header files. |
PackageMaintainer | Ubuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com> |
PackageName | libsuitesparse-dev |
PackageSection | libdevel |
PackageVersion | 1:4.4.6-1 |
SHA-1 | 1F76E52497FACBC6764CDC37E38A1D460CCA5771 |
SHA-256 | B8EE3BCB6C2147E8239FCCE9C2053EB49EB6DAA0CE20FF49671E4A168660D34F |
Key | Value |
---|---|
FileSize | 46576 |
MD5 | E67C1FBEE79E415B12E0FE87FEEF640C |
PackageDescription | concise sparse matrix library (complex, int and long int support) Suitesparse is a collection of libraries for computations involving sparse matrices. . The CXSparse library is a version of CSparse (see libcsparse package) that operates on both real and complex matrices. |
PackageMaintainer | Ubuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com> |
PackageName | libcxsparse3.1.4 |
PackageSection | libs |
PackageVersion | 1:4.4.6-1 |
SHA-1 | 267E989230410CD774B1CAEC524C19B761CAA9E6 |
SHA-256 | 8F21885DCF607027B22E4F1FC93E1DEDD5D16CA4D4BCFF647E5C99C73D7103AB |
Key | Value |
---|---|
FileSize | 21472 |
MD5 | F521DEF0AE2576F8BB3036CFFA73DD89 |
PackageDescription | constrained column approximate library for sparse matrices Suitesparse is a collection of libraries for computations involving sparse matrices. . The CCOLAMD library implements the "Constrained 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 | Ubuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com> |
PackageName | libccolamd2.9.1 |
PackageSection | libs |
PackageVersion | 1:4.4.6-1 |
SHA-1 | 28504B3CAAB7BE13861D3595C2229023CBBAD17B |
SHA-256 | FB0EB5C84EA99AA3DAA0911F7F2726A1AA591673CA2C1E93DDBDF6D4EEB77BE8 |
Key | Value |
---|---|
FileSize | 26320 |
MD5 | 96865997532552FBB032482970160575 |
PackageDescription | concise sparse matrix library Suitesparse is a collection of libraries for computations involving sparse matrices. . The CSparse 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 CSparse will not be competitive with UMFPACK or CHOLMOD, but the codes are much more concise and easy to understand. Other methods are competitive. |
PackageMaintainer | Ubuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com> |
PackageName | libcsparse3.1.4 |
PackageSection | libs |
PackageVersion | 1:4.4.6-1 |
SHA-1 | 2AF79C0413AA99C6ECAF7CB2F7F26BCB5851AD4E |
SHA-256 | 83C4D43A0B5692616A4A5827ACD7A65A8063C7301FFAE2C48A3918C8C0CA5A0D |
Key | Value |
---|---|
FileSize | 65670 |
MD5 | A1B758534DCD43084BBD1575061309E3 |
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 | Ubuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com> |
PackageName | libspqr2.0.2 |
PackageSection | libs |
PackageVersion | 1:4.4.6-1 |
SHA-1 | 2F4ECCBC556AF40D231CEEC4B1F2FB4E28B084DF |
SHA-256 | 24E5834EDEB245C7E5882D0707F23F2BE87C52E69D521E3F2D0EFFF6DA68F94A |