blob: caa522b0e73f65102dcd59ad9994b9fb7852e119 (
plain)
1
2
3
4
5
6
|
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.
|
