Key | Value |
---|---|
FileName | ./usr/share/licenses/libcholmod3/ChangeLog |
FileSize | 13292 |
MD5 | 431F43C77BCEFB651F65FFE737758DDC |
SHA-1 | F448879545D41134CF2ABE2A5688F5BEC1124990 |
SHA-256 | 957872B3EE19B61F85331AC7F14D95F39D86B30228F211A2558C4B938B094D5E |
SSDEEP | 384:MPO0CfNcYPS4dUvC44BhPWqq9W3bify0LtjrGXB3h0Y51zw:MPOreYPS46C44XPWqq9WufZJGR3h55K |
TLSH | T12D52842A32CA2273E16112D28FDBEEA0D77C525F67564640700F92382FA39BD536F758 |
hashlookup:parent-total | 2 |
hashlookup:trust | 60 |
The searched file hash is included in 2 parent files which include package known and seen by metalookup. A sample is included below:
Key | Value |
---|---|
MD5 | CD987399C8D97104AF04B58EA9B3EFBD |
PackageArch | x86_64 |
PackageDescription | CHOLMOD is a set of ANSI C routines for sparse Cholesky factorization and update/downdate. A MATLAB interface is provided. The performance of CHOLMOD was compared with 10 other codes in a paper by Nick Gould, Yifan Hu, and Jennifer Scott. see also their raw data. Comparing BCSLIB-EXT, CHOLMOD, MA57, MUMPS, Oblio, PARDISO, SPOOLES, SPRSBLKLLT, TAUCS, UMFPACK, and WSMP, on 87 large symmetric positive definite matrices, they found CHOLMOD to be fastest for 42 of the 87 matrices. Its run time is either fastest or within 10% of the fastest for 73 out of 87 matrices. Considering just the larger matrices, it is either the fastest or within 10% of the fastest for 40 out of 42 matrices. It uses the least amount of memory (or within 10% of the least) for 35 of the 42 larger matrices. Jennifer Scott and Yifan Hu also discuss the design considerations for a sparse direct code. CHOLMOD is part of the SuiteSparse sparse matrix suite. |
PackageName | libcholmod3 |
PackageRelease | 59.1 |
PackageVersion | 3.0.13 |
SHA-1 | 2F521AF0FE6CF336FF1D427E9E3D4569699F871F |
SHA-256 | 3FF0C07778CE78AB9426A777CFD586F6A1EAA076BECC9CC308868E45307CB6EA |
Key | Value |
---|---|
MD5 | 5698970664F3A2CD2F3E1D693FC11877 |
PackageArch | x86_64 |
PackageDescription | CHOLMOD is a set of ANSI C routines for sparse Cholesky factorization and update/downdate. A MATLAB interface is provided. The performance of CHOLMOD was compared with 10 other codes in a paper by Nick Gould, Yifan Hu, and Jennifer Scott. see also their raw data. Comparing BCSLIB-EXT, CHOLMOD, MA57, MUMPS, Oblio, PARDISO, SPOOLES, SPRSBLKLLT, TAUCS, UMFPACK, and WSMP, on 87 large symmetric positive definite matrices, they found CHOLMOD to be fastest for 42 of the 87 matrices. Its run time is either fastest or within 10% of the fastest for 73 out of 87 matrices. Considering just the larger matrices, it is either the fastest or within 10% of the fastest for 40 out of 42 matrices. It uses the least amount of memory (or within 10% of the least) for 35 of the 42 larger matrices. Jennifer Scott and Yifan Hu also discuss the design considerations for a sparse direct code. CHOLMOD is part of the SuiteSparse sparse matrix suite. |
PackageName | libcholmod3 |
PackageRelease | lp150.59.1 |
PackageVersion | 3.0.13 |
SHA-1 | CBF2BB42AF275CE26D48EDC3724D7CEF2F861435 |
SHA-256 | 0D71184AEAD16B087F29D708D3800DBE31F45B2EA1339C7EA1E5DDA5A1FC7609 |