Package : libcolamd2.8.0
Package details
Summary: Library of routines for computing column approximate minimum degree ordering
Description:
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 contains the library needed to run programs dynamically
linked against COLAMD.
Maintainer: nobody
Description:
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 contains the library needed to run programs dynamically
linked against COLAMD.
Maintainer: nobody
List of RPMs
No RPM found for libcolamd2.8.0 using the current filters, try other values.