openbsd-ports/math/colamd/distinfo

MD5 (COLAMD-2.7.2.tar.gz) = K05DyO8z2s+t5tHsSVQqwQ==
MD5 (UFconfig-3.0.0.tar.gz) = +noP6LyqGZvx8+OhD7BP7w==
RMD160 (COLAMD-2.7.2.tar.gz) = MjmeouzdaBuVvTnfiAeoXS+welw=
RMD160 (UFconfig-3.0.0.tar.gz) = lbxDTiK0YpX2ucakUwB3pUTzEME=
SHA1 (COLAMD-2.7.2.tar.gz) = H8KnVgPk9lbtpm6soVqYtgQpPT0=
SHA1 (UFconfig-3.0.0.tar.gz) = 8bXvosYI/y//h4qQzRXcL0yf/TY=
SHA256 (COLAMD-2.7.2.tar.gz) = QtVJenF6TeGfuOznjZ34vfLTkk+Y/KJSltOgPNDTawI=
SHA256 (UFconfig-3.0.0.tar.gz) = 6YbPv1konLea6qGFzz9egG8pgaoJlpvPvjZ3Q1FSz1g=
SIZE (COLAMD-2.7.2.tar.gz) = 55852
SIZE (UFconfig-3.0.0.tar.gz) = 6395
Import colamd, needed for upcoming octave update. 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. 2010-05-11 13:11:32 -04:00			`MD5 (COLAMD-2.7.2.tar.gz) = K05DyO8z2s+t5tHsSVQqwQ==`
			`MD5 (UFconfig-3.0.0.tar.gz) = +noP6LyqGZvx8+OhD7BP7w==`
			`RMD160 (COLAMD-2.7.2.tar.gz) = MjmeouzdaBuVvTnfiAeoXS+welw=`
			`RMD160 (UFconfig-3.0.0.tar.gz) = lbxDTiK0YpX2ucakUwB3pUTzEME=`
			`SHA1 (COLAMD-2.7.2.tar.gz) = H8KnVgPk9lbtpm6soVqYtgQpPT0=`
			`SHA1 (UFconfig-3.0.0.tar.gz) = 8bXvosYI/y//h4qQzRXcL0yf/TY=`
			`SHA256 (COLAMD-2.7.2.tar.gz) = QtVJenF6TeGfuOznjZ34vfLTkk+Y/KJSltOgPNDTawI=`
			`SHA256 (UFconfig-3.0.0.tar.gz) = 6YbPv1konLea6qGFzz9egG8pgaoJlpvPvjZ3Q1FSz1g=`
			`SIZE (COLAMD-2.7.2.tar.gz) = 55852`
			`SIZE (UFconfig-3.0.0.tar.gz) = 6395`