fastports

colamd 3.3.5

math/suitesparse-colamd

Column approximate minimum degree ordering algorithm

Category
math
Maintainer
fortran@FreeBSD.org
WWW
https://faculty.cse.tamu.edu/davis/suitesparse.html
License
BSD3CLAUSE
USES
localbase:ldflags cmake:insource fortran pathfix compiler:c++11-lib

Description

This port installs the module COLAMD of SuiteSparse.

The CCOLAMD 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. CSYMAMD is a symmetric minimum degree
ordering method based on CCOLAMD, also available as a MATLAB-callable function.
It constructs a matrix M such that M'*M has the same pattern as A, and then uses
CCOLAMD to compute a column ordering of M.

Dependencies

Commit History

may be incomplete — full history at freebsd-ports on GitHub

Loading commit history — this may take up to a minute on first view. Reload the page in a moment.