blob: 728817ca7a8422a5e69889fec8b796123282f752 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
|
<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE pkgmetadata SYSTEM "https://www.gentoo.org/dtd/metadata.dtd">
<pkgmetadata>
<maintainer type="project">
<email>sci@gentoo.org</email>
<name>Gentoo Science Project</name>
</maintainer>
<longdescription lang="en">
Constrained Approximate Minimum Degree ordering is a set of routines
for ordering a sparse matrix prior to Cholesky factorization (or for
LU factorization with diagonal pivoting).
</longdescription>
<upstream>
<remote-id type="github">DrTimothyAldenDavis/SuiteSparse</remote-id>
</upstream>
</pkgmetadata>
|
GitWeb
