1 #ifndef DUNE_MATRIXMATRIX_HH
2 #define DUNE_MATRIXMATRIX_HH
4 #include <dune/common/fmatrix.hh>
5 #include <dune/common/tuples.hh>
6 #include <dune/common/timer.hh>
32 struct NonzeroPatternTraverser
37 struct NonzeroPatternTraverser<0>
39 template<
class T,
class A1,
class A2,
class F,
int n,
int m,
int k>
47 DUNE_THROW(ISTLError,
"The sizes of the matrices do not match: "<<
A.M()<<
"!="<<B.N());
50 typedef typename Dune::BCRSMatrix<Dune::FieldMatrix<T,n,k>,A1>::ConstColIterator Col;
51 typedef typename Dune::BCRSMatrix<Dune::FieldMatrix<T,k,m>,A2>::ConstRowIterator BRow;
52 typedef typename Dune::BCRSMatrix<Dune::FieldMatrix<T,k,m>,A2>::ConstColIterator BCol;
58 for(BCol bcol = B[
col.index()].begin(); bcol != B[
col.index()].end(); ++bcol){
59 func(*
col, *bcol,
row.index(), bcol.index());
68 struct NonzeroPatternTraverser<1>
70 template<
class T,
class A1,
class A2,
class F,
int n,
int m,
int k>
77 DUNE_THROW(ISTLError,
"The sizes of the matrices do not match: "<<
A.N()<<
"!="<<B.N());
80 typedef typename Dune::BCRSMatrix<Dune::FieldMatrix<T,k,n>,A1>::ConstColIterator Col;
81 typedef typename Dune::BCRSMatrix<Dune::FieldMatrix<T,k,m>,A2>::ConstColIterator BCol;
82 typedef typename Dune::BCRSMatrix<Dune::FieldMatrix<T,k,n>,A1>::size_type size_t1;
83 typedef typename Dune::BCRSMatrix<Dune::FieldMatrix<T,k,m>,A2>::size_type size_t2;
87 for(BCol bcol = B[
row.index()].begin(); bcol != B[
row.index()].end(); ++bcol){
88 func(*
col, *bcol,
col.index(), bcol.index());
96 struct NonzeroPatternTraverser<2>
98 template<
class T,
class A1,
class A2,
class F,
int n,
int m,
int k>
99 static void traverse(
const BCRSMatrix<FieldMatrix<T,n,m>,A1>&
mat,
100 const BCRSMatrix<FieldMatrix<T,k,m>,A2>& matt,
103 if(
mat.M()!=matt.M())
104 DUNE_THROW(ISTLError,
"The sizes of the matrices do not match: "<<
mat.N()<<
"!="<<matt.N());
106 typedef typename BCRSMatrix<FieldMatrix<T,n,m>,A1>::ConstRowIterator row_iterator;
107 typedef typename BCRSMatrix<FieldMatrix<T,n,m>,A1>::ConstColIterator col_iterator;
108 typedef typename BCRSMatrix<FieldMatrix<T,k,m>,A2>::ConstRowIterator row_iterator_t;
109 typedef typename BCRSMatrix<FieldMatrix<T,k,m>,A2>::ConstColIterator col_iterator_t;
111 for(row_iterator mrow=
mat.begin(); mrow !=
mat.end(); ++mrow){
118 for(row_iterator_t mtcol=matt.begin(); mtcol != matt.end(); ++mtcol){
121 col_iterator_t mtrow=mtcol->
begin();
122 bool funcCalled =
false;
123 for(col_iterator mcol=mrow->begin(); mcol != mrow->end(); ++mcol){
126 for( ;mtrow != mtcol->end(); ++mtrow)
127 if(mtrow.index()>=mcol.index())
129 if(mtrow != mtcol->end() && mtrow.index()==mcol.index()){
130 func(*mcol, *mtrow, mtcol.index());
150 template<
class T,
class A,
int n,
int m>
151 class SparsityPatternInitializer
162 template<
class T1,
class T2>
163 void operator()(
const T1& t1,
const T2& t2, size_type j)
180 template<
int transpose,
class T,
class TA,
int n,
int m>
181 class MatrixInitializer
189 MatrixInitializer(
Matrix& A_, size_type rows)
192 template<
class T1,
class T2>
193 void operator()(
const T1& t1,
const T2& t2,
int j)
204 std::size_t nonzeros()
209 template<
class A1,
class A2,
int n2,
int m2,
int n3,
int m3>
210 void initPattern(
const BCRSMatrix<FieldMatrix<T,n2,m2>,A1>& mat1,
211 const BCRSMatrix<FieldMatrix<T,n3,m3>,A2>& mat2)
213 SparsityPatternInitializer<T, TA, n, m> sparsity(
A.
createbegin());
214 NonzeroPatternTraverser<transpose>::traverse(mat1,mat2,sparsity);
222 template<
class T,
class TA,
int n,
int m>
223 class MatrixInitializer<1,T,TA,n,m>
226 enum{do_break=
false};
231 MatrixInitializer(
Matrix& A_, size_type rows)
232 :
A(A_), entries(rows)
235 template<
class T1,
class T2>
236 void operator()(
const T1& t1,
const T2& t2, size_type i, size_type j)
238 entries[i].insert(j);
247 typedef typename std::vector<std::set<size_t> >::const_iterator Iter;
248 for(Iter iter = entries.begin(); iter != entries.end(); ++iter)
252 template<
class A1,
class A2,
int n2,
int m2,
int n3,
int m3>
253 void initPattern(
const BCRSMatrix<FieldMatrix<T,n2,m2>,A1>& mat1,
254 const BCRSMatrix<FieldMatrix<T,n3,m3>,A2>& mat2)
256 typedef typename std::vector<std::set<size_t> >::const_iterator Iter;
258 for(Iter iter = entries.begin(); iter != entries.end(); ++iter, ++citer){
259 typedef std::set<size_t>::const_iterator SetIter;
267 std::vector<std::set<size_t> > entries;
270 template<
class T,
class TA,
int n,
int m>
271 struct MatrixInitializer<0,T,TA,n,m>
272 :
public MatrixInitializer<1,T,TA,n,m>
276 :MatrixInitializer<1,T,TA,n,m>(A_,rows)
281 template<
class T,
class T1,
class T2,
int n,
int m,
int k>
282 void addMatMultTransposeMat(FieldMatrix<T,n,k>& res,
const FieldMatrix<T1,n,m>&
mat,
283 const FieldMatrix<T2,k,m>& matt)
285 typedef typename FieldMatrix<T,n,k>::size_type size_type;
289 for(size_type i=0; i < m; ++i)
294 template<
class T,
class T1,
class T2,
int n,
int m,
int k>
295 void addTransposeMatMultMat(FieldMatrix<T,n,k>& res,
const FieldMatrix<T1,m,n>& mat,
296 const FieldMatrix<T2,m,k>& matt)
298 typedef typename FieldMatrix<T,n,k>::size_type size_type;
299 for(size_type i=0; i<m; ++i)
306 template<
class T,
class T1,
class T2,
int n,
int m,
int k>
307 void addMatMultMat(FieldMatrix<T,n,m>& res,
const FieldMatrix<T1,n,k>& mat,
308 const FieldMatrix<T2,k,m>& matt)
310 typedef typename FieldMatrix<T,n,k>::size_type size_type;
313 for(size_type i=0; i < k; ++i)
319 template<
class T,
class A,
int n,
int m>
320 class EntryAccumulatorFather
323 enum{do_break=
false};
324 typedef BCRSMatrix<FieldMatrix<T,n,m>,
A>
Matrix;
328 EntryAccumulatorFather(
Matrix& mat_)
329 :mat(mat_),
row(mat.begin())
353 template<
class T,
class A,
int n,
int m,
int transpose>
354 class EntryAccumulator
355 :
public EntryAccumulatorFather<T,A,n,m>
358 typedef BCRSMatrix<FieldMatrix<T,n,m>,
A>
Matrix;
361 EntryAccumulator(
Matrix& mat_)
362 : EntryAccumulatorFather<T,
A,n,m>(mat_)
365 template<
class T1,
class T2>
366 void operator()(
const T1& t1,
const T2& t2, size_type i)
368 assert(this->
col.index()==i);
369 addMatMultMat(*(this->
col),t1,t2);
373 template<
class T,
class A,
int n,
int m>
374 class EntryAccumulator<T,
A,n,m,0>
375 :
public EntryAccumulatorFather<T,A,n,m>
378 typedef BCRSMatrix<FieldMatrix<T,n,m>,
A>
Matrix;
381 EntryAccumulator(
Matrix& mat_)
382 : EntryAccumulatorFather<T,
A,n,m>(mat_)
385 template<
class T1,
class T2>
386 void operator()(
const T1& t1,
const T2& t2, size_type i, size_type j)
388 addMatMultMat(this->mat[i][j], t1, t2);
392 template<
class T,
class A,
int n,
int m>
393 class EntryAccumulator<T,
A,n,m,1>
394 :
public EntryAccumulatorFather<T,A,n,m>
397 typedef BCRSMatrix<FieldMatrix<T,n,m>,
A>
Matrix;
400 EntryAccumulator(
Matrix& mat_)
401 : EntryAccumulatorFather<T,
A,n,m>(mat_)
404 template<
class T1,
class T2>
405 void operator()(
const T1& t1,
const T2& t2, size_type i, size_type j)
407 addTransposeMatMultMat(this->mat[i][j], t1, t2);
411 template<
class T,
class A,
int n,
int m>
412 class EntryAccumulator<T,
A,n,m,2>
413 :
public EntryAccumulatorFather<T,A,n,m>
416 typedef BCRSMatrix<FieldMatrix<T,n,m>,
A>
Matrix;
419 EntryAccumulator(
Matrix& mat_)
420 : EntryAccumulatorFather<T,
A,n,m>(mat_)
423 template<
class T1,
class T2>
424 void operator()(
const T1& t1,
const T2& t2, size_type i)
426 assert(this->
col.index()==i);
427 addMatMultTransposeMat(*this->
col,t1,t2);
432 template<
int transpose>
438 struct SizeSelector<0>
440 template<
class M1,
class M2>
441 static tuple<typename M1::size_type, typename M2::size_type>
442 size(
const M1& m1,
const M2& m2)
444 return make_tuple(m1.N(), m2.M());
449 struct SizeSelector<1>
451 template<
class M1,
class M2>
452 static tuple<typename M1::size_type, typename M2::size_type>
453 size(
const M1& m1,
const M2& m2)
455 return make_tuple(m1.M(), m2.M());
461 struct SizeSelector<2>
463 template<
class M1,
class M2>
464 static tuple<typename M1::size_type, typename M2::size_type>
465 size(
const M1& m1,
const M2& m2)
467 return make_tuple(m1.N(), m2.N());
471 template<
int transpose,
class T,
class A,
class A1,
class A2,
int n1,
int m1,
int n2,
int m2,
int n3,
int m3>
472 void matMultMat(BCRSMatrix<FieldMatrix<T,n1,m1>,
A>& res,
const BCRSMatrix<FieldMatrix<T,n2,m2>,A1>& mat1,
473 const BCRSMatrix<FieldMatrix<T,n3,m3>,A2>& mat2)
476 typename BCRSMatrix<FieldMatrix<T,n1,m1>,
A>::size_type rows, cols;
477 tie(rows,cols)=SizeSelector<transpose>::size(mat1, mat2);
478 MatrixInitializer<transpose,T,A,n1,m1> patternInit(res, rows);
480 NonzeroPatternTraverser<transpose>::traverse(mat1,mat2,patternInit);
481 res.setSize(rows, cols, patternInit.nonzeros());
482 res.setBuildMode(BCRSMatrix<FieldMatrix<T,n1,m1>,
A>::row_wise);
484 std::cout<<
"Counting nonzeros took "<<timer.elapsed()<<std::endl;
488 patternInit.initPattern(mat1, mat2);
490 std::cout<<
"Setting up sparsity pattern took "<<timer.elapsed()<<std::endl;
493 EntryAccumulator<T,A,n1,m1, transpose> entriesAccu(res);
494 NonzeroPatternTraverser<transpose>::traverse(mat1,mat2,entriesAccu);
495 std::cout<<
"Calculating entries took "<<timer.elapsed()<<std::endl;
507 template<
typename M1,
typename M2>
512 template<
typename T,
int n,
int k,
int m>
518 template<
typename T,
typename A,
typename A1,
int n,
int k,
int m>
533 template<
class T,
class A,
class A1,
class A2,
int n,
int m,
int k>
537 matMultMat<2>(res,
mat, matt);
548 template<
class T,
class A,
class A1,
class A2,
int n,
int m,
int k>
552 matMultMat<0>(res,
mat, matt);
563 template<
class T,
class A,
class A1,
class A2,
int n,
int m,
int k>
567 matMultMat<1>(res,
mat, matt);