3#ifndef DUNE_ISTL_MATRIXMATRIX_HH
4#define DUNE_ISTL_MATRIXMATRIX_HH
6#include <dune/common/fmatrix.hh>
7#include <dune/common/tuples.hh>
8#include <dune/common/timer.hh>
34 struct NonzeroPatternTraverser
39 struct NonzeroPatternTraverser<0>
41 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());
52 for(Row row= A.begin(); row != A.end(); ++row) {
54 for(Col
col = row->begin();
col != row->end(); ++
col) {
57 for(BCol bcol = B[
col.index()].begin(); bcol != B[
col.index()].end(); ++bcol) {
58 func(*
col, *bcol, row.index(), bcol.index());
67 struct NonzeroPatternTraverser<1>
69 template<
class T,
class A1,
class A2,
class F,
int n,
int m,
int k>
76 DUNE_THROW(ISTLError,
"The sizes of the matrices do not match: "<<A.N()<<
"!="<<B.N());
82 for(Row row=A.begin(); row!=A.end(); ++row) {
83 for(Col
col=row->begin();
col!=row->end(); ++
col) {
84 for(BCol bcol = B[row.index()].begin(); bcol != B[row.index()].end(); ++bcol) {
85 func(*
col, *bcol,
col.index(), bcol.index());
93 struct NonzeroPatternTraverser<2>
95 template<
class T,
class A1,
class A2,
class F,
int n,
int m,
int k>
96 static void traverse(
const BCRSMatrix<FieldMatrix<T,n,m>,A1>&
mat,
97 const BCRSMatrix<FieldMatrix<T,k,m>,A2>& matt,
100 if(
mat.M()!=matt.M())
101 DUNE_THROW(ISTLError,
"The sizes of the matrices do not match: "<<
mat.M()<<
"!="<<matt.M());
103 typedef typename BCRSMatrix<FieldMatrix<T,n,m>,A1>::ConstRowIterator row_iterator;
104 typedef typename BCRSMatrix<FieldMatrix<T,n,m>,A1>::ConstColIterator col_iterator;
105 typedef typename BCRSMatrix<FieldMatrix<T,k,m>,A2>::ConstRowIterator row_iterator_t;
106 typedef typename BCRSMatrix<FieldMatrix<T,k,m>,A2>::ConstColIterator col_iterator_t;
108 for(row_iterator mrow=
mat.begin(); mrow !=
mat.end(); ++mrow) {
115 for(row_iterator_t mtcol=matt.begin(); mtcol != matt.end(); ++mtcol) {
118 col_iterator_t mtrow=mtcol->begin();
119 bool funcCalled =
false;
120 for(col_iterator mcol=mrow->begin(); mcol != mrow->end(); ++mcol) {
123 for( ; mtrow != mtcol->end(); ++mtrow)
124 if(mtrow.index()>=mcol.index())
126 if(mtrow != mtcol->end() && mtrow.index()==mcol.index()) {
127 func(*mcol, *mtrow, mtcol.index());
147 template<
class T,
class A,
int n,
int m>
148 class SparsityPatternInitializer
159 template<
class T1,
class T2>
177 template<
int transpose,
class T,
class TA,
int n,
int m>
178 class MatrixInitializer
189 template<
class T1,
class T2>
190 void operator()(
const T1&,
const T2&,
int)
201 std::size_t nonzeros()
206 template<
class A1,
class A2,
int n2,
int m2,
int n3,
int m3>
207 void initPattern(
const BCRSMatrix<FieldMatrix<T,n2,m2>,A1>& mat1,
208 const BCRSMatrix<FieldMatrix<T,n3,m3>,A2>& mat2)
210 SparsityPatternInitializer<T, TA, n, m> sparsity(A.createbegin());
211 NonzeroPatternTraverser<transpose>::traverse(mat1,mat2,sparsity);
219 template<
class T,
class TA,
int n,
int m>
220 class MatrixInitializer<1,T,TA,n,m>
229 : A(A_), entries(rows)
232 template<
class T1,
class T2>
235 entries[i].insert(j);
244 typedef typename std::vector<std::set<size_t> >::const_iterator Iter;
245 for(Iter iter = entries.begin(); iter != entries.end(); ++iter)
249 template<
class A1,
class A2,
int n2,
int m2,
int n3,
int m3>
250 void initPattern(
const BCRSMatrix<FieldMatrix<T,n2,m2>,A1>&,
251 const BCRSMatrix<FieldMatrix<T,n3,m3>,A2>&)
253 typedef typename std::vector<std::set<size_t> >::const_iterator Iter;
255 for(Iter iter = entries.begin(); iter != entries.end(); ++iter, ++citer) {
256 typedef std::set<size_t>::const_iterator SetIter;
257 for(SetIter index=iter->begin(); index != iter->end(); ++index)
258 citer.insert(*index);
264 std::vector<std::set<size_t> > entries;
267 template<
class T,
class TA,
int n,
int m>
268 struct MatrixInitializer<0,T,TA,n,m>
269 :
public MatrixInitializer<1,T,TA,n,m>
273 : MatrixInitializer<1,T,TA,n,m>(A_,rows)
278 template<
class T,
class T1,
class T2,
int n,
int m,
int k>
279 void addMatMultTransposeMat(FieldMatrix<T,n,k>& res,
const FieldMatrix<T1,n,m>&
mat,
280 const FieldMatrix<T2,k,m>& matt)
282 typedef typename FieldMatrix<T,n,k>::size_type size_type;
284 for(size_type row=0; row<n; ++row)
286 for(size_type i=0; i < m; ++i)
291 template<
class T,
class T1,
class T2,
int n,
int m,
int k>
292 void addTransposeMatMultMat(FieldMatrix<T,n,k>& res,
const FieldMatrix<T1,m,n>&
mat,
293 const FieldMatrix<T2,m,k>& matt)
295 typedef typename FieldMatrix<T,n,k>::size_type size_type;
296 for(size_type i=0; i<m; ++i)
297 for(size_type row=0; row<n; ++row) {
303 template<
class T,
class T1,
class T2,
int n,
int m,
int k>
304 void addMatMultMat(FieldMatrix<T,n,m>& res,
const FieldMatrix<T1,n,k>&
mat,
305 const FieldMatrix<T2,k,m>& matt)
307 typedef typename FieldMatrix<T,n,k>::size_type size_type;
308 for(size_type row=0; row<n; ++row)
310 for(size_type i=0; i < k; ++i)
316 template<
class T,
class A,
int n,
int m>
317 class EntryAccumulatorFather
350 template<
class T,
class A,
int n,
int m,
int transpose>
351 class EntryAccumulator
352 :
public EntryAccumulatorFather<T,A,n,m>
359 : EntryAccumulatorFather<T,A,n,m>(
mat_)
362 template<
class T1,
class T2>
370 template<
class T,
class A,
int n,
int m>
371 class EntryAccumulator<T,A,n,m,0>
372 :
public EntryAccumulatorFather<T,A,n,m>
379 : EntryAccumulatorFather<T,A,n,m>(
mat_)
382 template<
class T1,
class T2>
389 template<
class T,
class A,
int n,
int m>
390 class EntryAccumulator<T,A,n,m,1>
391 :
public EntryAccumulatorFather<T,A,n,m>
398 : EntryAccumulatorFather<T,A,n,m>(
mat_)
401 template<
class T1,
class T2>
408 template<
class T,
class A,
int n,
int m>
409 class EntryAccumulator<T,A,n,m,2>
410 :
public EntryAccumulatorFather<T,A,n,m>
417 : EntryAccumulatorFather<T,A,n,m>(
mat_)
420 template<
class T1,
class T2>
430 template<
int transpose>
435 struct SizeSelector<0>
437 template<
class M1,
class M2>
438 static tuple<typename M1::size_type, typename M2::size_type>
439 size(
const M1& m1,
const M2& m2)
441 return make_tuple(m1.N(), m2.M());
446 struct SizeSelector<1>
448 template<
class M1,
class M2>
449 static tuple<typename M1::size_type, typename M2::size_type>
450 size(
const M1& m1,
const M2& m2)
452 return make_tuple(m1.M(), m2.M());
458 struct SizeSelector<2>
460 template<
class M1,
class M2>
461 static tuple<typename M1::size_type, typename M2::size_type>
462 size(
const M1& m1,
const M2& m2)
464 return make_tuple(m1.N(), m2.N());
468 template<
int transpose,
class T,
class A,
class A1,
class A2,
int n1,
int m1,
int n2,
int m2,
int n3,
int m3>
469 void matMultMat(BCRSMatrix<FieldMatrix<T,n1,m1>,A>& res,
const BCRSMatrix<FieldMatrix<T,n2,m2>,A1>& mat1,
470 const BCRSMatrix<FieldMatrix<T,n3,m3>,A2>& mat2)
473 typename BCRSMatrix<FieldMatrix<T,n1,m1>,A>::size_type rows, cols;
474 tie(rows,cols)=SizeSelector<transpose>::size(mat1, mat2);
475 MatrixInitializer<transpose,T,A,n1,m1> patternInit(res, rows);
477 NonzeroPatternTraverser<transpose>::traverse(mat1,mat2,patternInit);
478 res.setSize(rows, cols, patternInit.nonzeros());
479 res.setBuildMode(BCRSMatrix<FieldMatrix<T,n1,m1>,A>::row_wise);
485 patternInit.initPattern(mat1, mat2);
491 EntryAccumulator<T,A,n1,m1, transpose> entriesAccu(res);
492 NonzeroPatternTraverser<transpose>::traverse(mat1,mat2,entriesAccu);
505 template<
typename M1,
typename M2>
509 template<
typename T,
int n,
int k,
int m>
515 template<
typename T,
typename A,
typename A1,
int n,
int k,
int m>
530 template<
typename M1,
typename M2>
534 template<
typename T,
int n,
int k,
int m>
540 template<
typename T,
typename A,
typename A1,
int n,
int k,
int m>
556 template<
class T,
class A,
class A1,
class A2,
int n,
int m,
int k>
572 template<
class T,
class A,
class A1,
class A2,
int n,
int m,
int k>
587 template<
class T,
class A,
class A1,
class A2,
int n,
int m,
int k>
Implementation of the BCRSMatrix class.
BCRSMatrix< FieldMatrix< T, n, m >, A > Matrix
Definition matrixmatrix.hh:375
FieldMatrix< T, n, m > type
Definition matrixmatrix.hh:512
void transposeMatMultMat(BCRSMatrix< FieldMatrix< T, n, m >, A > &res, const BCRSMatrix< FieldMatrix< T, k, n >, A1 > &mat, const BCRSMatrix< FieldMatrix< T, k, m >, A2 > &matt, bool tryHard=false)
Calculate product of a transposed sparse matrix with another sparse matrices ( ).
Definition matrixmatrix.hh:588
void matMultMat(BCRSMatrix< FieldMatrix< T, n, m >, A > &res, const BCRSMatrix< FieldMatrix< T, n, k >, A1 > &mat, const BCRSMatrix< FieldMatrix< T, k, m >, A2 > &matt, bool tryHard=false)
Calculate product of two sparse matrices ( ).
Definition matrixmatrix.hh:573
BCRSMatrix< FieldMatrix< T, n, m >, A > Matrix
Definition matrixmatrix.hh:355
Matrix::RowIterator Row
Definition matrixmatrix.hh:322
BCRSMatrix< FieldMatrix< T, n, m >, A > Matrix
Definition matrixmatrix.hh:413
Dune::BCRSMatrix< Dune::FieldMatrix< T, n, m >, TA > Matrix
Definition matrixmatrix.hh:224
Matrix::size_type size_type
Definition matrixmatrix.hh:356
Matrix::size_type size_type
Definition matrixmatrix.hh:376
Col col
Definition matrixmatrix.hh:347
Matrix::ColIterator Col
Definition matrixmatrix.hh:323
Matrix::size_type size_type
Definition matrixmatrix.hh:184
Col col
Definition matrixmatrix.hh:347
Matrix & mat
Definition matrixmatrix.hh:343
Matrix & mat
Definition matrixmatrix.hh:343
Matrix::size_type size_type
Definition matrixmatrix.hh:226
FieldMatrix< T, n, m > type
Definition matrixmatrix.hh:537
void matMultTransposeMat(BCRSMatrix< FieldMatrix< T, n, k >, A > &res, const BCRSMatrix< FieldMatrix< T, n, m >, A1 > &mat, const BCRSMatrix< FieldMatrix< T, k, m >, A2 > &matt, bool tryHard=false)
Calculate product of a sparse matrix with a transposed sparse matrices ( ).
Definition matrixmatrix.hh:557
BCRSMatrix< FieldMatrix< T, n, m >, A >::CreateIterator CreateIterator
Definition matrixmatrix.hh:152
BCRSMatrix< FieldMatrix< T, n, m >, A > Matrix
Definition matrixmatrix.hh:394
Dune::BCRSMatrix< FieldMatrix< T, n, m >, TA > Matrix
Definition matrixmatrix.hh:182
BCRSMatrix< typename MatMultMatResult< FieldMatrix< T, n, k >, FieldMatrix< T, k, m > >::type, std::allocator< typename MatMultMatResult< FieldMatrix< T, n, k >, FieldMatrix< T, k, m > >::type > > type
Definition matrixmatrix.hh:519
Matrix::CreateIterator CreateIterator
Definition matrixmatrix.hh:225
BCRSMatrix< FieldMatrix< T, n, m >, A > Matrix
Definition matrixmatrix.hh:321
Matrix::size_type size_type
Definition matrixmatrix.hh:395
Matrix::CreateIterator CreateIterator
Definition matrixmatrix.hh:183
BCRSMatrix< typename MatMultMatResult< FieldMatrix< T, n, k >, FieldMatrix< T, k, m > >::type, std::allocator< typename MatMultMatResult< FieldMatrix< T, n, k >, FieldMatrix< T, k, m > >::type > > type
Definition matrixmatrix.hh:544
Matrix::size_type size_type
Definition matrixmatrix.hh:414
BCRSMatrix< FieldMatrix< T, n, m >, A >::size_type size_type
Definition matrixmatrix.hh:153
@ do_break
Definition matrixmatrix.hh:151
@ do_break
Definition matrixmatrix.hh:320
@ do_break
Definition matrixmatrix.hh:181
Definition basearray.hh:19
iterator begin()
begin iterator
Definition basearray.hh:170
Iterator implementation class
Definition basearray.hh:84
Statistics about compression achieved in implicit mode.
Definition bcrsmatrix.hh:81
A sparse block matrix with compressed row storage.
Definition bcrsmatrix.hh:412
Iterator class for sequential creation of blocks
Definition bcrsmatrix.hh:918
void insert(size_type j)
put column index in row
Definition bcrsmatrix.hh:1022
Iterator class for sequential access.
Definition matrix.hh:257
A::size_type size_type
Type for indices and sizes.
Definition matrix.hh:571
Helper TMP to get the result type of a sparse matrix matrix multiplication ( )
Definition matrixmatrix.hh:507
Helper TMP to get the result type of a sparse matrix matrix multiplication ( )
Definition matrixmatrix.hh:532
Definition matrixutils.hh:25