Gentoo Packages

Search

Package Information

Description:

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).

Homepage:

https://people.engr.tamu.edu/davis/suitesparse.html

License:

BSD

Versions

Metadata

Description

• 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).

Maintainers

• Francois Bissey (frp.bissey@gmail.com) - Type: person

Upstream

• Remote IDs:
  • github: DrTimothyAldenDavis/SuiteSparse

<pkgmetadata>
	<maintainer type="person">
		<email>frp.bissey@gmail.com</email>
		<name>Francois Bissey</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>

Lint Warnings

• [Warning] Missing md5-cache for version 3.2.1. Run 'ebuild <ebuild_file> manifest' or 'egencache' to generate it.

USE Flags

Manifest