Parents (Total: 31)

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

Key	Value
MD5	7E6877CD710DED8A42D245E815E18309
PackageArch	x86_64
PackageDescription	The COLAMD column approximate minimum degree ordering algorithm 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. SYMAMD is a symmetric minimum degree ordering method based on COLAMD, available as a MATLAB-callable function. It constructs a matrix M such that M'*M has the same pattern as A, and then uses COLAMD to compute a column ordering of M. Colamd and symamd tend to be faster and generate better orderings than their MATLAB counterparts, colmmd and symmmd. COLAMD is part of the SuiteSparse sparse matrix suite.
PackageMaintainer	https://bugs.opensuse.org
PackageName	libcolamd2
PackageRelease	lp152.5.10
PackageVersion	2.9.6
SHA-1	0437EF0F1194F525779DFC80971DE0E4B5CA4F07
SHA-256	AC679E1EA2E1DE30D1598C1BCFCC9913330D1E8888BFD16ADC222040BE57C487

Key	Value
MD5	F6A2D7D1EFA0D57B2F45CCC192CF34B5
PackageArch	x86_64
PackageDescription	The COLAMD column approximate minimum degree ordering algorithm 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. SYMAMD is a symmetric minimum degree ordering method based on COLAMD, available as a MATLAB-callable function. It constructs a matrix M such that M'*M has the same pattern as A, and then uses COLAMD to compute a column ordering of M. Colamd and symamd tend to be faster and generate better orderings than their MATLAB counterparts, colmmd and symmmd. COLAMD is part of the SuiteSparse sparse matrix suite.
PackageName	libcolamd2
PackageRelease	lp150.59.1
PackageVersion	2.9.6
SHA-1	1558E80A498BF522DB7CB737431CBB59F945FF8B
SHA-256	190371BFB18C7EA5E521BD181B68DEF45DF37D077DDDBF740F1C1E79DC0F000D

Key	Value
MD5	E4DDCD415A3C96499E8934C063CC1FDF
PackageArch	x86_64
PackageDescription	The COLAMD column approximate minimum degree ordering algorithm 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. SYMAMD is a symmetric minimum degree ordering method based on COLAMD, available as a MATLAB-callable function. It constructs a matrix M such that M'*M has the same pattern as A, and then uses COLAMD to compute a column ordering of M. Colamd and symamd tend to be faster and generate better orderings than their MATLAB counterparts, colmmd and symmmd. COLAMD is part of the SuiteSparse sparse matrix suite.
PackageName	libcolamd2
PackageRelease	59.1
PackageVersion	2.9.6
SHA-1	24EAE3387EF2D1274E9E9DD33E84C0037DDBC514
SHA-256	A2ECB052B704CD52A313116A4B439BEB50964A2FC6A3F3B533FB0704B1B357F3

Key	Value
MD5	5D78CA30C8C10C5649F86F00A69172BE
PackageArch	x86_64
PackageDescription	The COLAMD column approximate minimum degree ordering algorithm 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. SYMAMD is a symmetric minimum degree ordering method based on COLAMD, available as a MATLAB-callable function. It constructs a matrix M such that M'*M has the same pattern as A, and then uses COLAMD to compute a column ordering of M. Colamd and symamd tend to be faster and generate better orderings than their MATLAB counterparts, colmmd and symmmd. COLAMD is part of the SuiteSparse sparse matrix suite.
PackageName	libcolamd2
PackageRelease	bp153.44.4
PackageVersion	2.9.6
SHA-1	3FE885F4F8DCB129B47D83992B331ED7D82549A6
SHA-256	2DA03D3F90EA495D50482B800E8D115B8C44236278382EFC7A4AAF7643E7D227

Key	Value
MD5	20E9FA6C72E15F406AD8D1968E932682
PackageArch	x86_64
PackageDescription	The COLAMD column approximate minimum degree ordering algorithm 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. SYMAMD is a symmetric minimum degree ordering method based on COLAMD, available as a MATLAB-callable function. It constructs a matrix M such that M'*M has the same pattern as A, and then uses COLAMD to compute a column ordering of M. Colamd and symamd tend to be faster and generate better orderings than their MATLAB counterparts, colmmd and symmmd. COLAMD is part of the SuiteSparse sparse matrix suite.
PackageName	libcolamd2
PackageRelease	bp150.44.1
PackageVersion	2.9.6
SHA-1	4ADAD608D447A14FE95E1CD4E4E6489508446B34
SHA-256	87A3D99116AF7C4525C1FECCB25486819BB2F6C0BA8A15E674281608E4046264

