MueLu Version of the Day
Loading...
Searching...
No Matches
MueLu_OnePtAggregationAlgorithm_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/*
47 * MueLu_OnePtAggregationAlgorithm_def.hpp
48 *
49 * Created on: Sep 18, 2012
50 * Author: Tobias Wiesner
51 */
52
53#ifndef MUELU_ONEPTAGGREGATIONALGORITHM_DEF_HPP_
54#define MUELU_ONEPTAGGREGATIONALGORITHM_DEF_HPP_
55
56#include <Teuchos_Comm.hpp>
57#include <Teuchos_CommHelpers.hpp>
58
59#include <Xpetra_Vector.hpp>
60
61#include "MueLu_OnePtAggregationAlgorithm.hpp"
62
63//#include "MueLu_Graph.hpp"
64#include "MueLu_GraphBase.hpp"
65#include "MueLu_Aggregates.hpp"
66#include "MueLu_Exceptions.hpp"
67#include "MueLu_Monitor.hpp"
68
69namespace MueLu {
70
71template <class LocalOrdinal, class GlobalOrdinal, class Node>
73{
74}
75
76template <class LocalOrdinal, class GlobalOrdinal, class Node>
77void OnePtAggregationAlgorithm<LocalOrdinal, GlobalOrdinal, Node>::BuildAggregates(Teuchos::ParameterList const & /* params */, GraphBase const & graph, Aggregates & aggregates, std::vector<unsigned>& aggStat, LO& numNonAggregatedNodes) const {
78 Monitor m(*this, "BuildAggregates");
79
80 const LocalOrdinal nRows = graph.GetNodeNumVertices();
81 const int myRank = graph.GetComm()->getRank();
82
83 // vertex ids for output
84 Teuchos::ArrayRCP<LocalOrdinal> vertex2AggId = aggregates.GetVertex2AggId()->getDataNonConst(0);
85 Teuchos::ArrayRCP<LocalOrdinal> procWinner = aggregates.GetProcWinner()->getDataNonConst(0);
86
87 // some internal variables
88 LocalOrdinal nLocalAggregates = aggregates.GetNumAggregates(); // number of local aggregates on current proc
89 LocalOrdinal iNode1 = 0; // current node
90
91 // main loop over all local rows of graph(A)
92 while (iNode1 < nRows) {
93
94 if (aggStat[iNode1] == ONEPT) {
95
96 aggregates.SetIsRoot(iNode1); // mark iNode1 as root node for new aggregate 'ag'
97 std::vector<int> aggList;
98 aggList.push_back(iNode1);
99 int aggIndex = nLocalAggregates++;
100
101 for (size_t k = 0; k < aggList.size(); k++) {
102 aggStat[aggList[k]] = IGNORED;
103 vertex2AggId[aggList[k]] = aggIndex;
104 procWinner[aggList[k]] = myRank;
105 }
106 numNonAggregatedNodes -= aggList.size();
107 }
108
109 iNode1++;
110 } // end while
111
112 // update aggregate object
113 aggregates.SetNumAggregates(nLocalAggregates);
114}
115
116} // end namespace
117
118
119#endif /* MUELU_ONEPTAGGREGATIONALGORITHM_DEF_HPP_ */
MueLu::DefaultLocalOrdinal LocalOrdinal
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.
OnePtAggregationAlgorithm(RCP< const FactoryBase > const &graphFact=Teuchos::null)
Constructor.
void BuildAggregates(Teuchos::ParameterList const &params, GraphBase const &graph, Aggregates &aggregates, std::vector< unsigned > &aggStat, LO &numNonAggregatedNodes) const
Local aggregation.
Namespace for MueLu classes and methods.