#include <AMD.h>
Inheritance diagram for AMD::

Public Methods | |
| AMD () | |
| ~AMD () | |
| virtual void | renumberNodes (GridFE &grid) |
| virtual void | renumberUnknowns (SparseDS &structure) |
Protected Methods | |
| virtual void | renumber (int &N, VecSimple(int) &PE, VecSimple(int) &IW, VecSimple(int) &LEN, int &IWLEN, int &PFREE, VecSimple(int) &NV, VecSimple(int) &NEXT, VecSimple(int) &LAST, VecSimple(int) &HEAD, VecSimple(int) &ELEN, VecSimple(int) &DEGREE, int &NCMPA, VecSimple(int) &W, int &IOVFLO)=0 |
NAME: AMD - renumbering of unknowns by approximate minimum degree algorithm
DESCRIPTION:
A set of 6 approximate minimum degree renumbering algorithms. Reduces the bandwidth and profile of the matrix represented by the vector NDSTK. RENUM is the new numbering, and is a permutation matrix P^T. The algorithm follows these steps. Since the class "AMD" is abstract, it can only be used through the derived classes.
|
|
There is one constructor without any arguments. The initialization is embedded in calls to the renumbering functions. |
|
|
|
|
|
this is the interface to the renumbering strategy implemented in each class derived from "AMD", possibly being a wrapper to FORTRAN functionality. Reimplemented in AMDbar, AMDatr, AMDexa, AMDhaf, AMDhat, and AMDtru. |
|
|
renumbers the nodes in the "grid" object. The grid data is prepared for transfer to the appropriate "renumber" function, and the computed results are mapped back to the "GridFE" data structure. Reimplemented from RenumUnknowns. |
|
|
not yet implemented, for future use. Reimplemented from RenumUnknowns. |