3#ifndef DUNE_ISTL_MATRIXREDISTRIBUTE_HH
4#define DUNE_ISTL_MATRIXREDISTRIBUTE_HH
10#include <dune/istl/paamg/pinfo.hh>
19 struct RedistributeInformation
26 void redistribute([[maybe_unused]]
const D& from, [[maybe_unused]] D& to)
const
30 void redistributeBackward([[maybe_unused]] D& from, [[maybe_unused]]
const D& to)
const
36 void setNoRows([[maybe_unused]] std::size_t size)
39 void setNoCopyRows([[maybe_unused]] std::size_t size)
42 void setNoBackwardsCopyRows([[maybe_unused]] std::size_t size)
45 std::size_t getRowSize([[maybe_unused]] std::size_t index)
const
50 std::size_t getCopyRowSize([[maybe_unused]] std::size_t index)
const
55 std::size_t getBackwardsCopyRowSize([[maybe_unused]] std::size_t index)
const
63 template<
typename T,
typename T1>
64 class RedistributeInformation<OwnerOverlapCopyCommunication<T,T1> >
67 typedef OwnerOverlapCopyCommunication<T,T1> Comm;
69 RedistributeInformation()
70 : interface(), setup_(false)
73 RedistributeInterface& getInterface()
78 void checkInterface(
const IS& source,
79 const IS& target, MPI_Comm comm)
81 auto ri = std::make_unique<RemoteIndices<IS> >(source, target, comm);
82 ri->template rebuild<true>();
84 typename OwnerOverlapCopyCommunication<int>::OwnerSet flags;
86 MPI_Comm_rank(MPI_COMM_WORLD, &rank);
88 inf.build(*ri, flags, flags);
94 MPI_Comm_rank(MPI_COMM_WORLD, &rank);
96 std::cout<<
"Interfaces do not match!"<<std::endl;
97 std::cout<<rank<<
": redist interface new :"<<inf<<std::endl;
98 std::cout<<rank<<
": redist interface :"<<interface<<std::endl;
115 template<
class GatherScatter,
class D>
116 void redistribute(
const D& from, D& to)
const
118 BufferedCommunicator communicator;
119 communicator.template build<D>(from,to, interface);
120 communicator.template forward<GatherScatter>(from, to);
123 template<
class GatherScatter,
class D>
124 void redistributeBackward(D& from,
const D& to)
const
127 BufferedCommunicator communicator;
128 communicator.template build<D>(from,to, interface);
129 communicator.template backward<GatherScatter>(from, to);
134 void redistribute(
const D& from, D& to)
const
136 redistribute<CopyGatherScatter<D> >(from,to);
139 void redistributeBackward(D& from,
const D& to)
const
141 redistributeBackward<CopyGatherScatter<D> >(from,to);
148 void reserve(std::size_t size)
151 std::size_t& getRowSize(std::size_t index)
153 return rowSize[index];
156 std::size_t getRowSize(std::size_t index)
const
158 return rowSize[index];
161 std::size_t& getCopyRowSize(std::size_t index)
163 return copyrowSize[index];
166 std::size_t getCopyRowSize(std::size_t index)
const
168 return copyrowSize[index];
171 std::size_t& getBackwardsCopyRowSize(std::size_t index)
173 return backwardscopyrowSize[index];
176 std::size_t getBackwardsCopyRowSize(std::size_t index)
const
178 return backwardscopyrowSize[index];
181 void setNoRows(std::size_t rows)
183 rowSize.resize(rows, 0);
186 void setNoCopyRows(std::size_t rows)
188 copyrowSize.resize(rows, 0);
191 void setNoBackwardsCopyRows(std::size_t rows)
193 backwardscopyrowSize.resize(rows, 0);
197 std::vector<std::size_t> rowSize;
198 std::vector<std::size_t> copyrowSize;
199 std::vector<std::size_t> backwardscopyrowSize;
200 RedistributeInterface interface;
212 template<
class M,
class RI>
216 typedef typename M::size_type value_type;
217 typedef typename M::size_type size_type;
225 : matrix(m_), rowsize(rowsize_)
241 template<
class M,
class I>
244 typedef typename M::size_type size_type;
253 : matrix(m_), idxset(idxset_), aggidxset(aggidxset_), rowsize()
264 const std::vector<typename M::size_type>& rowsize_)
265 : matrix(m_), idxset(idxset_), aggidxset(aggidxset_), sparsity(aggidxset_.size()), rowsize(&rowsize_)
283 MPI_Comm_rank(MPI_COMM_WORLD, &rank);
285 for(IIter i= aggidxset.begin(), end=aggidxset.end(); i!=end; ++i) {
286 if(!OwnerSet::contains(i->local().attribute())) {
288 std::cout<<rank<<
" Inserting diagonal for"<<i->local()<<std::endl;
290 sparsity[i->local()].insert(i->local());
293 nnz+=sparsity[i->local()].size();
295 assert( aggidxset.size()==sparsity.size());
298 m.setSize(aggidxset.size(), aggidxset.size(), nnz);
299 m.setBuildMode(M::row_wise);
300 typename M::CreateIterator citer=m.createbegin();
306 typedef typename std::vector<std::set<size_type> >::const_iterator Iter;
307 for(Iter i=sparsity.begin(), end=sparsity.end(); i!=end; ++i, ++citer)
309 typedef typename std::set<size_type>::const_iterator SIter;
310 for(SIter si=i->begin(), send=i->end(); si!=send; ++si)
313 if(i->find(idx)==i->end()) {
314 const typename I::IndexPair* gi=global.
pair(idx);
316 std::cout<<rank<<
": row "<<idx<<
" is missing a diagonal entry! global="<<gi->global()<<
" attr="<<gi->local().attribute()<<
" "<<
317 OwnerSet::contains(gi->local().attribute())<<
318 " row size="<<i->size()<<std::endl;
340 for (
unsigned int i = 0; i != sparsity.size(); ++i) {
341 if (add_sparsity[i].size() != 0) {
342 typedef std::set<size_type> Set;
344 std::insert_iterator<Set> tmp_insert (tmp_set, tmp_set.begin());
345 std::set_union(add_sparsity[i].begin(), add_sparsity[i].end(),
346 sparsity[i].begin(), sparsity[i].end(), tmp_insert);
347 sparsity[i].swap(tmp_set);
356 std::vector<std::set<size_type> > sparsity;
357 const std::vector<size_type>* rowsize;
360 template<
class M,
class I>
361 struct CommPolicy<CommMatrixSparsityPattern<M,I> >
363 typedef CommMatrixSparsityPattern<M,I>
Type;
374 static typename M::size_type
getSize(
const Type& t, std::size_t i)
377 return t.matrix[i].size();
380 assert((*t.rowsize)[i]>0);
381 return (*t.rowsize)[i];
392 template<
class M,
class I>
411 std::vector<size_t>& rowsize_)
425 if(!OwnerSet::contains(i->local().attribute())) {
427 typedef typename M::ColIterator CIter;
428 for(CIter c=
matrix[i->local()].begin(), cend=
matrix[i->local()].end();
432 if(c.index()==i->local()) {
433 auto setDiagonal = [](
auto&& scalarOrMatrix,
const auto& value) {
434 auto&& matrixView = Dune::Impl::asMatrix(scalarOrMatrix);
435 for (
auto rowIt = matrixView.begin(); rowIt != matrixView.end(); ++rowIt)
436 (*rowIt)[rowIt.index()] = value;
453 template<
class M,
class I>
462 typedef std::pair<typename I::GlobalIndex,typename M::block_type>
IndexedType;
467 static std::size_t
getSize(
const Type& t, std::size_t i)
470 return t.matrix[i].size();
473 assert((*t.rowsize)[i]>0);
474 return (*t.rowsize)[i];
479 template<
class M,
class I,
class RI>
480 struct MatrixRowSizeGatherScatter
482 typedef CommMatrixRowSize<M,RI> Container;
484 static const typename M::size_type gather(
const Container& cont, std::size_t i)
486 return cont.matrix[i].size();
488 static void scatter(Container& cont,
const typename M::size_type& rowsize, std::size_t i)
491 cont.rowsize.getRowSize(i)=rowsize;
496 template<
class M,
class I,
class RI>
497 struct MatrixCopyRowSizeGatherScatter
499 typedef CommMatrixRowSize<M,RI> Container;
501 static const typename M::size_type gather(
const Container& cont, std::size_t i)
503 return cont.matrix[i].size();
505 static void scatter(Container& cont,
const typename M::size_type& rowsize, std::size_t i)
508 if (rowsize > cont.rowsize.getCopyRowSize(i))
509 cont.rowsize.getCopyRowSize(i)=rowsize;
514 template<
class M,
class I>
515 struct MatrixSparsityPatternGatherScatter
517 typedef typename I::GlobalIndex GlobalIndex;
518 typedef CommMatrixSparsityPattern<M,I> Container;
519 typedef typename M::ConstColIterator ColIter;
522 static GlobalIndex numlimits;
524 static const GlobalIndex& gather(
const Container& cont, std::size_t i, std::size_t j)
527 col=cont.matrix[i].begin();
528 else if (col!=cont.matrix[i].end())
535 if (col==cont.matrix[i].end()) {
540 const typename I::IndexPair* index=cont.idxset.pair(col.index());
543 if ( index->local().attribute() != 2)
544 return index->global();
551 static void scatter(Container& cont,
const GlobalIndex& gi, std::size_t i, [[maybe_unused]] std::size_t j)
555 const typename I::IndexPair& ip=cont.aggidxset.at(gi);
556 assert(ip.global()==gi);
557 std::size_t column = ip.local();
558 cont.sparsity[i].insert(column);
561 if(!OwnerSet::contains(ip.local().attribute()))
563 cont.sparsity[column].insert(i);
569 typedef typename Container::LookupIndexSet GlobalLookup;
570 typedef typename GlobalLookup::IndexPair IndexPair;
573 GlobalLookup lookup(cont.aggidxset);
574 const IndexPair* pi=lookup.pair(i);
576 if(OwnerSet::contains(pi->local().attribute())) {
578 MPI_Comm_rank(MPI_COMM_WORLD,&rank);
579 std::cout<<rank<<cont.aggidxset<<std::endl;
580 std::cout<<rank<<
": row "<<i<<
" (global="<<gi <<
") not in index set for owner index "<<pi->global()<<std::endl;
588 template<
class M,
class I>
589 typename MatrixSparsityPatternGatherScatter<M,I>::ColIter MatrixSparsityPatternGatherScatter<M,I>::col;
591 template<
class M,
class I>
592 typename MatrixSparsityPatternGatherScatter<M,I>::GlobalIndex MatrixSparsityPatternGatherScatter<M,I>::numlimits;
595 template<
class M,
class I>
596 struct MatrixRowGatherScatter
598 typedef typename I::GlobalIndex GlobalIndex;
599 typedef CommMatrixRow<M,I> Container;
600 typedef typename M::ConstColIterator ColIter;
601 typedef typename std::pair<GlobalIndex,typename M::block_type> Data;
603 static Data datastore;
604 static GlobalIndex numlimits;
606 static const Data& gather(
const Container& cont, std::size_t i, std::size_t j)
609 col=cont.matrix[i].begin();
610 else if (col!=cont.matrix[i].end())
616 if (col==cont.matrix[i].end()) {
618 datastore = Data(numlimits,*col);
623 const typename I::IndexPair* index=cont.idxset.pair(col.index());
627 if ( index->local().attribute() != 2)
628 datastore = Data(index->global(),*col);
631 datastore = Data(numlimits,*col);
636 static void scatter(Container& cont,
const Data& data, std::size_t i, [[maybe_unused]] std::size_t j)
640 typename M::size_type column=cont.aggidxset.at(data.first).local();
641 cont.matrix[i][column]=data.second;
651 template<
class M,
class I>
652 typename MatrixRowGatherScatter<M,I>::ColIter MatrixRowGatherScatter<M,I>::col;
654 template<
class M,
class I>
655 typename MatrixRowGatherScatter<M,I>::Data MatrixRowGatherScatter<M,I>::datastore;
657 template<
class M,
class I>
658 typename MatrixRowGatherScatter<M,I>::GlobalIndex MatrixRowGatherScatter<M,I>::numlimits;
660 template<
typename M,
typename C>
661 void redistributeSparsityPattern(M& origMatrix, M& newMatrix, C& origComm, C& newComm,
662 RedistributeInformation<C>& ri)
664 typename C::CopySet copyflags;
665 typename C::OwnerSet ownerflags;
666 typedef typename C::ParallelIndexSet IndexSet;
667 typedef RedistributeInformation<C> RI;
668 std::vector<typename M::size_type> rowsize(newComm.indexSet().size(), 0);
669 std::vector<typename M::size_type> copyrowsize(newComm.indexSet().size(), 0);
670 std::vector<typename M::size_type> backwardscopyrowsize(origComm.indexSet().size(), 0);
673 CommMatrixRowSize<M,RI> commRowSize(origMatrix, ri);
674 ri.template redistribute<MatrixRowSizeGatherScatter<M,IndexSet,RI> >(commRowSize,commRowSize);
676 origComm.buildGlobalLookup();
678 for (std::size_t i=0; i < newComm.indexSet().size(); i++) {
679 rowsize[i] = ri.getRowSize(i);
682 CommMatrixSparsityPattern<M,IndexSet>
683 origsp(origMatrix, origComm.globalLookup(), newComm.indexSet());
684 CommMatrixSparsityPattern<M,IndexSet>
685 newsp(origMatrix, origComm.globalLookup(), newComm.indexSet(), rowsize);
687 ri.template redistribute<MatrixSparsityPatternGatherScatter<M,IndexSet> >(origsp,newsp);
691 RemoteIndices<IndexSet> *ris =
new RemoteIndices<IndexSet>(origComm.indexSet(),
693 origComm.communicator());
694 ris->template rebuild<true>();
696 ri.getInterface().free();
697 ri.getInterface().build(*ris,copyflags,ownerflags);
700 CommMatrixRowSize<M,RI> commRowSize_copy(origMatrix, ri);
701 ri.template redistribute<MatrixCopyRowSizeGatherScatter<M,IndexSet,RI> >(commRowSize_copy,
704 for (std::size_t i=0; i < newComm.indexSet().size(); i++) {
705 copyrowsize[i] = ri.getCopyRowSize(i);
708 ri.redistributeBackward(backwardscopyrowsize,copyrowsize);
709 for (std::size_t i=0; i < origComm.indexSet().size(); i++) {
710 ri.getBackwardsCopyRowSize(i) = backwardscopyrowsize[i];
714 CommMatrixSparsityPattern<M,IndexSet> origsp_copy(origMatrix,
715 origComm.globalLookup(),
717 backwardscopyrowsize);
718 CommMatrixSparsityPattern<M,IndexSet> newsp_copy(origMatrix, origComm.globalLookup(),
719 newComm.indexSet(), copyrowsize);
720 ri.template redistribute<MatrixSparsityPatternGatherScatter<M,IndexSet> >(origsp_copy,
723 newsp.completeSparsityPattern(newsp_copy.sparsity);
724 newsp.storeSparsityPattern(newMatrix);
727 newsp.storeSparsityPattern(newMatrix);
729#ifdef DUNE_ISTL_WITH_CHECKING
732 typedef typename M::ConstRowIterator RIter;
733 for(RIter row=newMatrix.begin(), rend=newMatrix.end(); row != rend; ++row) {
734 typedef typename M::ConstColIterator CIter;
735 for(CIter col=row->begin(), cend=row->end(); col!=cend; ++col)
738 newMatrix[col.index()][row.index()];
740 std::cerr<<newComm.communicator().rank()<<
": entry ("
741 <<col.index()<<
","<<row.index()<<
") missing! for symmetry!"<<std::endl;
750 DUNE_THROW(ISTLError,
"Matrix not symmetric!");
754 template<
typename M,
typename C>
755 void redistributeMatrixEntries(M& origMatrix, M& newMatrix, C& origComm, C& newComm,
756 RedistributeInformation<C>& ri)
758 typedef typename C::ParallelIndexSet IndexSet;
759 typename C::OwnerSet ownerflags;
760 std::vector<typename M::size_type> rowsize(newComm.indexSet().size(), 0);
761 std::vector<typename M::size_type> copyrowsize(newComm.indexSet().size(), 0);
762 std::vector<typename M::size_type> backwardscopyrowsize(origComm.indexSet().size(), 0);
764 for (std::size_t i=0; i < newComm.indexSet().size(); i++) {
765 rowsize[i] = ri.getRowSize(i);
767 copyrowsize[i] = ri.getCopyRowSize(i);
771 for (std::size_t i=0; i < origComm.indexSet().size(); i++)
773 backwardscopyrowsize[i] = ri.getBackwardsCopyRowSize(i);
778 CommMatrixRow<M,IndexSet> origrow_copy(origMatrix, origComm.globalLookup(),
779 newComm.indexSet(), backwardscopyrowsize);
780 CommMatrixRow<M,IndexSet> newrow_copy(newMatrix, origComm.globalLookup(),
781 newComm.indexSet(),copyrowsize);
782 ri.template redistribute<MatrixRowGatherScatter<M,IndexSet> >(origrow_copy,
784 ri.getInterface().free();
785 RemoteIndices<IndexSet> *ris =
new RemoteIndices<IndexSet>(origComm.indexSet(),
787 origComm.communicator());
788 ris->template rebuild<true>();
789 ri.getInterface().build(*ris,ownerflags,ownerflags);
792 CommMatrixRow<M,IndexSet>
793 origrow(origMatrix, origComm.globalLookup(), newComm.indexSet());
794 CommMatrixRow<M,IndexSet>
795 newrow(newMatrix, origComm.globalLookup(), newComm.indexSet(),rowsize);
796 ri.template redistribute<MatrixRowGatherScatter<M,IndexSet> >(origrow,newrow);
798 newrow.setOverlapRowsToDirichlet();
817 template<
typename M,
typename C>
819 RedistributeInformation<C>& ri)
821 ri.setNoRows(newComm.indexSet().size());
822 ri.setNoCopyRows(newComm.indexSet().size());
823 ri.setNoBackwardsCopyRows(origComm.indexSet().size());
824 redistributeSparsityPattern(origMatrix, newMatrix, origComm, newComm, ri);
825 redistributeMatrixEntries(origMatrix, newMatrix, origComm, newComm, ri);
830 void redistributeMatrixEntries(M& origMatrix, M& newMatrix,
831 Dune::Amg::SequentialInformation& origComm,
832 Dune::Amg::SequentialInformation& newComm,
833 RedistributeInformation<Dune::Amg::SequentialInformation>& ri)
835 DUNE_THROW(InvalidStateException,
"Trying to redistribute in sequential program!");
839 Dune::Amg::SequentialInformation& origComm,
840 Dune::Amg::SequentialInformation& newComm,
841 RedistributeInformation<Dune::Amg::SequentialInformation>& ri)
843 DUNE_THROW(InvalidStateException,
"Trying to redistribute in sequential program!");
A constant random access iterator for the Dune::ArrayList class.
Definition: arraylist.hh:377
A set consisting only of one item.
Definition: enumset.hh:59
Decorates an index set with the possibility to find a global index that is mapped to a specific local...
Definition: indexset.hh:507
derive error class from the base class in common
Definition: istlexception.hh:17
Default exception class for range errors.
Definition: exceptions.hh:252
A few common exception classes.
const IndexPair * pair(const std::size_t &local) const
Get the index pair corresponding to a local index.
#define DUNE_THROW(E, m)
Definition: exceptions.hh:216
auto max(ADLTag< 0 >, const V &v1, const V &v2)
implements binary Simd::max()
Definition: defaults.hh:79
Provides a map between global and local indices.
Dune namespace.
Definition: alignedallocator.hh:11
void redistributeMatrix(M &origMatrix, M &newMatrix, C &origComm, C &newComm, RedistributeInformation< C > &ri)
Redistribute a matrix according to given domain decompositions.
Definition: matrixredistribute.hh:818
Classes providing communication interfaces for overlapping Schwarz methods.
Functionality for redistributing a parallel index set using graph partitioning.
Utility class to communicate and set the row sizes of a redistributed matrix.
Definition: matrixredistribute.hh:214
CommMatrixRowSize(const M &m_, RI &rowsize_)
Constructor.
Definition: matrixredistribute.hh:224
Utility class for comunicating the matrix entries.
Definition: matrixredistribute.hh:394
std::vector< size_t > * rowsize
row size information for the receiving side.
Definition: matrixredistribute.hh:450
M & matrix
The matrix to communicate the values of.
Definition: matrixredistribute.hh:444
CommMatrixRow(M &m_, const Dune::GlobalLookupIndexSet< I > &idxset_, const I &aggidxset_, std::vector< size_t > &rowsize_)
Constructor.
Definition: matrixredistribute.hh:410
const Dune::GlobalLookupIndexSet< I > & idxset
Index set for the original matrix.
Definition: matrixredistribute.hh:446
void setOverlapRowsToDirichlet()
Sets the non-owner rows correctly as Dirichlet boundaries.
Definition: matrixredistribute.hh:419
const I & aggidxset
Index set for the redistributed matrix.
Definition: matrixredistribute.hh:448
CommMatrixRow(M &m_, const Dune::GlobalLookupIndexSet< I > &idxset_, const I &aggidxset_)
Constructor.
Definition: matrixredistribute.hh:403
Utility class to communicate and build the sparsity pattern of a redistributed matrix.
Definition: matrixredistribute.hh:243
void storeSparsityPattern(M &m)
Creates and stores the sparsity pattern of the redistributed matrix.
Definition: matrixredistribute.hh:274
void completeSparsityPattern(std::vector< std::set< size_type > > add_sparsity)
Completes the sparsity pattern of the redistributed matrix with data from copy rows for the novlp cas...
Definition: matrixredistribute.hh:338
CommMatrixSparsityPattern(const M &m_, const Dune::GlobalLookupIndexSet< I > &idxset_, const I &aggidxset_)
Constructor for the original side.
Definition: matrixredistribute.hh:252
CommMatrixSparsityPattern(const M &m_, const Dune::GlobalLookupIndexSet< I > &idxset_, const I &aggidxset_, const std::vector< typename M::size_type > &rowsize_)
Constructor for the redistruted side.
Definition: matrixredistribute.hh:263
Default policy used for communicating an indexed type.
Definition: communicator.hh:126
V::value_type IndexedType
The type we get at each index with operator[].
Definition: communicator.hh:145
static int getSize(const V &, int index)
Get the number of primitve elements at that index.
SizeOne IndexedTypeFlag
Whether the indexed type has variable size or there is always one value at each index.
Definition: communicator.hh:151
V Type
The type the policy is for.
Definition: communicator.hh:138
@ nonoverlapping
Category for non-overlapping solvers.
Definition: solvercategory.hh:25
static Category category(const OP &op, decltype(op.category()) *=nullptr)
Helperfunction to extract the solver category either from an enum, or from the newly introduced virtu...
Definition: solvercategory.hh:32
Flag for marking indexed data structures where the data at each index may be a variable multiple of a...
Definition: communicator.hh:116