Index

NAME

AMD - renumbering of unknowns by approximate minimum degree algo­
rithm

INCLUDE

include "AMD.h"

SYNTAX

 class AMD : public RenumUnknowns
 {
 protected:
   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;

 public:
    AMD () ;
   ~AMD () {}

   virtual void renumberNodes (GridFE& grid);
   virtual void renumberUnknowns (SparseDS& structure);
 };

KEYWORDS

bandwidth reduction, profile reduction, node numbering, renumber­
ing strategies, linear systems

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 permuta­
tion-matrix P^t.  The algoritm follows these steps.

Virtual function, use one of the derived classes.

MEMBER FUNCTIONS

See class RenumUnknowns.

SEE ALSO

class Puttonen, class RenumUnknowns

DEVELOPED BY

SINTEF Applied Mathematics, Oslo, Norway, and University of Oslo,
Dept. of Mathematics, Norway

AUTHOR

Gerhard Zumbusch, SINTEF