Key	Value
MD5	EA85E24FAF32693D04929907ED590E02
PackageArch	x86_64
PackageDescription	The COLAMD column approximate minimum degree ordering algorithm 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. SYMAMD is a symmetric minimum degree ordering method based on COLAMD, available as a MATLAB-callable function. It constructs a matrix M such that M'*M has the same pattern as A, and then uses COLAMD to compute a column ordering of M. Colamd and symamd tend to be faster and generate better orderings than their MATLAB counterparts, colmmd and symmmd. COLAMD is part of the SuiteSparse sparse matrix suite.
PackageMaintainer	https://bugs.opensuse.org
PackageName	libcolamd-2_9_6
PackageRelease	lp150.2.12
PackageVersion	2.9.6
SHA-1	59CE2A8F93ADCD91E6A164F309E25D534ED13B03
SHA-256	40D5DAE632834D95E9956C97D25072B8FD91E89FE85E143897CDEAE9C20184A0

Key	Value
MD5	337204EE70CFBE95FA5692CD74AB3DB6
PackageArch	x86_64
PackageDescription	The COLAMD column approximate minimum degree ordering algorithm 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. SYMAMD is a symmetric minimum degree ordering method based on COLAMD, available as a MATLAB-callable function. It constructs a matrix M such that M'*M has the same pattern as A, and then uses COLAMD to compute a column ordering of M. Colamd and symamd tend to be faster and generate better orderings than their MATLAB counterparts, colmmd and symmmd. COLAMD is part of the SuiteSparse sparse matrix suite.
PackageName	libcolamd2
PackageRelease	bp152.44.3
PackageVersion	2.9.6
SHA-1	5E711AA8A8473230F849E20E927908100E3371BC
SHA-256	91099CDBE20A7808A2A8BE80ADAA42403AFD8050C5E914CAFA0E5CD698F6EAB1

Key	Value
CRC32	FF593691
FileName	libcolamd2-2.9.6-lp151.4.1.x86_64.rpm
FileSize	44872
MD5	301586346D307618784F270848B71AF3
OpSystemCode	362
PackageArch	x86_64
PackageDescription	The COLAMD column approximate minimum degree ordering algorithm 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. SYMAMD is a symmetric minimum degree ordering method based on COLAMD, available as a MATLAB-callable function. It constructs a matrix M such that M'*M has the same pattern as A, and then uses COLAMD to compute a column ordering of M. Colamd and symamd tend to be faster and generate better orderings than their MATLAB counterparts, colmmd and symmmd. COLAMD is part of the SuiteSparse sparse matrix suite.
PackageMaintainer	https://bugs.opensuse.org
PackageName	libcolamd2
PackageRelease	lp151.4.1
PackageVersion	2.9.6
ProductCode	215189
SHA-1	695A0FF64C7848C4FD84717ED8575032C3F1330B
SHA-256	E171999E96EABB9F8D0AD301DEE13FCE2AA252FAB41F3C42C3D2636ADC327FA1
SpecialCode
db	nsrl_modern_rds
insert-timestamp	1647017067.8448975
source	NSRL

Key	Value
MD5	1F3BC7617542A2C3A9795A977B1F7DC0
PackageArch	i586
PackageDescription	The COLAMD column approximate minimum degree ordering algorithm 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. SYMAMD is a symmetric minimum degree ordering method based on COLAMD, available as a MATLAB-callable function. It constructs a matrix M such that M'*M has the same pattern as A, and then uses COLAMD to compute a column ordering of M. Colamd and symamd tend to be faster and generate better orderings than their MATLAB counterparts, colmmd and symmmd. COLAMD is part of the SuiteSparse sparse matrix suite.
PackageName	libcolamd2
PackageRelease	45.3
PackageVersion	2.9.6
SHA-1	69DE957A3330E43C60CA7AD29EE109D0DE540D6C
SHA-256	8DEE7EEE13275CF75826CCFF02CF6912D988B6C8DE36901078E53BD731ADCCF7

Key	Value
MD5	8A699AF3951FE64C00D2ED14DE98DBBD
PackageArch	noarch
PackageDescription	This package contains documentation files for suitesparse.
PackageMaintainer	Fedora Project
PackageName	suitesparse-doc
PackageRelease	5.fc33
PackageVersion	5.4.0
SHA-1	75D792700EC1A73F27911C001AE8ADE2D058554D
SHA-256	199E4728DB2ACC0C83CD7ED36184AA06C5E067B1873815E9E76A7AD55B1AD434