Given a representation of the nonzero pattern of a symmetric matrix, A,
(excluding the diagonal) perform an approximate minimum (UMFPACK/MA38-style)
degree ordering to compute a pivot order such that the introduction of
nonzeros (fill-in) in the Cholesky factors A = LL' is kept low.
AMD finds a symmetric ordering P of a matrix A so that the Cholesky
factorization of P*A*P' has fewer nonzeros and takes less work than the
Cholesky factorization of A.
Damd() -
Constructor for class edu.ufl.cise.amd.tdouble.Damd
AMD_2: performs the AMD ordering on a symmetric sparse matrix A, followed
by a postordering (via depth-first search) of the assembly tree using the
AMD_postorder routine.
Damd_2() -
Constructor for class edu.ufl.cise.amd.tdouble.Damd_2