Parents (Total: 141)

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

Key	Value
FileSize	18900
MD5	C581423750F833CC8198589E3BA35EFD
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	Debian Science Team <debian-science-maintainers@lists.alioth.debian.org>
PackageName	libsuitesparseconfig4
PackageSection	libs
PackageVersion	1:4.5.4-1
SHA-1	0115177E710613D3D4C6359FF15769579C73B83A
SHA-256	F91E65ED15CF22C1E7A659BBE0F4BA701195B2F3D70B2BB66EB382A9EDDFFA85

Key	Value
FileSize	18970
MD5	6FAD48BCAECA8E5887EA3282FDED90A2
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	Debian Science Team <debian-science-maintainers@lists.alioth.debian.org>
PackageName	libsuitesparseconfig4
PackageSection	libs
PackageVersion	1:4.5.4-1
SHA-1	0238B3E84E6B04068D97DB6FA6AFA4DEF065D965
SHA-256	F4CC3F722450A4989EDAF3FB808D71362F1352CF7C75C468ABA61ECCF2B7DEAA

Key	Value
FileSize	65300
MD5	CE6E3F0BE24F1FEB9196C2E608BB980B
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:4.5.4-1
SHA-1	0256019F0704560DBE3E99C5DFA02AE9AC1B05A4
SHA-256	360F807C1DBBFCA7E360943BCE3530B82A0D1345E33F20DE09CCA99772CCB357

Key	Value
FileSize	27398
MD5	999B24E23518E52A9E8142B52BDADF58
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	Debian Science Team <debian-science-maintainers@lists.alioth.debian.org>
PackageName	libcamd2
PackageSection	libs
PackageVersion	1:4.5.4-1
SHA-1	0A8F5CE042C9032500672CCD389D978ACF45CB7B
SHA-256	8026ED20C789C6374834AD43EA45E2B98CF72E38B925AC694B327A2C8989D2FD

Key	Value
FileSize	74676
MD5	4290C42E04AE4A442CE6359C18187CF3
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:4.5.4-1
SHA-1	0ACD46C8B97C54CEAA1E9A608128C6435D16A305
SHA-256	A940FC48F06CEA0C3BA9F8FE20522C123D2E26354EA62793F5AAD4269D161619

Key	Value
FileSize	36288
MD5	4702D123F6DE9338BF0BC8D3E4ACE6A9
PackageDescription	approximate minimum degree ordering library for sparse matrices Suitesparse is a collection of libraries for computations involving sparse matrices. . The AMD library provides a set of routines for pre-ordering sparse matrices prior to Cholesky or LU factorization, using the "Approximate Minimum Degree ordering" algorithm.
PackageMaintainer	Debian Science Team <debian-science-maintainers@lists.alioth.debian.org>
PackageName	libamd2
PackageSection	libs
PackageVersion	1:4.5.4-1
SHA-1	114A13D16F237E6B17E6CCCD0EF7BEBED32F74CE
SHA-256	C4214AFD1A1EFCC45FF78A75E87B911F19D4F13F78E12627CB4ED5B972FCED6B

Key	Value
FileSize	19066
MD5	680AFC83475286D68C0E8EE808418C2D
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	Debian Science Team <debian-science-maintainers@lists.alioth.debian.org>
PackageName	libsuitesparseconfig4
PackageSection	libs
PackageVersion	1:4.5.4-1
SHA-1	12061626C39FBD0F0D138103E7C90CD5F559F0C0
SHA-256	542FCDE64C3000BADD31107FB102C326D93CC871B670FAAD8264DA3594AF41B8

Key	Value
FileSize	23960
MD5	F22D095B4857B691E2CDEBEC7187A8A7
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:4.5.4-1
SHA-1	13D97B62DD5E7A93EEE50BD44978378B87CB5D3F
SHA-256	F3FD25827AC4F6896D3A60C2CAE39C7A8592BAFF4F341B4053E267C72771AF51

Key	Value
FileSize	20272
MD5	90FA59BFE45DE13A770BC84376D258B4
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	Debian Science Team <debian-science-maintainers@lists.alioth.debian.org>
PackageName	libbtf1
PackageSection	libs
PackageVersion	1:4.5.4-1
SHA-1	181AD508A9CE0943CEE0C8AB50C0E2897D9A78AA
SHA-256	BDAF142754427C7F2EB45A4E959113CF9863FEAF30CC51F492651A607FCA4AF0

Key	Value
FileSize	1846520
MD5	D202028B581D40D986C6DAD3294B8695
PackageDescription	libraries for sparse matrices computations (documentation) Suitesparse is a collection of libraries for computations involving sparse matrices. This package contains the user guides for the libraries distributed by the SuiteSparse project.
PackageMaintainer	Debian Science Team <debian-science-maintainers@lists.alioth.debian.org>
PackageName	libsuitesparse-doc
PackageSection	doc
PackageVersion	1:4.5.4-1
SHA-1	1AC4668EBE9A5FD305DF650D964E242EDBEE3090
SHA-256	8705D270E699C98AEC45602799CD965F3C5559CAB8DEA969F1D4C62190A03535