Result for F448879545D41134CF2ABE2A5688F5BEC1124990

Query result

Key Value
FileName./usr/share/licenses/libcholmod3/ChangeLog
FileSize13292
MD5431F43C77BCEFB651F65FFE737758DDC
SHA-1F448879545D41134CF2ABE2A5688F5BEC1124990
SHA-256957872B3EE19B61F85331AC7F14D95F39D86B30228F211A2558C4B938B094D5E
SSDEEP384:MPO0CfNcYPS4dUvC44BhPWqq9W3bify0LtjrGXB3h0Y51zw:MPOreYPS46C44XPWqq9WufZJGR3h55K
TLSHT12D52842A32CA2273E16112D28FDBEEA0D77C525F67564640700F92382FA39BD536F758
hashlookup:parent-total2
hashlookup:trust60

Network graph view

Parents (Total: 2)

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
MD5CD987399C8D97104AF04B58EA9B3EFBD
PackageArchx86_64
PackageDescriptionCHOLMOD 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.
PackageNamelibcholmod3
PackageRelease59.1
PackageVersion3.0.13
SHA-12F521AF0FE6CF336FF1D427E9E3D4569699F871F
SHA-2563FF0C07778CE78AB9426A777CFD586F6A1EAA076BECC9CC308868E45307CB6EA
Key Value
MD55698970664F3A2CD2F3E1D693FC11877
PackageArchx86_64
PackageDescriptionCHOLMOD 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.
PackageNamelibcholmod3
PackageReleaselp150.59.1
PackageVersion3.0.13
SHA-1CBF2BB42AF275CE26D48EDC3724D7CEF2F861435
SHA-2560D71184AEAD16B087F29D708D3800DBE31F45B2EA1339C7EA1E5DDA5A1FC7609