MueLu Version of the Day
Loading...
Searching...
No Matches
MueLu_PreserveDirichletAggregationAlgorithm_def.hpp
Go to the documentation of this file.
1// @HEADER
2//
3// ***********************************************************************
4//
5// MueLu: A package for multigrid based preconditioning
6// Copyright 2012 Sandia Corporation
7//
8// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation,
9// the U.S. Government retains certain rights in this software.
10//
11// Redistribution and use in source and binary forms, with or without
12// modification, are permitted provided that the following conditions are
13// met:
14//
15// 1. Redistributions of source code must retain the above copyright
16// notice, this list of conditions and the following disclaimer.
17//
18// 2. Redistributions in binary form must reproduce the above copyright
19// notice, this list of conditions and the following disclaimer in the
20// documentation and/or other materials provided with the distribution.
21//
22// 3. Neither the name of the Corporation nor the names of the
23// contributors may be used to endorse or promote products derived from
24// this software without specific prior written permission.
25//
26// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY
27// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
28// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
29// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE
30// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
31// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
32// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
33// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
34// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
35// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
36// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
37//
38// Questions? Contact
39// Jonathan Hu (jhu@sandia.gov)
40// Andrey Prokopenko (aprokop@sandia.gov)
41// Ray Tuminaro (rstumin@sandia.gov)
42//
43// ***********************************************************************
44//
45// @HEADER
46#ifndef MUELU_PRESERVEDIRICHLETAGGREGATIONALGORITHM_DEF_HPP_
47#define MUELU_PRESERVEDIRICHLETAGGREGATIONALGORITHM_DEF_HPP_
48
49#include <Teuchos_Comm.hpp>
50#include <Teuchos_CommHelpers.hpp>
51
52#include <Xpetra_Vector.hpp>
53
54#include "MueLu_PreserveDirichletAggregationAlgorithm.hpp"
55
56#include "MueLu_GraphBase.hpp"
57#include "MueLu_Aggregates.hpp"
58#include "MueLu_Exceptions.hpp"
59#include "MueLu_Monitor.hpp"
60
61namespace MueLu {
62
63 template <class LocalOrdinal, class GlobalOrdinal, class Node>
64 void PreserveDirichletAggregationAlgorithm<LocalOrdinal, GlobalOrdinal, Node>::BuildAggregates(Teuchos::ParameterList const & params, GraphBase const & graph, Aggregates & aggregates, std::vector<unsigned>& aggStat, LO& numNonAggregatedNodes) const {
65 Monitor m(*this, "BuildAggregates");
66
67 bool preserve = params.get<bool>("aggregation: preserve Dirichlet points");
68
69 const LO numRows = graph.GetNodeNumVertices();
70 const int myRank = graph.GetComm()->getRank();
71
72 ArrayRCP<LO> vertex2AggId = aggregates.GetVertex2AggId()->getDataNonConst(0);
73 ArrayRCP<LO> procWinner = aggregates.GetProcWinner() ->getDataNonConst(0);
74
75 LO numLocalAggregates = aggregates.GetNumAggregates();
76
77 for (LO i = 0; i < numRows; i++)
78 if (aggStat[i] == BOUNDARY) {
79 aggStat[i] = IGNORED;
80 numNonAggregatedNodes--;
81
82 if (preserve) {
83 aggregates.SetIsRoot(i);
84
85 vertex2AggId[i] = numLocalAggregates++;
86 procWinner [i] = myRank;
87 }
88 }
89
90 // update aggregate object
91 aggregates.SetNumAggregates(numLocalAggregates);
92 }
93
94} // end namespace
95
96#endif /* MUELU_PRESERVEDIRICHLETAGGREGATIONALGORITHM_DEF_HPP_ */
Container class for aggregation information.
void SetIsRoot(LO i, bool value=true)
Set root node information.
const RCP< LOMultiVector > & GetVertex2AggId() const
Returns constant vector that maps local node IDs to local aggregates IDs.
const RCP< LOVector > & GetProcWinner() const
Returns constant vector that maps local node IDs to owning processor IDs.
LO GetNumAggregates() const
returns the number of aggregates of the current processor. Note: could/should be renamed to GetNumLoc...
void SetNumAggregates(LO nAggregates)
Set number of local aggregates on current processor.
MueLu representation of a graph.
virtual const RCP< const Teuchos::Comm< int > > GetComm() const =0
virtual size_t GetNodeNumVertices() const =0
Return number of vertices owned by the calling node.
Timer to be used in non-factories.
void BuildAggregates(const Teuchos::ParameterList &params, const GraphBase &graph, Aggregates &aggregates, std::vector< unsigned > &aggStat, LO &numNonAggregatedNodes) const
Local aggregation.
Namespace for MueLu classes and methods.
@ BOUNDARY
Definition: MueLu_Types.hpp:82