Dune Core Modules (2.6.0)

matrixredistribute.hh
Go to the documentation of this file.
1// -*- tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 2 -*-
2// vi: set et ts=4 sw=2 sts=2:
3#ifndef DUNE_ISTL_MATRIXREDISTRIBUTE_HH
4#define DUNE_ISTL_MATRIXREDISTRIBUTE_HH
5#include <memory>
6#include "repartition.hh"
7#include <dune/common/exceptions.hh>
8#include <dune/common/parallel/indexset.hh>
9#include <dune/common/unused.hh>
10#include <dune/istl/owneroverlapcopy.hh>
11#include <dune/istl/paamg/pinfo.hh>
17namespace Dune
18{
19 template<typename T>
20 struct RedistributeInformation
21 {
22 bool isSetup() const
23 {
24 return false;
25 }
26 template<class D>
27 void redistribute(const D& from, D& to) const
28 {
29 DUNE_UNUSED_PARAMETER(from);
30 DUNE_UNUSED_PARAMETER(to);
31 }
32
33 template<class D>
34 void redistributeBackward(D& from, const D& to) const
35 {
36 DUNE_UNUSED_PARAMETER(from);
37 DUNE_UNUSED_PARAMETER(to);
38 }
39
40 void resetSetup()
41 {}
42
43 void setNoRows(std::size_t size)
44 {
45 DUNE_UNUSED_PARAMETER(size);
46 }
47
48 void setNoCopyRows(std::size_t size)
49 {
50 DUNE_UNUSED_PARAMETER(size);
51 }
52
53 void setNoBackwardsCopyRows(std::size_t size)
54 {
55 DUNE_UNUSED_PARAMETER(size);
56 }
57
58 std::size_t getRowSize(std::size_t index) const
59 {
60 DUNE_UNUSED_PARAMETER(index);
61 return -1;
62 }
63
64 std::size_t getCopyRowSize(std::size_t index) const
65 {
66 DUNE_UNUSED_PARAMETER(index);
67 return -1;
68 }
69
70 std::size_t getBackwardsCopyRowSize(std::size_t index) const
71 {
72 DUNE_UNUSED_PARAMETER(index);
73 return -1;
74 }
75
76 };
77
78#if HAVE_MPI
79 template<typename T, typename T1>
80 class RedistributeInformation<OwnerOverlapCopyCommunication<T,T1> >
81 {
82 public:
83 typedef OwnerOverlapCopyCommunication<T,T1> Comm;
84
85 RedistributeInformation()
86 : interface(), setup_(false)
87 {}
88
89 RedistributeInterface& getInterface()
90 {
91 return interface;
92 }
93 template<typename IS>
94 void checkInterface(const IS& source,
95 const IS& target, MPI_Comm comm)
96 {
97 auto ri = std::make_unique<RemoteIndices<IS> >(source, target, comm);
98 ri->template rebuild<true>();
99 Interface inf;
100 typename OwnerOverlapCopyCommunication<int>::OwnerSet flags;
101 int rank;
102 MPI_Comm_rank(MPI_COMM_WORLD, &rank);
103 inf.free();
104 inf.build(*ri, flags, flags);
105
106
107#ifdef DEBUG_REPART
108 if(inf!=interface) {
109
110 MPI_Comm_rank(MPI_COMM_WORLD, &rank);
111 if(rank==0)
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;
115
116 throw "autsch!";
117 }
118#endif
119 }
120 void setSetup()
121 {
122 setup_=true;
123 interface.strip();
124 }
125
126 void resetSetup()
127 {
128 setup_=false;
129 }
130
131 template<class GatherScatter, class D>
132 void redistribute(const D& from, D& to) const
133 {
134 BufferedCommunicator communicator;
135 communicator.template build<D>(from,to, interface);
136 communicator.template forward<GatherScatter>(from, to);
137 communicator.free();
138 }
139 template<class GatherScatter, class D>
140 void redistributeBackward(D& from, const D& to) const
141 {
142
143 BufferedCommunicator communicator;
144 communicator.template build<D>(from,to, interface);
145 communicator.template backward<GatherScatter>(from, to);
146 communicator.free();
147 }
148
149 template<class D>
150 void redistribute(const D& from, D& to) const
151 {
152 redistribute<CopyGatherScatter<D> >(from,to);
153 }
154 template<class D>
155 void redistributeBackward(D& from, const D& to) const
156 {
157 redistributeBackward<CopyGatherScatter<D> >(from,to);
158 }
159 bool isSetup() const
160 {
161 return setup_;
162 }
163
164 void reserve(std::size_t size)
165 {}
166
167 std::size_t& getRowSize(std::size_t index)
168 {
169 return rowSize[index];
170 }
171
172 std::size_t getRowSize(std::size_t index) const
173 {
174 return rowSize[index];
175 }
176
177 std::size_t& getCopyRowSize(std::size_t index)
178 {
179 return copyrowSize[index];
180 }
181
182 std::size_t getCopyRowSize(std::size_t index) const
183 {
184 return copyrowSize[index];
185 }
186
187 std::size_t& getBackwardsCopyRowSize(std::size_t index)
188 {
189 return backwardscopyrowSize[index];
190 }
191
192 std::size_t getBackwardsCopyRowSize(std::size_t index) const
193 {
194 return backwardscopyrowSize[index];
195 }
196
197 void setNoRows(std::size_t rows)
198 {
199 rowSize.resize(rows, 0);
200 }
201
202 void setNoCopyRows(std::size_t rows)
203 {
204 copyrowSize.resize(rows, 0);
205 }
206
207 void setNoBackwardsCopyRows(std::size_t rows)
208 {
209 backwardscopyrowSize.resize(rows, 0);
210 }
211
212 private:
213 std::vector<std::size_t> rowSize;
214 std::vector<std::size_t> copyrowSize;
215 std::vector<std::size_t> backwardscopyrowSize;
216 RedistributeInterface interface;
217 bool setup_;
218 };
219
228 template<class M, class RI>
229 struct CommMatrixRowSize
230 {
231 // Make the default communication policy work.
232 typedef typename M::size_type value_type;
233 typedef typename M::size_type size_type;
234
240 CommMatrixRowSize(const M& m_, RI& rowsize_)
241 : matrix(m_), rowsize(rowsize_)
242 {}
243 const M& matrix;
244 RI& rowsize;
245
246 };
247
248
257 template<class M, class I>
258 struct CommMatrixSparsityPattern
259 {
260 typedef typename M::size_type size_type;
261
268 CommMatrixSparsityPattern(const M& m_, const Dune::GlobalLookupIndexSet<I>& idxset_, const I& aggidxset_)
269 : matrix(m_), idxset(idxset_), aggidxset(aggidxset_), rowsize()
270 {}
271
279 CommMatrixSparsityPattern(const M& m_, const Dune::GlobalLookupIndexSet<I>& idxset_, const I& aggidxset_,
280 const std::vector<typename M::size_type>& rowsize_)
281 : matrix(m_), idxset(idxset_), aggidxset(aggidxset_), sparsity(aggidxset_.size()), rowsize(&rowsize_)
282 {}
283
290 void storeSparsityPattern(M& m)
291 {
292 // insert diagonal to overlap rows
293 typedef typename Dune::GlobalLookupIndexSet<I>::const_iterator IIter;
294 typedef typename Dune::OwnerOverlapCopyCommunication<int>::OwnerSet OwnerSet;
295 std::size_t nnz=0;
296#ifdef DEBUG_REPART
297 int rank;
298
299 MPI_Comm_rank(MPI_COMM_WORLD, &rank);
300#endif
301 for(IIter i= aggidxset.begin(), end=aggidxset.end(); i!=end; ++i) {
302 if(!OwnerSet::contains(i->local().attribute())) {
303#ifdef DEBUG_REPART
304 std::cout<<rank<<" Inserting diagonal for"<<i->local()<<std::endl;
305#endif
306 sparsity[i->local()].insert(i->local());
307 }
308
309 nnz+=sparsity[i->local()].size();
310 }
311 assert( aggidxset.size()==sparsity.size());
312
313 if(nnz>0) {
314 m.setSize(aggidxset.size(), aggidxset.size(), nnz);
315 m.setBuildMode(M::row_wise);
316 typename M::CreateIterator citer=m.createbegin();
317#ifdef DEBUG_REPART
318 std::size_t idx=0;
319 bool correct=true;
320 Dune::GlobalLookupIndexSet<I> global(aggidxset);
321#endif
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)
324 {
325 typedef typename std::set<size_type>::const_iterator SIter;
326 for(SIter si=i->begin(), send=i->end(); si!=send; ++si)
327 citer.insert(*si);
328#ifdef DEBUG_REPART
329 if(i->find(idx)==i->end()) {
330 const typename I::IndexPair* gi=global.pair(idx);
331 assert(gi);
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;
335 correct=false;
336 }
337 ++idx;
338#endif
339 }
340#ifdef DEBUG_REPART
341 if(!correct)
342 throw "bla";
343#endif
344 }
345 }
346
354 void completeSparsityPattern(std::vector<std::set<size_type> > add_sparsity)
355 {
356 for (unsigned int i = 0; i != sparsity.size(); ++i) {
357 if (add_sparsity[i].size() != 0) {
358 typedef std::set<size_type> Set;
359 Set tmp_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);
364 }
365 }
366 }
367
368 const M& matrix;
369 typedef Dune::GlobalLookupIndexSet<I> LookupIndexSet;
370 const Dune::GlobalLookupIndexSet<I>& idxset;
371 const I& aggidxset;
372 std::vector<std::set<size_type> > sparsity;
373 const std::vector<size_type>* rowsize;
374 };
375
376 template<class M, class I>
377 struct CommPolicy<CommMatrixSparsityPattern<M,I> >
378 {
379 typedef CommMatrixSparsityPattern<M,I> Type;
380
385 typedef typename I::GlobalIndex IndexedType;
386
388 typedef VariableSize IndexedTypeFlag;
389
390 static typename M::size_type getSize(const Type& t, std::size_t i)
391 {
392 if(!t.rowsize)
393 return t.matrix[i].size();
394 else
395 {
396 assert((*t.rowsize)[i]>0);
397 return (*t.rowsize)[i];
398 }
399 }
400 };
401
408 template<class M, class I>
409 struct CommMatrixRow
410 {
419 CommMatrixRow(M& m_, const Dune::GlobalLookupIndexSet<I>& idxset_, const I& aggidxset_)
420 : matrix(m_), idxset(idxset_), aggidxset(aggidxset_), rowsize()
421 {}
422
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_)
429 {}
435 void setOverlapRowsToDirichlet()
436 {
437 typedef typename Dune::GlobalLookupIndexSet<I>::const_iterator Iter;
438 typedef typename Dune::OwnerOverlapCopyCommunication<int>::OwnerSet OwnerSet;
439
440 for(Iter i= aggidxset.begin(), end=aggidxset.end(); i!=end; ++i)
441 if(!OwnerSet::contains(i->local().attribute())) {
442 // Set to Dirchlet
443 typedef typename M::ColIterator CIter;
444 for(CIter c=matrix[i->local()].begin(), cend= matrix[i->local()].end();
445 c!= cend; ++c)
446 {
447 *c=0;
448 if(c.index()==i->local()) {
449 typedef typename M::block_type::RowIterator RIter;
450 for(RIter r=c->begin(), rend=c->end();
451 r != rend; ++r)
452 (*r)[r.index()]=1;
453 }
454 }
455 }
456 }
458 M& matrix;
460 const Dune::GlobalLookupIndexSet<I>& idxset;
462 const I& aggidxset;
464 std::vector<size_t>* rowsize; // row sizes differ from sender side in overlap!
465 };
466
467 template<class M, class I>
468 struct CommPolicy<CommMatrixRow<M,I> >
469 {
470 typedef CommMatrixRow<M,I> Type;
471
476 typedef std::pair<typename I::GlobalIndex,typename M::block_type> IndexedType;
477
479 typedef VariableSize IndexedTypeFlag;
480
481 static std::size_t getSize(const Type& t, std::size_t i)
482 {
483 if(!t.rowsize)
484 return t.matrix[i].size();
485 else
486 {
487 assert((*t.rowsize)[i]>0);
488 return (*t.rowsize)[i];
489 }
490 }
491 };
492
493 template<class M, class I, class RI>
494 struct MatrixRowSizeGatherScatter
495 {
496 typedef CommMatrixRowSize<M,RI> Container;
497
498 static const typename M::size_type gather(const Container& cont, std::size_t i)
499 {
500 return cont.matrix[i].size();
501 }
502 static void scatter(Container& cont, const typename M::size_type& rowsize, std::size_t i)
503 {
504 assert(rowsize);
505 cont.rowsize.getRowSize(i)=rowsize;
506 }
507
508 };
509
510 template<class M, class I, class RI>
511 struct MatrixCopyRowSizeGatherScatter
512 {
513 typedef CommMatrixRowSize<M,RI> Container;
514
515 static const typename M::size_type gather(const Container& cont, std::size_t i)
516 {
517 return cont.matrix[i].size();
518 }
519 static void scatter(Container& cont, const typename M::size_type& rowsize, std::size_t i)
520 {
521 assert(rowsize);
522 if (rowsize > cont.rowsize.getCopyRowSize(i))
523 cont.rowsize.getCopyRowSize(i)=rowsize;
524 }
525
526 };
527
528 template<class M, class I>
529 struct MatrixSparsityPatternGatherScatter
530 {
531 typedef typename I::GlobalIndex GlobalIndex;
532 typedef CommMatrixSparsityPattern<M,I> Container;
533 typedef typename M::ConstColIterator ColIter;
534
535 static ColIter col;
536 static GlobalIndex numlimits;
537
538 static const GlobalIndex& gather(const Container& cont, std::size_t i, std::size_t j)
539 {
540 if(j==0)
541 col=cont.matrix[i].begin();
542 else if (col!=cont.matrix[i].end())
543 ++col;
544
545 //copy communication: different row sizes for copy rows with the same global index
546 //are possible. If all values of current matrix row are sent, send
547 //std::numeric_limits<GlobalIndex>::max()
548 //and receiver will ignore it.
549 if (col==cont.matrix[i].end()) {
550 numlimits = std::numeric_limits<GlobalIndex>::max();
551 return numlimits;
552 }
553 else {
554 const typename I::IndexPair* index=cont.idxset.pair(col.index());
555 assert(index);
556 // Only send index if col is no ghost
557 if ( index->local().attribute() != 2)
558 return index->global();
559 else {
560 numlimits = std::numeric_limits<GlobalIndex>::max();
561 return numlimits;
562 }
563 }
564 }
565 static void scatter(Container& cont, const GlobalIndex& gi, std::size_t i, std::size_t j)
566 {
567 DUNE_UNUSED_PARAMETER(j);
568 try{
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();
573 cont.sparsity[i].insert(column);
574
575 typedef typename Dune::OwnerOverlapCopyCommunication<int>::OwnerSet OwnerSet;
576 if(!OwnerSet::contains(ip.local().attribute()))
577 // preserve symmetry for overlap
578 cont.sparsity[column].insert(i);
579 }
580 }
581 catch(Dune::RangeError er) {
582 // Entry not present in the new index set. Ignore!
583#ifdef DEBUG_REPART
584 typedef typename Container::LookupIndexSet GlobalLookup;
585 typedef typename GlobalLookup::IndexPair IndexPair;
586 typedef typename Dune::OwnerOverlapCopyCommunication<int>::OwnerSet OwnerSet;
587
588 GlobalLookup lookup(cont.aggidxset);
589 const IndexPair* pi=lookup.pair(i);
590 assert(pi);
591 if(OwnerSet::contains(pi->local().attribute())) {
592 int rank;
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;
596 throw er;
597 }
598#endif
599 }
600 }
601
602 };
603 template<class M, class I>
604 typename MatrixSparsityPatternGatherScatter<M,I>::ColIter MatrixSparsityPatternGatherScatter<M,I>::col;
605
606 template<class M, class I>
607 typename MatrixSparsityPatternGatherScatter<M,I>::GlobalIndex MatrixSparsityPatternGatherScatter<M,I>::numlimits;
608
609
610 template<class M, class I>
611 struct MatrixRowGatherScatter
612 {
613 typedef typename I::GlobalIndex GlobalIndex;
614 typedef CommMatrixRow<M,I> Container;
615 typedef typename M::ConstColIterator ColIter;
616 typedef typename std::pair<GlobalIndex,typename M::block_type> Data;
617 static ColIter col;
618 static Data datastore;
619 static GlobalIndex numlimits;
620
621 static const Data& gather(const Container& cont, std::size_t i, std::size_t j)
622 {
623 if(j==0)
624 col=cont.matrix[i].begin();
625 else if (col!=cont.matrix[i].end())
626 ++col;
627 // copy communication: different row sizes for copy rows with the same global index
628 // are possible. If all values of current matrix row are sent, send
629 // std::numeric_limits<GlobalIndex>::max()
630 // and receiver will ignore it.
631 if (col==cont.matrix[i].end()) {
632 numlimits = std::numeric_limits<GlobalIndex>::max();
633 datastore = std::make_pair(numlimits,*col);
634 return datastore;
635 }
636 else {
637 // convert local column index to global index
638 const typename I::IndexPair* index=cont.idxset.pair(col.index());
639 assert(index);
640 // Store the data to prevent reference to temporary
641 // Only send index if col is no ghost
642 if ( index->local().attribute() != 2)
643 datastore = std::make_pair(index->global(),*col);
644 else {
645 numlimits = std::numeric_limits<GlobalIndex>::max();
646 datastore = std::make_pair(numlimits,*col);
647 }
648 return datastore;
649 }
650 }
651 static void scatter(Container& cont, const Data& data, std::size_t i, std::size_t j)
652 {
653 DUNE_UNUSED_PARAMETER(j);
654 try{
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;
658 }
659 }
660 catch(Dune::RangeError er) {
661 // This an overlap row and might therefore lack some entries!
662 }
663
664 }
665 };
666
667 template<class M, class I>
668 typename MatrixRowGatherScatter<M,I>::ColIter MatrixRowGatherScatter<M,I>::col;
669
670 template<class M, class I>
671 typename MatrixRowGatherScatter<M,I>::Data MatrixRowGatherScatter<M,I>::datastore;
672
673 template<class M, class I>
674 typename MatrixRowGatherScatter<M,I>::GlobalIndex MatrixRowGatherScatter<M,I>::numlimits;
675
676 template<typename M, typename C>
677 void redistributeSparsityPattern(M& origMatrix, M& newMatrix, C& origComm, C& newComm,
678 RedistributeInformation<C>& ri)
679 {
680 typename C::CopySet copyflags;
681 typename C::OwnerSet ownerflags;
682 typedef typename C::ParallelIndexSet IndexSet;
683 typedef RedistributeInformation<C> RI;
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);
687
688 // get owner rowsizes
689 CommMatrixRowSize<M,RI> commRowSize(origMatrix, ri);
690 ri.template redistribute<MatrixRowSizeGatherScatter<M,IndexSet,RI> >(commRowSize,commRowSize);
691
692 origComm.buildGlobalLookup();
693
694 for (std::size_t i=0; i < newComm.indexSet().size(); i++) {
695 rowsize[i] = ri.getRowSize(i);
696 }
697 // get sparsity pattern from owner rows
698 CommMatrixSparsityPattern<M,IndexSet>
699 origsp(origMatrix, origComm.globalLookup(), newComm.indexSet());
700 CommMatrixSparsityPattern<M,IndexSet>
701 newsp(origMatrix, origComm.globalLookup(), newComm.indexSet(), rowsize);
702
703 ri.template redistribute<MatrixSparsityPatternGatherScatter<M,IndexSet> >(origsp,newsp);
704
705 // build copy to owner interface to get missing matrix values for novlp case
706 if (origComm.getSolverCategory() == SolverCategory::nonoverlapping) {
707 RemoteIndices<IndexSet> *ris = new RemoteIndices<IndexSet>(origComm.indexSet(),
708 newComm.indexSet(),
709 origComm.communicator());
710 ris->template rebuild<true>();
711
712 ri.getInterface().free();
713 ri.getInterface().build(*ris,copyflags,ownerflags);
714
715 // get copy rowsizes
716 CommMatrixRowSize<M,RI> commRowSize_copy(origMatrix, ri);
717 ri.template redistribute<MatrixCopyRowSizeGatherScatter<M,IndexSet,RI> >(commRowSize_copy,
718 commRowSize_copy);
719
720 for (std::size_t i=0; i < newComm.indexSet().size(); i++) {
721 copyrowsize[i] = ri.getCopyRowSize(i);
722 }
723 //get copy rowsizes for sender
724 ri.redistributeBackward(backwardscopyrowsize,copyrowsize);
725 for (std::size_t i=0; i < origComm.indexSet().size(); i++) {
726 ri.getBackwardsCopyRowSize(i) = backwardscopyrowsize[i];
727 }
728
729 // get sparsity pattern from copy rows
730 CommMatrixSparsityPattern<M,IndexSet> origsp_copy(origMatrix,
731 origComm.globalLookup(),
732 newComm.indexSet(),
733 backwardscopyrowsize);
734 CommMatrixSparsityPattern<M,IndexSet> newsp_copy(origMatrix, origComm.globalLookup(),
735 newComm.indexSet(), copyrowsize);
736 ri.template redistribute<MatrixSparsityPatternGatherScatter<M,IndexSet> >(origsp_copy,
737 newsp_copy);
738
739 newsp.completeSparsityPattern(newsp_copy.sparsity);
740 newsp.storeSparsityPattern(newMatrix);
741 }
742 else
743 newsp.storeSparsityPattern(newMatrix);
744
745#ifdef DUNE_ISTL_WITH_CHECKING
746 // Check for symmetry
747 int ret=0;
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)
752 {
753 try{
754 newMatrix[col.index()][row.index()];
755 }catch(Dune::ISTLError e) {
756 std::cerr<<newComm.communicator().rank()<<": entry ("
757 <<col.index()<<","<<row.index()<<") missing! for symmetry!"<<std::endl;
758 ret=1;
759
760 }
761
762 }
763 }
764
765 if(ret)
766 DUNE_THROW(ISTLError, "Matrix not symmetric!");
767#endif
768 }
769
770 template<typename M, typename C>
771 void redistributeMatrixEntries(M& origMatrix, M& newMatrix, C& origComm, C& newComm,
772 RedistributeInformation<C>& ri)
773 {
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);
779
780 for (std::size_t i=0; i < newComm.indexSet().size(); i++) {
781 rowsize[i] = ri.getRowSize(i);
782 if (origComm.getSolverCategory() == SolverCategory::nonoverlapping) {
783 copyrowsize[i] = ri.getCopyRowSize(i);
784 }
785 }
786
787 for (std::size_t i=0; i < origComm.indexSet().size(); i++)
788 if (origComm.getSolverCategory() == SolverCategory::nonoverlapping)
789 backwardscopyrowsize[i] = ri.getBackwardsCopyRowSize(i);
790
791
792 if (origComm.getSolverCategory() == SolverCategory::nonoverlapping) {
793 // fill sparsity pattern from copy rows
794 CommMatrixRow<M,IndexSet> origrow_copy(origMatrix, origComm.globalLookup(),
795 newComm.indexSet(), backwardscopyrowsize);
796 CommMatrixRow<M,IndexSet> newrow_copy(newMatrix, origComm.globalLookup(),
797 newComm.indexSet(),copyrowsize);
798 ri.template redistribute<MatrixRowGatherScatter<M,IndexSet> >(origrow_copy,
799 newrow_copy);
800 ri.getInterface().free();
801 RemoteIndices<IndexSet> *ris = new RemoteIndices<IndexSet>(origComm.indexSet(),
802 newComm.indexSet(),
803 origComm.communicator());
804 ris->template rebuild<true>();
805 ri.getInterface().build(*ris,ownerflags,ownerflags);
806 }
807
808 CommMatrixRow<M,IndexSet>
809 origrow(origMatrix, origComm.globalLookup(), newComm.indexSet());
810 CommMatrixRow<M,IndexSet>
811 newrow(newMatrix, origComm.globalLookup(), newComm.indexSet(),rowsize);
812 ri.template redistribute<MatrixRowGatherScatter<M,IndexSet> >(origrow,newrow);
813 if (origComm.getSolverCategory() != static_cast<int>(SolverCategory::nonoverlapping))
814 newrow.setOverlapRowsToDirichlet();
815 }
816
833 template<typename M, typename C>
834 void redistributeMatrix(M& origMatrix, M& newMatrix, C& origComm, C& newComm,
835 RedistributeInformation<C>& ri)
836 {
837 ri.setNoRows(newComm.indexSet().size());
838 ri.setNoCopyRows(newComm.indexSet().size());
839 ri.setNoBackwardsCopyRows(origComm.indexSet().size());
840 redistributeSparsityPattern(origMatrix, newMatrix, origComm, newComm, ri);
841 redistributeMatrixEntries(origMatrix, newMatrix, origComm, newComm, ri);
842 }
843#endif
844
845template<typename M>
846 void redistributeMatrixEntries(M& origMatrix, M& newMatrix,
847 Dune::Amg::SequentialInformation& origComm,
848 Dune::Amg::SequentialInformation& newComm,
849 RedistributeInformation<Dune::Amg::SequentialInformation>& ri)
850 {
851 DUNE_THROW(InvalidStateException, "Trying to redistribute in sequential program!");
852 }
853 template<typename M>
854 void redistributeMatrix(M& origMatrix, M& newMatrix,
855 Dune::Amg::SequentialInformation& origComm,
856 Dune::Amg::SequentialInformation& newComm,
857 RedistributeInformation<Dune::Amg::SequentialInformation>& ri)
858 {
859 DUNE_THROW(InvalidStateException, "Trying to redistribute in sequential program!");
860 }
861}
862#endif
Dune::ConstArrayListIterator
A constant random access iterator for the Dune::ArrayList class.
Definition: arraylist.hh:379
Dune::EnumItem
A set consisting only of one item.
Definition: enumset.hh:60
Dune::GlobalLookupIndexSet
Decorates an index set with the possibility to find a global index that is mapped to a specific local...
Definition: indexset.hh:506
Dune::ISTLError
derive error class from the base class in common
Definition: istlexception.hh:16
Dune::RangeError
Default exception class for range errors.
Definition: exceptions.hh:252
exceptions.hh
A few common exception classes.
Dune::GlobalLookupIndexSet::pair
const IndexPair * pair(const std::size_t &local) const
Get the index pair corresponding to a local index.
DUNE_UNUSED_PARAMETER
#define DUNE_UNUSED_PARAMETER(parm)
A macro to mark intentionally unused function parameters with.
Definition: unused.hh:25
DUNE_THROW
#define DUNE_THROW(E, m)
Definition: exceptions.hh:216
indexset.hh
Provides a map between global and local indices.
Dune
Dune namespace.
Definition: alignedallocator.hh:10
Dune::redistributeMatrix
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
owneroverlapcopy.hh
Classes providing communication interfaces for overlapping Schwarz methods.
repartition.hh
Functionality for redistributing a parallel index set using graph partitioning.
Dune::CommMatrixRowSize
Utility class to communicate and set the row sizes of a redistributed matrix.
Definition: matrixredistribute.hh:230
Dune::CommMatrixRowSize::CommMatrixRowSize
CommMatrixRowSize(const M &m_, RI &rowsize_)
Constructor.
Definition: matrixredistribute.hh:240
Dune::CommMatrixRow
Utility class for comunicating the matrix entries.
Definition: matrixredistribute.hh:410
Dune::CommMatrixRow::rowsize
std::vector< size_t > * rowsize
row size information for the receiving side.
Definition: matrixredistribute.hh:464
Dune::CommMatrixRow::matrix
M & matrix
The matrix to communicate the values of.
Definition: matrixredistribute.hh:458
Dune::CommMatrixRow::CommMatrixRow
CommMatrixRow(M &m_, const Dune::GlobalLookupIndexSet< I > &idxset_, const I &aggidxset_, std::vector< size_t > &rowsize_)
Constructor.
Definition: matrixredistribute.hh:426
Dune::CommMatrixRow::idxset
const Dune::GlobalLookupIndexSet< I > & idxset
Index set for the original matrix.
Definition: matrixredistribute.hh:460
Dune::CommMatrixRow::setOverlapRowsToDirichlet
void setOverlapRowsToDirichlet()
Sets the non-owner rows correctly as Dirichlet boundaries.
Definition: matrixredistribute.hh:435
Dune::CommMatrixRow::aggidxset
const I & aggidxset
Index set for the redistributed matrix.
Definition: matrixredistribute.hh:462
Dune::CommMatrixRow::CommMatrixRow
CommMatrixRow(M &m_, const Dune::GlobalLookupIndexSet< I > &idxset_, const I &aggidxset_)
Constructor.
Definition: matrixredistribute.hh:419
Dune::CommMatrixSparsityPattern
Utility class to communicate and build the sparsity pattern of a redistributed matrix.
Definition: matrixredistribute.hh:259
Dune::CommMatrixSparsityPattern::storeSparsityPattern
void storeSparsityPattern(M &m)
Creates and stores the sparsity pattern of the redistributed matrix.
Definition: matrixredistribute.hh:290
Dune::CommMatrixSparsityPattern::completeSparsityPattern
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
Dune::CommMatrixSparsityPattern::CommMatrixSparsityPattern
CommMatrixSparsityPattern(const M &m_, const Dune::GlobalLookupIndexSet< I > &idxset_, const I &aggidxset_)
Constructor for the original side.
Definition: matrixredistribute.hh:268
Dune::CommMatrixSparsityPattern::CommMatrixSparsityPattern
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
Dune::CommPolicy
Default policy used for communicating an indexed type.
Definition: communicator.hh:127
Dune::CommPolicy::IndexedType
V::value_type IndexedType
The type we get at each index with operator[].
Definition: communicator.hh:146
Dune::CommPolicy::getSize
static int getSize(const V &, int index)
Get the number of primitve elements at that index.
Dune::CommPolicy::IndexedTypeFlag
SizeOne IndexedTypeFlag
Whether the indexed type has variable size or there is always one value at each index.
Definition: communicator.hh:152
Dune::CommPolicy::Type
V Type
The type the policy is for.
Definition: communicator.hh:139
Dune::SolverCategory::nonoverlapping
@ nonoverlapping
Category for non-overlapping solvers.
Definition: solvercategory.hh:25
Dune::VariableSize
Flag for marking indexed data structures where the data at each index may be a variable multiple of a...
Definition: communicator.hh:117
unused.hh
Definition of the DUNE_UNUSED macro for the case that config.h is not available.
Creative Commons License   |  Legal Statements / Impressum  |  Hosted by TU Dresden  |  generated with Hugo v0.111.3 (Nov 13, 23:29, 2024)