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

Public Methods | |
| RenumUnknowns () | |
| virtual | ~RenumUnknowns () |
| virtual void | renumberNodes (GridFE &grid)=0 |
| virtual void | renumberUnknowns (SparseDS &structure)=0 |
Protected Attributes | |
| int | n |
| int | nonzeroes |
| int | bandwidth |
| Handle(VecSimpleH(int)) | renum |
NAME: RenumUnknowns - hierarchy for renumbering unknowns in linear systems
DESCRIPTION:
This is a base class for different renumbering strategies. Since the class is abstract it can only be used in terms of derived classes implementing specific numbering schemes.
|
|
|
|
|
|
|
|
renumbers the nodes in a grid. This function makes a "SparseDS" object from the grid, calls "renumberUnknowns" and thereafter the "GridFE newNodalNumbering" is called to change the node numbers. Reimplemented in AMD, GibbPooleStockm, Puttonen, RedBlack, and RenumNoUnknowns. |
|
|
renumbers the unknowns in a matrix sparsity pattern. Note that the underlying grid is not modified. See the brief description of the function "renumberNodes" to see the relation between the renumbering routines. Reimplemented in AMD, GibbPooleStockm, Puttonen, RedBlack, and RenumNoUnknowns. |
|
|
|
|
|
|
|
|
|
|
|
|