MueLu_AggregationPhase2bAlgorithm_decl.hpp File Reference

#include "MueLu_ConfigDefs.hpp"
#include "MueLu_Aggregates_fwd.hpp"
#include "MueLu_AggregationAlgorithmBase.hpp"
#include "MueLu_FactoryBase_fwd.hpp"
#include "MueLu_GraphBase.hpp"
#include "MueLu_AggregationPhase2bAlgorithm_fwd.hpp"
#include "MueLu_UseShortNamesOrdinal.hpp"

Go to the source code of this file.

Classes
class	MueLu::AggregationPhase2bAlgorithm< LocalOrdinal, GlobalOrdinal, Node >
	Add leftovers to existing aggregates Idea In phase 2b non-aggregated nodes are added to existing aggregates. All neighbors of the unaggregated node are checked and the corresponding aggregate weight is increased. The unaggregated node is added to the aggregate with the best weight. A simple penalty strategy makes sure that the non-aggregated nodes are added to different aggregates. The routine runs twice to cover non-aggregate nodes which have a node distance of two to existing aggregates. Assuming that the node distance is not greater than 3 (the aggregate diameter size), running the algorithm only twice should be sufficient. More...

Namespaces
	MueLu
	Namespace for MueLu classes and methods.

Macros
#define	MUELU_AGGREGATIONPHASE2BALGORITHM_SHORT

Macro Definition Documentation

#define MUELU_AGGREGATIONPHASE2BALGORITHM_SHORT

Definition at line 114 of file MueLu_AggregationPhase2bAlgorithm_decl.hpp.