dune-istl
2.2.0
|
Criterion taking advantage of symmetric matrices. More...
#include <dune/istl/paamg/aggregates.hh>
Public Types | |
typedef SymmetricDependency< M, Norm > | DependencyPolicy |
The policy for calculating the dependency graph. | |
typedef M | Matrix |
The matrix type we build the dependency of. | |
typedef Norm | Norm |
The norm to use for examining the matrix entries. | |
typedef Matrix::row_type | Row |
Constant Row iterator of the matrix. | |
typedef Matrix::ConstColIterator | ColIter |
Constant column iterator of the matrix. | |
Public Member Functions | |
SymmetricCriterion (const Parameters &parms) | |
SymmetricCriterion () | |
void | setDefaultValuesIsotropic (std::size_t dim, std::size_t diameter=2) |
Sets reasonable default values for an isotropic problem. | |
void | setDefaultValuesAnisotropic (std::size_t dim, std::size_t diameter=2) |
Sets reasonable default values for an aisotropic problem. | |
void | init (const Matrix *matrix) |
void | initRow (const Row &row, int index) |
void | examine (const ColIter &col) |
void | examine (G &graph, const typename G::EdgeIterator &edge, const ColIter &col) |
bool | isIsolated () |
void | setDebugLevel (int level) |
Set the debugging level. | |
int | debugLevel () const |
Get the debugging Level. | |
void | setNoPreSmoothSteps (std::size_t steps) |
Set the number of presmoothing steps to apply. | |
std::size_t | getNoPreSmoothSteps () const |
Get the number of presmoothing steps to apply. | |
void | setNoPostSmoothSteps (std::size_t steps) |
Set the number of postsmoothing steps to apply. | |
std::size_t | getNoPostSmoothSteps () const |
Get the number of postsmoothing steps to apply. | |
void | setGamma (std::size_t gamma) |
Set the value of gamma; 1 for V-cycle, 2 for W-cycle. | |
std::size_t | getGamma () const |
Get the value of gamma; 1 for V-cycle, 2 for W-cycle. | |
void | setAdditive (bool additive) |
Set whether to use additive multigrid. | |
bool | getAdditive () const |
Get whether to use additive multigrid. | |
void | setMaxLevel (int l) |
Set the maximum number of levels allowed in the hierarchy. | |
int | maxLevel () const |
Get the maximum number of levels allowed in the hierarchy. | |
void | setCoarsenTarget (int nodes) |
Set the maximum number of unknowns allowed on the coarsest level. | |
int | coarsenTarget () const |
Get the maximum number of unknowns allowed on the coarsest level. | |
void | setMinCoarsenRate (double rate) |
Set the minimum coarsening rate to be achieved in each coarsening. | |
double | minCoarsenRate () const |
Get the minimum coarsening rate to be achieved. | |
AccumulationMode | accumulate () const |
Whether the data should be accumulated on fewer processes on coarser levels. | |
void | setAccumulate (AccumulationMode accu) |
Set whether he data should be accumulated on fewer processes on coarser levels. | |
void | setAccumulate (bool accu) |
void | setProlongationDampingFactor (double d) |
Set the damping factor for the prolongation. | |
double | getProlongationDampingFactor () const |
Get the damping factor for the prolongation. | |
std::size_t | maxDistance () const |
Get the maximal distance allowed between to nodes in a aggregate. | |
void | setMaxDistance (std::size_t distance) |
Set the maximal distance allowed between to nodes in a aggregate. | |
bool | skipIsolated () const |
Whether isolated aggregates will not be represented on the coarse level. | |
void | setSkipIsolated (bool skip) |
Set whether isolated aggregates will not be represented on the coarse level. | |
std::size_t | minAggregateSize () const |
Get the minimum number of nodes a aggregate has to consist of. | |
void | setMinAggregateSize (std::size_t size) |
Set the minimum number of nodes a aggregate has to consist of. | |
std::size_t | maxAggregateSize () const |
Get the maximum number of nodes a aggregate is allowed to have. | |
void | setMaxAggregateSize (std::size_t size) |
Set the maximum number of nodes a aggregate is allowed to have. | |
std::size_t | maxConnectivity () const |
Get the maximum number of connections a aggregate is allowed to have. | |
void | setMaxConnectivity (std::size_t connectivity) |
Set the maximum number of connections a aggregate is allowed to have. | |
void | setBeta (double b) |
Set threshold for marking nodes as isolated. The default value is 1.0E-5. | |
double | beta () const |
Get the threshold for marking nodes as isolated. The default value is 1.0E-5. | |
void | setAlpha (double a) |
Set the scaling value for marking connections as strong. Default value is 1/3. | |
double | alpha () const |
Get the scaling value for marking connections as strong. Default value is 1/3. | |
Protected Attributes | |
const Matrix * | matrix_ |
The matrix we work on. | |
Matrix::field_type | maxValue_ |
The current max value. | |
Norm | norm_ |
The functor for calculating the norm. | |
int | row_ |
index of the currently evaluated row. | |
Matrix::field_type | diagonal_ |
The norm of the current diagonal. |
Criterion taking advantage of symmetric matrices.
The two template parameters are:
typedef Matrix::ConstColIterator Dune::Amg::SymmetricDependency< M, Norm >::ColIter [inherited] |
Constant column iterator of the matrix.
typedef SymmetricDependency< M, Norm > Dune::Amg::AggregationCriterion< SymmetricDependency< M, Norm > >::DependencyPolicy [inherited] |
The policy for calculating the dependency graph.
typedef M Dune::Amg::SymmetricDependency< M, Norm >::Matrix [inherited] |
The matrix type we build the dependency of.
typedef Norm Dune::Amg::SymmetricDependency< M, Norm >::Norm [inherited] |
The norm to use for examining the matrix entries.
typedef Matrix::row_type Dune::Amg::SymmetricDependency< M, Norm >::Row [inherited] |
Constant Row iterator of the matrix.
void Dune::Amg::SymmetricDependency< M, Norm >::examine | ( | const ColIter & | col | ) | [inherited] |
void Dune::Amg::SymmetricDependency< M, Norm >::examine | ( | G & | graph, |
const typename G::EdgeIterator & | edge, | ||
const ColIter & | col | ||
) | [inherited] |
void Dune::Amg::SymmetricDependency< M, Norm >::init | ( | const Matrix * | matrix | ) | [inherited] |
void Dune::Amg::SymmetricDependency< M, Norm >::initRow | ( | const Row & | row, |
int | index | ||
) | [inherited] |
bool Dune::Amg::SymmetricDependency< M, Norm >::isIsolated | ( | ) | [inherited] |
void Dune::Amg::AggregationCriterion< SymmetricDependency< M, Norm > >::setDefaultValuesAnisotropic | ( | std::size_t | dim, |
std::size_t | diameter = 2 |
||
) | [inline, inherited] |
Sets reasonable default values for an aisotropic problem.
Reasonable means that we should end up with cube aggregates with sides of diameter 2 and sides in one dimension that are longer (e.g. for 3D: 2x2x3).
dim | The dimension of the problem. |
diameter | The preferred diameter for the aggregation. |
Reimplemented from Dune::Amg::AggregationParameters.
References Dune::Amg::AggregationCriterion< T >::setDefaultValuesIsotropic().
void Dune::Amg::AggregationCriterion< SymmetricDependency< M, Norm > >::setDefaultValuesIsotropic | ( | std::size_t | dim, |
std::size_t | diameter = 2 |
||
) | [inline, inherited] |
Sets reasonable default values for an isotropic problem.
Reasonable means that we should end up with cube aggregates of diameter 2.
dim | The dimension of the problem. |
diameter | The preferred diameter for the aggregation. |
Reimplemented from Dune::Amg::AggregationParameters.
Matrix::field_type Dune::Amg::SymmetricDependency< M, Norm >::diagonal_ [protected, inherited] |
The norm of the current diagonal.
const Matrix* Dune::Amg::SymmetricDependency< M, Norm >::matrix_ [protected, inherited] |
The matrix we work on.
Matrix::field_type Dune::Amg::SymmetricDependency< M, Norm >::maxValue_ [protected, inherited] |
The current max value.
Norm Dune::Amg::SymmetricDependency< M, Norm >::norm_ [protected, inherited] |
The functor for calculating the norm.
int Dune::Amg::SymmetricDependency< M, Norm >::row_ [protected, inherited] |
index of the currently evaluated row.