5#ifndef DUNE_ISTL_ILU_HH
6#define DUNE_ISTL_ILU_HH
17#include "istlexception.hh"
36 typedef typename M::RowIterator rowiterator;
37 typedef typename M::ColIterator coliterator;
38 typedef typename M::block_type block;
41 rowiterator endi=A.end();
42 for (rowiterator i=A.begin(); i!=endi; ++i)
45 coliterator endij=(*i).end();
49 for (ij=(*i).begin(); ij.index()<i.index(); ++ij)
52 coliterator jj = A[ij.index()].find(ij.index());
55 Impl::asMatrix(*ij).rightmultiply(Impl::asMatrix(*jj));
58 coliterator endjk=A[ij.index()].end();
59 coliterator jk=jj; ++jk;
60 coliterator ik=ij; ++ik;
61 while (ik!=endij && jk!=endjk)
62 if (ik.index()==jk.index())
65 Impl::asMatrix(B).leftmultiply(Impl::asMatrix(*ij));
71 if (ik.index()<jk.index())
79 if (ij.index()!=i.index())
82 Impl::asMatrix(*ij).invert();
86 << i.index() <<
"][" << ij.index() <<
"]" << e.what();
87 th__ex.r=i.index(); th__ex.c=ij.index(););
93 template<
class M,
class X,
class Y>
97 typedef typename M::ConstRowIterator rowiterator;
98 typedef typename M::ConstColIterator coliterator;
99 typedef typename Y::block_type dblock;
100 typedef typename X::block_type vblock;
103 rowiterator endi=A.end();
104 for (rowiterator i=A.begin(); i!=endi; ++i)
112 dblock rhsValue(d[i.index()]);
113 auto&& rhs = Impl::asVector(rhsValue);
114 for (coliterator j=(*i).begin(); j.index()<i.index(); ++j)
115 Impl::asMatrix(*j).mmv(Impl::asVector(v[j.index()]),rhs);
116 Impl::asVector(v[i.index()]) = rhs;
120 rowiterator rendi=A.beforeBegin();
121 for (rowiterator i=A.beforeEnd(); i!=rendi; --i)
129 vblock rhsValue(v[i.index()]);
130 auto&& rhs = Impl::asVector(rhsValue);
132 for (j=(*i).beforeEnd(); j.index()>i.index(); --j)
133 Impl::asMatrix(*j).mmv(Impl::asVector(v[j.index()]),rhs);
134 auto&& vi = Impl::asVector(v[i.index()]);
135 Impl::asMatrix(*j).mv(rhs,vi);
141 typename M::field_type& firstMatrixElement (M& A,
144 return firstMatrixElement(*(A.begin()->begin()));
148 K& firstMatrixElement (K& A,
154 template<
class K,
int n,
int m>
155 K& firstMatrixElement (FieldMatrix<K,n,m>& A)
170 typedef typename M::ColIterator coliterator;
171 typedef typename M::ConstRowIterator crowiterator;
172 typedef typename M::ConstColIterator ccoliterator;
173 typedef typename M::CreateIterator createiterator;
174 typedef typename M::field_type K;
175 typedef std::map<size_t, int> map;
176 typedef typename map::iterator mapiterator;
179 crowiterator endi=A.end();
180 createiterator ci=ILU.createbegin();
181 for (crowiterator i=A.begin(); i!=endi; ++i)
186 for (ccoliterator j=(*i).begin(); j!=(*i).end(); ++j)
187 rowpattern[j.index()] = 0;
190 for (mapiterator ik=rowpattern.begin(); (*ik).first<i.index(); ++ik)
194 coliterator endk = ILU[(*ik).first].end();
195 coliterator kj = ILU[(*ik).first].find((*ik).first);
196 for (++kj; kj!=endk; ++kj)
201 int generation = (int)
Simd::lane(0, abs( firstMatrixElement(*kj) ));
204 mapiterator ij = rowpattern.find(kj.index());
205 if (ij==rowpattern.end())
207 rowpattern[kj.index()] = generation+1;
215 for (mapiterator ik=rowpattern.begin(); ik!=rowpattern.end(); ++ik)
216 ci.insert((*ik).first);
220 coliterator endILUij = ILU[i.index()].end();;
221 for (coliterator ILUij=ILU[i.index()].begin(); ILUij!=endILUij; ++ILUij)
226 for (crowiterator i=A.begin(); i!=endi; ++i)
229 coliterator endILUij = ILU[i.index()].end();;
230 for (ILUij=ILU[i.index()].begin(); ILUij!=endILUij; ++ILUij)
232 ccoliterator Aij = (*i).begin();
233 ccoliterator endAij = (*i).end();
234 ILUij = ILU[i.index()].begin();
235 while (Aij!=endAij && ILUij!=endILUij)
237 if (Aij.index()==ILUij.index())
244 if (Aij.index()<ILUij.index())
257 template <
class B,
class Alloc = std::allocator<B>>
260 typedef B block_type;
261 typedef size_t size_type;
263 CRS() : nRows_( 0 ) {}
265 size_type rows()
const {
return nRows_; }
267 size_type nonZeros()
const
269 assert( rows_[ rows() ] != size_type(-1) );
270 return rows_[ rows() ];
273 void resize(
const size_type nRows )
275 if( nRows_ != nRows )
278 rows_.resize( nRows_+1, size_type(-1) );
282 void reserveAdditional(
const size_type nonZeros )
284 const size_type needed = values_.size() + nonZeros ;
285 if( values_.capacity() < needed )
287 const size_type estimate = needed * 1.1;
288 values_.reserve( estimate );
289 cols_.reserve( estimate );
293 void push_back(
const block_type& value,
const size_type index )
295 values_.push_back( value );
296 cols_.push_back( index );
299 std::vector< size_type > rows_;
300 std::vector< block_type, Alloc> values_;
301 std::vector< size_type > cols_;
306 template<
class M,
class CRS,
class InvVector>
309 typedef typename M :: size_type size_type;
311 lower.resize( A.N() );
312 upper.resize( A.N() );
316 const size_t memEstimate = (A.nonzeroes() - A.N())/2;
318 assert( A.nonzeroes() != 0 );
319 lower.reserveAdditional( memEstimate );
320 upper.reserveAdditional( memEstimate );
322 const auto endi = A.end();
324 size_type colcount = 0;
325 lower.rows_[ 0 ] = colcount;
326 for (
auto i=A.begin(); i!=endi; ++i, ++row)
328 const size_type iIndex = i.index();
331 for (
auto j=(*i).begin(); j.index() < iIndex; ++j )
333 lower.push_back( (*j), j.index() );
336 lower.rows_[ iIndex+1 ] = colcount;
339 const auto rendi = A.beforeBegin();
342 upper.rows_[ 0 ] = colcount ;
346 for (
auto i=A.beforeEnd(); i!=rendi; --i, ++ row )
348 const auto endij=(*i).beforeBegin();
350 const size_type iIndex = i.index();
353 for (
auto j=(*i).beforeEnd(); j != endij; --j )
355 const size_type jIndex = j.index();
356 if( j.index() == iIndex )
361 else if ( j.index() >= i.index() )
363 upper.push_back( (*j), jIndex );
367 upper.rows_[ row+1 ] = colcount;
372 template<
class CRS,
class InvVector,
class X,
class Y>
375 const InvVector& inv,
379 typedef typename Y :: block_type dblock;
380 typedef typename X :: block_type vblock;
381 typedef typename X :: size_type size_type ;
383 const size_type iEnd = lower.rows();
384 const size_type lastRow = iEnd - 1;
385 if( iEnd != upper.rows() )
391 for( size_type i=0; i<iEnd; ++ i )
393 dblock rhsValue( d[ i ] );
394 auto&& rhs = Impl::asVector(rhsValue);
395 const size_type rowI = lower.rows_[ i ];
396 const size_type rowINext = lower.rows_[ i+1 ];
398 for( size_type col = rowI; col < rowINext; ++ col )
399 Impl::asMatrix(lower.values_[ col ]).mmv( Impl::asVector(v[ lower.cols_[ col ] ] ), rhs );
401 Impl::asVector(v[ i ]) = rhs;
405 for( size_type i=0; i<iEnd; ++ i )
407 auto&& vBlock = Impl::asVector(v[ lastRow - i ]);
408 vblock rhsValue ( v[ lastRow - i ] );
409 auto&& rhs = Impl::asVector(rhsValue);
410 const size_type rowI = upper.rows_[ i ];
411 const size_type rowINext = upper.rows_[ i+1 ];
413 for( size_type col = rowI; col < rowINext; ++ col )
414 Impl::asMatrix(upper.values_[ col ]).mmv( Impl::asVector(v[ upper.cols_[ col ] ]), rhs );
417 Impl::asMatrix(inv[ i ]).mv(rhs, vBlock);
Error thrown if operations of a FieldMatrix fail.
Definition: densematrix.hh:126
derive error class from the base class in common
Definition: istlexception.hh:19
Error when performing an operation on a matrix block.
Definition: istlexception.hh:52
Implements a matrix constructed from a given type representing a field and compile-time given number ...
#define DUNE_THROW(E, m)
Definition: exceptions.hh:218
decltype(auto) lane(std::size_t l, V &&v)
Extract an element of a SIMD type.
Definition: interface.hh:324
typename Overloads::ScalarType< std::decay_t< V > >::type Scalar
Element type of some SIMD type.
Definition: interface.hh:235
void convertToCRS(const M &A, CRS &lower, CRS &upper, InvVector &inv)
convert ILU decomposition into CRS format for lower and upper triangular and inverse.
Definition: ilu.hh:307
void blockILUBacksolve(const M &A, X &v, const Y &d)
LU backsolve with stored inverse.
Definition: ilu.hh:94
void blockILU0Decomposition(M &A)
compute ILU decomposition of A. A is overwritten by its decomposition
Definition: ilu.hh:33
void blockILUDecomposition(const M &A, int n, M &ILU)
Definition: ilu.hh:167
Dune namespace.
Definition: alignedallocator.hh:13
Implements a scalar matrix view wrapper around an existing scalar.
Implements a scalar vector view wrapper around an existing scalar.
a simple compressed row storage matrix class
Definition: ilu.hh:259
Whether this type acts as a scalar in the context of (hierarchically blocked) containers.
Definition: typetraits.hh:194