2011-11-09 11:33:19 +04:00
|
|
|
<?xml version="1.0" encoding="UTF-8"?>
|
2015-08-25 09:01:42 +03:00
|
|
|
<!DOCTYPE pkgmetadata SYSTEM "http://www.gentoo.org/dtd/metadata.dtd">
|
2011-11-09 11:33:19 +04:00
|
|
|
<pkgmetadata>
|
2016-01-25 16:13:40 +03:00
|
|
|
<maintainer type="project">
|
|
|
|
<email>sci@gentoo.org</email>
|
|
|
|
<name>Gentoo Science Project</name>
|
|
|
|
</maintainer>
|
2015-01-05 00:00:35 +03:00
|
|
|
<longdescription lang="en">
|
2012-11-12 09:08:09 +04:00
|
|
|
The COLumn Approximate Minimum Degree ordering algorithm
|
2011-11-09 11:33:19 +04:00
|
|
|
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
|
2012-11-12 09:08:09 +04:00
|
|
|
COLAMD to compute a column ordering of M.
|
2011-11-09 11:33:19 +04:00
|
|
|
</longdescription>
|
|
|
|
</pkgmetadata>
|