|
Class Summary |
| Damd |
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_1 |
AMD_1: Construct A+A' for a sparse matrix A and perform the AMD ordering. |
| Damd_2 |
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_aat |
AMD_aat: compute the symmetry of the pattern of A, and count the number of
nonzeros each column of A+A' (excluding the diagonal). |
| Damd_control |
User-callable. |
| Damd_defaults |
|
| Damd_dump |
Debugging routines for AMD. |
| Damd_info |
User-callable. |
| Damd_internal |
|
| Damd_order |
User-callable AMD minimum degree ordering routine. |
| Damd_post_tree |
Post-ordering of a supernodal elimination tree. |
| Damd_postorder |
Perform a postordering (via depth-first search) of an assembly tree. |
| Damd_preprocess |
Sorts, removes duplicate entries, and transposes from the nonzero pattern of
a column-form matrix A, to obtain the matrix R. |
| Damd_valid |
Check if a column-form matrix is valid or not. |