Parents (Total: 240)

The searched file hash is included in 240 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	64064
MD5	553374894CA4CAE59183C5B8D066B8B8
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
PackageSection	libs
PackageVersion	1:4.5.3-1
SHA-1	02AF03F409B9C5B15F93A7CF9B02F6DFA507AA23
SHA-256	F528B9805716A8831A85D458179F98E6646A4A26CFA6CA4217A04CFC4D61CDAC

Key	Value
FileSize	74996
MD5	19A1F8291BE5BF5F38DE766F3D98E918
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	Ubuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com>
PackageName	libcxsparse3
PackageSection	libs
PackageVersion	1:4.5.3-1
SHA-1	095CCB9B4698FF3598C0600092A50951A5F70326
SHA-256	757B72E1D9D6EEBC5EFBBF3D4F09E8DA2E44EB612662BF0CF34F2F783D685283

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	13356
MD5	EEB32D150735CD406330B5DA2E915A18
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
PackageSection	libs
PackageVersion	1:4.5.3-1
SHA-1	0BF81485D336559C188DFA60256AA735A9CADA64
SHA-256	E8C9D0BB689B9831EE5E7311CA9007C219A8524CEADCB482E466C12F22EA96E3

Key	Value
FileSize	9506
MD5	231A6F74725910B97857357DC3B4365A
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
PackageSection	libs
PackageVersion	1:4.5.3-1
SHA-1	0C36FC73BF4E01AA33535C84255FF3DAA335C27F
SHA-256	B9742D95539316D9B87B63D4DAF6BBFB0B589875EF9FBE0E57090AFB0565723C

Key	Value
FileSize	22092
MD5	985EAA81EF1DFFC52DCA16132310526F
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
PackageSection	libs
PackageVersion	1:4.5.3-1
SHA-1	0D399939F86E3AC199E862D05D44A4B70507C5F2
SHA-256	1A26DAF148908ED3BC69A8562923B79D2F058B551E76805732E68F615FF9AB95