Parents (Total: 171)

The searched file hash is included in 171 parent files which include package known and seen by metalookup. A sample is included below:

Key	Value
FileSize	227292
MD5	BA6A30CB673FC627B43FBB5A288A9629
PackageDescription	sparse Cholesky factorization library for sparse matrices Suitesparse is a collection of libraries for computations involving sparse matrices. . The CHOLMOD library provides a set of routines for factorizing sparse symmetric positive definite matrices of the form A or AA', updating/downdating a sparse Cholesky factorization, solving linear systems, updating/downdating the solution to the triangular system Lx=b, and many other sparse matrix functions for both symmetric and unsymmetric matrices. Its supernodal Cholesky factorization relies on LAPACK and the Level-3 BLAS, and obtains a substantial fraction of the peak performance of the BLAS.
PackageMaintainer	Debian Science Team <debian-science-maintainers@lists.alioth.debian.org>
PackageName	libcholmod3
PackageSection	libs
PackageVersion	1:5.4.0+dfsg-1
SHA-1	027F7E8C02413DAC71DF379D480DEFF3DC6C53B7
SHA-256	847A0282ED1FBC1D189E04B21CEE11E39563085E35825BD8AAC28C703C489C0E

Key	Value
FileSize	319036
MD5	3F570A0A89C7A16E377C669A1716F669
PackageDescription	sparse Cholesky factorization library for sparse matrices Suitesparse is a collection of libraries for computations involving sparse matrices. . The CHOLMOD library provides a set of routines for factorizing sparse symmetric positive definite matrices of the form A or AA', updating/downdating a sparse Cholesky factorization, solving linear systems, updating/downdating the solution to the triangular system Lx=b, and many other sparse matrix functions for both symmetric and unsymmetric matrices. Its supernodal Cholesky factorization relies on LAPACK and the Level-3 BLAS, and obtains a substantial fraction of the peak performance of the BLAS.
PackageMaintainer	Debian Science Team <debian-science-maintainers@lists.alioth.debian.org>
PackageName	libcholmod3
PackageSection	libs
PackageVersion	1:5.4.0+dfsg-1
SHA-1	0398EAEBF9222B5607CAF60BCDBC68AC77E09801
SHA-256	3BE8BB2D91BD1432DF171CA9294C796F823C9D599887DE93BEB6965A96CE83C2

Key	Value
FileSize	61644
MD5	8146E874F66523378A2CC0BA39A8CCE7
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.4.0+dfsg-1
SHA-1	07197ECAFEF70826F1CA8EBC4FC405B18466FF4D
SHA-256	625C65053F0D5373B27D3703527C3FA9E7B5F11624BB9F502EEC4AE818775B3B

Key	Value
FileSize	149128
MD5	4709A50E2E5CC9E5B30BEA6D3A4B8294
PackageDescription	sparse LU factorization library Suitesparse is a collection of libraries for computations involving sparse matrices. . The UMFPACK library provides a set of routines solving sparse linear systems via LU factorization.
PackageMaintainer	Debian Science Team <debian-science-maintainers@lists.alioth.debian.org>
PackageName	libumfpack5
PackageSection	libs
PackageVersion	1:5.4.0+dfsg-1
SHA-1	0759E69B9346D15E826A3EBE751567F1536C0980
SHA-256	2E699A4F2E773B6C9A72BCD088393316D589231757C3BEF7469E34BCDA491171

Key	Value
FileSize	2772032
MD5	88508C0B9F09D77237E813EB72D94027
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	libgraphblas2
PackageSection	libs
PackageVersion	1:5.4.0+dfsg-1
SHA-1	08134459DB9A0E91EF2B9EA67E04F7D8795808CF
SHA-256	89138B823843E0F911B6299D6E426775973557E0FE0FC543FDA59E4F40B14502

Key	Value
FileSize	29204
MD5	C48FBDE995C18741624D276FCB14CF1F
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.4.0+dfsg-1
SHA-1	088DAAF72BEF55B180C082CDA56B21BC608613B9
SHA-256	51B1F50012D662EA6C2A088406ED079A59BBC587195B54A4C05660022B90FCB1

Key	Value
FileSize	3745816
MD5	D0897238522160515350C17D0E62D509
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 . 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.4.0+dfsg-1
SHA-1	088E569A85DDC6D4A81A421DB18EFFBE45D68500
SHA-256	3FAACAEB1582BA87E38E6EB0A5F1B370C10DE0DFC954BB0D8B79A52C83BA8934

Key	Value
FileSize	22284
MD5	72FD371A7FFF881B6FB3B0EC1295955D
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.4.0+dfsg-1
SHA-1	092773DD5FCE90EA42AB8B1CE0E8E7D8B4097BB3
SHA-256	A2B1E41BECEF108460106140AF68C59A92D23F2FC9284FCF7C6C57A4C6B2B0DF

Key	Value
FileSize	22788
MD5	CF0AD305FED3B720C6B920FA04B7481A
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.4.0+dfsg-1
SHA-1	0BC445ED25B982BB9BBBF79AE908D63E2477D9C4
SHA-256	8C473EC1F34E8F073162CA4E55F33A218B5501A1F6D9B7A8C265BB69FE1DF574

Key	Value
FileSize	69112
MD5	81C52AA7FA92DA240D9D3B1239EEA349
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.4.0+dfsg-1
SHA-1	0CE42FBFE35CFF3B5030222ABBF2CC73E96B0B4B
SHA-256	B4B77EBDF94A5EEC56802E027244C28130AAD265F7FD21CACF2E39F54EB85626