85 RCP<ParameterList> validParamList = rcp(
new ParameterList());
90 typedef Teuchos::StringToIntegralParameterEntryValidator<int> validatorType;
91#define SET_VALID_ENTRY(name) validParamList->setEntry(name, MasterList::getEntry(name))
96 validParamList->getEntry(
"aggregation: ordering").setValidator(
97 rcp(
new validatorType(Teuchos::tuple<std::string>(
"natural",
"graph",
"random"),
"aggregation: ordering")));
107 SET_VALID_ENTRY(
"aggregation: error on nodes with no on-rank neighbors");
111#undef SET_VALID_ENTRY
114 validParamList->set< RCP<const FactoryBase> >(
"Graph", null,
"Generating factory of the graph");
115 validParamList->set< RCP<const FactoryBase> >(
"DofsPerNode", null,
"Generating factory for variable \'DofsPerNode\', usually the same as for \'Graph\'");
116 validParamList->set< RCP<const FactoryBase> >(
"AggregateQualities", null,
"Generating factory for variable \'AggregateQualities\'");
119 validParamList->set< std::string > (
"OnePt aggregate map name",
"",
"Name of input map for single node aggregates. (default='')");
120 validParamList->set< std::string > (
"OnePt aggregate map factory",
"",
"Generating factory of (DOF) map for single node aggregates.");
125 validParamList->set< std::string > (
"Interface aggregate map name",
"",
"Name of input map for interface aggregates. (default='')");
126 validParamList->set< std::string > (
"Interface aggregate map factory",
"",
"Generating factory of (DOF) map for interface aggregates.");
127 validParamList->set<RCP<const FactoryBase> > (
"nodeOnInterface", Teuchos::null,
"Array specifying whether or not a node is on the interface (1 or 0).");
129 return validParamList;
175 ParameterList pL = GetParameterList();
176 bDefinitionPhase_ =
false;
178 if (pL.get<
int>(
"aggregation: max agg size") == -1)
179 pL.set(
"aggregation: max agg size", INT_MAX);
182 RCP<const FactoryBase> graphFact = GetFactory(
"Graph");
188 if (pL.get<
bool>(
"aggregation: allow user-specified singletons") ==
true) algos_.push_back(rcp(
new OnePtAggregationAlgorithm (graphFact)));
200 std::string mapOnePtName = pL.get<std::string>(
"OnePt aggregate map name");
201 RCP<Map> OnePtMap = Teuchos::null;
202 if (mapOnePtName.length()) {
203 std::string mapOnePtFactName = pL.get<std::string>(
"OnePt aggregate map factory");
204 if (mapOnePtFactName ==
"" || mapOnePtFactName ==
"NoFactory") {
207 RCP<const FactoryBase> mapOnePtFact = GetFactory(mapOnePtFactName);
208 OnePtMap = currentLevel.
Get<RCP<Map> >(mapOnePtName, mapOnePtFact.get());
213 std::string mapInterfaceName = pL.get<std::string>(
"Interface aggregate map name");
214 RCP<Map> InterfaceMap = Teuchos::null;
216 RCP<const GraphBase> graph = Get< RCP<GraphBase> >(currentLevel,
"Graph");
219 RCP<Aggregates> aggregates = rcp(
new Aggregates(*graph));
220 aggregates->setObjectLabel(
"UC");
222 const LO numRows = graph->GetNodeNumVertices();
225 std::vector<unsigned> aggStat(numRows,
READY);
228 if (pL.get<
bool>(
"aggregation: use interface aggregation") ==
true){
229 Teuchos::Array<LO> nodeOnInterface = Get<Array<LO>>(currentLevel,
"nodeOnInterface");
230 for (LO i = 0; i < numRows; i++) {
231 if (nodeOnInterface[i])
236 ArrayRCP<const bool> dirichletBoundaryMap = graph->GetBoundaryNodeMap();
237 if (dirichletBoundaryMap != Teuchos::null)
238 for (LO i = 0; i < numRows; i++)
239 if (dirichletBoundaryMap[i] ==
true)
242 LO nDofsPerNode = Get<LO>(currentLevel,
"DofsPerNode");
243 GO indexBase = graph->GetDomainMap()->getIndexBase();
244 if (OnePtMap != Teuchos::null) {
245 for (LO i = 0; i < numRows; i++) {
247 GO grid = (graph->GetDomainMap()->getGlobalElement(i)-indexBase) * nDofsPerNode + indexBase;
249 for (LO kr = 0; kr < nDofsPerNode; kr++)
250 if (OnePtMap->isNodeGlobalElement(grid + kr))
257 const RCP<const Teuchos::Comm<int> > comm = graph->GetComm();
258 GO numGlobalRows = 0;
262 LO numNonAggregatedNodes = numRows;
263 GO numGlobalAggregatedPrev = 0, numGlobalAggsPrev = 0;
264 for (
size_t a = 0; a < algos_.size(); a++) {
265 std::string phase = algos_[a]->description();
268 int oldRank = algos_[a]->SetProcRankVerbose(this->GetProcRankVerbose());
269 algos_[a]->BuildAggregates(pL, *graph, *aggregates, aggStat, numNonAggregatedNodes);
270 algos_[a]->SetProcRankVerbose(oldRank);
273 GO numLocalAggregated = numRows - numNonAggregatedNodes, numGlobalAggregated = 0;
274 GO numLocalAggs = aggregates->GetNumAggregates(), numGlobalAggs = 0;
275 MueLu_sumAll(comm, numLocalAggregated, numGlobalAggregated);
278 double aggPercent = 100*as<double>(numGlobalAggregated)/as<double>(numGlobalRows);
279 if (aggPercent > 99.99 && aggPercent < 100.00) {
286 GetOStream(
Statistics1) <<
" aggregated : " << (numGlobalAggregated - numGlobalAggregatedPrev) <<
" (phase), " << std::fixed
287 << std::setprecision(2) << numGlobalAggregated <<
"/" << numGlobalRows <<
" [" << aggPercent <<
"%] (total)\n"
288 <<
" remaining : " << numGlobalRows - numGlobalAggregated <<
"\n"
289 <<
" aggregates : " << numGlobalAggs-numGlobalAggsPrev <<
" (phase), " << numGlobalAggs <<
" (total)" << std::endl;
290 numGlobalAggregatedPrev = numGlobalAggregated;
291 numGlobalAggsPrev = numGlobalAggs;
295 TEUCHOS_TEST_FOR_EXCEPTION(numNonAggregatedNodes,
Exceptions::RuntimeError,
"MueLu::UncoupledAggregationFactory::Build: Leftover nodes found! Error!");
297 aggregates->AggregatesCrossProcessors(
false);
298 aggregates->ComputeAggregateSizes(
true);
300 Set(currentLevel,
"Aggregates", aggregates);
302 if (pL.get<
bool>(
"aggregation: compute aggregate qualities")) {
303 RCP<Xpetra::MultiVector<DefaultScalar,LO,GO,Node>> aggQualities = Get<RCP<Xpetra::MultiVector<DefaultScalar,LO,GO,Node>>>(currentLevel,
"AggregateQualities");