slackbuilds_ponce/academic/colamd/README

7 lines
312 B
Text
Raw Normal View History

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.
This package is part of SuiteSparse.