3 #ifndef DUNE_ISTL_MATRIXREDISTRIBUTE_HH 4 #define DUNE_ISTL_MATRIXREDISTRIBUTE_HH 7 #include <dune/common/exceptions.hh> 8 #include <dune/common/parallel/indexset.hh> 9 #include <dune/common/unused.hh> 29 DUNE_UNUSED_PARAMETER(from);
30 DUNE_UNUSED_PARAMETER(to);
36 DUNE_UNUSED_PARAMETER(from);
37 DUNE_UNUSED_PARAMETER(to);
45 DUNE_UNUSED_PARAMETER(size);
50 DUNE_UNUSED_PARAMETER(size);
55 DUNE_UNUSED_PARAMETER(size);
60 DUNE_UNUSED_PARAMETER(index);
66 DUNE_UNUSED_PARAMETER(index);
72 DUNE_UNUSED_PARAMETER(index);
79 template<
typename T,
typename T1>
86 : interface(), setup_(false)
95 const IS& target, MPI_Comm comm)
97 auto ri = std::make_unique<RemoteIndices<IS> >(source, target, comm);
98 ri->template rebuild<true>();
102 MPI_Comm_rank(MPI_COMM_WORLD, &rank);
104 inf.build(*ri, flags, flags);
110 MPI_Comm_rank(MPI_COMM_WORLD, &rank);
112 std::cout<<
"Interfaces do not match!"<<std::endl;
113 std::cout<<rank<<
": redist interface new :"<<inf<<std::endl;
114 std::cout<<rank<<
": redist interface :"<<interface<<std::endl;
131 template<
class GatherScatter,
class D>
134 BufferedCommunicator communicator;
135 communicator.template build<D>(from,to, interface);
136 communicator.template forward<GatherScatter>(from, to);
139 template<
class GatherScatter,
class D>
143 BufferedCommunicator communicator;
144 communicator.template build<D>(from,to, interface);
145 communicator.template backward<GatherScatter>(from, to);
152 redistribute<CopyGatherScatter<D> >(from,to);
157 redistributeBackward<CopyGatherScatter<D> >(from,to);
169 return rowSize[index];
174 return rowSize[index];
179 return copyrowSize[index];
184 return copyrowSize[index];
189 return backwardscopyrowSize[index];
194 return backwardscopyrowSize[index];
199 rowSize.resize(rows, 0);
204 copyrowSize.resize(rows, 0);
209 backwardscopyrowSize.resize(rows, 0);
213 std::vector<std::size_t> rowSize;
214 std::vector<std::size_t> copyrowSize;
215 std::vector<std::size_t> backwardscopyrowSize;
228 template<
class M,
class RI>
241 : matrix(m_), rowsize(rowsize_)
257 template<
class M,
class I>
269 : matrix(m_), idxset(idxset_), aggidxset(aggidxset_), rowsize()
280 const std::vector<typename M::size_type>& rowsize_)
281 : matrix(m_), idxset(idxset_), aggidxset(aggidxset_), sparsity(aggidxset_.size()), rowsize(&rowsize_)
293 typedef typename Dune::GlobalLookupIndexSet<I>::const_iterator IIter;
299 MPI_Comm_rank(MPI_COMM_WORLD, &rank);
301 for(IIter i= aggidxset.begin(), end=aggidxset.end(); i!=end; ++i) {
302 if(!OwnerSet::contains(i->local().attribute())) {
304 std::cout<<rank<<
" Inserting diagonal for"<<i->local()<<std::endl;
306 sparsity[i->local()].insert(i->local());
309 nnz+=sparsity[i->local()].size();
311 assert( aggidxset.size()==sparsity.size());
314 m.setSize(aggidxset.size(), aggidxset.size(), nnz);
315 m.setBuildMode(M::row_wise);
316 typename M::CreateIterator citer=m.createbegin();
320 Dune::GlobalLookupIndexSet<I> global(aggidxset);
322 typedef typename std::vector<std::set<size_type> >::const_iterator Iter;
323 for(Iter i=sparsity.begin(), end=sparsity.end(); i!=end; ++i, ++citer)
325 typedef typename std::set<size_type>::const_iterator SIter;
326 for(SIter si=i->begin(), send=i->end(); si!=send; ++si)
329 if(i->find(idx)==i->end()) {
330 const typename I::IndexPair* gi=global.pair(idx);
332 std::cout<<rank<<
": row "<<idx<<
" is missing a diagonal entry! global="<<gi->global()<<
" attr="<<gi->local().attribute()<<
" "<<
333 OwnerSet::contains(gi->local().attribute())<<
334 " row size="<<i->size()<<std::endl;
356 for (
unsigned int i = 0; i != sparsity.size(); ++i) {
357 if (add_sparsity[i].size() != 0) {
358 typedef std::set<size_type> Set;
360 std::insert_iterator<Set> tmp_insert (tmp_set, tmp_set.begin());
361 std::set_union(add_sparsity[i].begin(), add_sparsity[i].end(),
362 sparsity[i].begin(), sparsity[i].end(), tmp_insert);
363 sparsity[i].swap(tmp_set);
370 const Dune::GlobalLookupIndexSet<I>&
idxset;
376 template<
class M,
class I>
390 static typename M::size_type
getSize(
const Type& t, std::size_t i)
393 return t.
matrix[i].size();
408 template<
class M,
class I>
419 CommMatrixRow(M& m_,
const Dune::GlobalLookupIndexSet<I>& idxset_,
const I& aggidxset_)
420 : matrix(m_), idxset(idxset_), aggidxset(aggidxset_), rowsize()
426 CommMatrixRow(M& m_,
const Dune::GlobalLookupIndexSet<I>& idxset_,
const I& aggidxset_,
427 std::vector<size_t>& rowsize_)
428 : matrix(m_), idxset(idxset_), aggidxset(aggidxset_), rowsize(&rowsize_)
437 typedef typename Dune::GlobalLookupIndexSet<I>::const_iterator Iter;
440 for(Iter i= aggidxset.begin(), end=aggidxset.end(); i!=end; ++i)
441 if(!OwnerSet::contains(i->local().attribute())) {
443 typedef typename M::ColIterator CIter;
444 for(CIter c=matrix[i->local()].begin(), cend= matrix[i->local()].end();
448 if(c.index()==i->local()) {
449 typedef typename M::block_type::RowIterator RIter;
450 for(RIter r=c->begin(), rend=c->end();
460 const Dune::GlobalLookupIndexSet<I>&
idxset;
467 template<
class M,
class I>
476 typedef std::pair<typename I::GlobalIndex,typename M::block_type>
IndexedType;
481 static std::size_t
getSize(
const Type& t, std::size_t i)
484 return t.
matrix[i].size();
493 template<
class M,
class I,
class RI>
498 static const typename M::size_type
gather(
const Container& cont, std::size_t i)
500 return cont.
matrix[i].size();
502 static void scatter(Container& cont,
const typename M::size_type& rowsize, std::size_t i)
505 cont.
rowsize.getRowSize(i)=rowsize;
510 template<
class M,
class I,
class RI>
515 static const typename M::size_type
gather(
const Container& cont, std::size_t i)
517 return cont.
matrix[i].size();
519 static void scatter(Container& cont,
const typename M::size_type& rowsize, std::size_t i)
522 if (rowsize > cont.
rowsize.getCopyRowSize(i))
523 cont.
rowsize.getCopyRowSize(i)=rowsize;
528 template<
class M,
class I>
538 static const GlobalIndex&
gather(
const Container& cont, std::size_t i, std::size_t j)
541 col=cont.
matrix[i].begin();
542 else if (col!=cont.
matrix[i].end())
549 if (col==cont.
matrix[i].end()) {
550 numlimits = std::numeric_limits<GlobalIndex>::max();
554 const typename I::IndexPair* index=cont.
idxset.pair(col.index());
557 if ( index->local().attribute() != 2)
558 return index->global();
560 numlimits = std::numeric_limits<GlobalIndex>::max();
565 static void scatter(Container& cont,
const GlobalIndex& gi, std::size_t i, std::size_t j)
567 DUNE_UNUSED_PARAMETER(j);
569 if (gi != std::numeric_limits<GlobalIndex>::max()) {
570 const typename I::IndexPair& ip=cont.
aggidxset.at(gi);
571 assert(ip.global()==gi);
572 std::size_t column = ip.local();
576 if(!OwnerSet::contains(ip.local().attribute()))
581 catch(
const Dune::RangeError&) {
585 typedef typename GlobalLookup::IndexPair IndexPair;
589 const IndexPair* pi=lookup.pair(i);
591 if(OwnerSet::contains(pi->local().attribute())) {
593 MPI_Comm_rank(MPI_COMM_WORLD,&rank);
594 std::cout<<rank<<cont.
aggidxset<<std::endl;
595 std::cout<<rank<<
": row "<<i<<
" (global="<<gi <<
") not in index set for owner index "<<pi->global()<<std::endl;
603 template<
class M,
class I>
606 template<
class M,
class I>
610 template<
class M,
class I>
616 typedef typename std::pair<GlobalIndex,typename M::block_type>
Data;
621 static const Data&
gather(
const Container& cont, std::size_t i, std::size_t j)
624 col=cont.
matrix[i].begin();
625 else if (col!=cont.
matrix[i].end())
631 if (col==cont.
matrix[i].end()) {
632 numlimits = std::numeric_limits<GlobalIndex>::max();
633 datastore = std::make_pair(numlimits,*col);
638 const typename I::IndexPair* index=cont.
idxset.pair(col.index());
642 if ( index->local().attribute() != 2)
643 datastore = std::make_pair(index->global(),*
col);
645 numlimits = std::numeric_limits<GlobalIndex>::max();
646 datastore = std::make_pair(numlimits,*col);
651 static void scatter(Container& cont,
const Data& data, std::size_t i, std::size_t j)
653 DUNE_UNUSED_PARAMETER(j);
655 if (data.first != std::numeric_limits<GlobalIndex>::max()) {
656 typename M::size_type column=cont.
aggidxset.at(data.first).local();
657 cont.
matrix[i][column]=data.second;
660 catch(
const Dune::RangeError&) {
667 template<
class M,
class I>
670 template<
class M,
class I>
673 template<
class M,
class I>
676 template<
typename M,
typename C>
680 typename C::CopySet copyflags;
681 typename C::OwnerSet ownerflags;
682 typedef typename C::ParallelIndexSet IndexSet;
684 std::vector<typename M::size_type> rowsize(newComm.indexSet().size(), 0);
685 std::vector<typename M::size_type> copyrowsize(newComm.indexSet().size(), 0);
686 std::vector<typename M::size_type> backwardscopyrowsize(origComm.indexSet().size(), 0);
690 ri.template redistribute<MatrixRowSizeGatherScatter<M,IndexSet,RI> >(commRowSize,commRowSize);
692 origComm.buildGlobalLookup();
694 for (std::size_t i=0; i < newComm.indexSet().size(); i++) {
699 origsp(origMatrix, origComm.globalLookup(), newComm.indexSet());
701 newsp(origMatrix, origComm.globalLookup(), newComm.indexSet(), rowsize);
703 ri.template redistribute<MatrixSparsityPatternGatherScatter<M,IndexSet> >(origsp,newsp);
707 RemoteIndices<IndexSet> *ris =
new RemoteIndices<IndexSet>(origComm.indexSet(),
709 origComm.communicator());
710 ris->template rebuild<true>();
712 ri.getInterface().free();
713 ri.getInterface().build(*ris,copyflags,ownerflags);
717 ri.template redistribute<MatrixCopyRowSizeGatherScatter<M,IndexSet,RI> >(commRowSize_copy,
720 for (std::size_t i=0; i < newComm.indexSet().size(); i++) {
725 for (std::size_t i=0; i < origComm.indexSet().size(); i++) {
731 origComm.globalLookup(),
733 backwardscopyrowsize);
735 newComm.indexSet(), copyrowsize);
736 ri.template redistribute<MatrixSparsityPatternGatherScatter<M,IndexSet> >(origsp_copy,
739 newsp.completeSparsityPattern(newsp_copy.sparsity);
740 newsp.storeSparsityPattern(newMatrix);
743 newsp.storeSparsityPattern(newMatrix);
745 #ifdef DUNE_ISTL_WITH_CHECKING 748 typedef typename M::ConstRowIterator RIter;
749 for(RIter row=newMatrix.begin(), rend=newMatrix.end(); row != rend; ++row) {
750 typedef typename M::ConstColIterator CIter;
751 for(CIter
col=row->begin(), cend=row->end();
col!=cend; ++
col)
754 newMatrix[
col.index()][row.index()];
756 std::cerr<<newComm.communicator().rank()<<
": entry (" 757 <<
col.index()<<
","<<row.index()<<
") missing! for symmetry!"<<std::endl;
766 DUNE_THROW(
ISTLError,
"Matrix not symmetric!");
770 template<
typename M,
typename C>
774 typedef typename C::ParallelIndexSet IndexSet;
775 typename C::OwnerSet ownerflags;
776 std::vector<typename M::size_type> rowsize(newComm.indexSet().size(), 0);
777 std::vector<typename M::size_type> copyrowsize(newComm.indexSet().size(), 0);
778 std::vector<typename M::size_type> backwardscopyrowsize(origComm.indexSet().size(), 0);
780 for (std::size_t i=0; i < newComm.indexSet().size(); i++) {
787 for (std::size_t i=0; i < origComm.indexSet().size(); i++)
795 newComm.indexSet(), backwardscopyrowsize);
797 newComm.indexSet(),copyrowsize);
798 ri.template redistribute<MatrixRowGatherScatter<M,IndexSet> >(origrow_copy,
800 ri.getInterface().free();
801 RemoteIndices<IndexSet> *ris =
new RemoteIndices<IndexSet>(origComm.indexSet(),
803 origComm.communicator());
804 ris->template rebuild<true>();
805 ri.getInterface().build(*ris,ownerflags,ownerflags);
809 origrow(origMatrix, origComm.globalLookup(), newComm.indexSet());
811 newrow(newMatrix, origComm.globalLookup(), newComm.indexSet(),rowsize);
812 ri.template redistribute<MatrixRowGatherScatter<M,IndexSet> >(origrow,newrow);
814 newrow.setOverlapRowsToDirichlet();
833 template<
typename M,
typename C>
851 DUNE_THROW(InvalidStateException,
"Trying to redistribute in sequential program!");
859 DUNE_THROW(InvalidStateException,
"Trying to redistribute in sequential program!");
RedistributeInformation()
Definition: matrixredistribute.hh:85
void reserve(std::size_t size)
Definition: matrixredistribute.hh:164
Dune::GlobalLookupIndexSet< I > LookupIndexSet
Definition: matrixredistribute.hh:369
std::size_t getBackwardsCopyRowSize(std::size_t index) const
Definition: matrixredistribute.hh:192
CommMatrixRowSize< M, RI > Container
Definition: matrixredistribute.hh:496
void setNoRows(std::size_t size)
Definition: matrixredistribute.hh:43
void setNoRows(std::size_t rows)
Definition: matrixredistribute.hh:197
Definition: matrixredistribute.hh:494
void redistribute(const D &from, D &to) const
Definition: matrixredistribute.hh:132
CommMatrixRow< M, I > Type
Definition: matrixredistribute.hh:470
EnumItem< AttributeSet, OwnerOverlapCopyAttributeSet::owner > OwnerSet
Definition: owneroverlapcopy.hh:192
Definition: allocator.hh:7
void storeSparsityPattern(M &m)
Creates and stores the sparsity pattern of the redistributed matrix.
Definition: matrixredistribute.hh:290
RedistributeInterface & getInterface()
Definition: matrixredistribute.hh:89
std::vector< size_t > * rowsize
row size information for the receiving side.
Definition: matrixredistribute.hh:464
std::pair< GlobalIndex, typename M::block_type > Data
Definition: matrixredistribute.hh:616
const std::vector< size_type > * rowsize
Definition: matrixredistribute.hh:373
Definition: matrixredistribute.hh:529
Functionality for redistributing a parallel index set using graph partitioning.
I::GlobalIndex GlobalIndex
Definition: matrixredistribute.hh:613
std::size_t & getCopyRowSize(std::size_t index)
Definition: matrixredistribute.hh:177
void redistribute(const D &from, D &to) const
Definition: matrixredistribute.hh:150
void redistributeSparsityPattern(M &origMatrix, M &newMatrix, C &origComm, C &newComm, RedistributeInformation< C > &ri)
Definition: matrixredistribute.hh:677
static const M::size_type gather(const Container &cont, std::size_t i)
Definition: matrixredistribute.hh:498
M::size_type size_type
Definition: matrixredistribute.hh:233
RI & rowsize
Definition: matrixredistribute.hh:244
CommMatrixRow< M, I > Container
Definition: matrixredistribute.hh:614
std::pair< typename I::GlobalIndex, typename M::block_type > IndexedType
The indexed type we send. This is the pair of global index indentitfying the column and the value its...
Definition: matrixredistribute.hh:476
static M::size_type getSize(const Type &t, std::size_t i)
Definition: matrixredistribute.hh:390
static void scatter(Container &cont, const GlobalIndex &gi, std::size_t i, std::size_t j)
Definition: matrixredistribute.hh:565
static void scatter(Container &cont, const typename M::size_type &rowsize, std::size_t i)
Definition: matrixredistribute.hh:519
I::GlobalIndex GlobalIndex
Definition: matrixredistribute.hh:531
VariableSize IndexedTypeFlag
Each row varies in size.
Definition: matrixredistribute.hh:479
static ColIter col
Definition: matrixredistribute.hh:617
CommMatrixSparsityPattern(const M &m_, const Dune::GlobalLookupIndexSet< I > &idxset_, const I &aggidxset_)
Constructor for the original side.
Definition: matrixredistribute.hh:268
Category for non-overlapping solvers.
Definition: solvercategory.hh:25
void redistributeMatrix(M &origMatrix, M &newMatrix, C &origComm, C &newComm, RedistributeInformation< C > &ri)
Redistribute a matrix according to given domain decompositions.
Definition: matrixredistribute.hh:834
CommMatrixRowSize(const M &m_, RI &rowsize_)
Constructor.
Definition: matrixredistribute.hh:240
M::size_type size_type
Definition: matrixredistribute.hh:260
std::size_t getBackwardsCopyRowSize(std::size_t index) const
Definition: matrixredistribute.hh:70
static GlobalIndex numlimits
Definition: matrixredistribute.hh:619
static const M::size_type gather(const Container &cont, std::size_t i)
Definition: matrixredistribute.hh:515
CommMatrixRow(M &m_, const Dune::GlobalLookupIndexSet< I > &idxset_, const I &aggidxset_, std::vector< size_t > &rowsize_)
Constructor.
Definition: matrixredistribute.hh:426
void setSetup()
Definition: matrixredistribute.hh:120
const I & aggidxset
Index set for the redistributed matrix.
Definition: matrixredistribute.hh:462
M::ConstColIterator ColIter
Definition: matrixredistribute.hh:533
M & matrix
The matrix to communicate the values of.
Definition: matrixredistribute.hh:458
bool isSetup() const
Definition: matrixredistribute.hh:159
I::GlobalIndex IndexedType
The indexed type we send. This is the global index indentitfying the column.
Definition: matrixredistribute.hh:385
Utility class to communicate and set the row sizes of a redistributed matrix.
Definition: matrixredistribute.hh:229
static void scatter(Container &cont, const Data &data, std::size_t i, std::size_t j)
Definition: matrixredistribute.hh:651
static void scatter(Container &cont, const typename M::size_type &rowsize, std::size_t i)
Definition: matrixredistribute.hh:502
const M & matrix
Definition: matrixredistribute.hh:368
Definition: matrixredistribute.hh:511
const I & aggidxset
Definition: matrixredistribute.hh:371
static std::size_t getSize(const Type &t, std::size_t i)
Definition: matrixredistribute.hh:481
std::size_t getCopyRowSize(std::size_t index) const
Definition: matrixredistribute.hh:64
static Data datastore
Definition: matrixredistribute.hh:618
void checkInterface(const IS &source, const IS &target, MPI_Comm comm)
Definition: matrixredistribute.hh:94
CommMatrixSparsityPattern< M, I > Container
Definition: matrixredistribute.hh:532
void redistribute(const D &from, D &to) const
Definition: matrixredistribute.hh:27
void redistributeBackward(D &from, const D &to) const
Definition: matrixredistribute.hh:140
CommMatrixRow(M &m_, const Dune::GlobalLookupIndexSet< I > &idxset_, const I &aggidxset_)
Constructor.
Definition: matrixredistribute.hh:419
void resetSetup()
Definition: matrixredistribute.hh:40
M::size_type value_type
Definition: matrixredistribute.hh:232
static const Data & gather(const Container &cont, std::size_t i, std::size_t j)
Definition: matrixredistribute.hh:621
const Dune::GlobalLookupIndexSet< I > & idxset
Index set for the original matrix.
Definition: matrixredistribute.hh:460
derive error class from the base class in common
Definition: istlexception.hh:16
const M & matrix
Definition: matrixredistribute.hh:243
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:354
void setNoCopyRows(std::size_t size)
Definition: matrixredistribute.hh:48
Definition: matrixredistribute.hh:611
std::vector< std::set< size_type > > sparsity
Definition: matrixredistribute.hh:372
std::size_t getCopyRowSize(std::size_t index) const
Definition: matrixredistribute.hh:182
void redistributeBackward(D &from, const D &to) const
Definition: matrixredistribute.hh:34
void resetSetup()
Definition: matrixredistribute.hh:126
void setNoBackwardsCopyRows(std::size_t rows)
Definition: matrixredistribute.hh:207
bool isSetup() const
Definition: matrixredistribute.hh:22
CommMatrixSparsityPattern< M, I > Type
Definition: matrixredistribute.hh:379
std::size_t & getBackwardsCopyRowSize(std::size_t index)
Definition: matrixredistribute.hh:187
CommMatrixRowSize< M, RI > Container
Definition: matrixredistribute.hh:513
Definition: repartition.hh:265
void redistributeBackward(D &from, const D &to) const
Definition: matrixredistribute.hh:155
std::size_t getRowSize(std::size_t index) const
Definition: matrixredistribute.hh:172
VariableSize IndexedTypeFlag
Each row varies in size.
Definition: matrixredistribute.hh:388
Col col
Definition: matrixmatrix.hh:349
A class setting up standard communication for a two-valued attribute set with owner/overlap/copy sema...
Definition: owneroverlapcopy.hh:171
Classes providing communication interfaces for overlapping Schwarz methods.
const Dune::GlobalLookupIndexSet< I > & idxset
Definition: matrixredistribute.hh:370
std::size_t getRowSize(std::size_t index) const
Definition: matrixredistribute.hh:58
Utility class to communicate and build the sparsity pattern of a redistributed matrix.
Definition: matrixredistribute.hh:258
static GlobalIndex numlimits
Definition: matrixredistribute.hh:536
Definition: matrixredistribute.hh:20
void setOverlapRowsToDirichlet()
Sets the non-owner rows correctly as Dirichlet boundaries.
Definition: matrixredistribute.hh:435
void setNoCopyRows(std::size_t rows)
Definition: matrixredistribute.hh:202
void setNoBackwardsCopyRows(std::size_t size)
Definition: matrixredistribute.hh:53
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:279
static ColIter col
Definition: matrixredistribute.hh:535
M::ConstColIterator ColIter
Definition: matrixredistribute.hh:615
static const GlobalIndex & gather(const Container &cont, std::size_t i, std::size_t j)
Definition: matrixredistribute.hh:538
void redistributeMatrixEntries(M &origMatrix, M &newMatrix, C &origComm, C &newComm, RedistributeInformation< C > &ri)
Definition: matrixredistribute.hh:771
Utility class for comunicating the matrix entries.
Definition: matrixredistribute.hh:409
std::size_t & getRowSize(std::size_t index)
Definition: matrixredistribute.hh:167
OwnerOverlapCopyCommunication< T, T1 > Comm
Definition: matrixredistribute.hh:83