>;\n+278 using X = typename P::domain_type;\n+279 using Y = typename P::range_type;\n+280 public:\n+_\b2_\b8_\b2 typedef typename P::domain_type _\bd_\bo_\bm_\ba_\bi_\bn_\b__\bt_\by_\bp_\be;\n+_\b2_\b8_\b4 typedef typename P::range_type _\br_\ba_\bn_\bg_\be_\b__\bt_\by_\bp_\be;\n+_\b2_\b8_\b6 typedef C _\bc_\bo_\bm_\bm_\bu_\bn_\bi_\bc_\ba_\bt_\bi_\bo_\bn_\b__\bt_\by_\bp_\be;\n+287\n+_\b2_\b9_\b5 _\bN_\bo_\bn_\bo_\bv_\be_\br_\bl_\ba_\bp_\bp_\bi_\bn_\bg_\bB_\bl_\bo_\bc_\bk_\bP_\br_\be_\bc_\bo_\bn_\bd_\bi_\bt_\bi_\bo_\bn_\be_\br (P& p, const _\bc_\bo_\bm_\bm_\bu_\bn_\bi_\bc_\ba_\bt_\bi_\bo_\bn_\b__\bt_\by_\bp_\be& c)\n+296 : _preconditioner(stackobject_to_shared_ptr(p)), _communication(c)\n+297 { }\n+298\n+_\b3_\b0_\b6 _\bN_\bo_\bn_\bo_\bv_\be_\br_\bl_\ba_\bp_\bp_\bi_\bn_\bg_\bB_\bl_\bo_\bc_\bk_\bP_\br_\be_\bc_\bo_\bn_\bd_\bi_\bt_\bi_\bo_\bn_\be_\br (const std::shared_ptr& p, const\n+_\bc_\bo_\bm_\bm_\bu_\bn_\bi_\bc_\ba_\bt_\bi_\bo_\bn_\b__\bt_\by_\bp_\be& c)\n+307 : _preconditioner(p), _communication(c)\n+308 { }\n+309\n+_\b3_\b1_\b5 virtual void _\bp_\br_\be (_\bd_\bo_\bm_\ba_\bi_\bn_\b__\bt_\by_\bp_\be& x, _\br_\ba_\bn_\bg_\be_\b__\bt_\by_\bp_\be& b)\n+316 {\n+317 _preconditioner->pre(x,b);\n+318 }\n+319\n+_\b3_\b2_\b5 virtual void _\ba_\bp_\bp_\bl_\by (_\bd_\bo_\bm_\ba_\bi_\bn_\b__\bt_\by_\bp_\be& v, const _\br_\ba_\bn_\bg_\be_\b__\bt_\by_\bp_\be& d)\n+326 {\n+327 // block preconditioner equivalent to WrappedPreconditioner from\n+328 // pdelab/backend/ovlpistsolverbackend.hh,\n+329 // but not to BlockPreconditioner from schwarz.hh\n+330 _preconditioner->apply(v,d);\n+331 _communication.addOwnerCopyToOwnerCopy(v,v);\n+332 }\n+333\n+334 template\n+_\b3_\b3_\b5 void _\ba_\bp_\bp_\bl_\by (X& v, const Y& d)\n+336 {\n+337 _preconditioner->template apply(v,d);\n+338 _communication.addOwnerCopyToOwnerCopy(v,v);\n+339 }\n+340\n+_\b3_\b4_\b6 virtual void _\bp_\bo_\bs_\bt (_\bd_\bo_\bm_\ba_\bi_\bn_\b__\bt_\by_\bp_\be& x)\n+347 {\n+348 _preconditioner->post(x);\n+349 }\n+350\n+_\b3_\b5_\b2 virtual _\bS_\bo_\bl_\bv_\be_\br_\bC_\ba_\bt_\be_\bg_\bo_\br_\by_\b:_\b:_\bC_\ba_\bt_\be_\bg_\bo_\br_\by _\bc_\ba_\bt_\be_\bg_\bo_\br_\by() const\n+353 {\n+354 return _\bS_\bo_\bl_\bv_\be_\br_\bC_\ba_\bt_\be_\bg_\bo_\br_\by_\b:_\b:_\bn_\bo_\bn_\bo_\bv_\be_\br_\bl_\ba_\bp_\bp_\bi_\bn_\bg;\n+355 }\n+356\n+357 private:\n+359 std::shared_ptr _preconditioner;\n+360\n+362 const _\bc_\bo_\bm_\bm_\bu_\bn_\bi_\bc_\ba_\bt_\bi_\bo_\bn_\b__\bt_\by_\bp_\be& _communication;\n+363 };\n+364\n+367} // end namespace\n+368\n+369#endif\n+_\bs_\bc_\ba_\bl_\ba_\br_\bp_\br_\bo_\bd_\bu_\bc_\bt_\bs_\b._\bh_\bh\n+Define base class for scalar product and norm.\n+_\bp_\br_\be_\bc_\bo_\bn_\bd_\bi_\bt_\bi_\bo_\bn_\be_\br_\bs_\b._\bh_\bh\n+Define general preconditioner interface.\n+_\bo_\bw_\bn_\be_\br_\bo_\bv_\be_\br_\bl_\ba_\bp_\bc_\bo_\bp_\by_\b._\bh_\bh\n+Classes providing communication interfaces for overlapping Schwarz methods.\n+_\bi_\bl_\bu_\b._\bh_\bh\n+The incomplete LU factorization kernels.\n+_\bg_\bs_\be_\bt_\bc_\b._\bh_\bh\n+Simple iterative methods like Jacobi, Gauss-Seidel, SOR, SSOR, etc. in a\n+generic way.\n+_\bb_\bc_\br_\bs_\bm_\ba_\bt_\br_\bi_\bx_\b._\bh_\bh\n+Implementation of the BCRSMatrix class.\n+_\bv_\bb_\bv_\be_\bc_\bt_\bo_\br_\b._\bh_\bh\n+???\n+_\bi_\bo_\b._\bh_\bh\n+Some generic functions for pretty printing vectors and matrices.\n+_\bb_\bv_\be_\bc_\bt_\bo_\br_\b._\bh_\bh\n+This file implements a vector space as a tensor product of a given vector\n+space. The number of compon...\n+_\bs_\bo_\bl_\bv_\be_\br_\bs_\b._\bh_\bh\n+Implementations of the inverse operator interface.\n+_\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\bs_\b._\bh_\bh\n+Define general, extensible interface for operators. The available\n+implementation wraps a matrix.\n _\bD_\bu_\bn_\be\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn allocator.hh:11\n-_\bD_\bu_\bn_\be_\b:_\b:_\bR_\be_\bb_\bo_\bu_\bn_\bd_\bA_\bl_\bl_\bo_\bc_\ba_\bt_\bo_\br_\bT_\by_\bp_\be\n-typename std::allocator_traits< typename AllocatorTraits< T >::type >::template\n-rebind_alloc< X > ReboundAllocatorType\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn allocator.hh:37\n-_\bD_\bu_\bn_\be_\b:_\b:_\bA_\bl_\bl_\bo_\bc_\ba_\bt_\bo_\br_\bT_\by_\bp_\be\n-typename AllocatorTraits< T >::type AllocatorType\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn allocator.hh:34\n-_\bD_\bu_\bn_\be_\b:_\b:_\be_\bx_\bi_\bs_\bt_\bs\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn allocator.hh:14\n-_\bD_\bu_\bn_\be_\b:_\b:_\be_\bx_\bi_\bs_\bt_\bs_\b:_\b:_\bv_\ba_\bl_\bu_\be\n-static const bool value\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn allocator.hh:15\n-_\bD_\bu_\bn_\be_\b:_\b:_\bD_\be_\bf_\ba_\bu_\bl_\bt_\bA_\bl_\bl_\bo_\bc_\ba_\bt_\bo_\br_\bT_\br_\ba_\bi_\bt_\bs\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn allocator.hh:20\n-_\bD_\bu_\bn_\be_\b:_\b:_\bD_\be_\bf_\ba_\bu_\bl_\bt_\bA_\bl_\bl_\bo_\bc_\ba_\bt_\bo_\br_\bT_\br_\ba_\bi_\bt_\bs_\b:_\b:_\bt_\by_\bp_\be\n-std::allocator< T > type\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn allocator.hh:21\n-_\bD_\bu_\bn_\be_\b:_\b:_\bD_\be_\bf_\ba_\bu_\bl_\bt_\bA_\bl_\bl_\bo_\bc_\ba_\bt_\bo_\br_\bT_\br_\ba_\bi_\bt_\bs_\b<_\b _\bT_\b,_\b _\bs_\bt_\bd_\b:_\b:_\bv_\bo_\bi_\bd_\b__\bt_\b<_\b _\bt_\by_\bp_\be_\bn_\ba_\bm_\be_\b _\bT_\b:_\b:_\ba_\bl_\bl_\bo_\bc_\ba_\bt_\bo_\br_\b__\bt_\by_\bp_\be_\b _\b>_\b _\b>_\b:_\b:\n-_\bt_\by_\bp_\be\n-typename T::allocator_type type\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn allocator.hh:27\n-_\bD_\bu_\bn_\be_\b:_\b:_\bA_\bl_\bl_\bo_\bc_\ba_\bt_\bo_\br_\bT_\br_\ba_\bi_\bt_\bs\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn allocator.hh:31\n+_\bD_\bu_\bn_\be_\b:_\b:_\bN_\bo_\bn_\bo_\bv_\be_\br_\bl_\ba_\bp_\bp_\bi_\bn_\bg_\bS_\bc_\bh_\bw_\ba_\br_\bz_\bO_\bp_\be_\br_\ba_\bt_\bo_\br\n+A nonoverlapping operator with communication object.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn novlpschwarz.hh:61\n+_\bD_\bu_\bn_\be_\b:_\b:_\bN_\bo_\bn_\bo_\bv_\be_\br_\bl_\ba_\bp_\bp_\bi_\bn_\bg_\bS_\bc_\bh_\bw_\ba_\br_\bz_\bO_\bp_\be_\br_\ba_\bt_\bo_\br_\b:_\b:_\bP_\bI_\bS\n+C::PIS PIS\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn novlpschwarz.hh:74\n+_\bD_\bu_\bn_\be_\b:_\b:_\bN_\bo_\bn_\bo_\bv_\be_\br_\bl_\ba_\bp_\bp_\bi_\bn_\bg_\bS_\bc_\bh_\bw_\ba_\br_\bz_\bO_\bp_\be_\br_\ba_\bt_\bo_\br_\b:_\b:_\bc_\bo_\bm_\bm_\bu_\bn_\bi_\bc_\ba_\bt_\bi_\bo_\bn_\b__\bt_\by_\bp_\be\n+C communication_type\n+The type of the communication object.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn novlpschwarz.hh:72\n+_\bD_\bu_\bn_\be_\b:_\b:_\bN_\bo_\bn_\bo_\bv_\be_\br_\bl_\ba_\bp_\bp_\bi_\bn_\bg_\bS_\bc_\bh_\bw_\ba_\br_\bz_\bO_\bp_\be_\br_\ba_\bt_\bo_\br_\b:_\b:_\bR_\bI_\bM_\ba_\bp\n+std::multimap< int, std::pair< int, RILIterator > > RIMap\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn novlpschwarz.hh:82\n+_\bD_\bu_\bn_\be_\b:_\b:_\bN_\bo_\bn_\bo_\bv_\be_\br_\bl_\ba_\bp_\bp_\bi_\bn_\bg_\bS_\bc_\bh_\bw_\ba_\br_\bz_\bO_\bp_\be_\br_\ba_\bt_\bo_\br_\b:_\b:_\bR_\bI\n+C::RI RI\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn novlpschwarz.hh:75\n+_\bD_\bu_\bn_\be_\b:_\b:_\bN_\bo_\bn_\bo_\bv_\be_\br_\bl_\ba_\bp_\bp_\bi_\bn_\bg_\bS_\bc_\bh_\bw_\ba_\br_\bz_\bO_\bp_\be_\br_\ba_\bt_\bo_\br_\b:_\b:_\bn_\bo_\bv_\bl_\bp_\b__\bo_\bp_\b__\ba_\bp_\bp_\bl_\by\n+void novlp_op_apply(const X &x, Y &y, field_type alpha) const\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn novlpschwarz.hh:126\n+_\bD_\bu_\bn_\be_\b:_\b:_\bN_\bo_\bn_\bo_\bv_\be_\br_\bl_\ba_\bp_\bp_\bi_\bn_\bg_\bS_\bc_\bh_\bw_\ba_\br_\bz_\bO_\bp_\be_\br_\ba_\bt_\bo_\br_\b:_\b:_\bN_\bo_\bn_\bo_\bv_\be_\br_\bl_\ba_\bp_\bp_\bi_\bn_\bg_\bS_\bc_\bh_\bw_\ba_\br_\bz_\bO_\bp_\be_\br_\ba_\bt_\bo_\br\n+NonoverlappingSchwarzOperator(std::shared_ptr< const matrix_type > A, const\n+communication_type &com)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn novlpschwarz.hh:96\n+_\bD_\bu_\bn_\be_\b:_\b:_\bN_\bo_\bn_\bo_\bv_\be_\br_\bl_\ba_\bp_\bp_\bi_\bn_\bg_\bS_\bc_\bh_\bw_\ba_\br_\bz_\bO_\bp_\be_\br_\ba_\bt_\bo_\br_\b:_\b:_\bC_\bo_\bl_\bI_\bt_\be_\br_\ba_\bt_\bo_\br\n+M::ConstColIterator ColIterator\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn novlpschwarz.hh:79\n+_\bD_\bu_\bn_\be_\b:_\b:_\bN_\bo_\bn_\bo_\bv_\be_\br_\bl_\ba_\bp_\bp_\bi_\bn_\bg_\bS_\bc_\bh_\bw_\ba_\br_\bz_\bO_\bp_\be_\br_\ba_\bt_\bo_\br_\b:_\b:_\ba_\bp_\bp_\bl_\by\n+virtual void apply(const X &x, Y &y) const\n+apply operator to x:\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn novlpschwarz.hh:101\n+_\bD_\bu_\bn_\be_\b:_\b:_\bN_\bo_\bn_\bo_\bv_\be_\br_\bl_\ba_\bp_\bp_\bi_\bn_\bg_\bS_\bc_\bh_\bw_\ba_\br_\bz_\bO_\bp_\be_\br_\ba_\bt_\bo_\br_\b:_\b:_\bd_\bo_\bm_\ba_\bi_\bn_\b__\bt_\by_\bp_\be\n+X domain_type\n+The type of the domain.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn novlpschwarz.hh:66\n+_\bD_\bu_\bn_\be_\b:_\b:_\bN_\bo_\bn_\bo_\bv_\be_\br_\bl_\ba_\bp_\bp_\bi_\bn_\bg_\bS_\bc_\bh_\bw_\ba_\br_\bz_\bO_\bp_\be_\br_\ba_\bt_\bo_\br_\b:_\b:_\bc_\ba_\bt_\be_\bg_\bo_\br_\by\n+virtual SolverCategory::Category category() const\n+Category of the linear operator (see SolverCategory::Category)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn novlpschwarz.hh:235\n+_\bD_\bu_\bn_\be_\b:_\b:_\bN_\bo_\bn_\bo_\bv_\be_\br_\bl_\ba_\bp_\bp_\bi_\bn_\bg_\bS_\bc_\bh_\bw_\ba_\br_\bz_\bO_\bp_\be_\br_\ba_\bt_\bo_\br_\b:_\b:_\bR_\bI_\bM_\ba_\bp_\bi_\bt\n+RIMap::iterator RIMapit\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn novlpschwarz.hh:83\n+_\bD_\bu_\bn_\be_\b:_\b:_\bN_\bo_\bn_\bo_\bv_\be_\br_\bl_\ba_\bp_\bp_\bi_\bn_\bg_\bS_\bc_\bh_\bw_\ba_\br_\bz_\bO_\bp_\be_\br_\ba_\bt_\bo_\br_\b:_\b:_\bg_\be_\bt_\bm_\ba_\bt\n+virtual const matrix_type & getmat() const\n+get matrix via *\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn novlpschwarz.hh:121\n+_\bD_\bu_\bn_\be_\b:_\b:_\bN_\bo_\bn_\bo_\bv_\be_\br_\bl_\ba_\bp_\bp_\bi_\bn_\bg_\bS_\bc_\bh_\bw_\ba_\br_\bz_\bO_\bp_\be_\br_\ba_\bt_\bo_\br_\b:_\b:_\bR_\bI_\bL_\bI_\bt_\be_\br_\ba_\bt_\bo_\br\n+RIL::const_iterator RILIterator\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn novlpschwarz.hh:78\n+_\bD_\bu_\bn_\be_\b:_\b:_\bN_\bo_\bn_\bo_\bv_\be_\br_\bl_\ba_\bp_\bp_\bi_\bn_\bg_\bS_\bc_\bh_\bw_\ba_\br_\bz_\bO_\bp_\be_\br_\ba_\bt_\bo_\br_\b:_\b:_\bM_\bM\n+std::multimap< int, int > MM\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn novlpschwarz.hh:81\n+_\bD_\bu_\bn_\be_\b:_\b:_\bN_\bo_\bn_\bo_\bv_\be_\br_\bl_\ba_\bp_\bp_\bi_\bn_\bg_\bS_\bc_\bh_\bw_\ba_\br_\bz_\bO_\bp_\be_\br_\ba_\bt_\bo_\br_\b:_\b:_\br_\ba_\bn_\bg_\be_\b__\bt_\by_\bp_\be\n+Y range_type\n+The type of the range.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn novlpschwarz.hh:68\n+_\bD_\bu_\bn_\be_\b:_\b:_\bN_\bo_\bn_\bo_\bv_\be_\br_\bl_\ba_\bp_\bp_\bi_\bn_\bg_\bS_\bc_\bh_\bw_\ba_\br_\bz_\bO_\bp_\be_\br_\ba_\bt_\bo_\br_\b:_\b:_\bm_\ba_\bt_\br_\bi_\bx_\b__\bt_\by_\bp_\be\n+M matrix_type\n+The type of the matrix we operate on.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn novlpschwarz.hh:64\n+_\bD_\bu_\bn_\be_\b:_\b:_\bN_\bo_\bn_\bo_\bv_\be_\br_\bl_\ba_\bp_\bp_\bi_\bn_\bg_\bS_\bc_\bh_\bw_\ba_\br_\bz_\bO_\bp_\be_\br_\ba_\bt_\bo_\br_\b:_\b:_\bR_\bo_\bw_\bI_\bt_\be_\br_\ba_\bt_\bo_\br\n+M::ConstRowIterator RowIterator\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn novlpschwarz.hh:80\n+_\bD_\bu_\bn_\be_\b:_\b:_\bN_\bo_\bn_\bo_\bv_\be_\br_\bl_\ba_\bp_\bp_\bi_\bn_\bg_\bS_\bc_\bh_\bw_\ba_\br_\bz_\bO_\bp_\be_\br_\ba_\bt_\bo_\br_\b:_\b:_\bg_\be_\bt_\bC_\bo_\bm_\bm_\bu_\bn_\bi_\bc_\ba_\bt_\bi_\bo_\bn\n+const communication_type & getCommunication() const\n+Get the object responsible for communication.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn novlpschwarz.hh:241\n+_\bD_\bu_\bn_\be_\b:_\b:_\bN_\bo_\bn_\bo_\bv_\be_\br_\bl_\ba_\bp_\bp_\bi_\bn_\bg_\bS_\bc_\bh_\bw_\ba_\br_\bz_\bO_\bp_\be_\br_\ba_\bt_\bo_\br_\b:_\b:_\ba_\bp_\bp_\bl_\by_\bs_\bc_\ba_\bl_\be_\ba_\bd_\bd\n+virtual void applyscaleadd(field_type alpha, const X &x, Y &y) const\n+apply operator to x, scale and add:\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn novlpschwarz.hh:109\n+_\bD_\bu_\bn_\be_\b:_\b:_\bN_\bo_\bn_\bo_\bv_\be_\br_\bl_\ba_\bp_\bp_\bi_\bn_\bg_\bS_\bc_\bh_\bw_\ba_\br_\bz_\bO_\bp_\be_\br_\ba_\bt_\bo_\br_\b:_\b:_\bR_\bI_\bL\n+RI::RemoteIndexList RIL\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn novlpschwarz.hh:76\n+_\bD_\bu_\bn_\be_\b:_\b:_\bN_\bo_\bn_\bo_\bv_\be_\br_\bl_\ba_\bp_\bp_\bi_\bn_\bg_\bS_\bc_\bh_\bw_\ba_\br_\bz_\bO_\bp_\be_\br_\ba_\bt_\bo_\br_\b:_\b:_\bf_\bi_\be_\bl_\bd_\b__\bt_\by_\bp_\be\n+X::field_type field_type\n+The field type of the range.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn novlpschwarz.hh:70\n+_\bD_\bu_\bn_\be_\b:_\b:_\bN_\bo_\bn_\bo_\bv_\be_\br_\bl_\ba_\bp_\bp_\bi_\bn_\bg_\bS_\bc_\bh_\bw_\ba_\br_\bz_\bO_\bp_\be_\br_\ba_\bt_\bo_\br_\b:_\b:_\bN_\bo_\bn_\bo_\bv_\be_\br_\bl_\ba_\bp_\bp_\bi_\bn_\bg_\bS_\bc_\bh_\bw_\ba_\br_\bz_\bO_\bp_\be_\br_\ba_\bt_\bo_\br\n+NonoverlappingSchwarzOperator(const matrix_type &A, const communication_type\n+&com)\n+constructor: just store a reference to a matrix.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn novlpschwarz.hh:92\n+_\bD_\bu_\bn_\be_\b:_\b:_\bN_\bo_\bn_\bo_\bv_\be_\br_\bl_\ba_\bp_\bp_\bi_\bn_\bg_\bS_\bc_\bh_\bw_\ba_\br_\bz_\bO_\bp_\be_\br_\ba_\bt_\bo_\br_\b:_\b:_\bR_\bI_\bI_\bt_\be_\br_\ba_\bt_\bo_\br\n+RI::const_iterator RIIterator\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn novlpschwarz.hh:77\n+_\bD_\bu_\bn_\be_\b:_\b:_\bN_\bo_\bn_\bo_\bv_\be_\br_\bl_\ba_\bp_\bp_\bi_\bn_\bg_\bB_\bl_\bo_\bc_\bk_\bP_\br_\be_\bc_\bo_\bn_\bd_\bi_\bt_\bi_\bo_\bn_\be_\br\n+Nonoverlapping parallel preconditioner.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn novlpschwarz.hh:276\n+_\bD_\bu_\bn_\be_\b:_\b:_\bN_\bo_\bn_\bo_\bv_\be_\br_\bl_\ba_\bp_\bp_\bi_\bn_\bg_\bB_\bl_\bo_\bc_\bk_\bP_\br_\be_\bc_\bo_\bn_\bd_\bi_\bt_\bi_\bo_\bn_\be_\br_\b:_\b:_\bN_\bo_\bn_\bo_\bv_\be_\br_\bl_\ba_\bp_\bp_\bi_\bn_\bg_\bB_\bl_\bo_\bc_\bk_\bP_\br_\be_\bc_\bo_\bn_\bd_\bi_\bt_\bi_\bo_\bn_\be_\br\n+NonoverlappingBlockPreconditioner(P &p, const communication_type &c)\n+Constructor.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn novlpschwarz.hh:295\n+_\bD_\bu_\bn_\be_\b:_\b:_\bN_\bo_\bn_\bo_\bv_\be_\br_\bl_\ba_\bp_\bp_\bi_\bn_\bg_\bB_\bl_\bo_\bc_\bk_\bP_\br_\be_\bc_\bo_\bn_\bd_\bi_\bt_\bi_\bo_\bn_\be_\br_\b:_\b:_\bc_\ba_\bt_\be_\bg_\bo_\br_\by\n+virtual SolverCategory::Category category() const\n+Category of the preconditioner (see SolverCategory::Category)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn novlpschwarz.hh:352\n+_\bD_\bu_\bn_\be_\b:_\b:_\bN_\bo_\bn_\bo_\bv_\be_\br_\bl_\ba_\bp_\bp_\bi_\bn_\bg_\bB_\bl_\bo_\bc_\bk_\bP_\br_\be_\bc_\bo_\bn_\bd_\bi_\bt_\bi_\bo_\bn_\be_\br_\b:_\b:_\ba_\bp_\bp_\bl_\by\n+virtual void apply(domain_type &v, const range_type &d)\n+Apply the preconditioner.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn novlpschwarz.hh:325\n+_\bD_\bu_\bn_\be_\b:_\b:_\bN_\bo_\bn_\bo_\bv_\be_\br_\bl_\ba_\bp_\bp_\bi_\bn_\bg_\bB_\bl_\bo_\bc_\bk_\bP_\br_\be_\bc_\bo_\bn_\bd_\bi_\bt_\bi_\bo_\bn_\be_\br_\b:_\b:_\br_\ba_\bn_\bg_\be_\b__\bt_\by_\bp_\be\n+P::range_type range_type\n+The range type of the preconditioner.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn novlpschwarz.hh:284\n+_\bD_\bu_\bn_\be_\b:_\b:_\bN_\bo_\bn_\bo_\bv_\be_\br_\bl_\ba_\bp_\bp_\bi_\bn_\bg_\bB_\bl_\bo_\bc_\bk_\bP_\br_\be_\bc_\bo_\bn_\bd_\bi_\bt_\bi_\bo_\bn_\be_\br_\b:_\b:_\bN_\bo_\bn_\bo_\bv_\be_\br_\bl_\ba_\bp_\bp_\bi_\bn_\bg_\bB_\bl_\bo_\bc_\bk_\bP_\br_\be_\bc_\bo_\bn_\bd_\bi_\bt_\bi_\bo_\bn_\be_\br\n+NonoverlappingBlockPreconditioner(const std::shared_ptr< P > &p, const\n+communication_type &c)\n+Constructor.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn novlpschwarz.hh:306\n+_\bD_\bu_\bn_\be_\b:_\b:_\bN_\bo_\bn_\bo_\bv_\be_\br_\bl_\ba_\bp_\bp_\bi_\bn_\bg_\bB_\bl_\bo_\bc_\bk_\bP_\br_\be_\bc_\bo_\bn_\bd_\bi_\bt_\bi_\bo_\bn_\be_\br_\b:_\b:_\bp_\bo_\bs_\bt\n+virtual void post(domain_type &x)\n+Clean up.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn novlpschwarz.hh:346\n+_\bD_\bu_\bn_\be_\b:_\b:_\bN_\bo_\bn_\bo_\bv_\be_\br_\bl_\ba_\bp_\bp_\bi_\bn_\bg_\bB_\bl_\bo_\bc_\bk_\bP_\br_\be_\bc_\bo_\bn_\bd_\bi_\bt_\bi_\bo_\bn_\be_\br_\b:_\b:_\bc_\bo_\bm_\bm_\bu_\bn_\bi_\bc_\ba_\bt_\bi_\bo_\bn_\b__\bt_\by_\bp_\be\n+C communication_type\n+The type of the communication object.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn novlpschwarz.hh:286\n+_\bD_\bu_\bn_\be_\b:_\b:_\bN_\bo_\bn_\bo_\bv_\be_\br_\bl_\ba_\bp_\bp_\bi_\bn_\bg_\bB_\bl_\bo_\bc_\bk_\bP_\br_\be_\bc_\bo_\bn_\bd_\bi_\bt_\bi_\bo_\bn_\be_\br_\b:_\b:_\bp_\br_\be\n+virtual void pre(domain_type &x, range_type &b)\n+Prepare the preconditioner.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn novlpschwarz.hh:315\n+_\bD_\bu_\bn_\be_\b:_\b:_\bN_\bo_\bn_\bo_\bv_\be_\br_\bl_\ba_\bp_\bp_\bi_\bn_\bg_\bB_\bl_\bo_\bc_\bk_\bP_\br_\be_\bc_\bo_\bn_\bd_\bi_\bt_\bi_\bo_\bn_\be_\br_\b:_\b:_\ba_\bp_\bp_\bl_\by\n+void apply(X &v, const Y &d)\n+Apply one step of the preconditioner to the system A(v)=d.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn novlpschwarz.hh:335\n+_\bD_\bu_\bn_\be_\b:_\b:_\bN_\bo_\bn_\bo_\bv_\be_\br_\bl_\ba_\bp_\bp_\bi_\bn_\bg_\bB_\bl_\bo_\bc_\bk_\bP_\br_\be_\bc_\bo_\bn_\bd_\bi_\bt_\bi_\bo_\bn_\be_\br_\b:_\b:_\bd_\bo_\bm_\ba_\bi_\bn_\b__\bt_\by_\bp_\be\n+P::domain_type domain_type\n+The domain type of the preconditioner.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn novlpschwarz.hh:282\n+_\bD_\bu_\bn_\be_\b:_\b:_\bA_\bs_\bs_\be_\bm_\bb_\bl_\be_\bd_\bL_\bi_\bn_\be_\ba_\br_\bO_\bp_\be_\br_\ba_\bt_\bo_\br\n+A linear operator exporting itself in matrix form.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn operators.hh:111\n+_\bD_\bu_\bn_\be_\b:_\b:_\bO_\bw_\bn_\be_\br_\bO_\bv_\be_\br_\bl_\ba_\bp_\bC_\bo_\bp_\by_\bA_\bt_\bt_\br_\bi_\bb_\bu_\bt_\be_\bS_\be_\bt_\b:_\b:_\bo_\bw_\bn_\be_\br\n+@ owner\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn owneroverlapcopy.hh:61\n+_\bD_\bu_\bn_\be_\b:_\b:_\bO_\bw_\bn_\be_\br_\bO_\bv_\be_\br_\bl_\ba_\bp_\bC_\bo_\bp_\by_\bA_\bt_\bt_\br_\bi_\bb_\bu_\bt_\be_\bS_\be_\bt_\b:_\b:_\bc_\bo_\bp_\by\n+@ copy\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn owneroverlapcopy.hh:61\n+_\bD_\bu_\bn_\be_\b:_\b:_\bO_\bw_\bn_\be_\br_\bO_\bv_\be_\br_\bl_\ba_\bp_\bC_\bo_\bp_\by_\bA_\bt_\bt_\br_\bi_\bb_\bu_\bt_\be_\bS_\be_\bt_\b:_\b:_\bo_\bv_\be_\br_\bl_\ba_\bp\n+@ overlap\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn owneroverlapcopy.hh:61\n+_\bD_\bu_\bn_\be_\b:_\b:_\bP_\br_\be_\bc_\bo_\bn_\bd_\bi_\bt_\bi_\bo_\bn_\be_\br\n+Base class for matrix free definition of preconditioners.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn preconditioner.hh:33\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bo_\bl_\bv_\be_\br_\bC_\ba_\bt_\be_\bg_\bo_\br_\by_\b:_\b:_\bC_\ba_\bt_\be_\bg_\bo_\br_\by\n+Category\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn solvercategory.hh:23\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bo_\bl_\bv_\be_\br_\bC_\ba_\bt_\be_\bg_\bo_\br_\by_\b:_\b:_\bn_\bo_\bn_\bo_\bv_\be_\br_\bl_\ba_\bp_\bp_\bi_\bn_\bg\n+@ nonoverlapping\n+Category for non-overlapping solvers.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn solvercategory.hh:27\n ===============================================================================\n Generated by\u00a0_\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b] 1.9.8\n"}]}, {"source1": "./usr/share/doc/libdune-istl-doc/doxygen/a00011.html", "source2": "./usr/share/doc/libdune-istl-doc/doxygen/a00011.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n
\n dune-istl: solvercategory.hh File Reference \n+dune-istl: ildl.hh File Reference \n \n-
#include <dune/common/exceptions.hh>\n+\n+
Incomplete LDL decomposition. \n+More...
\n+
#include <dune/common/scalarvectorview.hh>\n+
#include <dune/common/scalarmatrixview.hh>\n+
#include "ilu.hh "\n
\n
Go to the source code of this file.
\n
\n namespace Dune
\n+template<class K , int m, int n> static void Dune::bildl_subtractBCT (const FieldMatrix < K, m, n > &B, const FieldMatrix < K, m, n > &CT, FieldMatrix < K, m, n > &A) template<class K > static void Dune::bildl_subtractBCT (const K &B, const K &CT, K &A, typename std::enable_if_t< Dune::IsNumber< K >::value > *sfinae=nullptr) template<class Matrix > static void Dune::bildl_subtractBCT (const Matrix &B, const Matrix &CT, Matrix &A, typename std::enable_if_t<!Dune::IsNumber< Matrix >::value > *sfinae=nullptr) template<class Matrix > void Dune::bildl_decompose (Matrix &A) compute ILDL decomposition of a symmetric matrix A template<class Matrix , class X , class Y > void Dune::bildl_backsolve (const Matrix &A, X &v, const Y &d, bool isLowerTriangular=false)
\n-
\n+
\n+
Incomplete LDL decomposition.
\n+
Author Martin Nolte \n+
\n+_\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs | _\bF_\bu_\bn_\bc_\bt_\bi_\bo_\bn_\bs\n+ildl.hh File Reference\n+Incomplete LDL decomposition. _\bM_\bo_\br_\be_\b._\b._\b.\n+#include \n+#include \n+#include \"_\bi_\bl_\bu_\b._\bh_\bh\"\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bs_\bo_\bu_\br_\bc_\be_\b _\bc_\bo_\bd_\be_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n-C\bCl\bla\bas\bss\bse\bes\bs\n-struct \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bS_\bo_\bl_\bv_\be_\br_\bC_\ba_\bt_\be_\bg_\bo_\br_\by\n-\u00a0 Categories for the solvers. _\bM_\bo_\br_\be_\b._\b._\b.\n-\u00a0\n- class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bI_\bn_\bv_\ba_\bl_\bi_\bd_\bS_\bo_\bl_\bv_\be_\br_\bC_\ba_\bt_\be_\bg_\bo_\br_\by\n-\u00a0\n N\bNa\bam\bme\bes\bsp\bpa\bac\bce\bes\bs\n namespace \u00a0 _\bD_\bu_\bn_\be\n \u00a0\n+F\bFu\bun\bnc\bct\bti\bio\bon\bns\bs\n+template\n+static void\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bb_\bi_\bl_\bd_\bl_\b__\bs_\bu_\bb_\bt_\br_\ba_\bc_\bt_\bB_\bC_\bT (const _\bF_\bi_\be_\bl_\bd_\bM_\ba_\bt_\br_\bi_\bx< K, m, n > &B, const\n+ _\bF_\bi_\be_\bl_\bd_\bM_\ba_\bt_\br_\bi_\bx< K, m, n > &CT, _\bF_\bi_\be_\bl_\bd_\bM_\ba_\bt_\br_\bi_\bx< K, m, n > &A)\n+\u00a0\n+template\n+static void\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bb_\bi_\bl_\bd_\bl_\b__\bs_\bu_\bb_\bt_\br_\ba_\bc_\bt_\bB_\bC_\bT (const K &B, const K &CT, K &A, typename\n+ std::enable_if_t< Dune::IsNumber< K >::value > *sfinae=nullptr)\n+\u00a0\n+template\n+static void\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bb_\bi_\bl_\bd_\bl_\b__\bs_\bu_\bb_\bt_\br_\ba_\bc_\bt_\bB_\bC_\bT (const _\bM_\ba_\bt_\br_\bi_\bx &B, const _\bM_\ba_\bt_\br_\bi_\bx &CT, _\bM_\ba_\bt_\br_\bi_\bx\n+ &A, typename std::enable_if_t::value >\n+ *sfinae=nullptr)\n+\u00a0\n+template\n+ void\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bb_\bi_\bl_\bd_\bl_\b__\bd_\be_\bc_\bo_\bm_\bp_\bo_\bs_\be (_\bM_\ba_\bt_\br_\bi_\bx &A)\n+\u00a0 compute ILDL decomposition of a symmetric matrix A\n+\u00a0\n+template\n+ void\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bb_\bi_\bl_\bd_\bl_\b__\bb_\ba_\bc_\bk_\bs_\bo_\bl_\bv_\be (const _\bM_\ba_\bt_\br_\bi_\bx &A, X &v, const Y &d, bool\n+ isLowerTriangular=false)\n+\u00a0\n+*\b**\b**\b**\b**\b* D\bDe\bet\bta\bai\bil\ble\bed\bd D\bDe\bes\bsc\bcr\bri\bip\bpt\bti\bio\bon\bn *\b**\b**\b**\b**\b*\n+Incomplete LDL decomposition.\n+ Author\n+ Martin Nolte\n ===============================================================================\n Generated by\u00a0_\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b] 1.9.8\n"}]}, {"source1": "./usr/share/doc/libdune-istl-doc/doxygen/a00011_source.html", "source2": "./usr/share/doc/libdune-istl-doc/doxygen/a00011_source.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n dune-istl: solvercategory.hh Source File \n+dune-istl: ildl.hh Source File \n \n
Go to the documentation of this file. \n
\n-
\n-
\n-
5 #ifndef DUNE_ISTL_SOLVERCATEGORY_HH \n-
6 #define DUNE_ISTL_SOLVERCATEGORY_HH \n-
\n-
8 #include <dune/common/exceptions.hh> \n+
3 #ifndef DUNE_ISTL_ILDL_HH \n+
4 #define DUNE_ISTL_ILDL_HH \n+
\n+
6 #include <dune/common/scalarvectorview.hh> \n+
7 #include <dune/common/scalarmatrixview.hh> \n+
\n
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n+
\n+
\n+
\n+
\n+
\n+
\n+
23 template <
class K,
int m,
int n >
\n+
\n+
\n+
\n+
26 for (
int i = 0; i < m; ++i )
\n+
\n+
28 for (
int j = 0; j < n; ++j )
\n+
\n+
30 for (
int k = 0; k < n; ++k )
\n+
31 A[ i ][ j ] -= B[ i ][ k ] * CT[ j ][ k ];
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
38 typename std::enable_if_t<Dune::IsNumber<K>::value>* sfinae =
nullptr )
\n+
\n+
\n+
\n+
\n+
\n+
43 template <
class Matrix >
\n+
\n+
\n+
45 typename std::enable_if_t<!Dune::IsNumber<Matrix>::value>* sfinae =
nullptr )
\n+
\n+
47 for (
auto i = A.
begin (), iend = A.
end (); i != iend; ++i )
\n
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n+
\n+
50 auto &&B_i = B[ i.index() ];
\n+
51 const auto ikend = B_i.
end ();
\n+
52 for (
auto j = A_i.begin(), jend = A_i.end(); j != jend; ++j )
\n+
\n+
\n+
55 auto &&CT_j = CT[ j.index() ];
\n+
56 const auto jkend = CT_j.
end ();
\n+
57 for (
auto ik = B_i.begin(), jk = CT_j.begin(); (ik != ikend) && (jk != jkend); )
\n+
\n+
59 if ( ik.index() == jk.index() )
\n+
\n+
\n+
\n+
\n+
64 else if ( ik.index() < jk.index() )
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
87 template <
class Matrix >
\n+
\n+
\n+
\n+
90 for (
auto i = A.
begin (), iend = A.
end (); i != iend; ++i )
\n+
\n+
\n+
\n+
94 auto ij = A_i.begin();
\n+
95 for ( ; ij.index() < i.index(); ++ij )
\n+
\n+
\n+
98 auto &&A_j = A[ ij.index() ];
\n+
\n+
\n+
\n+
102 auto ik = A_i.
begin ();
\n+
103 auto jk = A_j.begin();
\n+
104 while ( (ik != ij) && (jk.index() < ij.index()) )
\n+
\n+
106 if ( ik.index() == jk.index() )
\n+
\n+
\n+
\n+
\n+
111 else if ( ik.index() < jk.index() )
\n+
\n+
\n+
\n+
\n+
\n+
\n+
118 if ( ij.index() != i.index() )
\n+
119 DUNE_THROW(
ISTLError ,
"diagonal entry missing" );
\n+
\n+
\n+
\n+
123 for (
auto ik = A_i.begin(); ik != ij; ++ik )
\n+
\n+
\n+
126 const auto &A_k = A[ ik.index() ];
\n+
\n+
\n+
129 Impl::asMatrix(A_ik).rightmultiply( Impl::asMatrix(*A_k.find( ik.index() )) );
\n+
\n+
\n+
\n+
\n+
134 Impl::asMatrix(A_ii).invert();
\n+
\n+
136 catch (
const Dune::FMatrixError &e )
\n+
\n+
138 DUNE_THROW(
MatrixBlockError ,
"ILDL failed to invert matrix block A[" << i.index() <<
"][" << ij.index() <<
"]" << e.what(); th__ex.r = i.index(); th__ex.c = ij.index() );
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
148 template <
class Matrix,
class X,
class Y >
\n+
\n+
\n+
\n+
\n+
152 for (
auto i = A.
begin (), iend = A.
end (); i != iend; ++i )
\n+
\n+
154 const auto &A_i = *i;
\n+
155 v[ i.index() ] = d[ i.index() ];
\n+
156 for (
auto ij = A_i.begin(); ij.index() < i.index(); ++ij )
\n+
\n+
158 auto && vi = Impl::asVector( v[ i.index() ] );
\n+
159 Impl::asMatrix(*ij).mmv(Impl::asVector( v[ ij.index() ] ), vi);
\n+
\n+
\n+
\n+
\n+
164 if ( isLowerTriangular )
\n+
\n+
\n+
\n+
168 for (
auto i = A.
begin (), iend = A.
end (); i != iend; ++i )
\n+
\n+
170 const auto &A_i = *i;
\n+
171 const auto ii = A_i.beforeEnd();
\n+
172 assert( ii.index() == i.index() );
\n+
\n+
\n+
\n+
\n+
\n+
\n+
179 auto rhsValue = v[ i.index() ];
\n+
180 auto && rhs = Impl::asVector(rhsValue);
\n+
181 auto && vi = Impl::asVector( v[ i.index() ] );
\n+
182 Impl::asMatrix(*ii).mv(rhs, vi);
\n+
\n+
\n+
\n+
\n+
\n+
\n+
189 for (
auto i = A.
begin (), iend = A.
end (); i != iend; ++i )
\n+
\n+
191 const auto &A_i = *i;
\n+
192 const auto ii = A_i.find( i.index() );
\n+
193 assert( ii.index() == i.index() );
\n+
\n+
\n+
\n+
\n+
\n+
\n+
200 auto rhsValue = v[ i.index() ];
\n+
201 auto && rhs = Impl::asVector(rhsValue);
\n+
202 auto && vi = Impl::asVector( v[ i.index() ] );
\n+
203 Impl::asMatrix(*ii).mv(rhs, vi);
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
211 const auto &A_i = *i;
\n+
212 for (
auto ij = A_i.begin(); ij.index() < i.index(); ++ij )
\n+
\n+
214 auto && vij = Impl::asVector( v[ ij.index() ] );
\n+
215 Impl::asMatrix(*ij).mmtv(Impl::asVector( v[ i.index() ] ), vij);
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
The incomplete LU factorization kernels.
\n
Definition allocator.hh:11
\n-
Categories for the solvers.
Definition solvercategory.hh:22
\n-
Category
Definition solvercategory.hh:23
\n-
@ sequential
Category for sequential solvers.
Definition solvercategory.hh:25
\n-
@ nonoverlapping
Category for non-overlapping solvers.
Definition solvercategory.hh:27
\n-
@ overlapping
Category for overlapping solvers.
Definition solvercategory.hh:29
\n-
static Category category(const OP &op, decltype(op.category()) *=nullptr)
Helperfunction to extract the solver category either from an enum, or from the newly introduced virtu...
Definition solvercategory.hh:34
\n-
Definition solvercategory.hh:54
\n+
void bildl_decompose(Matrix &A)
compute ILDL decomposition of a symmetric matrix A
Definition ildl.hh:88
\n+
void bildl_backsolve(const Matrix &A, X &v, const Y &d, bool isLowerTriangular=false)
Definition ildl.hh:149
\n+
static void bildl_subtractBCT(const FieldMatrix< K, m, n > &B, const FieldMatrix< K, m, n > &CT, FieldMatrix< K, m, n > &A)
Definition ildl.hh:24
\n+
derive error class from the base class in common
Definition istlexception.hh:19
\n+
Error when performing an operation on a matrix block.
Definition istlexception.hh:52
\n+
A generic dynamic dense matrix.
Definition matrix.hh:561
\n+
RowIterator beforeBegin()
Definition matrix.hh:630
\n+
RowIterator beforeEnd()
Definition matrix.hh:623
\n+
RowIterator end()
Get iterator to one beyond last row.
Definition matrix.hh:616
\n+
RowIterator begin()
Get iterator to first row.
Definition matrix.hh:610
\n+
Definition matrixutils.hh:27
\n
\n+3#ifndef DUNE_ISTL_ILDL_HH\n+4#define DUNE_ISTL_ILDL_HH\n+5\n+6#include \n+7#include \n+8#include \"_\bi_\bl_\bu_\b._\bh_\bh\"\n 9\n-10\n-11namespace _\bD_\bu_\bn_\be {\n-12\n-_\b2_\b1 struct _\bS_\bo_\bl_\bv_\be_\br_\bC_\ba_\bt_\be_\bg_\bo_\br_\by\n-22 {\n-_\b2_\b3 enum _\bC_\ba_\bt_\be_\bg_\bo_\br_\by {\n-_\b2_\b5 _\bs_\be_\bq_\bu_\be_\bn_\bt_\bi_\ba_\bl,\n-_\b2_\b7 _\bn_\bo_\bn_\bo_\bv_\be_\br_\bl_\ba_\bp_\bp_\bi_\bn_\bg,\n-29 _\bo_\bv_\be_\br_\bl_\ba_\bp_\bp_\bi_\bn_\bg\n-_\b3_\b0 };\n-31\n-33 template\n-_\b3_\b4 static _\bC_\ba_\bt_\be_\bg_\bo_\br_\by _\bc_\ba_\bt_\be_\bg_\bo_\br_\by(const OP& op, decltype(op.category())* = nullptr)\n-35 {\n-36 return op.category();\n-37 }\n-38\n-39#ifndef DOXYGEN\n-40 // template\n-41 // static Category category(const OP& op, decltype(op.getSolverCategory())*\n-= nullptr)\n-42 // {\n-43 // return op.getSolverCategory();\n-44 // }\n-45\n-46 template\n-47 static _\bC_\ba_\bt_\be_\bg_\bo_\br_\by _\bc_\ba_\bt_\be_\bg_\bo_\br_\by(const OP& op, decltype(op.category)* = nullptr)\n+17namespace _\bD_\bu_\bn_\be\n+18{\n+19\n+20 // bildl_subtractBCT\n+21 // -----------------\n+22\n+23 template< class K, int m, int n >\n+_\b2_\b4 inline static void _\bb_\bi_\bl_\bd_\bl_\b__\bs_\bu_\bb_\bt_\br_\ba_\bc_\bt_\bB_\bC_\bT ( const _\bF_\bi_\be_\bl_\bd_\bM_\ba_\bt_\br_\bi_\bx_\b<_\b _\bK_\b,_\b _\bm_\b,_\b _\bn_\b _\b> &B,\n+const _\bF_\bi_\be_\bl_\bd_\bM_\ba_\bt_\br_\bi_\bx_\b<_\b _\bK_\b,_\b _\bm_\b,_\b _\bn_\b _\b> &CT, _\bF_\bi_\be_\bl_\bd_\bM_\ba_\bt_\br_\bi_\bx_\b<_\b _\bK_\b,_\b _\bm_\b,_\b _\bn_\b _\b> &A )\n+25 {\n+26 for( int i = 0; i < m; ++i )\n+27 {\n+28 for( int j = 0; j < n; ++j )\n+29 {\n+30 for( int k = 0; k < n; ++k )\n+31 A[ i ][ j ] -= B[ i ][ k ] * CT[ j ][ k ];\n+32 }\n+33 }\n+34 }\n+35\n+36 template< class K >\n+_\b3_\b7 inline static void _\bb_\bi_\bl_\bd_\bl_\b__\bs_\bu_\bb_\bt_\br_\ba_\bc_\bt_\bB_\bC_\bT ( const K &B, const K &CT, K &A,\n+38 typename std::enable_if_t::value>* sfinae = nullptr )\n+39 {\n+40 A -= B * CT;\n+41 }\n+42\n+43 template< class Matrix >\n+_\b4_\b4 inline static void _\bb_\bi_\bl_\bd_\bl_\b__\bs_\bu_\bb_\bt_\br_\ba_\bc_\bt_\bB_\bC_\bT ( const _\bM_\ba_\bt_\br_\bi_\bx &B, const _\bM_\ba_\bt_\br_\bi_\bx &CT,\n+_\bM_\ba_\bt_\br_\bi_\bx &A,\n+45 typename std::enable_if_t::value>* sfinae = nullptr\n+)\n+46 {\n+47 for( auto i = A._\bb_\be_\bg_\bi_\bn(), iend = A._\be_\bn_\bd(); i != iend; ++i )\n 48 {\n-49 return OP::category;\n-50 }\n-51#endif\n-52 };\n-53\n-_\b5_\b4 class _\bI_\bn_\bv_\ba_\bl_\bi_\bd_\bS_\bo_\bl_\bv_\be_\br_\bC_\ba_\bt_\be_\bg_\bo_\br_\by : public InvalidStateException{};\n-55\n-58} // end namespace\n-59\n-60#endif\n+49 auto &&A_i = *i;\n+50 auto &&B_i = B[ i.index() ];\n+51 const auto ikend = B_i._\be_\bn_\bd();\n+52 for( auto j = A_i.begin(), jend = A_i.end(); j != jend; ++j )\n+53 {\n+54 auto &&A_ij = *j;\n+55 auto &&CT_j = CT[ j.index() ];\n+56 const auto jkend = CT_j._\be_\bn_\bd();\n+57 for( auto ik = B_i.begin(), jk = CT_j.begin(); (ik != ikend) && (jk !=\n+jkend); )\n+58 {\n+59 if( ik.index() == jk.index() )\n+60 {\n+61 _\bb_\bi_\bl_\bd_\bl_\b__\bs_\bu_\bb_\bt_\br_\ba_\bc_\bt_\bB_\bC_\bT( *ik, *jk, A_ij );\n+62 ++ik; ++jk;\n+63 }\n+64 else if( ik.index() < jk.index() )\n+65 ++ik;\n+66 else\n+67 ++jk;\n+68 }\n+69 }\n+70 }\n+71 }\n+72\n+73\n+74\n+75 // bildl_decompose\n+76 // ---------------\n+77\n+87 template< class Matrix >\n+_\b8_\b8 inline void _\bb_\bi_\bl_\bd_\bl_\b__\bd_\be_\bc_\bo_\bm_\bp_\bo_\bs_\be ( _\bM_\ba_\bt_\br_\bi_\bx &A )\n+89 {\n+90 for( auto i = A._\bb_\be_\bg_\bi_\bn(), iend = A._\be_\bn_\bd(); i != iend; ++i )\n+91 {\n+92 auto &&A_i = *i;\n+93\n+94 auto ij = A_i.begin();\n+95 for( ; ij.index() < i.index(); ++ij )\n+96 {\n+97 auto &&A_ij = *ij;\n+98 auto &&A_j = A[ ij.index() ];\n+99\n+100 // store L_ij Dj in A_ij (note: for k < i: A_kj = L_kj)\n+101 // L_ij Dj = A_ij - \\sum_{k < j} (L_ik D_k) L_jk^T\n+102 auto ik = A_i._\bb_\be_\bg_\bi_\bn();\n+103 auto jk = A_j.begin();\n+104 while( (ik != ij) && (jk.index() < ij.index()) )\n+105 {\n+106 if( ik.index() == jk.index() )\n+107 {\n+108 _\bb_\bi_\bl_\bd_\bl_\b__\bs_\bu_\bb_\bt_\br_\ba_\bc_\bt_\bB_\bC_\bT(*ik, *jk, A_ij);\n+109 ++ik; ++jk;\n+110 }\n+111 else if( ik.index() < jk.index() )\n+112 ++ik;\n+113 else\n+114 ++jk;\n+115 }\n+116 }\n+117\n+118 if( ij.index() != i.index() )\n+119 DUNE_THROW( _\bI_\bS_\bT_\bL_\bE_\br_\br_\bo_\br, \"diagonal entry missing\" );\n+120\n+121 // update diagonal and multiply A_ij by D_j^{-1}\n+122 auto &&A_ii = *ij;\n+123 for( auto ik = A_i.begin(); ik != ij; ++ik )\n+124 {\n+125 auto &&A_ik = *ik;\n+126 const auto &A_k = A[ ik.index() ];\n+127\n+128 auto B = A_ik;\n+129 Impl::asMatrix(A_ik).rightmultiply( Impl::asMatrix(*A_k.find( ik.index() ))\n+);\n+130 _\bb_\bi_\bl_\bd_\bl_\b__\bs_\bu_\bb_\bt_\br_\ba_\bc_\bt_\bB_\bC_\bT( B, A_ik, A_ii );\n+131 }\n+132 try\n+133 {\n+134 Impl::asMatrix(A_ii).invert();\n+135 }\n+136 catch( const Dune::FMatrixError &e )\n+137 {\n+138 DUNE_THROW( _\bM_\ba_\bt_\br_\bi_\bx_\bB_\bl_\bo_\bc_\bk_\bE_\br_\br_\bo_\br, \"ILDL failed to invert matrix block A[\" <<\n+i.index() << \"][\" << ij.index() << \"]\" << e.what(); th__ex.r = i.index();\n+th__ex.c = ij.index() );\n+139 }\n+140 }\n+141 }\n+142\n+143\n+144\n+145 // bildl_backsolve\n+146 // ---------------\n+147\n+148 template< class Matrix, class X, class Y >\n+_\b1_\b4_\b9 inline void _\bb_\bi_\bl_\bd_\bl_\b__\bb_\ba_\bc_\bk_\bs_\bo_\bl_\bv_\be ( const _\bM_\ba_\bt_\br_\bi_\bx &A, X &v, const Y &d, bool\n+isLowerTriangular = false )\n+150 {\n+151 // solve L v = d, note: Lii = I\n+152 for( auto i = A._\bb_\be_\bg_\bi_\bn(), iend = A._\be_\bn_\bd(); i != iend; ++i )\n+153 {\n+154 const auto &A_i = *i;\n+155 v[ i.index() ] = d[ i.index() ];\n+156 for( auto ij = A_i.begin(); ij.index() < i.index(); ++ij )\n+157 {\n+158 auto&& vi = Impl::asVector( v[ i.index() ] );\n+159 Impl::asMatrix(*ij).mmv(Impl::asVector( v[ ij.index() ] ), vi);\n+160 }\n+161 }\n+162\n+163 // solve D w = v, note: diagonal stores Dii^{-1}\n+164 if( isLowerTriangular )\n+165 {\n+166 // The matrix is lower triangular, so the diagonal entry is the\n+167 // last one in each row.\n+168 for( auto i = A._\bb_\be_\bg_\bi_\bn(), iend = A._\be_\bn_\bd(); i != iend; ++i )\n+169 {\n+170 const auto &A_i = *i;\n+171 const auto ii = A_i.beforeEnd();\n+172 assert( ii.index() == i.index() );\n+173 // We need to be careful here: Directly using\n+174 // auto rhs = Impl::asVector(v[ i.index() ]);\n+175 // is not OK in case this is a proxy. Hence\n+176 // we first have to copy the value. Notice that\n+177 // this is still not OK, if the vector type itself returns\n+178 // proxy references.\n+179 auto rhsValue = v[ i.index() ];\n+180 auto&& rhs = Impl::asVector(rhsValue);\n+181 auto&& vi = Impl::asVector( v[ i.index() ] );\n+182 Impl::asMatrix(*ii).mv(rhs, vi);\n+183 }\n+184 }\n+185 else\n+186 {\n+187 // Without assumptions on the sparsity pattern we have to search\n+188 // for the diagonal entry in each row.\n+189 for( auto i = A._\bb_\be_\bg_\bi_\bn(), iend = A._\be_\bn_\bd(); i != iend; ++i )\n+190 {\n+191 const auto &A_i = *i;\n+192 const auto ii = A_i.find( i.index() );\n+193 assert( ii.index() == i.index() );\n+194 // We need to be careful here: Directly using\n+195 // auto rhs = Impl::asVector(v[ i.index() ]);\n+196 // is not OK in case this is a proxy. Hence\n+197 // we first have to copy the value. Notice that\n+198 // this is still not OK, if the vector type itself returns\n+199 // proxy references.\n+200 auto rhsValue = v[ i.index() ];\n+201 auto&& rhs = Impl::asVector(rhsValue);\n+202 auto&& vi = Impl::asVector( v[ i.index() ] );\n+203 Impl::asMatrix(*ii).mv(rhs, vi);\n+204 }\n+205 }\n+206\n+207 // solve L^T v = w, note: only L is stored\n+208 // note: we perform the operation column-wise from right to left\n+209 for( auto i = A._\bb_\be_\bf_\bo_\br_\be_\bE_\bn_\bd(), iend = A._\bb_\be_\bf_\bo_\br_\be_\bB_\be_\bg_\bi_\bn(); i != iend; --i )\n+210 {\n+211 const auto &A_i = *i;\n+212 for( auto ij = A_i.begin(); ij.index() < i.index(); ++ij )\n+213 {\n+214 auto&& vij = Impl::asVector( v[ ij.index() ] );\n+215 Impl::asMatrix(*ij).mmtv(Impl::asVector( v[ i.index() ] ), vij);\n+216 }\n+217 }\n+218 }\n+219\n+220} // namespace Dune\n+221\n+222#endif // #ifndef DUNE_ISTL_ILDL_HH\n+_\bi_\bl_\bu_\b._\bh_\bh\n+The incomplete LU factorization kernels.\n _\bD_\bu_\bn_\be\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn allocator.hh:11\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bo_\bl_\bv_\be_\br_\bC_\ba_\bt_\be_\bg_\bo_\br_\by\n-Categories for the solvers.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn solvercategory.hh:22\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bo_\bl_\bv_\be_\br_\bC_\ba_\bt_\be_\bg_\bo_\br_\by_\b:_\b:_\bC_\ba_\bt_\be_\bg_\bo_\br_\by\n-Category\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn solvercategory.hh:23\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bo_\bl_\bv_\be_\br_\bC_\ba_\bt_\be_\bg_\bo_\br_\by_\b:_\b:_\bs_\be_\bq_\bu_\be_\bn_\bt_\bi_\ba_\bl\n-@ sequential\n-Category for sequential solvers.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn solvercategory.hh:25\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bo_\bl_\bv_\be_\br_\bC_\ba_\bt_\be_\bg_\bo_\br_\by_\b:_\b:_\bn_\bo_\bn_\bo_\bv_\be_\br_\bl_\ba_\bp_\bp_\bi_\bn_\bg\n-@ nonoverlapping\n-Category for non-overlapping solvers.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn solvercategory.hh:27\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bo_\bl_\bv_\be_\br_\bC_\ba_\bt_\be_\bg_\bo_\br_\by_\b:_\b:_\bo_\bv_\be_\br_\bl_\ba_\bp_\bp_\bi_\bn_\bg\n-@ overlapping\n-Category for overlapping solvers.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn solvercategory.hh:29\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bo_\bl_\bv_\be_\br_\bC_\ba_\bt_\be_\bg_\bo_\br_\by_\b:_\b:_\bc_\ba_\bt_\be_\bg_\bo_\br_\by\n-static Category category(const OP &op, decltype(op.category()) *=nullptr)\n-Helperfunction to extract the solver category either from an enum, or from the\n-newly introduced virtu...\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn solvercategory.hh:34\n-_\bD_\bu_\bn_\be_\b:_\b:_\bI_\bn_\bv_\ba_\bl_\bi_\bd_\bS_\bo_\bl_\bv_\be_\br_\bC_\ba_\bt_\be_\bg_\bo_\br_\by\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn solvercategory.hh:54\n+_\bD_\bu_\bn_\be_\b:_\b:_\bb_\bi_\bl_\bd_\bl_\b__\bd_\be_\bc_\bo_\bm_\bp_\bo_\bs_\be\n+void bildl_decompose(Matrix &A)\n+compute ILDL decomposition of a symmetric matrix A\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn ildl.hh:88\n+_\bD_\bu_\bn_\be_\b:_\b:_\bb_\bi_\bl_\bd_\bl_\b__\bb_\ba_\bc_\bk_\bs_\bo_\bl_\bv_\be\n+void bildl_backsolve(const Matrix &A, X &v, const Y &d, bool\n+isLowerTriangular=false)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn ildl.hh:149\n+_\bD_\bu_\bn_\be_\b:_\b:_\bb_\bi_\bl_\bd_\bl_\b__\bs_\bu_\bb_\bt_\br_\ba_\bc_\bt_\bB_\bC_\bT\n+static void bildl_subtractBCT(const FieldMatrix< K, m, n > &B, const\n+FieldMatrix< K, m, n > &CT, FieldMatrix< K, m, n > &A)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn ildl.hh:24\n+_\bD_\bu_\bn_\be_\b:_\b:_\bI_\bS_\bT_\bL_\bE_\br_\br_\bo_\br\n+derive error class from the base class in common\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn istlexception.hh:19\n+_\bD_\bu_\bn_\be_\b:_\b:_\bM_\ba_\bt_\br_\bi_\bx_\bB_\bl_\bo_\bc_\bk_\bE_\br_\br_\bo_\br\n+Error when performing an operation on a matrix block.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn istlexception.hh:52\n+_\bD_\bu_\bn_\be_\b:_\b:_\bM_\ba_\bt_\br_\bi_\bx\n+A generic dynamic dense matrix.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn matrix.hh:561\n+_\bD_\bu_\bn_\be_\b:_\b:_\bM_\ba_\bt_\br_\bi_\bx_\b:_\b:_\bb_\be_\bf_\bo_\br_\be_\bB_\be_\bg_\bi_\bn\n+RowIterator beforeBegin()\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn matrix.hh:630\n+_\bD_\bu_\bn_\be_\b:_\b:_\bM_\ba_\bt_\br_\bi_\bx_\b:_\b:_\bb_\be_\bf_\bo_\br_\be_\bE_\bn_\bd\n+RowIterator beforeEnd()\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn matrix.hh:623\n+_\bD_\bu_\bn_\be_\b:_\b:_\bM_\ba_\bt_\br_\bi_\bx_\b:_\b:_\be_\bn_\bd\n+RowIterator end()\n+Get iterator to one beyond last row.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn matrix.hh:616\n+_\bD_\bu_\bn_\be_\b:_\b:_\bM_\ba_\bt_\br_\bi_\bx_\b:_\b:_\bb_\be_\bg_\bi_\bn\n+RowIterator begin()\n+Get iterator to first row.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn matrix.hh:610\n+_\bD_\bu_\bn_\be_\b:_\b:_\bF_\bi_\be_\bl_\bd_\bM_\ba_\bt_\br_\bi_\bx\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn matrixutils.hh:27\n ===============================================================================\n Generated by\u00a0_\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b] 1.9.8\n"}]}, {"source1": "./usr/share/doc/libdune-istl-doc/doxygen/a00014.html", "source2": "./usr/share/doc/libdune-istl-doc/doxygen/a00014.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n dune-istl: spqr.hh File Reference \n+dune-istl: scalarproducts.hh File Reference \n \n-
#include <dune/common/fmatrix.hh>\n-
#include <dune/common/fvector.hh>\n-
#include <dune/common/typetraits.hh>\n+\n+
Define general preconditioner interface. \n+More...
\n+
#include <cmath>\n+
#include <complex>\n+
#include <iostream>\n+
#include <iomanip>\n+
#include <memory>\n+
#include <string>\n+
#include <dune/common/simd/simd.hh>\n+
#include <dune/common/parametertree.hh>\n+
#include <dune/istl/solverregistry.hh >\n+
#include "preconditioner.hh "\n+
#include "solver.hh "\n+
#include "solvercategory.hh "\n+
#include "istlexception.hh "\n+
#include "matrixutils.hh "\n+
#include "gsetc.hh "\n+
#include "dilu.hh "\n+
#include "ildl.hh "\n+
#include "ilu.hh "\n
\n
Go to the source code of this file.
\n
\n+class Dune::InverseOperator2Preconditioner< O, c > Turns an InverseOperator into a Preconditioner . More... class Dune::SeqSSOR< M, X, Y, l > Sequential SSOR preconditioner. More... class Dune::SeqSOR< M, X, Y, l > Sequential SOR preconditioner. More... class Dune::SeqJac< M, X, Y, l > The sequential jacobian preconditioner. More... class Dune::SeqDILU< M, X, Y, l > Sequential DILU preconditioner. More... class Dune::SeqILU< M, X, Y, l > Sequential ILU preconditioner. More... class Dune::Richardson< X, Y > Richardson preconditioner. More... class Dune::SeqILDL< M, X, Y > sequential ILDL preconditioner More...
\n+template<class M , class X , class Y , int l = 1> using Dune::SeqGS = SeqSOR < M, X, Y, l > Sequential Gauss Seidel preconditioner.
\n+ Dune::DUNE_REGISTER_PRECONDITIONER ("ssor", defaultPreconditionerBlockLevelCreator < Dune::SeqSSOR >()) Dune::DUNE_REGISTER_PRECONDITIONER ("sor", defaultPreconditionerBlockLevelCreator < Dune::SeqSOR >()) Dune::DUNE_REGISTER_PRECONDITIONER ("gs", defaultPreconditionerBlockLevelCreator < Dune::SeqGS >()) Dune::DUNE_REGISTER_PRECONDITIONER ("jac", defaultPreconditionerBlockLevelCreator < Dune::SeqJac >()) Dune::DUNE_REGISTER_PRECONDITIONER ("dilu", defaultPreconditionerBlockLevelCreator < Dune::SeqDILU >()) Dune::DUNE_REGISTER_PRECONDITIONER ("ilu", defaultPreconditionerBlockLevelCreator < Dune::SeqILU >()) Dune::DUNE_REGISTER_PRECONDITIONER ("richardson", [](auto tl, const auto &, const ParameterTree &config){ using D=typename Dune::TypeListElement< 1, decltype(tl)>::type;using R=typename Dune::TypeListElement< 2, decltype(tl)>::type;return std::make_shared< Richardson < D, R > >(config);}) Dune::DUNE_REGISTER_PRECONDITIONER ("ildl", defaultPreconditionerCreator < Dune::SeqILDL >())
\n-
\n+
\n+
Define general preconditioner interface.
\n+
Wrap the methods implemented by ISTL in this interface. However, the interface is extensible such that new preconditioners can be implemented and used with the solvers.
\n+
\n-#include \n-#include \n+_\bC_\bl_\ba_\bs_\bs_\be_\bs | _\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs | _\bT_\by_\bp_\be_\bd_\be_\bf_\bs | _\bF_\bu_\bn_\bc_\bt_\bi_\bo_\bn_\bs\n+preconditioners.hh File Reference\n+_\bI_\bt_\be_\br_\ba_\bt_\bi_\bv_\be_\b _\bS_\bo_\bl_\bv_\be_\br_\bs_\b _\bT_\be_\bm_\bp_\bl_\ba_\bt_\be_\b _\bL_\bi_\bb_\br_\ba_\br_\by_\b _\b(_\bI_\bS_\bT_\bL_\b) \u00bb _\bI_\bt_\be_\br_\ba_\bt_\bi_\bv_\be_\b _\bS_\bo_\bl_\bv_\be_\br_\bs \u00bb _\bP_\br_\be_\bc_\bo_\bn_\bd_\bi_\bt_\bi_\bo_\bn_\be_\br_\bs\n+Define general preconditioner interface. _\bM_\bo_\br_\be_\b._\b._\b.\n+#include \n+#include \n+#include \n+#include \n+#include \n+#include \n+#include \n+#include \n+#include <_\bd_\bu_\bn_\be_\b/_\bi_\bs_\bt_\bl_\b/_\bs_\bo_\bl_\bv_\be_\br_\br_\be_\bg_\bi_\bs_\bt_\br_\by_\b._\bh_\bh>\n+#include \"_\bp_\br_\be_\bc_\bo_\bn_\bd_\bi_\bt_\bi_\bo_\bn_\be_\br_\b._\bh_\bh\"\n+#include \"_\bs_\bo_\bl_\bv_\be_\br_\b._\bh_\bh\"\n+#include \"_\bs_\bo_\bl_\bv_\be_\br_\bc_\ba_\bt_\be_\bg_\bo_\br_\by_\b._\bh_\bh\"\n+#include \"_\bi_\bs_\bt_\bl_\be_\bx_\bc_\be_\bp_\bt_\bi_\bo_\bn_\b._\bh_\bh\"\n+#include \"_\bm_\ba_\bt_\br_\bi_\bx_\bu_\bt_\bi_\bl_\bs_\b._\bh_\bh\"\n+#include \"_\bg_\bs_\be_\bt_\bc_\b._\bh_\bh\"\n+#include \"_\bd_\bi_\bl_\bu_\b._\bh_\bh\"\n+#include \"_\bi_\bl_\bd_\bl_\b._\bh_\bh\"\n+#include \"_\bi_\bl_\bu_\b._\bh_\bh\"\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bs_\bo_\bu_\br_\bc_\be_\b _\bc_\bo_\bd_\be_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n+C\bCl\bla\bas\bss\bse\bes\bs\n+class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bI_\bn_\bv_\be_\br_\bs_\be_\bO_\bp_\be_\br_\ba_\bt_\bo_\br_\b2_\bP_\br_\be_\bc_\bo_\bn_\bd_\bi_\bt_\bi_\bo_\bn_\be_\br_\b<_\b _\bO_\b,_\b _\bc_\b _\b>\n+\u00a0 Turns an _\bI_\bn_\bv_\be_\br_\bs_\be_\bO_\bp_\be_\br_\ba_\bt_\bo_\br into a _\bP_\br_\be_\bc_\bo_\bn_\bd_\bi_\bt_\bi_\bo_\bn_\be_\br. _\bM_\bo_\br_\be_\b._\b._\b.\n+\u00a0\n+class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bS_\be_\bq_\bS_\bS_\bO_\bR_\b<_\b _\bM_\b,_\b _\bX_\b,_\b _\bY_\b,_\b _\bl_\b _\b>\n+\u00a0 Sequential SSOR preconditioner. _\bM_\bo_\br_\be_\b._\b._\b.\n+\u00a0\n+class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bS_\be_\bq_\bS_\bO_\bR_\b<_\b _\bM_\b,_\b _\bX_\b,_\b _\bY_\b,_\b _\bl_\b _\b>\n+\u00a0 Sequential SOR preconditioner. _\bM_\bo_\br_\be_\b._\b._\b.\n+\u00a0\n+class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bS_\be_\bq_\bJ_\ba_\bc_\b<_\b _\bM_\b,_\b _\bX_\b,_\b _\bY_\b,_\b _\bl_\b _\b>\n+\u00a0 The sequential jacobian preconditioner. _\bM_\bo_\br_\be_\b._\b._\b.\n+\u00a0\n+class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bS_\be_\bq_\bD_\bI_\bL_\bU_\b<_\b _\bM_\b,_\b _\bX_\b,_\b _\bY_\b,_\b _\bl_\b _\b>\n+\u00a0 Sequential _\bD_\bI_\bL_\bU preconditioner. _\bM_\bo_\br_\be_\b._\b._\b.\n+\u00a0\n+class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bS_\be_\bq_\bI_\bL_\bU_\b<_\b _\bM_\b,_\b _\bX_\b,_\b _\bY_\b,_\b _\bl_\b _\b>\n+\u00a0 Sequential _\bI_\bL_\bU preconditioner. _\bM_\bo_\br_\be_\b._\b._\b.\n+\u00a0\n+class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bR_\bi_\bc_\bh_\ba_\br_\bd_\bs_\bo_\bn_\b<_\b _\bX_\b,_\b _\bY_\b _\b>\n+\u00a0 _\bR_\bi_\bc_\bh_\ba_\br_\bd_\bs_\bo_\bn preconditioner. _\bM_\bo_\br_\be_\b._\b._\b.\n+\u00a0\n+class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bS_\be_\bq_\bI_\bL_\bD_\bL_\b<_\b _\bM_\b,_\b _\bX_\b,_\b _\bY_\b _\b>\n+\u00a0 sequential ILDL preconditioner _\bM_\bo_\br_\be_\b._\b._\b.\n+\u00a0\n N\bNa\bam\bme\bes\bsp\bpa\bac\bce\bes\bs\n namespace \u00a0 _\bD_\bu_\bn_\be\n \u00a0\n-namespace \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bI_\bS_\bT_\bL\n+T\bTy\byp\bpe\bed\bde\bef\bfs\bs\n+template\n+using\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bS_\be_\bq_\bG_\bS = _\bS_\be_\bq_\bS_\bO_\bR< M, X, Y, l >\n+\u00a0 Sequential Gauss Seidel preconditioner.\n+\u00a0\n+F\bFu\bun\bnc\bct\bti\bio\bon\bns\bs\n+\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bD_\bU_\bN_\bE_\b__\bR_\bE_\bG_\bI_\bS_\bT_\bE_\bR_\b__\bP_\bR_\bE_\bC_\bO_\bN_\bD_\bI_\bT_\bI_\bO_\bN_\bE_\bR (\"ssor\",\n+ _\bd_\be_\bf_\ba_\bu_\bl_\bt_\bP_\br_\be_\bc_\bo_\bn_\bd_\bi_\bt_\bi_\bo_\bn_\be_\br_\bB_\bl_\bo_\bc_\bk_\bL_\be_\bv_\be_\bl_\bC_\br_\be_\ba_\bt_\bo_\br< _\bD_\bu_\bn_\be_\b:_\b:_\bS_\be_\bq_\bS_\bS_\bO_\bR >())\n+\u00a0\n+\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bD_\bU_\bN_\bE_\b__\bR_\bE_\bG_\bI_\bS_\bT_\bE_\bR_\b__\bP_\bR_\bE_\bC_\bO_\bN_\bD_\bI_\bT_\bI_\bO_\bN_\bE_\bR (\"sor\",\n+ _\bd_\be_\bf_\ba_\bu_\bl_\bt_\bP_\br_\be_\bc_\bo_\bn_\bd_\bi_\bt_\bi_\bo_\bn_\be_\br_\bB_\bl_\bo_\bc_\bk_\bL_\be_\bv_\be_\bl_\bC_\br_\be_\ba_\bt_\bo_\br< _\bD_\bu_\bn_\be_\b:_\b:_\bS_\be_\bq_\bS_\bO_\bR >())\n+\u00a0\n+\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bD_\bU_\bN_\bE_\b__\bR_\bE_\bG_\bI_\bS_\bT_\bE_\bR_\b__\bP_\bR_\bE_\bC_\bO_\bN_\bD_\bI_\bT_\bI_\bO_\bN_\bE_\bR (\"gs\",\n+ _\bd_\be_\bf_\ba_\bu_\bl_\bt_\bP_\br_\be_\bc_\bo_\bn_\bd_\bi_\bt_\bi_\bo_\bn_\be_\br_\bB_\bl_\bo_\bc_\bk_\bL_\be_\bv_\be_\bl_\bC_\br_\be_\ba_\bt_\bo_\br< _\bD_\bu_\bn_\be_\b:_\b:_\bS_\be_\bq_\bG_\bS >())\n+\u00a0\n+\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bD_\bU_\bN_\bE_\b__\bR_\bE_\bG_\bI_\bS_\bT_\bE_\bR_\b__\bP_\bR_\bE_\bC_\bO_\bN_\bD_\bI_\bT_\bI_\bO_\bN_\bE_\bR (\"jac\",\n+ _\bd_\be_\bf_\ba_\bu_\bl_\bt_\bP_\br_\be_\bc_\bo_\bn_\bd_\bi_\bt_\bi_\bo_\bn_\be_\br_\bB_\bl_\bo_\bc_\bk_\bL_\be_\bv_\be_\bl_\bC_\br_\be_\ba_\bt_\bo_\br< _\bD_\bu_\bn_\be_\b:_\b:_\bS_\be_\bq_\bJ_\ba_\bc >())\n+\u00a0\n+\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bD_\bU_\bN_\bE_\b__\bR_\bE_\bG_\bI_\bS_\bT_\bE_\bR_\b__\bP_\bR_\bE_\bC_\bO_\bN_\bD_\bI_\bT_\bI_\bO_\bN_\bE_\bR (\"dilu\",\n+ _\bd_\be_\bf_\ba_\bu_\bl_\bt_\bP_\br_\be_\bc_\bo_\bn_\bd_\bi_\bt_\bi_\bo_\bn_\be_\br_\bB_\bl_\bo_\bc_\bk_\bL_\be_\bv_\be_\bl_\bC_\br_\be_\ba_\bt_\bo_\br< _\bD_\bu_\bn_\be_\b:_\b:_\bS_\be_\bq_\bD_\bI_\bL_\bU >())\n+\u00a0\n+\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bD_\bU_\bN_\bE_\b__\bR_\bE_\bG_\bI_\bS_\bT_\bE_\bR_\b__\bP_\bR_\bE_\bC_\bO_\bN_\bD_\bI_\bT_\bI_\bO_\bN_\bE_\bR (\"ilu\",\n+ _\bd_\be_\bf_\ba_\bu_\bl_\bt_\bP_\br_\be_\bc_\bo_\bn_\bd_\bi_\bt_\bi_\bo_\bn_\be_\br_\bB_\bl_\bo_\bc_\bk_\bL_\be_\bv_\be_\bl_\bC_\br_\be_\ba_\bt_\bo_\br< _\bD_\bu_\bn_\be_\b:_\b:_\bS_\be_\bq_\bI_\bL_\bU >())\n+\u00a0\n+\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bD_\bU_\bN_\bE_\b__\bR_\bE_\bG_\bI_\bS_\bT_\bE_\bR_\b__\bP_\bR_\bE_\bC_\bO_\bN_\bD_\bI_\bT_\bI_\bO_\bN_\bE_\bR (\"richardson\", [](auto tl, const auto &,\n+ const ParameterTree &config){ using D=typename Dune::TypeListElement< 1,\n+ decltype(tl)>::type;using R=typename Dune::TypeListElement< 2, decltype\n+ (tl)>::type;return std::make_shared< _\bR_\bi_\bc_\bh_\ba_\br_\bd_\bs_\bo_\bn< D, R > >(config);})\n+\u00a0\n+\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bD_\bU_\bN_\bE_\b__\bR_\bE_\bG_\bI_\bS_\bT_\bE_\bR_\b__\bP_\bR_\bE_\bC_\bO_\bN_\bD_\bI_\bT_\bI_\bO_\bN_\bE_\bR (\"ildl\", _\bd_\be_\bf_\ba_\bu_\bl_\bt_\bP_\br_\be_\bc_\bo_\bn_\bd_\bi_\bt_\bi_\bo_\bn_\be_\br_\bC_\br_\be_\ba_\bt_\bo_\br<\n+ _\bD_\bu_\bn_\be_\b:_\b:_\bS_\be_\bq_\bI_\bL_\bD_\bL >())\n \u00a0\n+*\b**\b**\b**\b**\b* D\bDe\bet\bta\bai\bil\ble\bed\bd D\bDe\bes\bsc\bcr\bri\bip\bpt\bti\bio\bon\bn *\b**\b**\b**\b**\b*\n+Define general preconditioner interface.\n+Wrap the methods implemented by ISTL in this interface. However, the interface\n+is extensible such that new preconditioners can be implemented and used with\n+the solvers.\n ===============================================================================\n Generated by\u00a0_\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b] 1.9.8\n"}]}, {"source1": "./usr/share/doc/libdune-istl-doc/doxygen/a00017_source.html", "source2": "./usr/share/doc/libdune-istl-doc/doxygen/a00017_source.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n dune-istl: bccsmatrix.hh Source File \n+dune-istl: preconditioners.hh Source File \n \n
Go to the documentation of this file. \n
\n
\n
\n-
5 #ifndef DUNE_ISTL_BCCSMATRIX_HH \n-
6 #define DUNE_ISTL_BCCSMATRIX_HH \n+
5 #ifndef DUNE_ISTL_PRECONDITIONERS_HH \n+
6 #define DUNE_ISTL_PRECONDITIONERS_HH \n
\n-
8 #include <dune/common/fmatrix.hh> \n-
9 #include <dune/common/fvector.hh> \n-
10 #include <dune/common/typetraits.hh> \n-
\n-
\n-
12 namespace Dune::ISTL::Impl
\n-
\n-
27 template<class B, class I = typename std::allocator<B>::size_type>
\n-
\n-
\n-
\n-
\n-
32 using size_type = std::size_t;
\n-
\n-
\n-
37 : N_(0), M_(0), Nnz_(0), values(0), rowindex(0), colstart(0)
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
48 void setSize(size_type rows, size_type columns)
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
64 size_type nonzeroes()
const \n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
95 Index* getRowIndex()
const \n-
\n-
\n-
\n-
\n-
106 Index* getColStart()
const \n-
\n-
\n-
\n-
\n-
112 BCCSMatrix& operator=(
const BCCSMatrix&
mat )
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
120 colstart=
new size_type[M_+1];
\n-
121 for (size_type i=0; i<=M_; ++i)
\n-
122 colstart[i]=
mat .colstart[i];
\n-
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
15 #include <dune/common/simd/simd.hh> \n+
16 #include <dune/common/parametertree.hh> \n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
73 template <
class O,
int c = -1>
\n+
\n+
\n+
75 public Preconditioner <typename O::domain_type, typename O::range_type>
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
96 : inverse_operator_(inverse_operator)
\n+
\n+
\n+
99 DUNE_THROW(InvalidStateException,
"User-supplied solver category does not match that of the given inverse operator" );
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
109 inverse_operator_.apply(v, copy, res);
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n
\n-
\n-
126 values =
new B[Nnz_];
\n-
127 rowindex =
new size_type[Nnz_];
\n+
\n+
\n+
\n
\n-
129 for (size_type i=0; i<Nnz_; ++i)
\n-
130 values[i]=
mat .values[i];
\n-
\n-
132 for (size_type i=0; i<Nnz_; ++i)
\n-
133 rowindex[i]=
mat .rowindex[i];
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
150 size_type N_, M_, Nnz_;
\n-
\n-
\n-
\n-
\n-
\n-
\n+
\n+
141 template <
class M,
class X,
class Y,
int l=1>
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
165 : _A_(A), _n(n), _w(w)
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
184 :
SeqSSOR (A->getmat(), configuration)
\n+
\n+
\n+
\n+
\n+
200 SeqSSOR (
const M& A,
const ParameterTree& configuration)
\n+
\n+
\n+
\n+
\n+
\n+
209 virtual void pre ([[maybe_unused]] X& x, [[maybe_unused]] Y& b)
\n+
\n+
\n+
\n+
\n+
217 virtual void apply (X& v,
const Y& d)
\n+
\n+
219 for (
int i=0; i<_n; i++) {
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
230 virtual void post ([[maybe_unused]] X& x)
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
261 template <
class M,
class X,
class Y,
int l=1>
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
285 : _A_(A), _n(n), _w(w)
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
304 :
SeqSOR (A->getmat(), configuration)
\n+
\n+
\n+
\n+
\n+
320 SeqSOR (
const M& A,
const ParameterTree& configuration)
\n+
\n+
\n+
\n+
\n+
\n+
329 virtual void pre ([[maybe_unused]] X& x, [[maybe_unused]] Y& b)
\n+
\n+
\n+
\n+
\n+
337 virtual void apply (X& v,
const Y& d)
\n+
\n+
339 this->
template apply<true>(v,d);
\n+
\n+
\n+
\n+
350 template <
bool forward>
\n+
\n+
\n+
\n+
\n+
354 for (
int i=0; i<_n; i++) {
\n+
\n+
\n+
\n+
358 for (
int i=0; i<_n; i++) {
\n+
\n+
\n+
\n+
\n+
\n+
\n+
368 virtual void post ([[maybe_unused]] X& x)
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
398 template <
class M,
class X,
class Y,
int l=1>
\n+
\n+
\n+
\n+
412 template <
class M,
class X,
class Y,
int l=1>
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
436 : _A_(A), _n(n), _w(w)
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
455 :
SeqJac (A->getmat(), configuration)
\n+
\n+
\n+
\n+
\n+
471 SeqJac (
const M& A,
const ParameterTree& configuration)
\n+
\n+
\n+
\n+
\n+
\n+
480 virtual void pre ([[maybe_unused]] X& x, [[maybe_unused]] Y& b)
\n+
\n+
\n+
\n+
\n+
488 virtual void apply (X& v,
const Y& d)
\n+
\n+
490 for (
int i=0; i<_n; i++) {
\n+
\n+
\n+
\n+
\n+
\n+
\n+
500 virtual void post ([[maybe_unused]] X& x)
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
562 template <
class M,
class X,
class Y,
int l = 1>
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
595 Dinv_.resize(_A_.N());
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
613 :
SeqDILU (A->getmat(), configuration)
\n+
\n+
\n+
\n+
\n+
\n+
629 SeqDILU (
const M &A,
const ParameterTree &config)
\n+
\n+
\n+
\n+
\n+
\n+
\n+
639 virtual void pre ([[maybe_unused]] X &x, [[maybe_unused]] Y &b)
\n+
\n+
\n+
\n+
\n+
\n+
648 virtual void apply (X &v,
const Y &d)
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
664 virtual void post ([[maybe_unused]] X &x)
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
696 template <
class M,
class X,
class Y,
int l=1>
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
727 :
SeqILU ( A, 0, w, resort )
\n+
\n+
\n+
\n+
\n+
\n+
\n+
746 :
SeqILU (A->getmat(), configuration)
\n+
\n+
\n+
\n+
\n+
763 SeqILU (
const M& A,
const ParameterTree& config)
\n+
\n+
\n+
766 config.
get (
"resort" , false))
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
813 virtual void pre ([[maybe_unused]] X& x, [[maybe_unused]] Y& b)
\n+
\n+
\n+
\n+
\n+
821 virtual void apply (X& v,
const Y& d)
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
843 virtual void post ([[maybe_unused]] X& x)
\n+
\n+
\n+
\n+
\n+
\n+
\n+
854 std::unique_ptr< matrix_type >
ILU_ ;
\n+
\n+
\n+
\n+
859 std::vector< block_type, typename matrix_type::allocator_type >
inv_ ;
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
877 template <
class X,
class Y>
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
920 virtual void pre ([[maybe_unused]] X& x, [[maybe_unused]] Y& b)
\n+
\n+
\n+
\n+
\n+
928 virtual void apply (X& v,
const Y& d)
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
939 virtual void post ([[maybe_unused]] X& x)
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
953 using D =
typename Dune::TypeListElement<1,
decltype (tl)>::type;
\n+
954 using R =
typename Dune::TypeListElement<2,
decltype (tl)>::type;
\n+
955 return std::make_shared<Richardson<D,R>>(config);
\n+
\n+
\n+
\n+
969 template <
class M,
class X,
class Y >
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
1003 :
SeqILDL (A->getmat(), configuration)
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
1031 : decomposition_( A.N(), A.M(),
matrix_type ::random ),
\n+
\n+
\n+
\n+
1035 for (
auto i = A.begin(), iend = A.end(); i != iend; ++i )
\n+
\n+
1037 const auto &A_i = *i;
\n+
1038 const auto ij = A_i.find( i.index() );
\n+
1039 if ( ij != A_i.end() )
\n+
1040 decomposition_.setrowsize( i.index(), ij.offset()+1 );
\n+
\n+
1042 DUNE_THROW(
ISTLError ,
"diagonal entry missing" );
\n+
\n+
1044 decomposition_.endrowsizes();
\n+
\n+
\n+
1047 for (
auto i = A.begin(), iend = A.end(); i != iend; ++i )
\n+
\n+
1049 const auto &A_i = *i;
\n+
1050 for (
auto ij = A_i.begin(); ij.index() < i.index() ; ++ij )
\n+
1051 decomposition_.addindex( i.index(), ij.index() );
\n+
1052 decomposition_.addindex( i.index(), i.index() );
\n+
\n+
1054 decomposition_.endindices();
\n+
\n+
\n+
\n+
1058 for (
auto row = decomposition_.begin(), rowend = decomposition_.end(); row != rowend; ++row, ++i )
\n+
\n+
1060 auto ij = i->begin();
\n+
1061 for (
auto col = row->begin(), colend = row->end();
col != colend; ++
col , ++ij )
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
1070 void pre ([[maybe_unused]] X &x, [[maybe_unused]] Y &b)
override \n+
\n+
\n+
\n+
\n+
1074 void apply ( X &v,
const Y &d )
override \n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
1081 void post ([[maybe_unused]] X &x)
override \n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n
\n-
\n-
Matrix & mat
Definition matrixmatrix.hh:347
\n+
\n+
\n+
\n+
\n+
\n+
\n+
Incomplete LDL decomposition.
\n+
\n+
#define DUNE_REGISTER_PRECONDITIONER(name,...)
Definition solverregistry.hh:16
\n+
\n+
The incomplete LU factorization kernels.
\n+
Some handy generic functions for ISTL matrices.
\n+
Simple iterative methods like Jacobi, Gauss-Seidel, SOR, SSOR, etc. in a generic way.
\n+
\n+
The diagonal incomplete LU factorization kernels.
\n+
Define general, extensible interface for inverse operators.
\n+
\n+
Col col
Definition matrixmatrix.hh:351
\n+
void bsorb(const M &A, X &x, const Y &b, const K &w)
SSOR step.
Definition gsetc.hh:646
\n+
void dbjac(const M &A, X &x, const Y &b, const K &w)
Jacobi step.
Definition gsetc.hh:658
\n+
void bsorf(const M &A, X &x, const Y &b, const K &w)
SOR step.
Definition gsetc.hh:634
\n+
Definition allocator.hh:11
\n+
void bildl_decompose(Matrix &A)
compute ILDL decomposition of a symmetric matrix A
Definition ildl.hh:88
\n+
PropertyMapTypeSelector< Amg::VertexVisitedTag, Amg::PropertiesGraph< G, Amg::VertexProperties, EP, VM, EM > >::Type get(const Amg::VertexVisitedTag &tag, Amg::PropertiesGraph< G, Amg::VertexProperties, EP, VM, EM > &graph)
Definition dependency.hh:293
\n+
void bildl_backsolve(const Matrix &A, X &v, const Y &d, bool isLowerTriangular=false)
Definition ildl.hh:149
\n+
void blockDILUDecomposition(M &A, std::vector< typename M::block_type > &Dinv_)
Definition dilu.hh:51
\n+
void blockDILUBacksolve(const M &A, const std::vector< typename M::block_type > Dinv_, X &v, const Y &d)
Definition dilu.hh:107
\n+
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
\n+
void blockILUBacksolve(const M &A, X &v, const Y &d)
LU backsolve with stored inverse.
Definition ilu.hh:94
\n+
void blockILU0Decomposition(M &A)
compute ILU decomposition of A. A is overwritten by its decomposition
Definition ilu.hh:33
\n+
void blockILUDecomposition(const M &A, int n, M &ILU)
Definition ilu.hh:167
\n+
compile-time parameter for block recursion depth
Definition gsetc.hh:45
\n+
a simple compressed row storage matrix class
Definition ilu.hh:259
\n+
derive error class from the base class in common
Definition istlexception.hh:19
\n+
static void check(const Matrix &mat)
Check whether the a matrix has diagonal values on blocklevel recursion levels.
Definition matrixutils.hh:53
\n+
A linear operator exporting itself in matrix form.
Definition operators.hh:111
\n+
Base class for matrix free definition of preconditioners.
Definition preconditioner.hh:33
\n+
Turns an InverseOperator into a Preconditioner.
Definition preconditioners.hh:76
\n+
O::range_type range_type
The range type of the preconditioner.
Definition preconditioners.hh:81
\n+
O::domain_type domain_type
The domain type of the preconditioner.
Definition preconditioners.hh:79
\n+
virtual void post(domain_type &)
Clean up.
Definition preconditioners.hh:112
\n+
range_type::field_type field_type
The field type of the preconditioner.
Definition preconditioners.hh:83
\n+
FieldTraits< scalar_field_type >::real_type real_field_type
real scalar type underlying the field_type
Definition preconditioners.hh:87
\n+
Simd::Scalar< field_type > scalar_field_type
scalar type underlying the field_type
Definition preconditioners.hh:85
\n+
virtual SolverCategory::Category category() const
Category of the preconditioner (see SolverCategory::Category)
Definition preconditioners.hh:116
\n+
virtual void pre(domain_type &, range_type &)
Prepare the preconditioner.
Definition preconditioners.hh:102
\n+
InverseOperator2Preconditioner(InverseOperator &inverse_operator)
Construct the preconditioner from the solver.
Definition preconditioners.hh:95
\n+
O InverseOperator
type of the wrapped inverse operator
Definition preconditioners.hh:89
\n+
virtual void apply(domain_type &v, const range_type &d)
Apply one step of the preconditioner to the system A(v)=d.
Definition preconditioners.hh:105
\n+
Sequential SSOR preconditioner.
Definition preconditioners.hh:142
\n+
virtual void post(X &x)
Clean up.
Definition preconditioners.hh:230
\n+
SeqSSOR(const std::shared_ptr< const AssembledLinearOperator< M, X, Y > > &A, const ParameterTree &configuration)
Constructor.
Definition preconditioners.hh:183
\n+
SeqSSOR(const M &A, const ParameterTree &configuration)
Constructor.
Definition preconditioners.hh:200
\n+
virtual SolverCategory::Category category() const
Category of the preconditioner (see SolverCategory::Category)
Definition preconditioners.hh:234
\n+
X::field_type field_type
The field type of the preconditioner.
Definition preconditioners.hh:151
\n+
Simd::Scalar< field_type > scalar_field_type
scalar type underlying the field_type
Definition preconditioners.hh:153
\n+
X domain_type
The domain type of the preconditioner.
Definition preconditioners.hh:147
\n+
M matrix_type
The matrix type the preconditioner is for.
Definition preconditioners.hh:145
\n+
virtual void apply(X &v, const Y &d)
Apply the preconditioner.
Definition preconditioners.hh:217
\n+
virtual void pre(X &x, Y &b)
Prepare the preconditioner.
Definition preconditioners.hh:209
\n+
Y range_type
The range type of the preconditioner.
Definition preconditioners.hh:149
\n+
FieldTraits< scalar_field_type >::real_type real_field_type
real scalar type underlying the field_type
Definition preconditioners.hh:155
\n+
SeqSSOR(const M &A, int n, real_field_type w)
Constructor.
Definition preconditioners.hh:164
\n+
Sequential SOR preconditioner.
Definition preconditioners.hh:262
\n+
SeqSOR(const std::shared_ptr< const AssembledLinearOperator< M, X, Y > > &A, const ParameterTree &configuration)
Constructor.
Definition preconditioners.hh:303
\n+
M matrix_type
The matrix type the preconditioner is for.
Definition preconditioners.hh:265
\n+
FieldTraits< scalar_field_type >::real_type real_field_type
real scalar type underlying the field_type
Definition preconditioners.hh:275
\n+
void apply(X &v, const Y &d)
Apply the preconditioner in a special direction.
Definition preconditioners.hh:351
\n+
X domain_type
The domain type of the preconditioner.
Definition preconditioners.hh:267
\n+
virtual void post(X &x)
Clean up.
Definition preconditioners.hh:368
\n+
virtual void pre(X &x, Y &b)
Prepare the preconditioner.
Definition preconditioners.hh:329
\n+
Simd::Scalar< field_type > scalar_field_type
scalar type underlying the field_type
Definition preconditioners.hh:273
\n+
virtual SolverCategory::Category category() const
Category of the preconditioner (see SolverCategory::Category)
Definition preconditioners.hh:372
\n+
virtual void apply(X &v, const Y &d)
Apply the preconditioner.
Definition preconditioners.hh:337
\n+
Y range_type
The range type of the preconditioner.
Definition preconditioners.hh:269
\n+
SeqSOR(const M &A, const ParameterTree &configuration)
Constructor.
Definition preconditioners.hh:320
\n+
X::field_type field_type
The field type of the preconditioner.
Definition preconditioners.hh:271
\n+
SeqSOR(const M &A, int n, real_field_type w)
Constructor.
Definition preconditioners.hh:284
\n+
The sequential jacobian preconditioner.
Definition preconditioners.hh:413
\n+
virtual void post(X &x)
Clean up.
Definition preconditioners.hh:500
\n+
SeqJac(const M &A, const ParameterTree &configuration)
Constructor.
Definition preconditioners.hh:471
\n+
virtual void apply(X &v, const Y &d)
Apply the preconditioner.
Definition preconditioners.hh:488
\n+
M matrix_type
The matrix type the preconditioner is for.
Definition preconditioners.hh:416
\n+
Simd::Scalar< field_type > scalar_field_type
scalar type underlying the field_type
Definition preconditioners.hh:424
\n+
SeqJac(const std::shared_ptr< const AssembledLinearOperator< M, X, Y > > &A, const ParameterTree &configuration)
Constructor.
Definition preconditioners.hh:454
\n+
X::field_type field_type
The field type of the preconditioner.
Definition preconditioners.hh:422
\n+
virtual void pre(X &x, Y &b)
Prepare the preconditioner.
Definition preconditioners.hh:480
\n+
X domain_type
The domain type of the preconditioner.
Definition preconditioners.hh:418
\n+
FieldTraits< scalar_field_type >::real_type real_field_type
real scalar type underlying the field_type
Definition preconditioners.hh:426
\n+
virtual SolverCategory::Category category() const
Category of the preconditioner (see SolverCategory::Category)
Definition preconditioners.hh:504
\n+
SeqJac(const M &A, int n, real_field_type w)
Constructor.
Definition preconditioners.hh:435
\n+
Y range_type
The range type of the preconditioner.
Definition preconditioners.hh:420
\n+
Sequential DILU preconditioner.
Definition preconditioners.hh:564
\n+
const bool wNotIdentity_
true if w != 1.0
Definition preconditioners.hh:681
\n+
typename X::field_type field_type
The field type of the preconditioner.
Definition preconditioners.hh:576
\n+
const real_field_type _w
The relaxation factor to use.
Definition preconditioners.hh:679
\n+
const M & _A_
The matrix we operate on.
Definition preconditioners.hh:677
\n+
SeqDILU(const std::shared_ptr< const AssembledLinearOperator< M, X, Y > > &A, const ParameterTree &configuration)
Constructor.
Definition preconditioners.hh:612
\n+
Simd::Scalar< field_type > scalar_field_type
scalar type underlying the field_type
Definition preconditioners.hh:579
\n+
virtual void post(X &x)
Clean up.
Definition preconditioners.hh:664
\n+
typename FieldTraits< scalar_field_type >::real_type real_field_type
real scalar type underlying the field_type
Definition preconditioners.hh:581
\n+
M matrix_type
The matrix type the preconditioner is for.
Definition preconditioners.hh:567
\n+
X domain_type
The domain type of the preconditioner.
Definition preconditioners.hh:571
\n+
typename matrix_type::block_type block_type
block type of matrix
Definition preconditioners.hh:569
\n+
virtual void apply(X &v, const Y &d)
Apply the preconditioner.
Definition preconditioners.hh:648
\n+
virtual void pre(X &x, Y &b)
Prepare the preconditioner.
Definition preconditioners.hh:639
\n+
SeqDILU(const M &A, real_field_type w)
Constructor.
Definition preconditioners.hh:589
\n+
virtual SolverCategory::Category category() const
Category of the preconditioner (see SolverCategory::Category)
Definition preconditioners.hh:669
\n+
Y range_type
The range type of the preconditioner.
Definition preconditioners.hh:573
\n+
SeqDILU(const M &A, const ParameterTree &config)
Constructor.
Definition preconditioners.hh:629
\n+
std::vector< block_type > Dinv_
Definition preconditioners.hh:675
\n+
Sequential ILU preconditioner.
Definition preconditioners.hh:697
\n+
virtual void post(X &x)
Clean up.
Definition preconditioners.hh:843
\n+
SeqILU(const M &A, int n, real_field_type w, const bool resort=false)
Constructor.
Definition preconditioners.hh:777
\n+
virtual void pre(X &x, Y &b)
Prepare the preconditioner.
Definition preconditioners.hh:813
\n+
virtual void apply(X &v, const Y &d)
Apply the preconditioner.
Definition preconditioners.hh:821
\n+
ILU::CRS< block_type, typename M::allocator_type > CRS
type of ILU storage
Definition preconditioners.hh:717
\n+
Y range_type
The range type of the preconditioner.
Definition preconditioners.hh:706
\n+
CRS lower_
The ILU(n) decomposition of the matrix. As storage a CRS structure is used.
Definition preconditioners.hh:857
\n+
const bool wNotIdentity_
true if w != 1.0
Definition preconditioners.hh:864
\n+
SeqILU(const M &A, const ParameterTree &config)
Constructor.
Definition preconditioners.hh:763
\n+
std::remove_const< M >::type matrix_type
The matrix type the preconditioner is for.
Definition preconditioners.hh:700
\n+
matrix_type::block_type block_type
block type of matrix
Definition preconditioners.hh:702
\n+
FieldTraits< scalar_field_type >::real_type real_field_type
real scalar type underlying the field_type
Definition preconditioners.hh:714
\n+
X::field_type field_type
The field type of the preconditioner.
Definition preconditioners.hh:709
\n+
virtual SolverCategory::Category category() const
Category of the preconditioner (see SolverCategory::Category)
Definition preconditioners.hh:847
\n+
SeqILU(const M &A, real_field_type w, const bool resort=false)
Constructor.
Definition preconditioners.hh:726
\n+
const real_field_type w_
The relaxation factor to use.
Definition preconditioners.hh:862
\n+
SeqILU(const std::shared_ptr< const AssembledLinearOperator< M, X, Y > > &A, const ParameterTree &configuration)
Constructor.
Definition preconditioners.hh:745
\n+
X domain_type
The domain type of the preconditioner.
Definition preconditioners.hh:704
\n+
std::vector< block_type, typename matrix_type::allocator_type > inv_
Definition preconditioners.hh:859
\n+
Simd::Scalar< field_type > scalar_field_type
scalar type underlying the field_type
Definition preconditioners.hh:712
\n+
std::unique_ptr< matrix_type > ILU_
The ILU(n) decomposition of the matrix. As storage a BCRSMatrix is used.
Definition preconditioners.hh:854
\n+
CRS upper_
Definition preconditioners.hh:858
\n+
Richardson preconditioner.
Definition preconditioners.hh:878
\n+
X::field_type field_type
The field type of the preconditioner.
Definition preconditioners.hh:885
\n+
virtual SolverCategory::Category category() const
Category of the preconditioner (see SolverCategory::Category)
Definition preconditioners.hh:943
\n+
Y range_type
The range type of the preconditioner.
Definition preconditioners.hh:883
\n+
virtual void pre(X &x, Y &b)
Prepare the preconditioner.
Definition preconditioners.hh:920
\n+
Richardson(real_field_type w=1.0)
Constructor.
Definition preconditioners.hh:896
\n+
virtual void post(X &x)
Clean up.
Definition preconditioners.hh:939
\n+
FieldTraits< scalar_field_type >::real_type real_field_type
real scalar type underlying the field_type
Definition preconditioners.hh:889
\n+
Simd::Scalar< field_type > scalar_field_type
scalar type underlying the field_type
Definition preconditioners.hh:887
\n+
Richardson(const ParameterTree &configuration)
Constructor.
Definition preconditioners.hh:911
\n+
X domain_type
The domain type of the preconditioner.
Definition preconditioners.hh:881
\n+
virtual void apply(X &v, const Y &d)
Apply the precondioner.
Definition preconditioners.hh:928
\n+
sequential ILDL preconditioner
Definition preconditioners.hh:972
\n+
SeqILDL(const matrix_type &A, const ParameterTree &config)
Constructor.
Definition preconditioners.hh:1018
\n+
SeqILDL(const matrix_type &A, real_field_type relax=real_field_type(1))
constructor
Definition preconditioners.hh:1030
\n+
X domain_type
domain type of the preconditioner
Definition preconditioners.hh:980
\n+
void post(X &x) override
Clean up.
Definition preconditioners.hh:1081
\n+
Y range_type
range type of the preconditioner
Definition preconditioners.hh:982
\n+
std::remove_const_t< M > matrix_type
type of matrix the preconditioner is for
Definition preconditioners.hh:978
\n+
void apply(X &v, const Y &d) override
Apply one step of the preconditioner to the system A(v)=d.
Definition preconditioners.hh:1074
\n+
FieldTraits< scalar_field_type >::real_type real_field_type
real scalar type underlying the field_type
Definition preconditioners.hh:988
\n+
SeqILDL(const std::shared_ptr< const AssembledLinearOperator< M, X, Y > > &A, const ParameterTree &configuration)
Constructor.
Definition preconditioners.hh:1002
\n+
void pre(X &x, Y &b) override
Prepare the preconditioner.
Definition preconditioners.hh:1070
\n+
Simd::Scalar< field_type > scalar_field_type
scalar type underlying the field_type
Definition preconditioners.hh:986
\n+
X::field_type field_type
field type of the preconditioner
Definition preconditioners.hh:984
\n+
SolverCategory::Category category() const override
Category of the preconditioner (see SolverCategory::Category)
Definition preconditioners.hh:1085
\n+
Statistics about the application of an inverse operator.
Definition solver.hh:50
\n+
Abstract base class for all solvers.
Definition solver.hh:101
\n+
Category
Definition solvercategory.hh:23
\n+
@ sequential
Category for sequential solvers.
Definition solvercategory.hh:25
\n+
static Category category(const OP &op, decltype(op.category()) *=nullptr)
Helperfunction to extract the solver category either from an enum, or from the newly introduced virtu...
Definition solvercategory.hh:34
\n
\n \n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,125 +1,1171 @@\n dune-istl\u00a02.10\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bi_\bs_\bt_\bl\n-bccsmatrix.hh\n+preconditioners.hh\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bd_\bo_\bc_\bu_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n 1// SPDX-FileCopyrightText: Copyright \u00c2\u00a9 DUNE Project contributors, see file\n LICENSE.md in module root\n 2// SPDX-License-Identifier: LicenseRef-GPL-2.0-only-with-DUNE-exception\n 3// -*- tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 2 -*-\n 4// vi: set et ts=4 sw=2 sts=2:\n-5#ifndef DUNE_ISTL_BCCSMATRIX_HH\n-6#define DUNE_ISTL_BCCSMATRIX_HH\n+5#ifndef DUNE_ISTL_PRECONDITIONERS_HH\n+6#define DUNE_ISTL_PRECONDITIONERS_HH\n 7\n-8#include
\n-9#include \n-10#include \n-11\n-_\b1_\b2namespace Dune::ISTL::Impl\n-13{\n-27 template::size_type>\n-28 class BCCSMatrix\n-29 {\n-30 public:\n-31 using Index = I;\n-32 using size_type = std::size_t;\n-33\n-36 BCCSMatrix()\n-37 : N_(0), M_(0), Nnz_(0), values(0), rowindex(0), colstart(0)\n-38 {}\n-39\n-41 ~BCCSMatrix()\n-42 {\n-43 if(N_+M_+Nnz_!=0)\n-44 free();\n-45 }\n-46\n-48 void setSize(size_type rows, size_type columns)\n-49 {\n-50 N_ = rows;\n-51 M_ = columns;\n-52 }\n-53\n-58 size_type N() const\n-59 {\n-60 return N_;\n-61 }\n-62\n-64 size_type nonzeroes() const\n-65 {\n-66 return Nnz_;\n-67 }\n-68\n-73 size_type M() const\n-74 {\n-75 return M_;\n-76 }\n-77\n-84 B* getValues() const\n-85 {\n-86 return values;\n-87 }\n-88\n-95 Index* getRowIndex() const\n-96 {\n-97 return rowindex;\n-98 }\n-99\n-106 Index* getColStart() const\n-107 {\n-108 return colstart;\n-109 }\n-110\n-112 BCCSMatrix& operator=(const BCCSMatrix& _\bm_\ba_\bt)\n-113 {\n-114 if(N_+M_+Nnz_!=0)\n-115 free();\n-116 N_=_\bm_\ba_\bt.N_;\n-117 M_=_\bm_\ba_\bt.M_;\n-118 Nnz_= _\bm_\ba_\bt.Nnz_;\n-119 if(M_>0) {\n-120 colstart=new size_type[M_+1];\n-121 for(size_type i=0; i<=M_; ++i)\n-122 colstart[i]=_\bm_\ba_\bt.colstart[i];\n-123 }\n+8#include \n+9#include \n+10#include \n+11#include \n+12#include \n+13#include \n+14\n+15#include \n+16#include \n+17\n+18#include <_\bd_\bu_\bn_\be_\b/_\bi_\bs_\bt_\bl_\b/_\bs_\bo_\bl_\bv_\be_\br_\br_\be_\bg_\bi_\bs_\bt_\br_\by_\b._\bh_\bh>\n+19#include \"_\bp_\br_\be_\bc_\bo_\bn_\bd_\bi_\bt_\bi_\bo_\bn_\be_\br_\b._\bh_\bh\"\n+20#include \"_\bs_\bo_\bl_\bv_\be_\br_\b._\bh_\bh\"\n+21#include \"_\bs_\bo_\bl_\bv_\be_\br_\bc_\ba_\bt_\be_\bg_\bo_\br_\by_\b._\bh_\bh\"\n+22#include \"_\bi_\bs_\bt_\bl_\be_\bx_\bc_\be_\bp_\bt_\bi_\bo_\bn_\b._\bh_\bh\"\n+23#include \"_\bm_\ba_\bt_\br_\bi_\bx_\bu_\bt_\bi_\bl_\bs_\b._\bh_\bh\"\n+24#include \"_\bg_\bs_\be_\bt_\bc_\b._\bh_\bh\"\n+25#include \"_\bd_\bi_\bl_\bu_\b._\bh_\bh\"\n+26#include \"_\bi_\bl_\bd_\bl_\b._\bh_\bh\"\n+27#include \"_\bi_\bl_\bu_\b._\bh_\bh\"\n+28\n+29\n+30namespace _\bD_\bu_\bn_\be {\n+73 template\n+_\b7_\b4 class _\bI_\bn_\bv_\be_\br_\bs_\be_\bO_\bp_\be_\br_\ba_\bt_\bo_\br_\b2_\bP_\br_\be_\bc_\bo_\bn_\bd_\bi_\bt_\bi_\bo_\bn_\be_\br :\n+75 public _\bP_\br_\be_\bc_\bo_\bn_\bd_\bi_\bt_\bi_\bo_\bn_\be_\br\n+76 {\n+77 public:\n+_\b7_\b9 typedef typename O::domain_type _\bd_\bo_\bm_\ba_\bi_\bn_\b__\bt_\by_\bp_\be;\n+_\b8_\b1 typedef typename O::range_type _\br_\ba_\bn_\bg_\be_\b__\bt_\by_\bp_\be;\n+_\b8_\b3 typedef typename range_type::field_type _\bf_\bi_\be_\bl_\bd_\b__\bt_\by_\bp_\be;\n+_\b8_\b5 typedef Simd::Scalar _\bs_\bc_\ba_\bl_\ba_\br_\b__\bf_\bi_\be_\bl_\bd_\b__\bt_\by_\bp_\be;\n+_\b8_\b7 typedef typename FieldTraits::real_type _\br_\be_\ba_\bl_\b__\bf_\bi_\be_\bl_\bd_\b__\bt_\by_\bp_\be;\n+_\b8_\b9 typedef O _\bI_\bn_\bv_\be_\br_\bs_\be_\bO_\bp_\be_\br_\ba_\bt_\bo_\br;\n+90\n+_\b9_\b5 _\bI_\bn_\bv_\be_\br_\bs_\be_\bO_\bp_\be_\br_\ba_\bt_\bo_\br_\b2_\bP_\br_\be_\bc_\bo_\bn_\bd_\bi_\bt_\bi_\bo_\bn_\be_\br(_\bI_\bn_\bv_\be_\br_\bs_\be_\bO_\bp_\be_\br_\ba_\bt_\bo_\br& inverse_operator)\n+96 : inverse_operator_(inverse_operator)\n+97 {\n+98 if(c != -1 && _\bS_\bo_\bl_\bv_\be_\br_\bC_\ba_\bt_\be_\bg_\bo_\br_\by_\b:_\b:_\bc_\ba_\bt_\be_\bg_\bo_\br_\by(inverse_operator_) != c)\n+99 DUNE_THROW(InvalidStateException, \"User-supplied solver category does not\n+match that of the given inverse operator\");\n+100 }\n+101\n+_\b1_\b0_\b2 virtual void _\bp_\br_\be(_\bd_\bo_\bm_\ba_\bi_\bn_\b__\bt_\by_\bp_\be&,_\br_\ba_\bn_\bg_\be_\b__\bt_\by_\bp_\be&)\n+103 {}\n+104\n+_\b1_\b0_\b5 virtual void _\ba_\bp_\bp_\bl_\by(_\bd_\bo_\bm_\ba_\bi_\bn_\b__\bt_\by_\bp_\be& v, const _\br_\ba_\bn_\bg_\be_\b__\bt_\by_\bp_\be& d)\n+106 {\n+107 _\bI_\bn_\bv_\be_\br_\bs_\be_\bO_\bp_\be_\br_\ba_\bt_\bo_\br_\bR_\be_\bs_\bu_\bl_\bt res;\n+108 _\br_\ba_\bn_\bg_\be_\b__\bt_\by_\bp_\be copy(d);\n+109 inverse_operator_.apply(v, copy, res);\n+110 }\n+111\n+_\b1_\b1_\b2 virtual void _\bp_\bo_\bs_\bt(_\bd_\bo_\bm_\ba_\bi_\bn_\b__\bt_\by_\bp_\be&)\n+113 {}\n+114\n+_\b1_\b1_\b6 virtual _\bS_\bo_\bl_\bv_\be_\br_\bC_\ba_\bt_\be_\bg_\bo_\br_\by_\b:_\b:_\bC_\ba_\bt_\be_\bg_\bo_\br_\by _\bc_\ba_\bt_\be_\bg_\bo_\br_\by() const\n+117 {\n+118 return _\bS_\bo_\bl_\bv_\be_\br_\bC_\ba_\bt_\be_\bg_\bo_\br_\by_\b:_\b:_\bc_\ba_\bt_\be_\bg_\bo_\br_\by(inverse_operator_);\n+119 }\n+120\n+121 private:\n+122 _\bI_\bn_\bv_\be_\br_\bs_\be_\bO_\bp_\be_\br_\ba_\bt_\bo_\br& inverse_operator_;\n+123 };\n 124\n-125 if(Nnz_>0) {\n-126 values = new B[Nnz_];\n-127 rowindex = new size_type[Nnz_];\n+125 //=====================================================================\n+126 // Implementation of this interface for sequential ISTL-preconditioners\n+127 //=====================================================================\n 128\n-129 for(size_type i=0; i\n+_\b1_\b4_\b2 class _\bS_\be_\bq_\bS_\bS_\bO_\bR : public _\bP_\br_\be_\bc_\bo_\bn_\bd_\bi_\bt_\bi_\bo_\bn_\be_\br {\n+143 public:\n+_\b1_\b4_\b5 typedef M _\bm_\ba_\bt_\br_\bi_\bx_\b__\bt_\by_\bp_\be;\n+_\b1_\b4_\b7 typedef X _\bd_\bo_\bm_\ba_\bi_\bn_\b__\bt_\by_\bp_\be;\n+_\b1_\b4_\b9 typedef Y _\br_\ba_\bn_\bg_\be_\b__\bt_\by_\bp_\be;\n+_\b1_\b5_\b1 typedef typename X::field_type _\bf_\bi_\be_\bl_\bd_\b__\bt_\by_\bp_\be;\n+_\b1_\b5_\b3 typedef Simd::Scalar _\bs_\bc_\ba_\bl_\ba_\br_\b__\bf_\bi_\be_\bl_\bd_\b__\bt_\by_\bp_\be;\n+_\b1_\b5_\b5 typedef typename FieldTraits::real_type _\br_\be_\ba_\bl_\b__\bf_\bi_\be_\bl_\bd_\b__\bt_\by_\bp_\be;\n+156\n+_\b1_\b6_\b4 _\bS_\be_\bq_\bS_\bS_\bO_\bR (const M& A, int n, _\br_\be_\ba_\bl_\b__\bf_\bi_\be_\bl_\bd_\b__\bt_\by_\bp_\be w)\n+165 : _A_(A), _n(n), _w(w)\n+166 {\n+167 _\bC_\bh_\be_\bc_\bk_\bI_\bf_\bD_\bi_\ba_\bg_\bo_\bn_\ba_\bl_\bP_\br_\be_\bs_\be_\bn_\bt_\b<_\bM_\b,_\bl_\b>_\b:_\b:_\bc_\bh_\be_\bc_\bk(_A_);\n+168 }\n+169\n+_\b1_\b8_\b3 _\bS_\be_\bq_\bS_\bS_\bO_\bR (const std::shared_ptr>& A,\n+const ParameterTree& configuration)\n+184 : _\bS_\be_\bq_\bS_\bS_\bO_\bR(A->getmat(), configuration)\n+185 {}\n+186\n+_\b2_\b0_\b0 _\bS_\be_\bq_\bS_\bS_\bO_\bR (const M& A, const ParameterTree& configuration)\n+201 : _\bS_\be_\bq_\bS_\bS_\bO_\bR(A, configuration._\bg_\be_\bt(\"iterations\",1),\n+configuration._\bg_\be_\bt<_\br_\be_\ba_\bl_\b__\bf_\bi_\be_\bl_\bd_\b__\bt_\by_\bp_\be>(\"relaxation\",1.0))\n+202 {}\n+203\n+_\b2_\b0_\b9 virtual void _\bp_\br_\be ([[maybe_unused]] X& x, [[maybe_unused]] Y& b)\n+210 {}\n+211\n+_\b2_\b1_\b7 virtual void _\ba_\bp_\bp_\bl_\by (X& v, const Y& d)\n+218 {\n+219 for (int i=0; i<_n; i++) {\n+220 _\bb_\bs_\bo_\br_\bf(_A_,v,d,_w,_\bB_\bL_\b<_\bl_\b>());\n+221 _\bb_\bs_\bo_\br_\bb(_A_,v,d,_w,_\bB_\bL_\b<_\bl_\b>());\n+222 }\n+223 }\n+224\n+_\b2_\b3_\b0 virtual void _\bp_\bo_\bs_\bt ([[maybe_unused]] X& x)\n+231 {}\n+232\n+_\b2_\b3_\b4 virtual _\bS_\bo_\bl_\bv_\be_\br_\bC_\ba_\bt_\be_\bg_\bo_\br_\by_\b:_\b:_\bC_\ba_\bt_\be_\bg_\bo_\br_\by _\bc_\ba_\bt_\be_\bg_\bo_\br_\by() const\n+235 {\n+236 return _\bS_\bo_\bl_\bv_\be_\br_\bC_\ba_\bt_\be_\bg_\bo_\br_\by_\b:_\b:_\bs_\be_\bq_\bu_\be_\bn_\bt_\bi_\ba_\bl;\n+237 }\n+238\n+239 private:\n+241 const M& _A_;\n+243 int _n;\n+245 _\br_\be_\ba_\bl_\b__\bf_\bi_\be_\bl_\bd_\b__\bt_\by_\bp_\be _w;\n+246 };\n+_\b2_\b4_\b7 _\bD_\bU_\bN_\bE_\b__\bR_\bE_\bG_\bI_\bS_\bT_\bE_\bR_\b__\bP_\bR_\bE_\bC_\bO_\bN_\bD_\bI_\bT_\bI_\bO_\bN_\bE_\bR(\"ssor\",\n+defaultPreconditionerBlockLevelCreator());\n+248\n+249\n+261 template\n+_\b2_\b6_\b2 class _\bS_\be_\bq_\bS_\bO_\bR : public _\bP_\br_\be_\bc_\bo_\bn_\bd_\bi_\bt_\bi_\bo_\bn_\be_\br {\n+263 public:\n+_\b2_\b6_\b5 typedef M _\bm_\ba_\bt_\br_\bi_\bx_\b__\bt_\by_\bp_\be;\n+_\b2_\b6_\b7 typedef X _\bd_\bo_\bm_\ba_\bi_\bn_\b__\bt_\by_\bp_\be;\n+_\b2_\b6_\b9 typedef Y _\br_\ba_\bn_\bg_\be_\b__\bt_\by_\bp_\be;\n+_\b2_\b7_\b1 typedef typename X::field_type _\bf_\bi_\be_\bl_\bd_\b__\bt_\by_\bp_\be;\n+_\b2_\b7_\b3 typedef Simd::Scalar _\bs_\bc_\ba_\bl_\ba_\br_\b__\bf_\bi_\be_\bl_\bd_\b__\bt_\by_\bp_\be;\n+_\b2_\b7_\b5 typedef typename FieldTraits::real_type _\br_\be_\ba_\bl_\b__\bf_\bi_\be_\bl_\bd_\b__\bt_\by_\bp_\be;\n+276\n+_\b2_\b8_\b4 _\bS_\be_\bq_\bS_\bO_\bR (const M& A, int n, _\br_\be_\ba_\bl_\b__\bf_\bi_\be_\bl_\bd_\b__\bt_\by_\bp_\be w)\n+285 : _A_(A), _n(n), _w(w)\n+286 {\n+287 _\bC_\bh_\be_\bc_\bk_\bI_\bf_\bD_\bi_\ba_\bg_\bo_\bn_\ba_\bl_\bP_\br_\be_\bs_\be_\bn_\bt_\b<_\bM_\b,_\bl_\b>_\b:_\b:_\bc_\bh_\be_\bc_\bk(_A_);\n+288 }\n+289\n+_\b3_\b0_\b3 _\bS_\be_\bq_\bS_\bO_\bR (const std::shared_ptr>& A,\n+const ParameterTree& configuration)\n+304 : _\bS_\be_\bq_\bS_\bO_\bR(A->getmat(), configuration)\n+305 {}\n+306\n+_\b3_\b2_\b0 _\bS_\be_\bq_\bS_\bO_\bR (const M& A, const ParameterTree& configuration)\n+321 : _\bS_\be_\bq_\bS_\bO_\bR(A, configuration._\bg_\be_\bt(\"iterations\",1),\n+configuration._\bg_\be_\bt<_\br_\be_\ba_\bl_\b__\bf_\bi_\be_\bl_\bd_\b__\bt_\by_\bp_\be>(\"relaxation\",1.0))\n+322 {}\n+323\n+_\b3_\b2_\b9 virtual void _\bp_\br_\be ([[maybe_unused]] X& x, [[maybe_unused]] Y& b)\n+330 {}\n+331\n+_\b3_\b3_\b7 virtual void _\ba_\bp_\bp_\bl_\by (X& v, const Y& d)\n+338 {\n+339 this->template apply(v,d);\n+340 }\n+341\n+350 template\n+_\b3_\b5_\b1 void _\ba_\bp_\bp_\bl_\by(X& v, const Y& d)\n+352 {\n+353 if(forward)\n+354 for (int i=0; i<_n; i++) {\n+355 _\bb_\bs_\bo_\br_\bf(_A_,v,d,_w,_\bB_\bL_\b<_\bl_\b>());\n+356 }\n+357 else\n+358 for (int i=0; i<_n; i++) {\n+359 _\bb_\bs_\bo_\br_\bb(_A_,v,d,_w,_\bB_\bL_\b<_\bl_\b>());\n+360 }\n+361 }\n+362\n+_\b3_\b6_\b8 virtual void _\bp_\bo_\bs_\bt ([[maybe_unused]] X& x)\n+369 {}\n+370\n+_\b3_\b7_\b2 virtual _\bS_\bo_\bl_\bv_\be_\br_\bC_\ba_\bt_\be_\bg_\bo_\br_\by_\b:_\b:_\bC_\ba_\bt_\be_\bg_\bo_\br_\by _\bc_\ba_\bt_\be_\bg_\bo_\br_\by() const\n+373 {\n+374 return _\bS_\bo_\bl_\bv_\be_\br_\bC_\ba_\bt_\be_\bg_\bo_\br_\by_\b:_\b:_\bs_\be_\bq_\bu_\be_\bn_\bt_\bi_\ba_\bl;\n+375 }\n+376\n+377 private:\n+379 const M& _A_;\n+381 int _n;\n+383 _\br_\be_\ba_\bl_\b__\bf_\bi_\be_\bl_\bd_\b__\bt_\by_\bp_\be _w;\n+384 };\n+_\b3_\b8_\b5 _\bD_\bU_\bN_\bE_\b__\bR_\bE_\bG_\bI_\bS_\bT_\bE_\bR_\b__\bP_\bR_\bE_\bC_\bO_\bN_\bD_\bI_\bT_\bI_\bO_\bN_\bE_\bR(\"sor\",\n+defaultPreconditionerBlockLevelCreator());\n+386\n+387\n+398 template\n+_\b3_\b9_\b9 using _\bS_\be_\bq_\bG_\bS = _\bS_\be_\bq_\bS_\bO_\bR_\b<_\bM_\b,_\bX_\b,_\bY_\b,_\bl_\b>;\n+_\b4_\b0_\b0 _\bD_\bU_\bN_\bE_\b__\bR_\bE_\bG_\bI_\bS_\bT_\bE_\bR_\b__\bP_\bR_\bE_\bC_\bO_\bN_\bD_\bI_\bT_\bI_\bO_\bN_\bE_\bR(\"gs\",\n+defaultPreconditionerBlockLevelCreator());\n+401\n+412 template\n+_\b4_\b1_\b3 class _\bS_\be_\bq_\bJ_\ba_\bc : public _\bP_\br_\be_\bc_\bo_\bn_\bd_\bi_\bt_\bi_\bo_\bn_\be_\br_\b<_\bX_\b,_\bY_\b> {\n+414 public:\n+_\b4_\b1_\b6 typedef M _\bm_\ba_\bt_\br_\bi_\bx_\b__\bt_\by_\bp_\be;\n+_\b4_\b1_\b8 typedef X _\bd_\bo_\bm_\ba_\bi_\bn_\b__\bt_\by_\bp_\be;\n+_\b4_\b2_\b0 typedef Y _\br_\ba_\bn_\bg_\be_\b__\bt_\by_\bp_\be;\n+_\b4_\b2_\b2 typedef typename X::field_type _\bf_\bi_\be_\bl_\bd_\b__\bt_\by_\bp_\be;\n+_\b4_\b2_\b4 typedef Simd::Scalar _\bs_\bc_\ba_\bl_\ba_\br_\b__\bf_\bi_\be_\bl_\bd_\b__\bt_\by_\bp_\be;\n+_\b4_\b2_\b6 typedef typename FieldTraits::real_type _\br_\be_\ba_\bl_\b__\bf_\bi_\be_\bl_\bd_\b__\bt_\by_\bp_\be;\n+427\n+_\b4_\b3_\b5 _\bS_\be_\bq_\bJ_\ba_\bc (const M& A, int n, _\br_\be_\ba_\bl_\b__\bf_\bi_\be_\bl_\bd_\b__\bt_\by_\bp_\be w)\n+436 : _A_(A), _n(n), _w(w)\n+437 {\n+438 _\bC_\bh_\be_\bc_\bk_\bI_\bf_\bD_\bi_\ba_\bg_\bo_\bn_\ba_\bl_\bP_\br_\be_\bs_\be_\bn_\bt_\b<_\bM_\b,_\bl_\b>_\b:_\b:_\bc_\bh_\be_\bc_\bk(_A_);\n+439 }\n+440\n+_\b4_\b5_\b4 _\bS_\be_\bq_\bJ_\ba_\bc (const std::shared_ptr>& A,\n+const ParameterTree& configuration)\n+455 : _\bS_\be_\bq_\bJ_\ba_\bc(A->getmat(), configuration)\n+456 {}\n+457\n+_\b4_\b7_\b1 _\bS_\be_\bq_\bJ_\ba_\bc (const M& A, const ParameterTree& configuration)\n+472 : _\bS_\be_\bq_\bJ_\ba_\bc(A, configuration._\bg_\be_\bt(\"iterations\",1),\n+configuration._\bg_\be_\bt<_\br_\be_\ba_\bl_\b__\bf_\bi_\be_\bl_\bd_\b__\bt_\by_\bp_\be>(\"relaxation\",1.0))\n+473 {}\n+474\n+_\b4_\b8_\b0 virtual void _\bp_\br_\be ([[maybe_unused]] X& x, [[maybe_unused]] Y& b)\n+481 {}\n+482\n+_\b4_\b8_\b8 virtual void _\ba_\bp_\bp_\bl_\by (X& v, const Y& d)\n+489 {\n+490 for (int i=0; i<_n; i++) {\n+491 _\bd_\bb_\bj_\ba_\bc(_A_,v,d,_w,_\bB_\bL_\b<_\bl_\b>());\n+492 }\n+493 }\n+494\n+_\b5_\b0_\b0 virtual void _\bp_\bo_\bs_\bt ([[maybe_unused]] X& x)\n+501 {}\n+502\n+_\b5_\b0_\b4 virtual _\bS_\bo_\bl_\bv_\be_\br_\bC_\ba_\bt_\be_\bg_\bo_\br_\by_\b:_\b:_\bC_\ba_\bt_\be_\bg_\bo_\br_\by _\bc_\ba_\bt_\be_\bg_\bo_\br_\by() const\n+505 {\n+506 return _\bS_\bo_\bl_\bv_\be_\br_\bC_\ba_\bt_\be_\bg_\bo_\br_\by_\b:_\b:_\bs_\be_\bq_\bu_\be_\bn_\bt_\bi_\ba_\bl;\n+507 }\n+508\n+509 private:\n+511 const M& _A_;\n+513 int _n;\n+515 real_field_type _w;\n+516 };\n+_\b5_\b1_\b7 _\bD_\bU_\bN_\bE_\b__\bR_\bE_\bG_\bI_\bS_\bT_\bE_\bR_\b__\bP_\bR_\bE_\bC_\bO_\bN_\bD_\bI_\bT_\bI_\bO_\bN_\bE_\bR(\"jac\",\n+defaultPreconditionerBlockLevelCreator());\n+518\n+562 template \n+_\b5_\b6_\b3 class _\bS_\be_\bq_\bD_\bI_\bL_\bU : public _\bP_\br_\be_\bc_\bo_\bn_\bd_\bi_\bt_\bi_\bo_\bn_\be_\br_\b<_\bX_\b,_\b _\bY_\b>\n+564 {\n+565 public:\n+_\b5_\b6_\b7 using _\bm_\ba_\bt_\br_\bi_\bx_\b__\bt_\by_\bp_\be = M;\n+_\b5_\b6_\b9 using _\bb_\bl_\bo_\bc_\bk_\b__\bt_\by_\bp_\be = typename matrix_type::block_type;\n+_\b5_\b7_\b1 using _\bd_\bo_\bm_\ba_\bi_\bn_\b__\bt_\by_\bp_\be = X;\n+_\b5_\b7_\b3 using _\br_\ba_\bn_\bg_\be_\b__\bt_\by_\bp_\be = Y;\n+574\n+_\b5_\b7_\b6 using _\bf_\bi_\be_\bl_\bd_\b__\bt_\by_\bp_\be = typename X::field_type;\n+577\n+_\b5_\b7_\b9 using _\bs_\bc_\ba_\bl_\ba_\br_\b__\bf_\bi_\be_\bl_\bd_\b__\bt_\by_\bp_\be = Simd::Scalar;\n+_\b5_\b8_\b1 using _\br_\be_\ba_\bl_\b__\bf_\bi_\be_\bl_\bd_\b__\bt_\by_\bp_\be = typename FieldTraits::real_type;\n+582\n+_\b5_\b8_\b9 _\bS_\be_\bq_\bD_\bI_\bL_\bU(const M &A, _\br_\be_\ba_\bl_\b__\bf_\bi_\be_\bl_\bd_\b__\bt_\by_\bp_\be w)\n+590 : _A_(A),\n+591 _w(w),\n+592 wNotIdentity_([w]\n+593 {using std::abs; return abs(w - _\br_\be_\ba_\bl_\b__\bf_\bi_\be_\bl_\bd_\b__\bt_\by_\bp_\be(1)) > 1e-15; }())\n+594 {\n+595 Dinv_.resize(_A_.N());\n+596 _\bC_\bh_\be_\bc_\bk_\bI_\bf_\bD_\bi_\ba_\bg_\bo_\bn_\ba_\bl_\bP_\br_\be_\bs_\be_\bn_\bt_\b<_\bM_\b,_\b _\bl_\b>_\b:_\b:_\bc_\bh_\be_\bc_\bk(_A_);\n+597 _\bD_\bI_\bL_\bU_\b:_\b:_\bb_\bl_\bo_\bc_\bk_\bD_\bI_\bL_\bU_\bD_\be_\bc_\bo_\bm_\bp_\bo_\bs_\bi_\bt_\bi_\bo_\bn(_A_, Dinv_);\n+598 }\n+599\n+_\b6_\b1_\b2 _\bS_\be_\bq_\bD_\bI_\bL_\bU(const std::shared_ptr> &A,\n+const ParameterTree &configuration)\n+613 : _\bS_\be_\bq_\bD_\bI_\bL_\bU(A->getmat(), configuration)\n+614 {\n+615 }\n+616\n+_\b6_\b2_\b9 _\bS_\be_\bq_\bD_\bI_\bL_\bU(const M &A, const ParameterTree &config)\n+630 : _\bS_\be_\bq_\bD_\bI_\bL_\bU(A, config._\bg_\be_\bt<_\br_\be_\ba_\bl_\b__\bf_\bi_\be_\bl_\bd_\b__\bt_\by_\bp_\be>(\"relaxation\", 1.0))\n+631 {\n+632 }\n+633\n+_\b6_\b3_\b9 virtual void _\bp_\br_\be([[maybe_unused]] X &x, [[maybe_unused]] Y &b)\n+640 {\n+641 }\n+642\n+_\b6_\b4_\b8 virtual void _\ba_\bp_\bp_\bl_\by(X &v, const Y &d)\n+649 {\n+650\n+651 _\bD_\bI_\bL_\bU_\b:_\b:_\bb_\bl_\bo_\bc_\bk_\bD_\bI_\bL_\bU_\bB_\ba_\bc_\bk_\bs_\bo_\bl_\bv_\be(_A_, Dinv_, v, d);\n+652\n+653 if (wNotIdentity_)\n+654 {\n+655 v *= _w;\n+656 }\n+657 }\n+658\n+_\b6_\b6_\b4 virtual void _\bp_\bo_\bs_\bt([[maybe_unused]] X &x)\n+665 {\n+666 }\n+667\n+_\b6_\b6_\b9 virtual _\bS_\bo_\bl_\bv_\be_\br_\bC_\ba_\bt_\be_\bg_\bo_\br_\by_\b:_\b:_\bC_\ba_\bt_\be_\bg_\bo_\br_\by _\bc_\ba_\bt_\be_\bg_\bo_\br_\by() const\n+670 {\n+671 return _\bS_\bo_\bl_\bv_\be_\br_\bC_\ba_\bt_\be_\bg_\bo_\br_\by_\b:_\b:_\bs_\be_\bq_\bu_\be_\bn_\bt_\bi_\ba_\bl;\n+672 }\n+673\n+674 protected:\n+_\b6_\b7_\b5 std::vector _\bD_\bi_\bn_\bv_\b_;\n+_\b6_\b7_\b7 const M &_\b__\bA_\b_;\n+_\b6_\b7_\b9 const _\br_\be_\ba_\bl_\b__\bf_\bi_\be_\bl_\bd_\b__\bt_\by_\bp_\be _\b__\bw;\n+_\b6_\b8_\b1 const bool _\bw_\bN_\bo_\bt_\bI_\bd_\be_\bn_\bt_\bi_\bt_\by_\b_;\n+682 };\n+_\b6_\b8_\b3 _\bD_\bU_\bN_\bE_\b__\bR_\bE_\bG_\bI_\bS_\bT_\bE_\bR_\b__\bP_\bR_\bE_\bC_\bO_\bN_\bD_\bI_\bT_\bI_\bO_\bN_\bE_\bR(\"dilu\",\n+defaultPreconditionerBlockLevelCreator());\n+684\n+696 template\n+_\b6_\b9_\b7 class _\bS_\be_\bq_\bI_\bL_\bU : public _\bP_\br_\be_\bc_\bo_\bn_\bd_\bi_\bt_\bi_\bo_\bn_\be_\br {\n+698 public:\n+_\b7_\b0_\b0 typedef typename std::remove_const::type _\bm_\ba_\bt_\br_\bi_\bx_\b__\bt_\by_\bp_\be;\n+_\b7_\b0_\b2 typedef typename matrix_type :: block_type _\bb_\bl_\bo_\bc_\bk_\b__\bt_\by_\bp_\be;\n+_\b7_\b0_\b4 typedef X _\bd_\bo_\bm_\ba_\bi_\bn_\b__\bt_\by_\bp_\be;\n+_\b7_\b0_\b6 typedef Y _\br_\ba_\bn_\bg_\be_\b__\bt_\by_\bp_\be;\n+707\n+_\b7_\b0_\b9 typedef typename X::field_type _\bf_\bi_\be_\bl_\bd_\b__\bt_\by_\bp_\be;\n+710\n+_\b7_\b1_\b2 typedef Simd::Scalar _\bs_\bc_\ba_\bl_\ba_\br_\b__\bf_\bi_\be_\bl_\bd_\b__\bt_\by_\bp_\be;\n+_\b7_\b1_\b4 typedef typename FieldTraits::real_type _\br_\be_\ba_\bl_\b__\bf_\bi_\be_\bl_\bd_\b__\bt_\by_\bp_\be;\n+715\n+_\b7_\b1_\b7 typedef typename _\bI_\bL_\bU_\b:_\b:_\bC_\bR_\bS_\b<_\b _\bb_\bl_\bo_\bc_\bk_\b__\bt_\by_\bp_\be_\b _\b,_\b _\bt_\by_\bp_\be_\bn_\ba_\bm_\be_\b _\bM_\b:_\b:_\ba_\bl_\bl_\bo_\bc_\ba_\bt_\bo_\br_\b__\bt_\by_\bp_\be_\b> _\bC_\bR_\bS;\n+718\n+_\b7_\b2_\b6 _\bS_\be_\bq_\bI_\bL_\bU (const M& A, _\br_\be_\ba_\bl_\b__\bf_\bi_\be_\bl_\bd_\b__\bt_\by_\bp_\be w, const bool resort = false )\n+727 : _\bS_\be_\bq_\bI_\bL_\bU( A, 0, w, resort ) // construct ILU(0)\n+728 {\n+729 }\n+730\n+_\b7_\b4_\b5 _\bS_\be_\bq_\bI_\bL_\bU (const std::shared_ptr>& A,\n+const ParameterTree& configuration)\n+746 : _\bS_\be_\bq_\bI_\bL_\bU(A->getmat(), configuration)\n+747 {}\n+748\n+_\b7_\b6_\b3 _\bS_\be_\bq_\bI_\bL_\bU(const M& A, const ParameterTree& config)\n+764 : _\bS_\be_\bq_\bI_\bL_\bU(A, config._\bg_\be_\bt(\"n\", 0),\n+765 config._\bg_\be_\bt<_\br_\be_\ba_\bl_\b__\bf_\bi_\be_\bl_\bd_\b__\bt_\by_\bp_\be>(\"relaxation\", 1.0),\n+766 config._\bg_\be_\bt(\"resort\", false))\n+767 {}\n+768\n+_\b7_\b7_\b7 _\bS_\be_\bq_\bI_\bL_\bU (const M& A, int n, _\br_\be_\ba_\bl_\b__\bf_\bi_\be_\bl_\bd_\b__\bt_\by_\bp_\be w, const bool resort = false )\n+778 : _\bI_\bL_\bU_\b_(),\n+779 _\bl_\bo_\bw_\be_\br_\b_(),\n+780 _\bu_\bp_\bp_\be_\br_\b_(),\n+781 _\bi_\bn_\bv_\b_(),\n+782 _\bw_\b_(w),\n+783 _\bw_\bN_\bo_\bt_\bI_\bd_\be_\bn_\bt_\bi_\bt_\by_\b_([w]{using std::abs; return abs(w - _\br_\be_\ba_\bl_\b__\bf_\bi_\be_\bl_\bd_\b__\bt_\by_\bp_\be(1)) > 1e-\n+15;}() )\n+784 {\n+785 if( n == 0 )\n+786 {\n+787 // copy A\n+788 _\bI_\bL_\bU_\b_.reset( new _\bm_\ba_\bt_\br_\bi_\bx_\b__\bt_\by_\bp_\be( A ) );\n+789 // create ILU(0) decomposition\n+790 _\bI_\bL_\bU_\b:_\b:_\bb_\bl_\bo_\bc_\bk_\bI_\bL_\bU_\b0_\bD_\be_\bc_\bo_\bm_\bp_\bo_\bs_\bi_\bt_\bi_\bo_\bn( *_\bI_\bL_\bU_\b_ );\n+791 }\n+792 else\n+793 {\n+794 // create matrix in build mode\n+795 _\bI_\bL_\bU_\b_.reset( new _\bm_\ba_\bt_\br_\bi_\bx_\b__\bt_\by_\bp_\be( A.N(), A.M(), matrix_type::row_wise) );\n+796 // create ILU(n) decomposition\n+797 _\bI_\bL_\bU_\b:_\b:_\bb_\bl_\bo_\bc_\bk_\bI_\bL_\bU_\bD_\be_\bc_\bo_\bm_\bp_\bo_\bs_\bi_\bt_\bi_\bo_\bn( A, n, *_\bI_\bL_\bU_\b_ );\n+798 }\n+799\n+800 if( resort )\n+801 {\n+802 // store ILU in simple CRS format\n+803 _\bI_\bL_\bU_\b:_\b:_\bc_\bo_\bn_\bv_\be_\br_\bt_\bT_\bo_\bC_\bR_\bS( *_\bI_\bL_\bU_\b_, _\bl_\bo_\bw_\be_\br_\b_, _\bu_\bp_\bp_\be_\br_\b_, _\bi_\bn_\bv_\b_ );\n+804 _\bI_\bL_\bU_\b_.reset();\n+805 }\n+806 }\n+807\n+_\b8_\b1_\b3 virtual void _\bp_\br_\be ([[maybe_unused]] X& x, [[maybe_unused]] Y& b)\n+814 {}\n+815\n+_\b8_\b2_\b1 virtual void _\ba_\bp_\bp_\bl_\by (X& v, const Y& d)\n+822 {\n+823 if( _\bI_\bL_\bU_\b_ )\n+824 {\n+825 _\bI_\bL_\bU_\b:_\b:_\bb_\bl_\bo_\bc_\bk_\bI_\bL_\bU_\bB_\ba_\bc_\bk_\bs_\bo_\bl_\bv_\be( *_\bI_\bL_\bU_\b_, v, d);\n+826 }\n+827 else\n+828 {\n+829 _\bI_\bL_\bU_\b:_\b:_\bb_\bl_\bo_\bc_\bk_\bI_\bL_\bU_\bB_\ba_\bc_\bk_\bs_\bo_\bl_\bv_\be(_\bl_\bo_\bw_\be_\br_\b_, _\bu_\bp_\bp_\be_\br_\b_, _\bi_\bn_\bv_\b_, v, d);\n+830 }\n+831\n+832 if( _\bw_\bN_\bo_\bt_\bI_\bd_\be_\bn_\bt_\bi_\bt_\by_\b_ )\n+833 {\n+834 v *= _\bw_\b_;\n+835 }\n+836 }\n+837\n+_\b8_\b4_\b3 virtual void _\bp_\bo_\bs_\bt ([[maybe_unused]] X& x)\n+844 {}\n+845\n+_\b8_\b4_\b7 virtual _\bS_\bo_\bl_\bv_\be_\br_\bC_\ba_\bt_\be_\bg_\bo_\br_\by_\b:_\b:_\bC_\ba_\bt_\be_\bg_\bo_\br_\by _\bc_\ba_\bt_\be_\bg_\bo_\br_\by() const\n+848 {\n+849 return _\bS_\bo_\bl_\bv_\be_\br_\bC_\ba_\bt_\be_\bg_\bo_\br_\by_\b:_\b:_\bs_\be_\bq_\bu_\be_\bn_\bt_\bi_\ba_\bl;\n+850 }\n+851\n+852 protected:\n+_\b8_\b5_\b4 std::unique_ptr< matrix_type > _\bI_\bL_\bU_\b_;\n+855\n+_\b8_\b5_\b7 _\bC_\bR_\bS _\bl_\bo_\bw_\be_\br_\b_;\n+_\b8_\b5_\b8 _\bC_\bR_\bS _\bu_\bp_\bp_\be_\br_\b_;\n+_\b8_\b5_\b9 std::vector< block_type, typename matrix_type::allocator_type > _\bi_\bn_\bv_\b_;\n+860\n+_\b8_\b6_\b2 const _\br_\be_\ba_\bl_\b__\bf_\bi_\be_\bl_\bd_\b__\bt_\by_\bp_\be _\bw_\b_;\n+_\b8_\b6_\b4 const bool _\bw_\bN_\bo_\bt_\bI_\bd_\be_\bn_\bt_\bi_\bt_\by_\b_;\n+865 };\n+_\b8_\b6_\b6 _\bD_\bU_\bN_\bE_\b__\bR_\bE_\bG_\bI_\bS_\bT_\bE_\bR_\b__\bP_\bR_\bE_\bC_\bO_\bN_\bD_\bI_\bT_\bI_\bO_\bN_\bE_\bR(\"ilu\",\n+defaultPreconditionerBlockLevelCreator());\n+867\n+868\n+877 template\n+_\b8_\b7_\b8 class _\bR_\bi_\bc_\bh_\ba_\br_\bd_\bs_\bo_\bn : public _\bP_\br_\be_\bc_\bo_\bn_\bd_\bi_\bt_\bi_\bo_\bn_\be_\br {\n+879 public:\n+_\b8_\b8_\b1 typedef X _\bd_\bo_\bm_\ba_\bi_\bn_\b__\bt_\by_\bp_\be;\n+_\b8_\b8_\b3 typedef Y _\br_\ba_\bn_\bg_\be_\b__\bt_\by_\bp_\be;\n+_\b8_\b8_\b5 typedef typename X::field_type _\bf_\bi_\be_\bl_\bd_\b__\bt_\by_\bp_\be;\n+_\b8_\b8_\b7 typedef Simd::Scalar _\bs_\bc_\ba_\bl_\ba_\br_\b__\bf_\bi_\be_\bl_\bd_\b__\bt_\by_\bp_\be;\n+_\b8_\b8_\b9 typedef typename FieldTraits::real_type _\br_\be_\ba_\bl_\b__\bf_\bi_\be_\bl_\bd_\b__\bt_\by_\bp_\be;\n+890\n+_\b8_\b9_\b6 _\bR_\bi_\bc_\bh_\ba_\br_\bd_\bs_\bo_\bn (_\br_\be_\ba_\bl_\b__\bf_\bi_\be_\bl_\bd_\b__\bt_\by_\bp_\be w=1.0) :\n+897 _w(w)\n+898 {}\n+899\n+_\b9_\b1_\b1 _\bR_\bi_\bc_\bh_\ba_\br_\bd_\bs_\bo_\bn (const ParameterTree& configuration)\n+912 : _\bR_\bi_\bc_\bh_\ba_\br_\bd_\bs_\bo_\bn(configuration._\bg_\be_\bt<_\br_\be_\ba_\bl_\b__\bf_\bi_\be_\bl_\bd_\b__\bt_\by_\bp_\be>(\"relaxation\", 1.0))\n+913 {}\n+914\n+_\b9_\b2_\b0 virtual void _\bp_\br_\be ([[maybe_unused]] X& x, [[maybe_unused]] Y& b)\n+921 {}\n+922\n+_\b9_\b2_\b8 virtual void _\ba_\bp_\bp_\bl_\by (X& v, const Y& d)\n+929 {\n+930 v = d;\n+931 v *= _w;\n+932 }\n+933\n+_\b9_\b3_\b9 virtual void _\bp_\bo_\bs_\bt ([[maybe_unused]] X& x)\n+940 {}\n+941\n+_\b9_\b4_\b3 virtual _\bS_\bo_\bl_\bv_\be_\br_\bC_\ba_\bt_\be_\bg_\bo_\br_\by_\b:_\b:_\bC_\ba_\bt_\be_\bg_\bo_\br_\by _\bc_\ba_\bt_\be_\bg_\bo_\br_\by() const\n+944 {\n+945 return _\bS_\bo_\bl_\bv_\be_\br_\bC_\ba_\bt_\be_\bg_\bo_\br_\by_\b:_\b:_\bs_\be_\bq_\bu_\be_\bn_\bt_\bi_\ba_\bl;\n+946 }\n+947\n+948 private:\n+950 _\br_\be_\ba_\bl_\b__\bf_\bi_\be_\bl_\bd_\b__\bt_\by_\bp_\be _w;\n+951 };\n+_\b9_\b5_\b2 _\bD_\bU_\bN_\bE_\b__\bR_\bE_\bG_\bI_\bS_\bT_\bE_\bR_\b__\bP_\bR_\bE_\bC_\bO_\bN_\bD_\bI_\bT_\bI_\bO_\bN_\bE_\bR(\"richardson\", [](auto tl, const auto& /* mat\n+*/, const ParameterTree& config){\n+953 using D = typename Dune::TypeListElement<1, decltype(tl)>::type;\n+954 using R = typename Dune::TypeListElement<2, decltype(tl)>::type;\n+955 return std::make_shared>(config);\n+956 });\n+957\n+958\n+969 template< class M, class X, class Y >\n+_\b9_\b7_\b0 class _\bS_\be_\bq_\bI_\bL_\bD_\bL\n+971 : public _\bP_\br_\be_\bc_\bo_\bn_\bd_\bi_\bt_\bi_\bo_\bn_\be_\br< X, Y >\n+972 {\n+973 typedef _\bS_\be_\bq_\bI_\bL_\bD_\bL_\b<_\b _\bM_\b,_\b _\bX_\b,_\b _\bY_\b _\b> _\bT_\bh_\bi_\bs;\n+974 typedef _\bP_\br_\be_\bc_\bo_\bn_\bd_\bi_\bt_\bi_\bo_\bn_\be_\br_\b<_\b _\bX_\b,_\b _\bY_\b _\b> _\bB_\ba_\bs_\be;\n+975\n+976 public:\n+_\b9_\b7_\b8 typedef std::remove_const_t< M > _\bm_\ba_\bt_\br_\bi_\bx_\b__\bt_\by_\bp_\be;\n+_\b9_\b8_\b0 typedef X _\bd_\bo_\bm_\ba_\bi_\bn_\b__\bt_\by_\bp_\be;\n+_\b9_\b8_\b2 typedef Y _\br_\ba_\bn_\bg_\be_\b__\bt_\by_\bp_\be;\n+_\b9_\b8_\b4 typedef typename X::field_type _\bf_\bi_\be_\bl_\bd_\b__\bt_\by_\bp_\be;\n+_\b9_\b8_\b6 typedef Simd::Scalar _\bs_\bc_\ba_\bl_\ba_\br_\b__\bf_\bi_\be_\bl_\bd_\b__\bt_\by_\bp_\be;\n+_\b9_\b8_\b8 typedef typename FieldTraits::real_type _\br_\be_\ba_\bl_\b__\bf_\bi_\be_\bl_\bd_\b__\bt_\by_\bp_\be;\n+989\n+_\b1_\b0_\b0_\b2 _\bS_\be_\bq_\bI_\bL_\bD_\bL (const std::shared_ptr>& A,\n+const ParameterTree& configuration)\n+1003 : _\bS_\be_\bq_\bI_\bL_\bD_\bL(A->getmat(), configuration)\n+1004 {}\n+1005\n+_\b1_\b0_\b1_\b8 _\bS_\be_\bq_\bI_\bL_\bD_\bL(const _\bm_\ba_\bt_\br_\bi_\bx_\b__\bt_\by_\bp_\be& A, const ParameterTree& config)\n+1019 : _\bS_\be_\bq_\bI_\bL_\bD_\bL(A, config._\bg_\be_\bt<_\br_\be_\ba_\bl_\b__\bf_\bi_\be_\bl_\bd_\b__\bt_\by_\bp_\be>(\"relaxation\", 1.0))\n+1020 {}\n+1021\n+_\b1_\b0_\b3_\b0 explicit _\bS_\be_\bq_\bI_\bL_\bD_\bL ( const _\bm_\ba_\bt_\br_\bi_\bx_\b__\bt_\by_\bp_\be &A, _\br_\be_\ba_\bl_\b__\bf_\bi_\be_\bl_\bd_\b__\bt_\by_\bp_\be relax =\n+_\br_\be_\ba_\bl_\b__\bf_\bi_\be_\bl_\bd_\b__\bt_\by_\bp_\be( 1 ) )\n+1031 : decomposition_( A.N(), A.M(), _\bm_\ba_\bt_\br_\bi_\bx_\b__\bt_\by_\bp_\be::random ),\n+1032 relax_( relax )\n+1033 {\n+1034 // setup row sizes for lower triangular matrix\n+1035 for( auto i = A.begin(), iend = A.end(); i != iend; ++i )\n+1036 {\n+1037 const auto &A_i = *i;\n+1038 const auto ij = A_i.find( i.index() );\n+1039 if( ij != A_i.end() )\n+1040 decomposition_.setrowsize( i.index(), ij.offset()+1 );\n+1041 else\n+1042 DUNE_THROW( _\bI_\bS_\bT_\bL_\bE_\br_\br_\bo_\br, \"diagonal entry missing\" );\n+1043 }\n+1044 decomposition_.endrowsizes();\n+1045\n+1046 // setup row indices for lower triangular matrix\n+1047 for( auto i = A.begin(), iend = A.end(); i != iend; ++i )\n+1048 {\n+1049 const auto &A_i = *i;\n+1050 for( auto ij = A_i.begin(); ij.index() < i.index() ; ++ij )\n+1051 decomposition_.addindex( i.index(), ij.index() );\n+1052 decomposition_.addindex( i.index(), i.index() );\n+1053 }\n+1054 decomposition_.endindices();\n+1055\n+1056 // copy values of lower triangular matrix\n+1057 auto i = A.begin();\n+1058 for( auto row = decomposition_.begin(), rowend = decomposition_.end(); row\n+!= rowend; ++row, ++i )\n+1059 {\n+1060 auto ij = i->begin();\n+1061 for( auto _\bc_\bo_\bl = row->begin(), colend = row->end(); _\bc_\bo_\bl != colend; ++_\bc_\bo_\bl,\n+++ij )\n+1062 *_\bc_\bo_\bl = *ij;\n+1063 }\n+1064\n+1065 // perform ILDL decomposition\n+1066 _\bb_\bi_\bl_\bd_\bl_\b__\bd_\be_\bc_\bo_\bm_\bp_\bo_\bs_\be( decomposition_ );\n+1067 }\n+1068\n+_\b1_\b0_\b7_\b0 void _\bp_\br_\be ([[maybe_unused]] X &x, [[maybe_unused]] Y &b) override\n+1071 {}\n+1072\n+_\b1_\b0_\b7_\b4 void _\ba_\bp_\bp_\bl_\by ( X &v, const Y &d ) override\n+1075 {\n+1076 _\bb_\bi_\bl_\bd_\bl_\b__\bb_\ba_\bc_\bk_\bs_\bo_\bl_\bv_\be( decomposition_, v, d, true );\n+1077 v *= relax_;\n+1078 }\n+1079\n+_\b1_\b0_\b8_\b1 void _\bp_\bo_\bs_\bt ([[maybe_unused]] X &x) override\n+1082 {}\n+1083\n+_\b1_\b0_\b8_\b5 _\bS_\bo_\bl_\bv_\be_\br_\bC_\ba_\bt_\be_\bg_\bo_\br_\by_\b:_\b:_\bC_\ba_\bt_\be_\bg_\bo_\br_\by _\bc_\ba_\bt_\be_\bg_\bo_\br_\by () const override { return\n+_\bS_\bo_\bl_\bv_\be_\br_\bC_\ba_\bt_\be_\bg_\bo_\br_\by_\b:_\b:_\bs_\be_\bq_\bu_\be_\bn_\bt_\bi_\ba_\bl; }\n+1086\n+1087 private:\n+1088 _\bm_\ba_\bt_\br_\bi_\bx_\b__\bt_\by_\bp_\be decomposition_;\n+1089 _\br_\be_\ba_\bl_\b__\bf_\bi_\be_\bl_\bd_\b__\bt_\by_\bp_\be relax_;\n+1090 };\n+_\b1_\b0_\b9_\b1 _\bD_\bU_\bN_\bE_\b__\bR_\bE_\bG_\bI_\bS_\bT_\bE_\bR_\b__\bP_\bR_\bE_\bC_\bO_\bN_\bD_\bI_\bT_\bI_\bO_\bN_\bE_\bR(\"ildl\", defaultPreconditionerCreator());\n+1092\n+1095} // end namespace\n+1096\n+1097\n+1098#endif\n+_\bi_\bl_\bd_\bl_\b._\bh_\bh\n+Incomplete LDL decomposition.\n+_\bs_\bo_\bl_\bv_\be_\br_\br_\be_\bg_\bi_\bs_\bt_\br_\by_\b._\bh_\bh\n+_\bD_\bU_\bN_\bE_\b__\bR_\bE_\bG_\bI_\bS_\bT_\bE_\bR_\b__\bP_\bR_\bE_\bC_\bO_\bN_\bD_\bI_\bT_\bI_\bO_\bN_\bE_\bR\n+#define DUNE_REGISTER_PRECONDITIONER(name,...)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn solverregistry.hh:16\n+_\bp_\br_\be_\bc_\bo_\bn_\bd_\bi_\bt_\bi_\bo_\bn_\be_\br_\b._\bh_\bh\n+_\bi_\bl_\bu_\b._\bh_\bh\n+The incomplete LU factorization kernels.\n+_\bm_\ba_\bt_\br_\bi_\bx_\bu_\bt_\bi_\bl_\bs_\b._\bh_\bh\n+Some handy generic functions for ISTL matrices.\n+_\bg_\bs_\be_\bt_\bc_\b._\bh_\bh\n+Simple iterative methods like Jacobi, Gauss-Seidel, SOR, SSOR, etc. in a\n+generic way.\n+_\bi_\bs_\bt_\bl_\be_\bx_\bc_\be_\bp_\bt_\bi_\bo_\bn_\b._\bh_\bh\n+_\bd_\bi_\bl_\bu_\b._\bh_\bh\n+The diagonal incomplete LU factorization kernels.\n+_\bs_\bo_\bl_\bv_\be_\br_\b._\bh_\bh\n+Define general, extensible interface for inverse operators.\n+_\bs_\bo_\bl_\bv_\be_\br_\bc_\ba_\bt_\be_\bg_\bo_\br_\by_\b._\bh_\bh\n+_\bc_\bo_\bl\n+Col col\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn matrixmatrix.hh:351\n+_\bD_\bu_\bn_\be_\b:_\b:_\bb_\bs_\bo_\br_\bb\n+void bsorb(const M &A, X &x, const Y &b, const K &w)\n+SSOR step.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn gsetc.hh:646\n+_\bD_\bu_\bn_\be_\b:_\b:_\bd_\bb_\bj_\ba_\bc\n+void dbjac(const M &A, X &x, const Y &b, const K &w)\n+Jacobi step.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn gsetc.hh:658\n+_\bD_\bu_\bn_\be_\b:_\b:_\bb_\bs_\bo_\br_\bf\n+void bsorf(const M &A, X &x, const Y &b, const K &w)\n+SOR step.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn gsetc.hh:634\n+_\bD_\bu_\bn_\be\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn allocator.hh:11\n+_\bD_\bu_\bn_\be_\b:_\b:_\bb_\bi_\bl_\bd_\bl_\b__\bd_\be_\bc_\bo_\bm_\bp_\bo_\bs_\be\n+void bildl_decompose(Matrix &A)\n+compute ILDL decomposition of a symmetric matrix A\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn ildl.hh:88\n+_\bD_\bu_\bn_\be_\b:_\b:_\bg_\be_\bt\n+PropertyMapTypeSelector< Amg::VertexVisitedTag, Amg::PropertiesGraph< G, Amg::\n+VertexProperties, EP, VM, EM > >::Type get(const Amg::VertexVisitedTag &tag,\n+Amg::PropertiesGraph< G, Amg::VertexProperties, EP, VM, EM > &graph)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn dependency.hh:293\n+_\bD_\bu_\bn_\be_\b:_\b:_\bb_\bi_\bl_\bd_\bl_\b__\bb_\ba_\bc_\bk_\bs_\bo_\bl_\bv_\be\n+void bildl_backsolve(const Matrix &A, X &v, const Y &d, bool\n+isLowerTriangular=false)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn ildl.hh:149\n+_\bD_\bu_\bn_\be_\b:_\b:_\bD_\bI_\bL_\bU_\b:_\b:_\bb_\bl_\bo_\bc_\bk_\bD_\bI_\bL_\bU_\bD_\be_\bc_\bo_\bm_\bp_\bo_\bs_\bi_\bt_\bi_\bo_\bn\n+void blockDILUDecomposition(M &A, std::vector< typename M::block_type > &Dinv_)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn dilu.hh:51\n+_\bD_\bu_\bn_\be_\b:_\b:_\bD_\bI_\bL_\bU_\b:_\b:_\bb_\bl_\bo_\bc_\bk_\bD_\bI_\bL_\bU_\bB_\ba_\bc_\bk_\bs_\bo_\bl_\bv_\be\n+void blockDILUBacksolve(const M &A, const std::vector< typename M::block_type >\n+Dinv_, X &v, const Y &d)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn dilu.hh:107\n+_\bD_\bu_\bn_\be_\b:_\b:_\bI_\bL_\bU_\b:_\b:_\bc_\bo_\bn_\bv_\be_\br_\bt_\bT_\bo_\bC_\bR_\bS\n+void convertToCRS(const M &A, CRS &lower, CRS &upper, InvVector &inv)\n+convert ILU decomposition into CRS format for lower and upper triangular and\n+inverse.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn ilu.hh:307\n+_\bD_\bu_\bn_\be_\b:_\b:_\bI_\bL_\bU_\b:_\b:_\bb_\bl_\bo_\bc_\bk_\bI_\bL_\bU_\bB_\ba_\bc_\bk_\bs_\bo_\bl_\bv_\be\n+void blockILUBacksolve(const M &A, X &v, const Y &d)\n+LU backsolve with stored inverse.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn ilu.hh:94\n+_\bD_\bu_\bn_\be_\b:_\b:_\bI_\bL_\bU_\b:_\b:_\bb_\bl_\bo_\bc_\bk_\bI_\bL_\bU_\b0_\bD_\be_\bc_\bo_\bm_\bp_\bo_\bs_\bi_\bt_\bi_\bo_\bn\n+void blockILU0Decomposition(M &A)\n+compute ILU decomposition of A. A is overwritten by its decomposition\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn ilu.hh:33\n+_\bD_\bu_\bn_\be_\b:_\b:_\bI_\bL_\bU_\b:_\b:_\bb_\bl_\bo_\bc_\bk_\bI_\bL_\bU_\bD_\be_\bc_\bo_\bm_\bp_\bo_\bs_\bi_\bt_\bi_\bo_\bn\n+void blockILUDecomposition(const M &A, int n, M &ILU)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn ilu.hh:167\n+_\bD_\bu_\bn_\be_\b:_\b:_\bB_\bL\n+compile-time parameter for block recursion depth\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn gsetc.hh:45\n+_\bD_\bu_\bn_\be_\b:_\b:_\bI_\bL_\bU_\b:_\b:_\bC_\bR_\bS\n+a simple compressed row storage matrix class\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn ilu.hh:259\n+_\bD_\bu_\bn_\be_\b:_\b:_\bI_\bS_\bT_\bL_\bE_\br_\br_\bo_\br\n+derive error class from the base class in common\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn istlexception.hh:19\n+_\bD_\bu_\bn_\be_\b:_\b:_\bC_\bh_\be_\bc_\bk_\bI_\bf_\bD_\bi_\ba_\bg_\bo_\bn_\ba_\bl_\bP_\br_\be_\bs_\be_\bn_\bt_\b:_\b:_\bc_\bh_\be_\bc_\bk\n+static void check(const Matrix &mat)\n+Check whether the a matrix has diagonal values on blocklevel recursion levels.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn matrixutils.hh:53\n+_\bD_\bu_\bn_\be_\b:_\b:_\bA_\bs_\bs_\be_\bm_\bb_\bl_\be_\bd_\bL_\bi_\bn_\be_\ba_\br_\bO_\bp_\be_\br_\ba_\bt_\bo_\br\n+A linear operator exporting itself in matrix form.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn operators.hh:111\n+_\bD_\bu_\bn_\be_\b:_\b:_\bP_\br_\be_\bc_\bo_\bn_\bd_\bi_\bt_\bi_\bo_\bn_\be_\br\n+Base class for matrix free definition of preconditioners.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn preconditioner.hh:33\n+_\bD_\bu_\bn_\be_\b:_\b:_\bI_\bn_\bv_\be_\br_\bs_\be_\bO_\bp_\be_\br_\ba_\bt_\bo_\br_\b2_\bP_\br_\be_\bc_\bo_\bn_\bd_\bi_\bt_\bi_\bo_\bn_\be_\br\n+Turns an InverseOperator into a Preconditioner.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn preconditioners.hh:76\n+_\bD_\bu_\bn_\be_\b:_\b:_\bI_\bn_\bv_\be_\br_\bs_\be_\bO_\bp_\be_\br_\ba_\bt_\bo_\br_\b2_\bP_\br_\be_\bc_\bo_\bn_\bd_\bi_\bt_\bi_\bo_\bn_\be_\br_\b:_\b:_\br_\ba_\bn_\bg_\be_\b__\bt_\by_\bp_\be\n+O::range_type range_type\n+The range type of the preconditioner.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn preconditioners.hh:81\n+_\bD_\bu_\bn_\be_\b:_\b:_\bI_\bn_\bv_\be_\br_\bs_\be_\bO_\bp_\be_\br_\ba_\bt_\bo_\br_\b2_\bP_\br_\be_\bc_\bo_\bn_\bd_\bi_\bt_\bi_\bo_\bn_\be_\br_\b:_\b:_\bd_\bo_\bm_\ba_\bi_\bn_\b__\bt_\by_\bp_\be\n+O::domain_type domain_type\n+The domain type of the preconditioner.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn preconditioners.hh:79\n+_\bD_\bu_\bn_\be_\b:_\b:_\bI_\bn_\bv_\be_\br_\bs_\be_\bO_\bp_\be_\br_\ba_\bt_\bo_\br_\b2_\bP_\br_\be_\bc_\bo_\bn_\bd_\bi_\bt_\bi_\bo_\bn_\be_\br_\b:_\b:_\bp_\bo_\bs_\bt\n+virtual void post(domain_type &)\n+Clean up.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn preconditioners.hh:112\n+_\bD_\bu_\bn_\be_\b:_\b:_\bI_\bn_\bv_\be_\br_\bs_\be_\bO_\bp_\be_\br_\ba_\bt_\bo_\br_\b2_\bP_\br_\be_\bc_\bo_\bn_\bd_\bi_\bt_\bi_\bo_\bn_\be_\br_\b:_\b:_\bf_\bi_\be_\bl_\bd_\b__\bt_\by_\bp_\be\n+range_type::field_type field_type\n+The field type of the preconditioner.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn preconditioners.hh:83\n+_\bD_\bu_\bn_\be_\b:_\b:_\bI_\bn_\bv_\be_\br_\bs_\be_\bO_\bp_\be_\br_\ba_\bt_\bo_\br_\b2_\bP_\br_\be_\bc_\bo_\bn_\bd_\bi_\bt_\bi_\bo_\bn_\be_\br_\b:_\b:_\br_\be_\ba_\bl_\b__\bf_\bi_\be_\bl_\bd_\b__\bt_\by_\bp_\be\n+FieldTraits< scalar_field_type >::real_type real_field_type\n+real scalar type underlying the field_type\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn preconditioners.hh:87\n+_\bD_\bu_\bn_\be_\b:_\b:_\bI_\bn_\bv_\be_\br_\bs_\be_\bO_\bp_\be_\br_\ba_\bt_\bo_\br_\b2_\bP_\br_\be_\bc_\bo_\bn_\bd_\bi_\bt_\bi_\bo_\bn_\be_\br_\b:_\b:_\bs_\bc_\ba_\bl_\ba_\br_\b__\bf_\bi_\be_\bl_\bd_\b__\bt_\by_\bp_\be\n+Simd::Scalar< field_type > scalar_field_type\n+scalar type underlying the field_type\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn preconditioners.hh:85\n+_\bD_\bu_\bn_\be_\b:_\b:_\bI_\bn_\bv_\be_\br_\bs_\be_\bO_\bp_\be_\br_\ba_\bt_\bo_\br_\b2_\bP_\br_\be_\bc_\bo_\bn_\bd_\bi_\bt_\bi_\bo_\bn_\be_\br_\b:_\b:_\bc_\ba_\bt_\be_\bg_\bo_\br_\by\n+virtual SolverCategory::Category category() const\n+Category of the preconditioner (see SolverCategory::Category)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn preconditioners.hh:116\n+_\bD_\bu_\bn_\be_\b:_\b:_\bI_\bn_\bv_\be_\br_\bs_\be_\bO_\bp_\be_\br_\ba_\bt_\bo_\br_\b2_\bP_\br_\be_\bc_\bo_\bn_\bd_\bi_\bt_\bi_\bo_\bn_\be_\br_\b:_\b:_\bp_\br_\be\n+virtual void pre(domain_type &, range_type &)\n+Prepare the preconditioner.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn preconditioners.hh:102\n+_\bD_\bu_\bn_\be_\b:_\b:_\bI_\bn_\bv_\be_\br_\bs_\be_\bO_\bp_\be_\br_\ba_\bt_\bo_\br_\b2_\bP_\br_\be_\bc_\bo_\bn_\bd_\bi_\bt_\bi_\bo_\bn_\be_\br_\b:_\b:_\bI_\bn_\bv_\be_\br_\bs_\be_\bO_\bp_\be_\br_\ba_\bt_\bo_\br_\b2_\bP_\br_\be_\bc_\bo_\bn_\bd_\bi_\bt_\bi_\bo_\bn_\be_\br\n+InverseOperator2Preconditioner(InverseOperator &inverse_operator)\n+Construct the preconditioner from the solver.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn preconditioners.hh:95\n+_\bD_\bu_\bn_\be_\b:_\b:_\bI_\bn_\bv_\be_\br_\bs_\be_\bO_\bp_\be_\br_\ba_\bt_\bo_\br_\b2_\bP_\br_\be_\bc_\bo_\bn_\bd_\bi_\bt_\bi_\bo_\bn_\be_\br_\b:_\b:_\bI_\bn_\bv_\be_\br_\bs_\be_\bO_\bp_\be_\br_\ba_\bt_\bo_\br\n+O InverseOperator\n+type of the wrapped inverse operator\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn preconditioners.hh:89\n+_\bD_\bu_\bn_\be_\b:_\b:_\bI_\bn_\bv_\be_\br_\bs_\be_\bO_\bp_\be_\br_\ba_\bt_\bo_\br_\b2_\bP_\br_\be_\bc_\bo_\bn_\bd_\bi_\bt_\bi_\bo_\bn_\be_\br_\b:_\b:_\ba_\bp_\bp_\bl_\by\n+virtual void apply(domain_type &v, const range_type &d)\n+Apply one step of the preconditioner to the system A(v)=d.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn preconditioners.hh:105\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\be_\bq_\bS_\bS_\bO_\bR\n+Sequential SSOR preconditioner.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn preconditioners.hh:142\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\be_\bq_\bS_\bS_\bO_\bR_\b:_\b:_\bp_\bo_\bs_\bt\n+virtual void post(X &x)\n+Clean up.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn preconditioners.hh:230\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\be_\bq_\bS_\bS_\bO_\bR_\b:_\b:_\bS_\be_\bq_\bS_\bS_\bO_\bR\n+SeqSSOR(const std::shared_ptr< const AssembledLinearOperator< M, X, Y > > &A,\n+const ParameterTree &configuration)\n+Constructor.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn preconditioners.hh:183\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\be_\bq_\bS_\bS_\bO_\bR_\b:_\b:_\bS_\be_\bq_\bS_\bS_\bO_\bR\n+SeqSSOR(const M &A, const ParameterTree &configuration)\n+Constructor.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn preconditioners.hh:200\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\be_\bq_\bS_\bS_\bO_\bR_\b:_\b:_\bc_\ba_\bt_\be_\bg_\bo_\br_\by\n+virtual SolverCategory::Category category() const\n+Category of the preconditioner (see SolverCategory::Category)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn preconditioners.hh:234\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\be_\bq_\bS_\bS_\bO_\bR_\b:_\b:_\bf_\bi_\be_\bl_\bd_\b__\bt_\by_\bp_\be\n+X::field_type field_type\n+The field type of the preconditioner.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn preconditioners.hh:151\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\be_\bq_\bS_\bS_\bO_\bR_\b:_\b:_\bs_\bc_\ba_\bl_\ba_\br_\b__\bf_\bi_\be_\bl_\bd_\b__\bt_\by_\bp_\be\n+Simd::Scalar< field_type > scalar_field_type\n+scalar type underlying the field_type\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn preconditioners.hh:153\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\be_\bq_\bS_\bS_\bO_\bR_\b:_\b:_\bd_\bo_\bm_\ba_\bi_\bn_\b__\bt_\by_\bp_\be\n+X domain_type\n+The domain type of the preconditioner.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn preconditioners.hh:147\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\be_\bq_\bS_\bS_\bO_\bR_\b:_\b:_\bm_\ba_\bt_\br_\bi_\bx_\b__\bt_\by_\bp_\be\n+M matrix_type\n+The matrix type the preconditioner is for.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn preconditioners.hh:145\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\be_\bq_\bS_\bS_\bO_\bR_\b:_\b:_\ba_\bp_\bp_\bl_\by\n+virtual void apply(X &v, const Y &d)\n+Apply the preconditioner.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn preconditioners.hh:217\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\be_\bq_\bS_\bS_\bO_\bR_\b:_\b:_\bp_\br_\be\n+virtual void pre(X &x, Y &b)\n+Prepare the preconditioner.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn preconditioners.hh:209\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\be_\bq_\bS_\bS_\bO_\bR_\b:_\b:_\br_\ba_\bn_\bg_\be_\b__\bt_\by_\bp_\be\n+Y range_type\n+The range type of the preconditioner.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn preconditioners.hh:149\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\be_\bq_\bS_\bS_\bO_\bR_\b:_\b:_\br_\be_\ba_\bl_\b__\bf_\bi_\be_\bl_\bd_\b__\bt_\by_\bp_\be\n+FieldTraits< scalar_field_type >::real_type real_field_type\n+real scalar type underlying the field_type\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn preconditioners.hh:155\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\be_\bq_\bS_\bS_\bO_\bR_\b:_\b:_\bS_\be_\bq_\bS_\bS_\bO_\bR\n+SeqSSOR(const M &A, int n, real_field_type w)\n+Constructor.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn preconditioners.hh:164\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\be_\bq_\bS_\bO_\bR\n+Sequential SOR preconditioner.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn preconditioners.hh:262\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\be_\bq_\bS_\bO_\bR_\b:_\b:_\bS_\be_\bq_\bS_\bO_\bR\n+SeqSOR(const std::shared_ptr< const AssembledLinearOperator< M, X, Y > > &A,\n+const ParameterTree &configuration)\n+Constructor.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn preconditioners.hh:303\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\be_\bq_\bS_\bO_\bR_\b:_\b:_\bm_\ba_\bt_\br_\bi_\bx_\b__\bt_\by_\bp_\be\n+M matrix_type\n+The matrix type the preconditioner is for.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn preconditioners.hh:265\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\be_\bq_\bS_\bO_\bR_\b:_\b:_\br_\be_\ba_\bl_\b__\bf_\bi_\be_\bl_\bd_\b__\bt_\by_\bp_\be\n+FieldTraits< scalar_field_type >::real_type real_field_type\n+real scalar type underlying the field_type\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn preconditioners.hh:275\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\be_\bq_\bS_\bO_\bR_\b:_\b:_\ba_\bp_\bp_\bl_\by\n+void apply(X &v, const Y &d)\n+Apply the preconditioner in a special direction.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn preconditioners.hh:351\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\be_\bq_\bS_\bO_\bR_\b:_\b:_\bd_\bo_\bm_\ba_\bi_\bn_\b__\bt_\by_\bp_\be\n+X domain_type\n+The domain type of the preconditioner.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn preconditioners.hh:267\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\be_\bq_\bS_\bO_\bR_\b:_\b:_\bp_\bo_\bs_\bt\n+virtual void post(X &x)\n+Clean up.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn preconditioners.hh:368\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\be_\bq_\bS_\bO_\bR_\b:_\b:_\bp_\br_\be\n+virtual void pre(X &x, Y &b)\n+Prepare the preconditioner.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn preconditioners.hh:329\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\be_\bq_\bS_\bO_\bR_\b:_\b:_\bs_\bc_\ba_\bl_\ba_\br_\b__\bf_\bi_\be_\bl_\bd_\b__\bt_\by_\bp_\be\n+Simd::Scalar< field_type > scalar_field_type\n+scalar type underlying the field_type\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn preconditioners.hh:273\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\be_\bq_\bS_\bO_\bR_\b:_\b:_\bc_\ba_\bt_\be_\bg_\bo_\br_\by\n+virtual SolverCategory::Category category() const\n+Category of the preconditioner (see SolverCategory::Category)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn preconditioners.hh:372\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\be_\bq_\bS_\bO_\bR_\b:_\b:_\ba_\bp_\bp_\bl_\by\n+virtual void apply(X &v, const Y &d)\n+Apply the preconditioner.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn preconditioners.hh:337\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\be_\bq_\bS_\bO_\bR_\b:_\b:_\br_\ba_\bn_\bg_\be_\b__\bt_\by_\bp_\be\n+Y range_type\n+The range type of the preconditioner.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn preconditioners.hh:269\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\be_\bq_\bS_\bO_\bR_\b:_\b:_\bS_\be_\bq_\bS_\bO_\bR\n+SeqSOR(const M &A, const ParameterTree &configuration)\n+Constructor.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn preconditioners.hh:320\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\be_\bq_\bS_\bO_\bR_\b:_\b:_\bf_\bi_\be_\bl_\bd_\b__\bt_\by_\bp_\be\n+X::field_type field_type\n+The field type of the preconditioner.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn preconditioners.hh:271\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\be_\bq_\bS_\bO_\bR_\b:_\b:_\bS_\be_\bq_\bS_\bO_\bR\n+SeqSOR(const M &A, int n, real_field_type w)\n+Constructor.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn preconditioners.hh:284\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\be_\bq_\bJ_\ba_\bc\n+The sequential jacobian preconditioner.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn preconditioners.hh:413\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\be_\bq_\bJ_\ba_\bc_\b:_\b:_\bp_\bo_\bs_\bt\n+virtual void post(X &x)\n+Clean up.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn preconditioners.hh:500\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\be_\bq_\bJ_\ba_\bc_\b:_\b:_\bS_\be_\bq_\bJ_\ba_\bc\n+SeqJac(const M &A, const ParameterTree &configuration)\n+Constructor.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn preconditioners.hh:471\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\be_\bq_\bJ_\ba_\bc_\b:_\b:_\ba_\bp_\bp_\bl_\by\n+virtual void apply(X &v, const Y &d)\n+Apply the preconditioner.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn preconditioners.hh:488\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\be_\bq_\bJ_\ba_\bc_\b:_\b:_\bm_\ba_\bt_\br_\bi_\bx_\b__\bt_\by_\bp_\be\n+M matrix_type\n+The matrix type the preconditioner is for.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn preconditioners.hh:416\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\be_\bq_\bJ_\ba_\bc_\b:_\b:_\bs_\bc_\ba_\bl_\ba_\br_\b__\bf_\bi_\be_\bl_\bd_\b__\bt_\by_\bp_\be\n+Simd::Scalar< field_type > scalar_field_type\n+scalar type underlying the field_type\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn preconditioners.hh:424\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\be_\bq_\bJ_\ba_\bc_\b:_\b:_\bS_\be_\bq_\bJ_\ba_\bc\n+SeqJac(const std::shared_ptr< const AssembledLinearOperator< M, X, Y > > &A,\n+const ParameterTree &configuration)\n+Constructor.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn preconditioners.hh:454\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\be_\bq_\bJ_\ba_\bc_\b:_\b:_\bf_\bi_\be_\bl_\bd_\b__\bt_\by_\bp_\be\n+X::field_type field_type\n+The field type of the preconditioner.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn preconditioners.hh:422\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\be_\bq_\bJ_\ba_\bc_\b:_\b:_\bp_\br_\be\n+virtual void pre(X &x, Y &b)\n+Prepare the preconditioner.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn preconditioners.hh:480\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\be_\bq_\bJ_\ba_\bc_\b:_\b:_\bd_\bo_\bm_\ba_\bi_\bn_\b__\bt_\by_\bp_\be\n+X domain_type\n+The domain type of the preconditioner.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn preconditioners.hh:418\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\be_\bq_\bJ_\ba_\bc_\b:_\b:_\br_\be_\ba_\bl_\b__\bf_\bi_\be_\bl_\bd_\b__\bt_\by_\bp_\be\n+FieldTraits< scalar_field_type >::real_type real_field_type\n+real scalar type underlying the field_type\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn preconditioners.hh:426\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\be_\bq_\bJ_\ba_\bc_\b:_\b:_\bc_\ba_\bt_\be_\bg_\bo_\br_\by\n+virtual SolverCategory::Category category() const\n+Category of the preconditioner (see SolverCategory::Category)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn preconditioners.hh:504\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\be_\bq_\bJ_\ba_\bc_\b:_\b:_\bS_\be_\bq_\bJ_\ba_\bc\n+SeqJac(const M &A, int n, real_field_type w)\n+Constructor.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn preconditioners.hh:435\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\be_\bq_\bJ_\ba_\bc_\b:_\b:_\br_\ba_\bn_\bg_\be_\b__\bt_\by_\bp_\be\n+Y range_type\n+The range type of the preconditioner.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn preconditioners.hh:420\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\be_\bq_\bD_\bI_\bL_\bU\n+Sequential DILU preconditioner.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn preconditioners.hh:564\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\be_\bq_\bD_\bI_\bL_\bU_\b:_\b:_\bw_\bN_\bo_\bt_\bI_\bd_\be_\bn_\bt_\bi_\bt_\by_\b_\n+const bool wNotIdentity_\n+true if w != 1.0\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn preconditioners.hh:681\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\be_\bq_\bD_\bI_\bL_\bU_\b:_\b:_\bf_\bi_\be_\bl_\bd_\b__\bt_\by_\bp_\be\n+typename X::field_type field_type\n+The field type of the preconditioner.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn preconditioners.hh:576\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\be_\bq_\bD_\bI_\bL_\bU_\b:_\b:_\b__\bw\n+const real_field_type _w\n+The relaxation factor to use.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn preconditioners.hh:679\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\be_\bq_\bD_\bI_\bL_\bU_\b:_\b:_\b__\bA_\b_\n+const M & _A_\n+The matrix we operate on.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn preconditioners.hh:677\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\be_\bq_\bD_\bI_\bL_\bU_\b:_\b:_\bS_\be_\bq_\bD_\bI_\bL_\bU\n+SeqDILU(const std::shared_ptr< const AssembledLinearOperator< M, X, Y > > &A,\n+const ParameterTree &configuration)\n+Constructor.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn preconditioners.hh:612\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\be_\bq_\bD_\bI_\bL_\bU_\b:_\b:_\bs_\bc_\ba_\bl_\ba_\br_\b__\bf_\bi_\be_\bl_\bd_\b__\bt_\by_\bp_\be\n+Simd::Scalar< field_type > scalar_field_type\n+scalar type underlying the field_type\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn preconditioners.hh:579\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\be_\bq_\bD_\bI_\bL_\bU_\b:_\b:_\bp_\bo_\bs_\bt\n+virtual void post(X &x)\n+Clean up.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn preconditioners.hh:664\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\be_\bq_\bD_\bI_\bL_\bU_\b:_\b:_\br_\be_\ba_\bl_\b__\bf_\bi_\be_\bl_\bd_\b__\bt_\by_\bp_\be\n+typename FieldTraits< scalar_field_type >::real_type real_field_type\n+real scalar type underlying the field_type\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn preconditioners.hh:581\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\be_\bq_\bD_\bI_\bL_\bU_\b:_\b:_\bm_\ba_\bt_\br_\bi_\bx_\b__\bt_\by_\bp_\be\n+M matrix_type\n+The matrix type the preconditioner is for.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn preconditioners.hh:567\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\be_\bq_\bD_\bI_\bL_\bU_\b:_\b:_\bd_\bo_\bm_\ba_\bi_\bn_\b__\bt_\by_\bp_\be\n+X domain_type\n+The domain type of the preconditioner.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn preconditioners.hh:571\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\be_\bq_\bD_\bI_\bL_\bU_\b:_\b:_\bb_\bl_\bo_\bc_\bk_\b__\bt_\by_\bp_\be\n+typename matrix_type::block_type block_type\n+block type of matrix\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn preconditioners.hh:569\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\be_\bq_\bD_\bI_\bL_\bU_\b:_\b:_\ba_\bp_\bp_\bl_\by\n+virtual void apply(X &v, const Y &d)\n+Apply the preconditioner.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn preconditioners.hh:648\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\be_\bq_\bD_\bI_\bL_\bU_\b:_\b:_\bp_\br_\be\n+virtual void pre(X &x, Y &b)\n+Prepare the preconditioner.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn preconditioners.hh:639\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\be_\bq_\bD_\bI_\bL_\bU_\b:_\b:_\bS_\be_\bq_\bD_\bI_\bL_\bU\n+SeqDILU(const M &A, real_field_type w)\n+Constructor.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn preconditioners.hh:589\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\be_\bq_\bD_\bI_\bL_\bU_\b:_\b:_\bc_\ba_\bt_\be_\bg_\bo_\br_\by\n+virtual SolverCategory::Category category() const\n+Category of the preconditioner (see SolverCategory::Category)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn preconditioners.hh:669\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\be_\bq_\bD_\bI_\bL_\bU_\b:_\b:_\br_\ba_\bn_\bg_\be_\b__\bt_\by_\bp_\be\n+Y range_type\n+The range type of the preconditioner.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn preconditioners.hh:573\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\be_\bq_\bD_\bI_\bL_\bU_\b:_\b:_\bS_\be_\bq_\bD_\bI_\bL_\bU\n+SeqDILU(const M &A, const ParameterTree &config)\n+Constructor.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn preconditioners.hh:629\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\be_\bq_\bD_\bI_\bL_\bU_\b:_\b:_\bD_\bi_\bn_\bv_\b_\n+std::vector< block_type > Dinv_\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn preconditioners.hh:675\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\be_\bq_\bI_\bL_\bU\n+Sequential ILU preconditioner.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn preconditioners.hh:697\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\be_\bq_\bI_\bL_\bU_\b:_\b:_\bp_\bo_\bs_\bt\n+virtual void post(X &x)\n+Clean up.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn preconditioners.hh:843\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\be_\bq_\bI_\bL_\bU_\b:_\b:_\bS_\be_\bq_\bI_\bL_\bU\n+SeqILU(const M &A, int n, real_field_type w, const bool resort=false)\n+Constructor.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn preconditioners.hh:777\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\be_\bq_\bI_\bL_\bU_\b:_\b:_\bp_\br_\be\n+virtual void pre(X &x, Y &b)\n+Prepare the preconditioner.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn preconditioners.hh:813\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\be_\bq_\bI_\bL_\bU_\b:_\b:_\ba_\bp_\bp_\bl_\by\n+virtual void apply(X &v, const Y &d)\n+Apply the preconditioner.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn preconditioners.hh:821\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\be_\bq_\bI_\bL_\bU_\b:_\b:_\bC_\bR_\bS\n+ILU::CRS< block_type, typename M::allocator_type > CRS\n+type of ILU storage\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn preconditioners.hh:717\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\be_\bq_\bI_\bL_\bU_\b:_\b:_\br_\ba_\bn_\bg_\be_\b__\bt_\by_\bp_\be\n+Y range_type\n+The range type of the preconditioner.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn preconditioners.hh:706\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\be_\bq_\bI_\bL_\bU_\b:_\b:_\bl_\bo_\bw_\be_\br_\b_\n+CRS lower_\n+The ILU(n) decomposition of the matrix. As storage a CRS structure is used.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn preconditioners.hh:857\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\be_\bq_\bI_\bL_\bU_\b:_\b:_\bw_\bN_\bo_\bt_\bI_\bd_\be_\bn_\bt_\bi_\bt_\by_\b_\n+const bool wNotIdentity_\n+true if w != 1.0\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn preconditioners.hh:864\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\be_\bq_\bI_\bL_\bU_\b:_\b:_\bS_\be_\bq_\bI_\bL_\bU\n+SeqILU(const M &A, const ParameterTree &config)\n+Constructor.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn preconditioners.hh:763\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\be_\bq_\bI_\bL_\bU_\b:_\b:_\bm_\ba_\bt_\br_\bi_\bx_\b__\bt_\by_\bp_\be\n+std::remove_const< M >::type matrix_type\n+The matrix type the preconditioner is for.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn preconditioners.hh:700\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\be_\bq_\bI_\bL_\bU_\b:_\b:_\bb_\bl_\bo_\bc_\bk_\b__\bt_\by_\bp_\be\n+matrix_type::block_type block_type\n+block type of matrix\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn preconditioners.hh:702\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\be_\bq_\bI_\bL_\bU_\b:_\b:_\br_\be_\ba_\bl_\b__\bf_\bi_\be_\bl_\bd_\b__\bt_\by_\bp_\be\n+FieldTraits< scalar_field_type >::real_type real_field_type\n+real scalar type underlying the field_type\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn preconditioners.hh:714\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\be_\bq_\bI_\bL_\bU_\b:_\b:_\bf_\bi_\be_\bl_\bd_\b__\bt_\by_\bp_\be\n+X::field_type field_type\n+The field type of the preconditioner.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn preconditioners.hh:709\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\be_\bq_\bI_\bL_\bU_\b:_\b:_\bc_\ba_\bt_\be_\bg_\bo_\br_\by\n+virtual SolverCategory::Category category() const\n+Category of the preconditioner (see SolverCategory::Category)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn preconditioners.hh:847\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\be_\bq_\bI_\bL_\bU_\b:_\b:_\bS_\be_\bq_\bI_\bL_\bU\n+SeqILU(const M &A, real_field_type w, const bool resort=false)\n+Constructor.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn preconditioners.hh:726\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\be_\bq_\bI_\bL_\bU_\b:_\b:_\bw_\b_\n+const real_field_type w_\n+The relaxation factor to use.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn preconditioners.hh:862\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\be_\bq_\bI_\bL_\bU_\b:_\b:_\bS_\be_\bq_\bI_\bL_\bU\n+SeqILU(const std::shared_ptr< const AssembledLinearOperator< M, X, Y > > &A,\n+const ParameterTree &configuration)\n+Constructor.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn preconditioners.hh:745\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\be_\bq_\bI_\bL_\bU_\b:_\b:_\bd_\bo_\bm_\ba_\bi_\bn_\b__\bt_\by_\bp_\be\n+X domain_type\n+The domain type of the preconditioner.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn preconditioners.hh:704\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\be_\bq_\bI_\bL_\bU_\b:_\b:_\bi_\bn_\bv_\b_\n+std::vector< block_type, typename matrix_type::allocator_type > inv_\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn preconditioners.hh:859\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\be_\bq_\bI_\bL_\bU_\b:_\b:_\bs_\bc_\ba_\bl_\ba_\br_\b__\bf_\bi_\be_\bl_\bd_\b__\bt_\by_\bp_\be\n+Simd::Scalar< field_type > scalar_field_type\n+scalar type underlying the field_type\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn preconditioners.hh:712\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\be_\bq_\bI_\bL_\bU_\b:_\b:_\bI_\bL_\bU_\b_\n+std::unique_ptr< matrix_type > ILU_\n+The ILU(n) decomposition of the matrix. As storage a BCRSMatrix is used.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn preconditioners.hh:854\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\be_\bq_\bI_\bL_\bU_\b:_\b:_\bu_\bp_\bp_\be_\br_\b_\n+CRS upper_\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn preconditioners.hh:858\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\bi_\bc_\bh_\ba_\br_\bd_\bs_\bo_\bn\n+Richardson preconditioner.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn preconditioners.hh:878\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\bi_\bc_\bh_\ba_\br_\bd_\bs_\bo_\bn_\b:_\b:_\bf_\bi_\be_\bl_\bd_\b__\bt_\by_\bp_\be\n+X::field_type field_type\n+The field type of the preconditioner.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn preconditioners.hh:885\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\bi_\bc_\bh_\ba_\br_\bd_\bs_\bo_\bn_\b:_\b:_\bc_\ba_\bt_\be_\bg_\bo_\br_\by\n+virtual SolverCategory::Category category() const\n+Category of the preconditioner (see SolverCategory::Category)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn preconditioners.hh:943\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\bi_\bc_\bh_\ba_\br_\bd_\bs_\bo_\bn_\b:_\b:_\br_\ba_\bn_\bg_\be_\b__\bt_\by_\bp_\be\n+Y range_type\n+The range type of the preconditioner.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn preconditioners.hh:883\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\bi_\bc_\bh_\ba_\br_\bd_\bs_\bo_\bn_\b:_\b:_\bp_\br_\be\n+virtual void pre(X &x, Y &b)\n+Prepare the preconditioner.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn preconditioners.hh:920\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\bi_\bc_\bh_\ba_\br_\bd_\bs_\bo_\bn_\b:_\b:_\bR_\bi_\bc_\bh_\ba_\br_\bd_\bs_\bo_\bn\n+Richardson(real_field_type w=1.0)\n+Constructor.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn preconditioners.hh:896\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\bi_\bc_\bh_\ba_\br_\bd_\bs_\bo_\bn_\b:_\b:_\bp_\bo_\bs_\bt\n+virtual void post(X &x)\n+Clean up.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn preconditioners.hh:939\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\bi_\bc_\bh_\ba_\br_\bd_\bs_\bo_\bn_\b:_\b:_\br_\be_\ba_\bl_\b__\bf_\bi_\be_\bl_\bd_\b__\bt_\by_\bp_\be\n+FieldTraits< scalar_field_type >::real_type real_field_type\n+real scalar type underlying the field_type\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn preconditioners.hh:889\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\bi_\bc_\bh_\ba_\br_\bd_\bs_\bo_\bn_\b:_\b:_\bs_\bc_\ba_\bl_\ba_\br_\b__\bf_\bi_\be_\bl_\bd_\b__\bt_\by_\bp_\be\n+Simd::Scalar< field_type > scalar_field_type\n+scalar type underlying the field_type\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn preconditioners.hh:887\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\bi_\bc_\bh_\ba_\br_\bd_\bs_\bo_\bn_\b:_\b:_\bR_\bi_\bc_\bh_\ba_\br_\bd_\bs_\bo_\bn\n+Richardson(const ParameterTree &configuration)\n+Constructor.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn preconditioners.hh:911\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\bi_\bc_\bh_\ba_\br_\bd_\bs_\bo_\bn_\b:_\b:_\bd_\bo_\bm_\ba_\bi_\bn_\b__\bt_\by_\bp_\be\n+X domain_type\n+The domain type of the preconditioner.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn preconditioners.hh:881\n+_\bD_\bu_\bn_\be_\b:_\b:_\bR_\bi_\bc_\bh_\ba_\br_\bd_\bs_\bo_\bn_\b:_\b:_\ba_\bp_\bp_\bl_\by\n+virtual void apply(X &v, const Y &d)\n+Apply the precondioner.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn preconditioners.hh:928\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\be_\bq_\bI_\bL_\bD_\bL\n+sequential ILDL preconditioner\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn preconditioners.hh:972\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\be_\bq_\bI_\bL_\bD_\bL_\b:_\b:_\bS_\be_\bq_\bI_\bL_\bD_\bL\n+SeqILDL(const matrix_type &A, const ParameterTree &config)\n+Constructor.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn preconditioners.hh:1018\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\be_\bq_\bI_\bL_\bD_\bL_\b:_\b:_\bS_\be_\bq_\bI_\bL_\bD_\bL\n+SeqILDL(const matrix_type &A, real_field_type relax=real_field_type(1))\n+constructor\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn preconditioners.hh:1030\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\be_\bq_\bI_\bL_\bD_\bL_\b:_\b:_\bd_\bo_\bm_\ba_\bi_\bn_\b__\bt_\by_\bp_\be\n+X domain_type\n+domain type of the preconditioner\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn preconditioners.hh:980\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\be_\bq_\bI_\bL_\bD_\bL_\b:_\b:_\bp_\bo_\bs_\bt\n+void post(X &x) override\n+Clean up.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn preconditioners.hh:1081\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\be_\bq_\bI_\bL_\bD_\bL_\b:_\b:_\br_\ba_\bn_\bg_\be_\b__\bt_\by_\bp_\be\n+Y range_type\n+range type of the preconditioner\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn preconditioners.hh:982\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\be_\bq_\bI_\bL_\bD_\bL_\b:_\b:_\bm_\ba_\bt_\br_\bi_\bx_\b__\bt_\by_\bp_\be\n+std::remove_const_t< M > matrix_type\n+type of matrix the preconditioner is for\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn preconditioners.hh:978\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\be_\bq_\bI_\bL_\bD_\bL_\b:_\b:_\ba_\bp_\bp_\bl_\by\n+void apply(X &v, const Y &d) override\n+Apply one step of the preconditioner to the system A(v)=d.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn preconditioners.hh:1074\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\be_\bq_\bI_\bL_\bD_\bL_\b:_\b:_\br_\be_\ba_\bl_\b__\bf_\bi_\be_\bl_\bd_\b__\bt_\by_\bp_\be\n+FieldTraits< scalar_field_type >::real_type real_field_type\n+real scalar type underlying the field_type\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn preconditioners.hh:988\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\be_\bq_\bI_\bL_\bD_\bL_\b:_\b:_\bS_\be_\bq_\bI_\bL_\bD_\bL\n+SeqILDL(const std::shared_ptr< const AssembledLinearOperator< M, X, Y > > &A,\n+const ParameterTree &configuration)\n+Constructor.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn preconditioners.hh:1002\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\be_\bq_\bI_\bL_\bD_\bL_\b:_\b:_\bp_\br_\be\n+void pre(X &x, Y &b) override\n+Prepare the preconditioner.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn preconditioners.hh:1070\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\be_\bq_\bI_\bL_\bD_\bL_\b:_\b:_\bs_\bc_\ba_\bl_\ba_\br_\b__\bf_\bi_\be_\bl_\bd_\b__\bt_\by_\bp_\be\n+Simd::Scalar< field_type > scalar_field_type\n+scalar type underlying the field_type\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn preconditioners.hh:986\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\be_\bq_\bI_\bL_\bD_\bL_\b:_\b:_\bf_\bi_\be_\bl_\bd_\b__\bt_\by_\bp_\be\n+X::field_type field_type\n+field type of the preconditioner\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn preconditioners.hh:984\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\be_\bq_\bI_\bL_\bD_\bL_\b:_\b:_\bc_\ba_\bt_\be_\bg_\bo_\br_\by\n+SolverCategory::Category category() const override\n+Category of the preconditioner (see SolverCategory::Category)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn preconditioners.hh:1085\n+_\bD_\bu_\bn_\be_\b:_\b:_\bI_\bn_\bv_\be_\br_\bs_\be_\bO_\bp_\be_\br_\ba_\bt_\bo_\br_\bR_\be_\bs_\bu_\bl_\bt\n+Statistics about the application of an inverse operator.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn solver.hh:50\n+_\bD_\bu_\bn_\be_\b:_\b:_\bI_\bn_\bv_\be_\br_\bs_\be_\bO_\bp_\be_\br_\ba_\bt_\bo_\br\n+Abstract base class for all solvers.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn solver.hh:101\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bo_\bl_\bv_\be_\br_\bC_\ba_\bt_\be_\bg_\bo_\br_\by_\b:_\b:_\bC_\ba_\bt_\be_\bg_\bo_\br_\by\n+Category\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn solvercategory.hh:23\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bo_\bl_\bv_\be_\br_\bC_\ba_\bt_\be_\bg_\bo_\br_\by_\b:_\b:_\bs_\be_\bq_\bu_\be_\bn_\bt_\bi_\ba_\bl\n+@ sequential\n+Category for sequential solvers.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn solvercategory.hh:25\n+_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bo_\bl_\bv_\be_\br_\bC_\ba_\bt_\be_\bg_\bo_\br_\by_\b:_\b:_\bc_\ba_\bt_\be_\bg_\bo_\br_\by\n+static Category category(const OP &op, decltype(op.category()) *=nullptr)\n+Helperfunction to extract the solver category either from an enum, or from the\n+newly introduced virtu...\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn solvercategory.hh:34\n ===============================================================================\n Generated by\u00a0_\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b] 1.9.8\n"}]}, {"source1": "./usr/share/doc/libdune-istl-doc/doxygen/a00020.html", "source2": "./usr/share/doc/libdune-istl-doc/doxygen/a00020.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n dune-istl: scaledidmatrix.hh File Reference \n+dune-istl: counter.hh File Reference \n \n-\n-
This file implements a quadratic matrix of fixed size which is a multiple of the identity. \n-More...
\n-
#include <cmath>\n-
#include <cstddef>\n-
#include <complex>\n+
#include <cassert>#include <typeinfo>#include <iostream>#include <dune/common/exceptions.hh>#include <dune/common/fmatrix.hh>#include <dune/common/diagonalmatrix.hh>#include <dune/common/ftraits.hh>#include <memory>#include <tuple>#include <utility>#include <dune/common/typeutilities.hh>
\n
Go to the source code of this file.
\n
\n+constexpr std::size_t maxcount = 100
\n-
\n-
This file implements a quadratic matrix of fixed size which is a multiple of the identity.
\n-
\n+\n+
\n+
◆ \n+\n+
\n+
\n+
\n+ \n+ #define DUNE_GET_COUNTER \n+ ( \n+ \n+ Tag ) \n+ (counterFunc(Dune::PriorityTag<maxcount >{}, Tag{}, Dune::CounterImpl::ADLTag{})) \n+ \n+
\n+
\n+\n+
\n+
\n+
\n+
◆ \n+\n+
\n+
\n+
\n+ \n+ #define DUNE_INC_COUNTER \n+ ( \n+ \n+ Tag ) \n+ \n+
\n+
\n+
Value: namespace { \\
\n+
namespace CounterImpl { \\
\n+
constexpr std::size_t \\
\n+
\n+
{ \\
\n+
return p.value; \\
\n+
} \\
\n+
} \\
\n+
} \\
\n+
static_assert(true , "unfudge indentation" )
\n+
#define DUNE_GET_COUNTER(Tag)
Definition counter.hh:17
\n+
\n+
\n+
\n+\n+
\n+
◆ \n+\n+
\n+
\n+
\n+ \n+ \n+ \n+ \n+ constexpr std::size_t maxcount = 100 \n+ \n+
\n+ \n+ \n+constexpr \n+ \n+
\n+
\n+\n+
\n+
\n+
\n-#include \n-#include \n+ * _\bc_\bo_\bm_\bm_\bo_\bn\n+_\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs | _\bM_\ba_\bc_\br_\bo_\bs | _\bV_\ba_\br_\bi_\ba_\bb_\bl_\be_\bs\n+counter.hh File Reference\n+#include \n+#include \n #include \n-#include \n-#include \n-#include \n-#include \n+#include \n+#include \n+#include \n+#include \n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bs_\bo_\bu_\br_\bc_\be_\b _\bc_\bo_\bd_\be_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n-C\bCl\bla\bas\bss\bse\bes\bs\n- class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bS_\bc_\ba_\bl_\be_\bd_\bI_\bd_\be_\bn_\bt_\bi_\bt_\by_\bM_\ba_\bt_\br_\bi_\bx_\b<_\b _\bK_\b,_\b _\bn_\b _\b>\n-\u00a0 A multiple of the identity matrix of static size. _\bM_\bo_\br_\be_\b._\b._\b.\n+N\bNa\bam\bme\bes\bsp\bpa\bac\bce\bes\bs\n+namespace \u00a0 _\bD_\bu_\bn_\be\n \u00a0\n-struct \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bD_\be_\bn_\bs_\be_\bM_\ba_\bt_\br_\bi_\bx_\bA_\bs_\bs_\bi_\bg_\bn_\be_\br_\b<_\b _\bD_\be_\bn_\bs_\be_\bM_\ba_\bt_\br_\bi_\bx_\b,_\b _\bS_\bc_\ba_\bl_\be_\bd_\bI_\bd_\be_\bn_\bt_\bi_\bt_\by_\bM_\ba_\bt_\br_\bi_\bx_\b<_\b _\bf_\bi_\be_\bl_\bd_\b,_\b _\bN\n- _\b>_\b _\b>\n+namespace \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bC_\bo_\bu_\bn_\bt_\be_\br_\bI_\bm_\bp_\bl\n \u00a0\n-struct \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bF_\bi_\be_\bl_\bd_\bT_\br_\ba_\bi_\bt_\bs_\b<_\b _\bS_\bc_\ba_\bl_\be_\bd_\bI_\bd_\be_\bn_\bt_\bi_\bt_\by_\bM_\ba_\bt_\br_\bi_\bx_\b<_\b _\bK_\b,_\b _\bn_\b _\b>_\b _\b>\n+M\bMa\bac\bcr\bro\bos\bs\n+#define\u00a0 _\bD_\bU_\bN_\bE_\b__\bG_\bE_\bT_\b__\bC_\bO_\bU_\bN_\bT_\bE_\bR(Tag)\u00a0\u00a0\u00a0 (counterFunc(Dune::PriorityTag<_\bm_\ba_\bx_\bc_\bo_\bu_\bn_\bt>{},\n+ Tag{}, Dune::CounterImpl::ADLTag{}))\n \u00a0\n-N\bNa\bam\bme\bes\bsp\bpa\bac\bce\bes\bs\n-namespace \u00a0 _\bD_\bu_\bn_\be\n+#define\u00a0 _\bD_\bU_\bN_\bE_\b__\bI_\bN_\bC_\b__\bC_\bO_\bU_\bN_\bT_\bE_\bR(Tag)\n+\u00a0\n+V\bVa\bar\bri\bia\bab\bbl\ble\bes\bs\n+constexpr std::size_t\u00a0 _\bm_\ba_\bx_\bc_\bo_\bu_\bn_\bt = 100\n \u00a0\n-*\b**\b**\b**\b**\b* D\bDe\bet\bta\bai\bil\ble\bed\bd D\bDe\bes\bsc\bcr\bri\bip\bpt\bti\bio\bon\bn *\b**\b**\b**\b**\b*\n-This file implements a quadratic matrix of fixed size which is a multiple of\n-the identity.\n+*\b**\b**\b**\b**\b* M\bMa\bac\bcr\bro\bo D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn D\bDo\boc\bcu\bum\bme\ben\bnt\bta\bat\bti\bio\bon\bn *\b**\b**\b**\b**\b*\n+*\b**\b**\b**\b**\b* _\b?\b\u25c6_\b?\b\u00a0D\bDU\bUN\bNE\bE_\b_G\bGE\bET\bT_\b_C\bCO\bOU\bUN\bNT\bTE\bER\bR *\b**\b**\b**\b**\b*\n+#define DUNE_GET_COUNTER ( \u00a0 Tag ) \u00a0\u00a0\u00a0 (counterFunc(Dune::PriorityTag<_\bm_\ba_\bx_\bc_\bo_\bu_\bn_\bt>\n+ {}, Tag{}, Dune::CounterImpl::ADLTag{}))\n+*\b**\b**\b**\b**\b* _\b?\b\u25c6_\b?\b\u00a0D\bDU\bUN\bNE\bE_\b_I\bIN\bNC\bC_\b_C\bCO\bOU\bUN\bNT\bTE\bER\bR *\b**\b**\b**\b**\b*\n+#define DUNE_INC_COUNTER ( \u00a0 Tag )\n+V\bVa\bal\blu\bue\be:\b:\n+namespace { \\\n+namespace CounterImpl { \\\n+constexpr std::size_t \\\n+counterFunc(Dune::PriorityTag<_\bD_\bU_\bN_\bE_\b__\bG_\bE_\bT_\b__\bC_\bO_\bU_\bN_\bT_\bE_\bR(Tag)+1> p, Tag, ADLTag) \\\n+{ \\\n+return p.value; \\\n+} \\\n+} \\\n+} \\\n+static_assert(true, \"unfudge indentation\")\n+_\bD_\bU_\bN_\bE_\b__\bG_\bE_\bT_\b__\bC_\bO_\bU_\bN_\bT_\bE_\bR\n+#define DUNE_GET_COUNTER(Tag)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn counter.hh:17\n+*\b**\b**\b**\b**\b* V\bVa\bar\bri\bia\bab\bbl\ble\be D\bDo\boc\bcu\bum\bme\ben\bnt\bta\bat\bti\bio\bon\bn *\b**\b**\b**\b**\b*\n+*\b**\b**\b**\b**\b* _\b?\b\u25c6_\b?\b\u00a0m\bma\bax\bxc\bco\bou\bun\bnt\bt *\b**\b**\b**\b**\b*\n+constexpr std::size_t maxcount = 100 constexpr\n ===============================================================================\n Generated by\u00a0_\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b] 1.9.8\n"}]}, {"source1": "./usr/share/doc/libdune-istl-doc/doxygen/a00020_source.html", "source2": "./usr/share/doc/libdune-istl-doc/doxygen/a00020_source.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n dune-istl: scaledidmatrix.hh Source File \n+dune-istl: counter.hh Source File \n \n
Go to the documentation of this file. \n
\n-
\n-
\n-
5 #ifndef DUNE_ISTL_SCALEDIDMATRIX_HH \n-
6 #define DUNE_ISTL_SCALEDIDMATRIX_HH \n-
\n-
\n-
\n-
\n-
\n-
18 #include <dune/common/exceptions.hh> \n-
19 #include <dune/common/fmatrix.hh> \n-
20 #include <dune/common/diagonalmatrix.hh> \n-
21 #include <dune/common/ftraits.hh> \n-
\n-
\n-
\n-
28 template <
class K,
int n>
\n-
\n-
\n-
\n-
31 typedef DiagonalMatrixWrapper< ScaledIdentityMatrix<K,n> > WrapperType;
\n-
\n-
\n-
\n-
\n-
\n+
3 #ifndef DUNE_ISTL_COMMON_COUNTER_HH \n+
4 #define DUNE_ISTL_COMMON_COUNTER_HH \n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
13 #include <dune/common/typeutilities.hh> \n+
\n+
\n+
\n+
\n+
17 #define DUNE_GET_COUNTER(Tag) \\ \n+
18 (counterFunc(Dune::PriorityTag<maxcount>{}, Tag{}, Dune::CounterImpl::ADLTag{})) \n+
\n+
\n+
\n+
20 #define DUNE_INC_COUNTER(Tag) \\ \n+
\n+
22 namespace CounterImpl { \\ \n+
23 constexpr std::size_t \\ \n+
24 counterFunc(Dune::PriorityTag<DUNE_GET_COUNTER(Tag)+1> p, Tag, ADLTag) \\ \n+
\n+
\n+
\n+
\n+
\n+
30 static_assert(true, "unfudge indentation") \n+
\n+
\n+
\n+
\n+
\n+
\n+
35 namespace CounterImpl {
\n+
\n+
\n
\n-
\n-
\n-
\n+
\n+
40 constexpr std::size_t counterFunc(Dune::PriorityTag<0>, Tag, ADLTag)
\n+
\n+
\n+
\n
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
80 return (
this ==&other);
\n-
\n-
\n-
\n-
\n-
85 typedef ContainerWrapperIterator<const WrapperType, reference, reference>
Iterator ;
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
96 return Iterator (WrapperType(
this ),0);
\n-
\n-
\n-
\n-
\n-
\n-
\n-
102 return Iterator (WrapperType(
this ),n);
\n-
\n-
\n-
\n-
\n-
\n-
\n-
109 return Iterator (WrapperType(
this ),n-1);
\n-
\n-
\n-
\n-
\n-
\n-
\n-
116 return Iterator (WrapperType(
this ),-1);
\n-
\n-
\n-
\n-
\n-
121 typedef ContainerWrapperIterator<const WrapperType, const_reference, const_reference>
ConstIterator ;
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
201 template <
class Scalar,
\n-
202 std::enable_if_t<IsNumber<Scalar>::value,
int > = 0>
\n-
\n-
\n-
209 template <
class Scalar,
\n-
210 std::enable_if_t<IsNumber<Scalar>::value,
int > = 0>
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
221 return p_==other.
scalar ();
\n-
\n-
\n-
\n-
\n-
\n-
\n-
227 return p_!=other.
scalar ();
\n-
\n-
\n-
\n-
\n-
\n-
233 template <
class X,
class Y>
\n-
\n-
234 void mv (
const X& x, Y& y)
const \n-
\n-
236 #ifdef DUNE_FMatrix_WITH_CHECKING \n-
237 if (x.N()!=
M ()) DUNE_THROW(FMatrixError,
"index out of range" );
\n-
238 if (y.N()!=
N ()) DUNE_THROW(FMatrixError,
"index out of range" );
\n-
\n-
\n-
\n-
\n-
\n-
\n-
245 template <
class X,
class Y>
\n-
\n-
246 void mtv (
const X& x, Y& y)
const \n-
\n-
\n-
\n-
\n-
\n-
252 template <
class X,
class Y>
\n-
\n-
253 void umv (
const X& x, Y& y)
const \n-
\n-
255 #ifdef DUNE_FMatrix_WITH_CHECKING \n-
256 if (x.N()!=
M ()) DUNE_THROW(FMatrixError,
"index out of range" );
\n-
257 if (y.N()!=
N ()) DUNE_THROW(FMatrixError,
"index out of range" );
\n-
\n-
\n-
\n-
\n-
\n-
\n-
264 template <
class X,
class Y>
\n-
\n-
265 void umtv (
const X& x, Y& y)
const \n-
\n-
267 #ifdef DUNE_FMatrix_WITH_CHECKING \n-
268 if (x.N()!=
N ()) DUNE_THROW(FMatrixError,
"index out of range" );
\n-
269 if (y.N()!=
M ()) DUNE_THROW(FMatrixError,
"index out of range" );
\n-
\n-
\n-
\n-
\n-
\n-
\n-
276 template <
class X,
class Y>
\n-
\n-
277 void umhv (
const X& x, Y& y)
const \n-
\n-
279 #ifdef DUNE_FMatrix_WITH_CHECKING \n-
280 if (x.N()!=
N ()) DUNE_THROW(FMatrixError,
"index out of range" );
\n-
281 if (y.N()!=
M ()) DUNE_THROW(FMatrixError,
"index out of range" );
\n-
\n-
\n-
284 y[i] += conjugateComplex(p_)*x[i];
\n-
\n-
\n-
\n-
288 template <
class X,
class Y>
\n-
\n-
289 void mmv (
const X& x, Y& y)
const \n-
\n-
291 #ifdef DUNE_FMatrix_WITH_CHECKING \n-
292 if (x.N()!=
M ()) DUNE_THROW(FMatrixError,
"index out of range" );
\n-
293 if (y.N()!=
N ()) DUNE_THROW(FMatrixError,
"index out of range" );
\n-
\n-
\n-
\n-
\n-
\n-
\n-
300 template <
class X,
class Y>
\n-
\n-
301 void mmtv (
const X& x, Y& y)
const \n-
\n-
303 #ifdef DUNE_FMatrix_WITH_CHECKING \n-
304 if (x.N()!=
N ()) DUNE_THROW(FMatrixError,
"index out of range" );
\n-
305 if (y.N()!=
M ()) DUNE_THROW(FMatrixError,
"index out of range" );
\n-
\n-
\n-
\n-
\n-
\n-
\n-
312 template <
class X,
class Y>
\n-
\n-
313 void mmhv (
const X& x, Y& y)
const \n-
\n-
315 #ifdef DUNE_FMatrix_WITH_CHECKING \n-
316 if (x.N()!=
N ()) DUNE_THROW(FMatrixError,
"index out of range" );
\n-
317 if (y.N()!=
M ()) DUNE_THROW(FMatrixError,
"index out of range" );
\n-
\n-
\n-
320 y[i] -= conjugateComplex(p_)*x[i];
\n-
\n-
\n-
\n-
324 template <
class X,
class Y>
\n-
\n-
325 void usmv (
const K& alpha,
const X& x, Y& y)
const \n-
\n-
327 #ifdef DUNE_FMatrix_WITH_CHECKING \n-
328 if (x.N()!=
M ()) DUNE_THROW(FMatrixError,
"index out of range" );
\n-
329 if (y.N()!=
N ()) DUNE_THROW(FMatrixError,
"index out of range" );
\n-
\n-
\n-
332 y[i] += alpha * p_ * x[i];
\n-
\n-
\n-
\n-
336 template <
class X,
class Y>
\n-
\n-
337 void usmtv (
const K& alpha,
const X& x, Y& y)
const \n-
\n-
339 #ifdef DUNE_FMatrix_WITH_CHECKING \n-
340 if (x.N()!=
N ()) DUNE_THROW(FMatrixError,
"index out of range" );
\n-
341 if (y.N()!=
M ()) DUNE_THROW(FMatrixError,
"index out of range" );
\n-
\n-
\n-
344 y[i] += alpha * p_ * x[i];
\n-
\n-
\n-
\n-
348 template <
class X,
class Y>
\n-
\n-
349 void usmhv (
const K& alpha,
const X& x, Y& y)
const \n-
\n-
351 #ifdef DUNE_FMatrix_WITH_CHECKING \n-
352 if (x.N()!=
N ()) DUNE_THROW(FMatrixError,
"index out of range" );
\n-
353 if (y.N()!=
M ()) DUNE_THROW(FMatrixError,
"index out of range" );
\n-
\n-
\n-
356 y[i] += alpha * conjugateComplex(p_) * x[i];
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
364 return fvmeta::sqrt(n*p_*p_);
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
382 return fvmeta::absreal(p_);
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
392 for (
int i=0; i<n; i++)
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
405 return std::pow(p_,n);
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
427 #ifdef DUNE_FMatrix_WITH_CHECKING \n-
428 if (i<0 || i>=n) DUNE_THROW(FMatrixError,
"row index out of range" );
\n-
429 if (j<0 || j>=n) DUNE_THROW(FMatrixError,
"column index out of range" );
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
441 s << ((i==j) ? a.p_ : 0) <<
" " ;
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
450 return reference (
const_cast< K*
> (&p_), i);
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
491 template <
class DenseMatrix,
class field,
int N>
\n-
\n-
\n-
\n-
493 static void apply (DenseMatrix& denseMatrix,
\n-
\n-
495 assert(denseMatrix.M() == N);
\n-
496 assert(denseMatrix.N() == N);
\n-
497 denseMatrix = field(0);
\n-
498 for (
int i = 0; i < N; ++i)
\n-
499 denseMatrix[i][i] = rhs.
scalar ();
\n-
\n-
\n-
\n-
\n-
\n-
503 template <
class K,
int n>
\n-
\n-
\n-
\n-
\n-
507 using real_type =
typename FieldTraits<field_type>::real_type;
\n-
\n-
\n-
\n-
\n-
\n-
\n+
\n+
\n+
\n+
constexpr std::size_t maxcount
Definition counter.hh:15
\n
Definition allocator.hh:11
\n-
A multiple of the identity matrix of static size.
Definition scaledidmatrix.hh:30
\n-
void usmhv(const K &alpha, const X &x, Y &y) const
y += alpha A^H x
Definition scaledidmatrix.hh:349
\n-
void mmtv(const X &x, Y &y) const
y -= A^T x
Definition scaledidmatrix.hh:301
\n-
ScaledIdentityMatrix & operator-=(const ScaledIdentityMatrix &y)
vector space subtraction
Definition scaledidmatrix.hh:165
\n-
const_row_type::ConstIterator ConstColIterator
rename the iterators for easier access
Definition scaledidmatrix.hh:127
\n-
ConstIterator end() const
end iterator
Definition scaledidmatrix.hh:136
\n-
Iterator beforeBegin()
Definition scaledidmatrix.hh:114
\n-
bool operator!=(const ScaledIdentityMatrix &other) const
incomparison operator
Definition scaledidmatrix.hh:225
\n-
void mmv(const X &x, Y &y) const
y -= A x
Definition scaledidmatrix.hh:289
\n-
std::size_t size_type
The type used for the index access and size operations.
Definition scaledidmatrix.hh:43
\n-
void usmv(const K &alpha, const X &x, Y &y) const
y += alpha A x
Definition scaledidmatrix.hh:325
\n-
row_type::Iterator ColIterator
rename the iterators for easier access
Definition scaledidmatrix.hh:91
\n-
const_row_type const_reference
Definition scaledidmatrix.hh:49
\n-
void mv(const X &x, Y &y) const
y = A x
Definition scaledidmatrix.hh:234
\n-
void umtv(const X &x, Y &y) const
y += A^T x
Definition scaledidmatrix.hh:265
\n-
void umhv(const X &x, Y &y) const
y += A^H x
Definition scaledidmatrix.hh:277
\n-
DiagonalRowVector< K, n > row_type
Each row is implemented by a field vector.
Definition scaledidmatrix.hh:46
\n-
ContainerWrapperIterator< const WrapperType, reference, reference > Iterator
Iterator class for sequential access.
Definition scaledidmatrix.hh:85
\n-
Iterator beforeEnd()
Definition scaledidmatrix.hh:107
\n-
K determinant() const
calculates the determinant of this matrix
Definition scaledidmatrix.hh:404
\n-
K field_type
export the type representing the field
Definition scaledidmatrix.hh:37
\n-
void usmtv(const K &alpha, const X &x, Y &y) const
y += alpha A^T x
Definition scaledidmatrix.hh:337
\n-
Iterator end()
end iterator
Definition scaledidmatrix.hh:100
\n-
Iterator iterator
typedef for stl compliant access
Definition scaledidmatrix.hh:87
\n-
const K & scalar() const
Get const reference to the scalar diagonal value.
Definition scaledidmatrix.hh:473
\n-
void umv(const X &x, Y &y) const
y += A x
Definition scaledidmatrix.hh:253
\n-
const K & diagonal(size_type) const
Get const reference to diagonal entry.
Definition scaledidmatrix.hh:460
\n-
@ rows
The number of rows.
Definition scaledidmatrix.hh:54
\n-
@ cols
The number of columns.
Definition scaledidmatrix.hh:56
\n-
ScaledIdentityMatrix & operator=(const K &k)
Definition scaledidmatrix.hh:71
\n-
ContainerWrapperIterator< const WrapperType, const_reference, const_reference > ConstIterator
Iterator class for sequential access.
Definition scaledidmatrix.hh:121
\n-
K & diagonal(size_type)
Get reference to diagonal entry.
Definition scaledidmatrix.hh:466
\n-
void solve(V &x, const V &b) const
Solve system A x = b.
Definition scaledidmatrix.hh:390
\n-
bool exists(size_type i, size_type j) const
return true when (i,j) is in pattern
Definition scaledidmatrix.hh:425
\n-
Iterator RowIterator
rename the iterators for easier access
Definition scaledidmatrix.hh:89
\n-
ConstIterator const_iterator
typedef for stl compliant access
Definition scaledidmatrix.hh:123
\n-
ScaledIdentityMatrix()
Default constructor.
Definition scaledidmatrix.hh:62
\n-
bool operator==(const ScaledIdentityMatrix &other) const
comparison operator
Definition scaledidmatrix.hh:219
\n-
ConstIterator beforeBegin() const
Definition scaledidmatrix.hh:150
\n-
ScaledIdentityMatrix & operator/=(const K &k)
vector space division by scalar
Definition scaledidmatrix.hh:192
\n-
friend std::ostream & operator<<(std::ostream &s, const ScaledIdentityMatrix< K, n > &a)
Sends the matrix to an output stream.
Definition scaledidmatrix.hh:437
\n-
FieldTraits< field_type >::real_type frobenius_norm2() const
square of frobenius norm, need for block recursion
Definition scaledidmatrix.hh:368
\n-
FieldTraits< field_type >::real_type frobenius_norm() const
frobenius norm: sqrt(sum over squared values of entries)
Definition scaledidmatrix.hh:362
\n-
FieldTraits< field_type >::real_type infinity_norm() const
infinity norm (row sum norm, how to generalize for blocks?)
Definition scaledidmatrix.hh:374
\n-
ConstIterator ConstRowIterator
rename the iterators for easier access
Definition scaledidmatrix.hh:125
\n-
ConstIterator beforeEnd() const
Definition scaledidmatrix.hh:143
\n-
size_type M() const
number of blocks in column direction
Definition scaledidmatrix.hh:417
\n-
const_reference operator[](size_type i) const
Return const_reference object as row replacement.
Definition scaledidmatrix.hh:454
\n-
ScaledIdentityMatrix(const K &k)
Constructor initializing the whole matrix with a scalar.
Definition scaledidmatrix.hh:66
\n-
friend auto operator*(const ScaledIdentityMatrix &matrix, Scalar scalar)
vector space multiplication with scalar
Definition scaledidmatrix.hh:203
\n-
FieldTraits< field_type >::real_type infinity_norm_real() const
simplified infinity norm (uses Manhattan norm for complex values)
Definition scaledidmatrix.hh:380
\n-
ScaledIdentityMatrix & operator*=(const K &k)
vector space multiplication with scalar
Definition scaledidmatrix.hh:185
\n-
bool identical(const ScaledIdentityMatrix< K, n > &other) const
Definition scaledidmatrix.hh:78
\n-
void invert()
Compute inverse.
Definition scaledidmatrix.hh:398
\n-
Iterator begin()
begin iterator
Definition scaledidmatrix.hh:94
\n-
K & scalar()
Get reference to the scalar diagonal value.
Definition scaledidmatrix.hh:480
\n-
row_type reference
Definition scaledidmatrix.hh:47
\n-
K block_type
export the type representing the components
Definition scaledidmatrix.hh:40
\n-
void mmhv(const X &x, Y &y) const
y -= A^H x
Definition scaledidmatrix.hh:313
\n-
ScaledIdentityMatrix & operator+=(const ScaledIdentityMatrix &y)
vector space addition
Definition scaledidmatrix.hh:158
\n-
DiagonalRowVectorConst< K, n > const_row_type
Definition scaledidmatrix.hh:48
\n-
void mtv(const X &x, Y &y) const
y = A^T x
Definition scaledidmatrix.hh:246
\n-
reference operator[](size_type i)
Return reference object as row replacement.
Definition scaledidmatrix.hh:448
\n-
ConstIterator begin() const
begin iterator
Definition scaledidmatrix.hh:130
\n-
size_type N() const
number of blocks in row direction
Definition scaledidmatrix.hh:411
\n-
static void apply(DenseMatrix &denseMatrix, ScaledIdentityMatrix< field, N > const &rhs)
Definition scaledidmatrix.hh:493
\n-
typename ScaledIdentityMatrix< K, n >::field_type field_type
Definition scaledidmatrix.hh:506
\n-
typename FieldTraits< field_type >::real_type real_type
Definition scaledidmatrix.hh:507
\n
\n \n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,711 +1,66 @@\n dune-istl\u00a02.10\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bi_\bs_\bt_\bl\n-scaledidmatrix.hh\n+ * _\bc_\bo_\bm_\bm_\bo_\bn\n+counter.hh\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bd_\bo_\bc_\bu_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n 1// SPDX-FileCopyrightText: Copyright \u00c2\u00a9 DUNE Project contributors, see file\n LICENSE.md in module root\n 2// SPDX-License-Identifier: LicenseRef-GPL-2.0-only-with-DUNE-exception\n-3// -*- tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 2 -*-\n-4// vi: set et ts=4 sw=2 sts=2:\n-5#ifndef DUNE_ISTL_SCALEDIDMATRIX_HH\n-6#define DUNE_ISTL_SCALEDIDMATRIX_HH\n-7\n-14#include
\n-15#include \n-16#include \n-17#include \n-18#include \n-19#include \n-20#include \n-21#include \n-22\n-23namespace _\bD_\bu_\bn_\be {\n-24\n-28 template\n-_\b2_\b9 class _\bS_\bc_\ba_\bl_\be_\bd_\bI_\bd_\be_\bn_\bt_\bi_\bt_\by_\bM_\ba_\bt_\br_\bi_\bx\n-30 {\n-31 typedef DiagonalMatrixWrapper< ScaledIdentityMatrix > WrapperType;\n-32\n-33 public:\n-34 //===== type definitions and constants\n-35\n-_\b3_\b7 typedef K _\bf_\bi_\be_\bl_\bd_\b__\bt_\by_\bp_\be;\n+3#ifndef DUNE_ISTL_COMMON_COUNTER_HH\n+4#define DUNE_ISTL_COMMON_COUNTER_HH\n+5\n+6#include \n+7#include \n+8#include \n+9#include \n+10#include \n+11#include \n+12\n+13#include \n+14\n+_\b1_\b5constexpr std::size_t _\bm_\ba_\bx_\bc_\bo_\bu_\bn_\bt = 100;\n+16\n+_\b1_\b7#define DUNE_GET_COUNTER(Tag) \\\n+18 (counterFunc(Dune::PriorityTag{}, Tag{}, Dune::CounterImpl::ADLTag\n+{}))\n+19\n+_\b2_\b0#define DUNE_INC_COUNTER(Tag) \\\n+21 namespace { \\\n+22 namespace CounterImpl { \\\n+23 constexpr std::size_t \\\n+24 counterFunc(Dune::PriorityTag p, Tag, ADLTag) \\\n+25 { \\\n+26 return p.value; \\\n+27 } \\\n+28 } \\\n+29 } \\\n+30 static_assert(true, \"unfudge indentation\")\n+31\n+32namespace _\bD_\bu_\bn_\be {\n+33 namespace {\n+34\n+_\b3_\b5 namespace CounterImpl {\n+36\n+37 struct ADLTag {};\n 38\n-_\b4_\b0 typedef K _\bb_\bl_\bo_\bc_\bk_\b__\bt_\by_\bp_\be;\n-41\n-_\b4_\b3 typedef std::size_t _\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be;\n+39 template\n+40 constexpr std::size_t counterFunc(Dune::PriorityTag<0>, Tag, ADLTag)\n+41 {\n+42 return 0;\n+43 }\n 44\n-_\b4_\b6 typedef DiagonalRowVector _\br_\bo_\bw_\b__\bt_\by_\bp_\be;\n-_\b4_\b7 typedef _\br_\bo_\bw_\b__\bt_\by_\bp_\be _\br_\be_\bf_\be_\br_\be_\bn_\bc_\be;\n-_\b4_\b8 typedef DiagonalRowVectorConst _\bc_\bo_\bn_\bs_\bt_\b__\br_\bo_\bw_\b__\bt_\by_\bp_\be;\n-_\b4_\b9 typedef _\bc_\bo_\bn_\bs_\bt_\b__\br_\bo_\bw_\b__\bt_\by_\bp_\be _\bc_\bo_\bn_\bs_\bt_\b__\br_\be_\bf_\be_\br_\be_\bn_\bc_\be;\n-50\n-52 enum {\n-_\b5_\b4 _\br_\bo_\bw_\bs = n,\n-56 _\bc_\bo_\bl_\bs = n\n-_\b5_\b7 };\n-58\n-59 //===== constructors\n-_\b6_\b2 _\bS_\bc_\ba_\bl_\be_\bd_\bI_\bd_\be_\bn_\bt_\bi_\bt_\by_\bM_\ba_\bt_\br_\bi_\bx () {}\n-63\n-_\b6_\b6 _\bS_\bc_\ba_\bl_\be_\bd_\bI_\bd_\be_\bn_\bt_\bi_\bt_\by_\bM_\ba_\bt_\br_\bi_\bx (const K& k)\n-67 : p_(k)\n-68 {}\n-69\n-70 //===== assignment from scalar\n-_\b7_\b1 _\bS_\bc_\ba_\bl_\be_\bd_\bI_\bd_\be_\bn_\bt_\bi_\bt_\by_\bM_\ba_\bt_\br_\bi_\bx& _\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b=_\b (const K& k)\n-72 {\n-73 p_ = k;\n-74 return *this;\n-75 }\n-76\n-77 // check if matrix is identical to other matrix (not only identical values)\n-_\b7_\b8 bool _\bi_\bd_\be_\bn_\bt_\bi_\bc_\ba_\bl(const _\bS_\bc_\ba_\bl_\be_\bd_\bI_\bd_\be_\bn_\bt_\bi_\bt_\by_\bM_\ba_\bt_\br_\bi_\bx_\b<_\bK_\b,_\bn_\b>& other) const\n-79 {\n-80 return (this==&other);\n-81 }\n-82\n-83 //===== iterator interface to rows of the matrix\n-_\b8_\b5 typedef ContainerWrapperIterator\n-_\bI_\bt_\be_\br_\ba_\bt_\bo_\br;\n-_\b8_\b7 typedef _\bI_\bt_\be_\br_\ba_\bt_\bo_\br _\bi_\bt_\be_\br_\ba_\bt_\bo_\br;\n-_\b8_\b9 typedef _\bI_\bt_\be_\br_\ba_\bt_\bo_\br _\bR_\bo_\bw_\bI_\bt_\be_\br_\ba_\bt_\bo_\br;\n-_\b9_\b1 typedef typename row_type::Iterator _\bC_\bo_\bl_\bI_\bt_\be_\br_\ba_\bt_\bo_\br;\n-92\n-_\b9_\b4 _\bI_\bt_\be_\br_\ba_\bt_\bo_\br _\bb_\be_\bg_\bi_\bn ()\n-95 {\n-96 return _\bI_\bt_\be_\br_\ba_\bt_\bo_\br(WrapperType(this),0);\n-97 }\n-98\n-_\b1_\b0_\b0 _\bI_\bt_\be_\br_\ba_\bt_\bo_\br _\be_\bn_\bd ()\n-101 {\n-102 return _\bI_\bt_\be_\br_\ba_\bt_\bo_\br(WrapperType(this),n);\n-103 }\n-104\n-_\b1_\b0_\b7 _\bI_\bt_\be_\br_\ba_\bt_\bo_\br _\bb_\be_\bf_\bo_\br_\be_\bE_\bn_\bd ()\n-108 {\n-109 return _\bI_\bt_\be_\br_\ba_\bt_\bo_\br(WrapperType(this),n-1);\n-110 }\n-111\n-_\b1_\b1_\b4 _\bI_\bt_\be_\br_\ba_\bt_\bo_\br _\bb_\be_\bf_\bo_\br_\be_\bB_\be_\bg_\bi_\bn ()\n-115 {\n-116 return _\bI_\bt_\be_\br_\ba_\bt_\bo_\br(WrapperType(this),-1);\n-117 }\n-118\n-119\n-_\b1_\b2_\b1 typedef ContainerWrapperIterator _\bC_\bo_\bn_\bs_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br;\n-_\b1_\b2_\b3 typedef _\bC_\bo_\bn_\bs_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br _\bc_\bo_\bn_\bs_\bt_\b__\bi_\bt_\be_\br_\ba_\bt_\bo_\br;\n-_\b1_\b2_\b5 typedef _\bC_\bo_\bn_\bs_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br _\bC_\bo_\bn_\bs_\bt_\bR_\bo_\bw_\bI_\bt_\be_\br_\ba_\bt_\bo_\br;\n-_\b1_\b2_\b7 typedef typename const_row_type::ConstIterator _\bC_\bo_\bn_\bs_\bt_\bC_\bo_\bl_\bI_\bt_\be_\br_\ba_\bt_\bo_\br;\n-128\n-_\b1_\b3_\b0 _\bC_\bo_\bn_\bs_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br _\bb_\be_\bg_\bi_\bn () const\n-131 {\n-132 return _\bC_\bo_\bn_\bs_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br(WrapperType(this),0);\n-133 }\n-134\n-_\b1_\b3_\b6 _\bC_\bo_\bn_\bs_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br _\be_\bn_\bd () const\n-137 {\n-138 return _\bC_\bo_\bn_\bs_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br(WrapperType(this),n);\n-139 }\n-140\n-_\b1_\b4_\b3 _\bC_\bo_\bn_\bs_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br _\bb_\be_\bf_\bo_\br_\be_\bE_\bn_\bd() const\n-144 {\n-145 return _\bC_\bo_\bn_\bs_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br(WrapperType(this),n-1);\n-146 }\n-147\n-_\b1_\b5_\b0 _\bC_\bo_\bn_\bs_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br _\bb_\be_\bf_\bo_\br_\be_\bB_\be_\bg_\bi_\bn () const\n-151 {\n-152 return _\bC_\bo_\bn_\bs_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br(WrapperType(this),-1);\n-153 }\n-154\n-155 //===== vector space arithmetic\n-156\n-_\b1_\b5_\b8 _\bS_\bc_\ba_\bl_\be_\bd_\bI_\bd_\be_\bn_\bt_\bi_\bt_\by_\bM_\ba_\bt_\br_\bi_\bx& _\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b+_\b=_\b (const _\bS_\bc_\ba_\bl_\be_\bd_\bI_\bd_\be_\bn_\bt_\bi_\bt_\by_\bM_\ba_\bt_\br_\bi_\bx& y)\n-159 {\n-160 p_ += y.p_;\n-161 return *this;\n-162 }\n-163\n-_\b1_\b6_\b5 _\bS_\bc_\ba_\bl_\be_\bd_\bI_\bd_\be_\bn_\bt_\bi_\bt_\by_\bM_\ba_\bt_\br_\bi_\bx& _\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b-_\b=_\b (const _\bS_\bc_\ba_\bl_\be_\bd_\bI_\bd_\be_\bn_\bt_\bi_\bt_\by_\bM_\ba_\bt_\br_\bi_\bx& y)\n-166 {\n-167 p_ -= y.p_;\n-168 return *this;\n-169 }\n-170\n-_\b1_\b7_\b2 _\bS_\bc_\ba_\bl_\be_\bd_\bI_\bd_\be_\bn_\bt_\bi_\bt_\by_\bM_\ba_\bt_\br_\bi_\bx& _\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b+_\b=_\b (const K& k)\n-173 {\n-174 p_ += k;\n-175 return *this;\n-176 }\n-177\n-_\b1_\b7_\b9 _\bS_\bc_\ba_\bl_\be_\bd_\bI_\bd_\be_\bn_\bt_\bi_\bt_\by_\bM_\ba_\bt_\br_\bi_\bx& _\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b-_\b=_\b (const K& k)\n-180 {\n-181 p_ -= k;\n-182 return *this;\n-183 }\n-_\b1_\b8_\b5 _\bS_\bc_\ba_\bl_\be_\bd_\bI_\bd_\be_\bn_\bt_\bi_\bt_\by_\bM_\ba_\bt_\br_\bi_\bx& _\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b*_\b=_\b (const K& k)\n-186 {\n-187 p_ *= k;\n-188 return *this;\n-189 }\n-190\n-_\b1_\b9_\b2 _\bS_\bc_\ba_\bl_\be_\bd_\bI_\bd_\be_\bn_\bt_\bi_\bt_\by_\bM_\ba_\bt_\br_\bi_\bx& _\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b/_\b=_\b (const K& k)\n-193 {\n-194 p_ /= k;\n-195 return *this;\n-196 }\n-197\n-198 //===== binary operators\n-199\n-201 template ::value, int> = 0>\n-_\b2_\b0_\b3 friend auto _\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b*_\b ( const _\bS_\bc_\ba_\bl_\be_\bd_\bI_\bd_\be_\bn_\bt_\bi_\bt_\by_\bM_\ba_\bt_\br_\bi_\bx& matrix, Scalar _\bs_\bc_\ba_\bl_\ba_\br)\n-204 {\n-205 return _\bS_\bc_\ba_\bl_\be_\bd_\bI_\bd_\be_\bn_\bt_\bi_\bt_\by_\bM_\ba_\bt_\br_\bi_\bx_\b<_\bt_\by_\bp_\be_\bn_\ba_\bm_\be_\b _\bP_\br_\bo_\bm_\bo_\bt_\bi_\bo_\bn_\bT_\br_\ba_\bi_\bt_\bs_\b<_\bK_\b,_\bS_\bc_\ba_\bl_\ba_\br_\b>_\b:_\b:\n-_\bP_\br_\bo_\bm_\bo_\bt_\be_\bd_\bT_\by_\bp_\be, n>{matrix._\bs_\bc_\ba_\bl_\ba_\br()*_\bs_\bc_\ba_\bl_\ba_\br};\n-206 }\n-207\n-209 template ::value, int> = 0>\n-_\b2_\b1_\b1 friend auto _\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b*_\b (Scalar _\bs_\bc_\ba_\bl_\ba_\br, const _\bS_\bc_\ba_\bl_\be_\bd_\bI_\bd_\be_\bn_\bt_\bi_\bt_\by_\bM_\ba_\bt_\br_\bi_\bx& matrix)\n-212 {\n-213 return _\bS_\bc_\ba_\bl_\be_\bd_\bI_\bd_\be_\bn_\bt_\bi_\bt_\by_\bM_\ba_\bt_\br_\bi_\bx_\b<_\bt_\by_\bp_\be_\bn_\ba_\bm_\be_\b _\bP_\br_\bo_\bm_\bo_\bt_\bi_\bo_\bn_\bT_\br_\ba_\bi_\bt_\bs_\b<_\bS_\bc_\ba_\bl_\ba_\br_\b,_\bK_\b>_\b:_\b:\n-_\bP_\br_\bo_\bm_\bo_\bt_\be_\bd_\bT_\by_\bp_\be, n>{_\bs_\bc_\ba_\bl_\ba_\br*matrix._\bs_\bc_\ba_\bl_\ba_\br()};\n-214 }\n-215\n-216 //===== comparison ops\n-217\n-_\b2_\b1_\b9 bool _\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b=_\b=(const _\bS_\bc_\ba_\bl_\be_\bd_\bI_\bd_\be_\bn_\bt_\bi_\bt_\by_\bM_\ba_\bt_\br_\bi_\bx& other) const\n-220 {\n-221 return p_==other._\bs_\bc_\ba_\bl_\ba_\br();\n-222 }\n-223\n-_\b2_\b2_\b5 bool _\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b!_\b=(const _\bS_\bc_\ba_\bl_\be_\bd_\bI_\bd_\be_\bn_\bt_\bi_\bt_\by_\bM_\ba_\bt_\br_\bi_\bx& other) const\n-226 {\n-227 return p_!=other._\bs_\bc_\ba_\bl_\ba_\br();\n-228 }\n-229\n-230 //===== linear maps\n-231\n-233 template\n-_\b2_\b3_\b4 void _\bm_\bv (const X& x, Y& y) const\n-235 {\n-236#ifdef DUNE_FMatrix_WITH_CHECKING\n-237 if (x.N()!=_\bM()) DUNE_THROW(FMatrixError,\"index out of range\");\n-238 if (y.N()!=_\bN()) DUNE_THROW(FMatrixError,\"index out of range\");\n-239#endif\n-240 for (_\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be i=0; i\n-_\b2_\b4_\b6 void _\bm_\bt_\bv (const X& x, Y& y) const\n-247 {\n-248 _\bm_\bv(x, y);\n-249 }\n-250\n-252 template\n-_\b2_\b5_\b3 void _\bu_\bm_\bv (const X& x, Y& y) const\n-254 {\n-255#ifdef DUNE_FMatrix_WITH_CHECKING\n-256 if (x.N()!=_\bM()) DUNE_THROW(FMatrixError,\"index out of range\");\n-257 if (y.N()!=_\bN()) DUNE_THROW(FMatrixError,\"index out of range\");\n-258#endif\n-259 for (_\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be i=0; i\n-_\b2_\b6_\b5 void _\bu_\bm_\bt_\bv (const X& x, Y& y) const\n-266 {\n-267#ifdef DUNE_FMatrix_WITH_CHECKING\n-268 if (x.N()!=_\bN()) DUNE_THROW(FMatrixError,\"index out of range\");\n-269 if (y.N()!=_\bM()) DUNE_THROW(FMatrixError,\"index out of range\");\n-270#endif\n-271 for (_\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be i=0; i\n-_\b2_\b7_\b7 void _\bu_\bm_\bh_\bv (const X& x, Y& y) const\n-278 {\n-279#ifdef DUNE_FMatrix_WITH_CHECKING\n-280 if (x.N()!=_\bN()) DUNE_THROW(FMatrixError,\"index out of range\");\n-281 if (y.N()!=_\bM()) DUNE_THROW(FMatrixError,\"index out of range\");\n-282#endif\n-283 for (_\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be i=0; i\n-_\b2_\b8_\b9 void _\bm_\bm_\bv (const X& x, Y& y) const\n-290 {\n-291#ifdef DUNE_FMatrix_WITH_CHECKING\n-292 if (x.N()!=_\bM()) DUNE_THROW(FMatrixError,\"index out of range\");\n-293 if (y.N()!=_\bN()) DUNE_THROW(FMatrixError,\"index out of range\");\n-294#endif\n-295 for (_\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be i=0; i\n-_\b3_\b0_\b1 void _\bm_\bm_\bt_\bv (const X& x, Y& y) const\n-302 {\n-303#ifdef DUNE_FMatrix_WITH_CHECKING\n-304 if (x.N()!=_\bN()) DUNE_THROW(FMatrixError,\"index out of range\");\n-305 if (y.N()!=_\bM()) DUNE_THROW(FMatrixError,\"index out of range\");\n-306#endif\n-307 for (_\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be i=0; i\n-_\b3_\b1_\b3 void _\bm_\bm_\bh_\bv (const X& x, Y& y) const\n-314 {\n-315#ifdef DUNE_FMatrix_WITH_CHECKING\n-316 if (x.N()!=_\bN()) DUNE_THROW(FMatrixError,\"index out of range\");\n-317 if (y.N()!=_\bM()) DUNE_THROW(FMatrixError,\"index out of range\");\n-318#endif\n-319 for (_\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be i=0; i\n-_\b3_\b2_\b5 void _\bu_\bs_\bm_\bv (const K& alpha, const X& x, Y& y) const\n-326 {\n-327#ifdef DUNE_FMatrix_WITH_CHECKING\n-328 if (x.N()!=_\bM()) DUNE_THROW(FMatrixError,\"index out of range\");\n-329 if (y.N()!=_\bN()) DUNE_THROW(FMatrixError,\"index out of range\");\n-330#endif\n-331 for (_\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be i=0; i\n-_\b3_\b3_\b7 void _\bu_\bs_\bm_\bt_\bv (const K& alpha, const X& x, Y& y) const\n-338 {\n-339#ifdef DUNE_FMatrix_WITH_CHECKING\n-340 if (x.N()!=_\bN()) DUNE_THROW(FMatrixError,\"index out of range\");\n-341 if (y.N()!=_\bM()) DUNE_THROW(FMatrixError,\"index out of range\");\n-342#endif\n-343 for (_\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be i=0; i\n-_\b3_\b4_\b9 void _\bu_\bs_\bm_\bh_\bv (const K& alpha, const X& x, Y& y) const\n-350 {\n-351#ifdef DUNE_FMatrix_WITH_CHECKING\n-352 if (x.N()!=_\bN()) DUNE_THROW(FMatrixError,\"index out of range\");\n-353 if (y.N()!=_\bM()) DUNE_THROW(FMatrixError,\"index out of range\");\n-354#endif\n-355 for (_\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be i=0; i::real_type _\bf_\br_\bo_\bb_\be_\bn_\bi_\bu_\bs_\b__\bn_\bo_\br_\bm () const\n-363 {\n-364 return fvmeta::sqrt(n*p_*p_);\n-365 }\n-366\n-_\b3_\b6_\b8 typename FieldTraits::real_type _\bf_\br_\bo_\bb_\be_\bn_\bi_\bu_\bs_\b__\bn_\bo_\br_\bm_\b2 () const\n-369 {\n-370 return n*p_*p_;\n-371 }\n-372\n-_\b3_\b7_\b4 typename FieldTraits::real_type _\bi_\bn_\bf_\bi_\bn_\bi_\bt_\by_\b__\bn_\bo_\br_\bm () const\n-375 {\n-376 return std::abs(p_);\n-377 }\n-378\n-_\b3_\b8_\b0 typename FieldTraits::real_type _\bi_\bn_\bf_\bi_\bn_\bi_\bt_\by_\b__\bn_\bo_\br_\bm_\b__\br_\be_\ba_\bl () const\n-381 {\n-382 return fvmeta::absreal(p_);\n-383 }\n-384\n-385 //===== solve\n-386\n-389 template\n-_\b3_\b9_\b0 void _\bs_\bo_\bl_\bv_\be (V& x, const V& b) const\n-391 {\n-392 for (int i=0; i=n) DUNE_THROW(FMatrixError,\"row index out of range\");\n-429 if (j<0 || j>=n) DUNE_THROW(FMatrixError,\"column index out of range\");\n-430#endif\n-431 return i==j;\n-432 }\n-433\n-434 //===== conversion operator\n-435\n-_\b4_\b3_\b7 friend std::ostream& _\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b<_\b<_\b (std::ostream& s, const\n-_\bS_\bc_\ba_\bl_\be_\bd_\bI_\bd_\be_\bn_\bt_\bi_\bt_\by_\bM_\ba_\bt_\br_\bi_\bx_\b<_\bK_\b,_\bn_\b>& a)\n-438 {\n-439 for (_\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be i=0; i(&p_), i);\n-451 }\n-452\n-_\b4_\b5_\b4 _\bc_\bo_\bn_\bs_\bt_\b__\br_\be_\bf_\be_\br_\be_\bn_\bc_\be _\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b[_\b](_\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be i) const\n-455 {\n-456 return _\bc_\bo_\bn_\bs_\bt_\b__\br_\be_\bf_\be_\br_\be_\bn_\bc_\be(const_cast(&p_), i);\n-457 }\n-458\n-_\b4_\b6_\b0 const K& _\bd_\bi_\ba_\bg_\bo_\bn_\ba_\bl(_\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be /*i*/) const\n-461 {\n-462 return p_;\n-463 }\n-464\n-_\b4_\b6_\b6 K& _\bd_\bi_\ba_\bg_\bo_\bn_\ba_\bl(_\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be /*i*/)\n-467 {\n-468 return p_;\n-469 }\n-470\n-_\b4_\b7_\b3 const K& _\bs_\bc_\ba_\bl_\ba_\br() const\n-474 {\n-475 return p_;\n-476 }\n-477\n-_\b4_\b8_\b0 K& _\bs_\bc_\ba_\bl_\ba_\br()\n-481 {\n-482 return p_;\n-483 }\n-484\n-485 private:\n-486 // the data, very simply a single number\n-487 K p_;\n-488\n-489 };\n-490\n-491 template \n-_\b4_\b9_\b2 struct DenseMatrixAssigner> {\n-_\b4_\b9_\b3 static void _\ba_\bp_\bp_\bl_\by(DenseMatrix& denseMatrix,\n-494 _\bS_\bc_\ba_\bl_\be_\bd_\bI_\bd_\be_\bn_\bt_\bi_\bt_\by_\bM_\ba_\bt_\br_\bi_\bx_\b<_\bf_\bi_\be_\bl_\bd_\b,_\b _\bN_\b> const& rhs) {\n-495 assert(denseMatrix.M() == N);\n-496 assert(denseMatrix.N() == N);\n-497 denseMatrix = field(0);\n-498 for (int i = 0; i < N; ++i)\n-499 denseMatrix[i][i] = rhs._\bs_\bc_\ba_\bl_\ba_\br();\n-500 }\n-501 };\n-502\n-503 template\n-_\b5_\b0_\b4 struct FieldTraits< _\bS_\bc_\ba_\bl_\be_\bd_\bI_\bd_\be_\bn_\bt_\bi_\bt_\by_\bM_\ba_\bt_\br_\bi_\bx >\n-505 {\n-_\b5_\b0_\b6 using _\bf_\bi_\be_\bl_\bd_\b__\bt_\by_\bp_\be = typename _\bS_\bc_\ba_\bl_\be_\bd_\bI_\bd_\be_\bn_\bt_\bi_\bt_\by_\bM_\ba_\bt_\br_\bi_\bx_\b<_\bK_\b,_\b _\bn_\b>_\b:_\b:_\bf_\bi_\be_\bl_\bd_\b__\bt_\by_\bp_\be;\n-_\b5_\b0_\b7 using _\br_\be_\ba_\bl_\b__\bt_\by_\bp_\be = typename FieldTraits::real_type;\n-508 };\n-509\n-510} // end namespace\n-511\n-512#endif\n+45 } // end namespace CounterImpl\n+46 } // end empty namespace\n+47} // end namespace Dune\n+48#endif // DUNE_ISTL_COMMON_COUNTER_HH\n+_\bm_\ba_\bx_\bc_\bo_\bu_\bn_\bt\n+constexpr std::size_t maxcount\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn counter.hh:15\n _\bD_\bu_\bn_\be\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn allocator.hh:11\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bc_\ba_\bl_\be_\bd_\bI_\bd_\be_\bn_\bt_\bi_\bt_\by_\bM_\ba_\bt_\br_\bi_\bx\n-A multiple of the identity matrix of static size.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn scaledidmatrix.hh:30\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bc_\ba_\bl_\be_\bd_\bI_\bd_\be_\bn_\bt_\bi_\bt_\by_\bM_\ba_\bt_\br_\bi_\bx_\b:_\b:_\bu_\bs_\bm_\bh_\bv\n-void usmhv(const K &alpha, const X &x, Y &y) const\n-y += alpha A^H x\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn scaledidmatrix.hh:349\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bc_\ba_\bl_\be_\bd_\bI_\bd_\be_\bn_\bt_\bi_\bt_\by_\bM_\ba_\bt_\br_\bi_\bx_\b:_\b:_\bm_\bm_\bt_\bv\n-void mmtv(const X &x, Y &y) const\n-y -= A^T x\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn scaledidmatrix.hh:301\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bc_\ba_\bl_\be_\bd_\bI_\bd_\be_\bn_\bt_\bi_\bt_\by_\bM_\ba_\bt_\br_\bi_\bx_\b:_\b:_\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b-_\b=\n-ScaledIdentityMatrix & operator-=(const ScaledIdentityMatrix &y)\n-vector space subtraction\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn scaledidmatrix.hh:165\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bc_\ba_\bl_\be_\bd_\bI_\bd_\be_\bn_\bt_\bi_\bt_\by_\bM_\ba_\bt_\br_\bi_\bx_\b:_\b:_\bC_\bo_\bn_\bs_\bt_\bC_\bo_\bl_\bI_\bt_\be_\br_\ba_\bt_\bo_\br\n-const_row_type::ConstIterator ConstColIterator\n-rename the iterators for easier access\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn scaledidmatrix.hh:127\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bc_\ba_\bl_\be_\bd_\bI_\bd_\be_\bn_\bt_\bi_\bt_\by_\bM_\ba_\bt_\br_\bi_\bx_\b:_\b:_\be_\bn_\bd\n-ConstIterator end() const\n-end iterator\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn scaledidmatrix.hh:136\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bc_\ba_\bl_\be_\bd_\bI_\bd_\be_\bn_\bt_\bi_\bt_\by_\bM_\ba_\bt_\br_\bi_\bx_\b:_\b:_\bb_\be_\bf_\bo_\br_\be_\bB_\be_\bg_\bi_\bn\n-Iterator beforeBegin()\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn scaledidmatrix.hh:114\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bc_\ba_\bl_\be_\bd_\bI_\bd_\be_\bn_\bt_\bi_\bt_\by_\bM_\ba_\bt_\br_\bi_\bx_\b:_\b:_\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b!_\b=\n-bool operator!=(const ScaledIdentityMatrix &other) const\n-incomparison operator\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn scaledidmatrix.hh:225\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bc_\ba_\bl_\be_\bd_\bI_\bd_\be_\bn_\bt_\bi_\bt_\by_\bM_\ba_\bt_\br_\bi_\bx_\b:_\b:_\bm_\bm_\bv\n-void mmv(const X &x, Y &y) const\n-y -= A x\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn scaledidmatrix.hh:289\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bc_\ba_\bl_\be_\bd_\bI_\bd_\be_\bn_\bt_\bi_\bt_\by_\bM_\ba_\bt_\br_\bi_\bx_\b:_\b:_\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be\n-std::size_t size_type\n-The type used for the index access and size operations.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn scaledidmatrix.hh:43\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bc_\ba_\bl_\be_\bd_\bI_\bd_\be_\bn_\bt_\bi_\bt_\by_\bM_\ba_\bt_\br_\bi_\bx_\b:_\b:_\bu_\bs_\bm_\bv\n-void usmv(const K &alpha, const X &x, Y &y) const\n-y += alpha A x\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn scaledidmatrix.hh:325\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bc_\ba_\bl_\be_\bd_\bI_\bd_\be_\bn_\bt_\bi_\bt_\by_\bM_\ba_\bt_\br_\bi_\bx_\b:_\b:_\bC_\bo_\bl_\bI_\bt_\be_\br_\ba_\bt_\bo_\br\n-row_type::Iterator ColIterator\n-rename the iterators for easier access\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn scaledidmatrix.hh:91\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bc_\ba_\bl_\be_\bd_\bI_\bd_\be_\bn_\bt_\bi_\bt_\by_\bM_\ba_\bt_\br_\bi_\bx_\b:_\b:_\bc_\bo_\bn_\bs_\bt_\b__\br_\be_\bf_\be_\br_\be_\bn_\bc_\be\n-const_row_type const_reference\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn scaledidmatrix.hh:49\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bc_\ba_\bl_\be_\bd_\bI_\bd_\be_\bn_\bt_\bi_\bt_\by_\bM_\ba_\bt_\br_\bi_\bx_\b:_\b:_\bm_\bv\n-void mv(const X &x, Y &y) const\n-y = A x\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn scaledidmatrix.hh:234\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bc_\ba_\bl_\be_\bd_\bI_\bd_\be_\bn_\bt_\bi_\bt_\by_\bM_\ba_\bt_\br_\bi_\bx_\b:_\b:_\bu_\bm_\bt_\bv\n-void umtv(const X &x, Y &y) const\n-y += A^T x\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn scaledidmatrix.hh:265\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bc_\ba_\bl_\be_\bd_\bI_\bd_\be_\bn_\bt_\bi_\bt_\by_\bM_\ba_\bt_\br_\bi_\bx_\b:_\b:_\bu_\bm_\bh_\bv\n-void umhv(const X &x, Y &y) const\n-y += A^H x\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn scaledidmatrix.hh:277\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bc_\ba_\bl_\be_\bd_\bI_\bd_\be_\bn_\bt_\bi_\bt_\by_\bM_\ba_\bt_\br_\bi_\bx_\b:_\b:_\br_\bo_\bw_\b__\bt_\by_\bp_\be\n-DiagonalRowVector< K, n > row_type\n-Each row is implemented by a field vector.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn scaledidmatrix.hh:46\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bc_\ba_\bl_\be_\bd_\bI_\bd_\be_\bn_\bt_\bi_\bt_\by_\bM_\ba_\bt_\br_\bi_\bx_\b:_\b:_\bI_\bt_\be_\br_\ba_\bt_\bo_\br\n-ContainerWrapperIterator< const WrapperType, reference, reference > Iterator\n-Iterator class for sequential access.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn scaledidmatrix.hh:85\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bc_\ba_\bl_\be_\bd_\bI_\bd_\be_\bn_\bt_\bi_\bt_\by_\bM_\ba_\bt_\br_\bi_\bx_\b:_\b:_\bb_\be_\bf_\bo_\br_\be_\bE_\bn_\bd\n-Iterator beforeEnd()\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn scaledidmatrix.hh:107\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bc_\ba_\bl_\be_\bd_\bI_\bd_\be_\bn_\bt_\bi_\bt_\by_\bM_\ba_\bt_\br_\bi_\bx_\b:_\b:_\bd_\be_\bt_\be_\br_\bm_\bi_\bn_\ba_\bn_\bt\n-K determinant() const\n-calculates the determinant of this matrix\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn scaledidmatrix.hh:404\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bc_\ba_\bl_\be_\bd_\bI_\bd_\be_\bn_\bt_\bi_\bt_\by_\bM_\ba_\bt_\br_\bi_\bx_\b:_\b:_\bf_\bi_\be_\bl_\bd_\b__\bt_\by_\bp_\be\n-K field_type\n-export the type representing the field\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn scaledidmatrix.hh:37\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bc_\ba_\bl_\be_\bd_\bI_\bd_\be_\bn_\bt_\bi_\bt_\by_\bM_\ba_\bt_\br_\bi_\bx_\b:_\b:_\bu_\bs_\bm_\bt_\bv\n-void usmtv(const K &alpha, const X &x, Y &y) const\n-y += alpha A^T x\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn scaledidmatrix.hh:337\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bc_\ba_\bl_\be_\bd_\bI_\bd_\be_\bn_\bt_\bi_\bt_\by_\bM_\ba_\bt_\br_\bi_\bx_\b:_\b:_\be_\bn_\bd\n-Iterator end()\n-end iterator\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn scaledidmatrix.hh:100\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bc_\ba_\bl_\be_\bd_\bI_\bd_\be_\bn_\bt_\bi_\bt_\by_\bM_\ba_\bt_\br_\bi_\bx_\b:_\b:_\bi_\bt_\be_\br_\ba_\bt_\bo_\br\n-Iterator iterator\n-typedef for stl compliant access\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn scaledidmatrix.hh:87\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bc_\ba_\bl_\be_\bd_\bI_\bd_\be_\bn_\bt_\bi_\bt_\by_\bM_\ba_\bt_\br_\bi_\bx_\b:_\b:_\bs_\bc_\ba_\bl_\ba_\br\n-const K & scalar() const\n-Get const reference to the scalar diagonal value.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn scaledidmatrix.hh:473\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bc_\ba_\bl_\be_\bd_\bI_\bd_\be_\bn_\bt_\bi_\bt_\by_\bM_\ba_\bt_\br_\bi_\bx_\b:_\b:_\bu_\bm_\bv\n-void umv(const X &x, Y &y) const\n-y += A x\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn scaledidmatrix.hh:253\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bc_\ba_\bl_\be_\bd_\bI_\bd_\be_\bn_\bt_\bi_\bt_\by_\bM_\ba_\bt_\br_\bi_\bx_\b:_\b:_\bd_\bi_\ba_\bg_\bo_\bn_\ba_\bl\n-const K & diagonal(size_type) const\n-Get const reference to diagonal entry.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn scaledidmatrix.hh:460\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bc_\ba_\bl_\be_\bd_\bI_\bd_\be_\bn_\bt_\bi_\bt_\by_\bM_\ba_\bt_\br_\bi_\bx_\b:_\b:_\br_\bo_\bw_\bs\n-@ rows\n-The number of rows.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn scaledidmatrix.hh:54\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bc_\ba_\bl_\be_\bd_\bI_\bd_\be_\bn_\bt_\bi_\bt_\by_\bM_\ba_\bt_\br_\bi_\bx_\b:_\b:_\bc_\bo_\bl_\bs\n-@ cols\n-The number of columns.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn scaledidmatrix.hh:56\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bc_\ba_\bl_\be_\bd_\bI_\bd_\be_\bn_\bt_\bi_\bt_\by_\bM_\ba_\bt_\br_\bi_\bx_\b:_\b:_\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b=\n-ScaledIdentityMatrix & operator=(const K &k)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn scaledidmatrix.hh:71\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bc_\ba_\bl_\be_\bd_\bI_\bd_\be_\bn_\bt_\bi_\bt_\by_\bM_\ba_\bt_\br_\bi_\bx_\b:_\b:_\bC_\bo_\bn_\bs_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br\n-ContainerWrapperIterator< const WrapperType, const_reference, const_reference >\n-ConstIterator\n-Iterator class for sequential access.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn scaledidmatrix.hh:121\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bc_\ba_\bl_\be_\bd_\bI_\bd_\be_\bn_\bt_\bi_\bt_\by_\bM_\ba_\bt_\br_\bi_\bx_\b:_\b:_\bd_\bi_\ba_\bg_\bo_\bn_\ba_\bl\n-K & diagonal(size_type)\n-Get reference to diagonal entry.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn scaledidmatrix.hh:466\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bc_\ba_\bl_\be_\bd_\bI_\bd_\be_\bn_\bt_\bi_\bt_\by_\bM_\ba_\bt_\br_\bi_\bx_\b:_\b:_\bs_\bo_\bl_\bv_\be\n-void solve(V &x, const V &b) const\n-Solve system A x = b.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn scaledidmatrix.hh:390\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bc_\ba_\bl_\be_\bd_\bI_\bd_\be_\bn_\bt_\bi_\bt_\by_\bM_\ba_\bt_\br_\bi_\bx_\b:_\b:_\be_\bx_\bi_\bs_\bt_\bs\n-bool exists(size_type i, size_type j) const\n-return true when (i,j) is in pattern\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn scaledidmatrix.hh:425\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bc_\ba_\bl_\be_\bd_\bI_\bd_\be_\bn_\bt_\bi_\bt_\by_\bM_\ba_\bt_\br_\bi_\bx_\b:_\b:_\bR_\bo_\bw_\bI_\bt_\be_\br_\ba_\bt_\bo_\br\n-Iterator RowIterator\n-rename the iterators for easier access\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn scaledidmatrix.hh:89\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bc_\ba_\bl_\be_\bd_\bI_\bd_\be_\bn_\bt_\bi_\bt_\by_\bM_\ba_\bt_\br_\bi_\bx_\b:_\b:_\bc_\bo_\bn_\bs_\bt_\b__\bi_\bt_\be_\br_\ba_\bt_\bo_\br\n-ConstIterator const_iterator\n-typedef for stl compliant access\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn scaledidmatrix.hh:123\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bc_\ba_\bl_\be_\bd_\bI_\bd_\be_\bn_\bt_\bi_\bt_\by_\bM_\ba_\bt_\br_\bi_\bx_\b:_\b:_\bS_\bc_\ba_\bl_\be_\bd_\bI_\bd_\be_\bn_\bt_\bi_\bt_\by_\bM_\ba_\bt_\br_\bi_\bx\n-ScaledIdentityMatrix()\n-Default constructor.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn scaledidmatrix.hh:62\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bc_\ba_\bl_\be_\bd_\bI_\bd_\be_\bn_\bt_\bi_\bt_\by_\bM_\ba_\bt_\br_\bi_\bx_\b:_\b:_\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b=_\b=\n-bool operator==(const ScaledIdentityMatrix &other) const\n-comparison operator\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn scaledidmatrix.hh:219\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bc_\ba_\bl_\be_\bd_\bI_\bd_\be_\bn_\bt_\bi_\bt_\by_\bM_\ba_\bt_\br_\bi_\bx_\b:_\b:_\bb_\be_\bf_\bo_\br_\be_\bB_\be_\bg_\bi_\bn\n-ConstIterator beforeBegin() const\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn scaledidmatrix.hh:150\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bc_\ba_\bl_\be_\bd_\bI_\bd_\be_\bn_\bt_\bi_\bt_\by_\bM_\ba_\bt_\br_\bi_\bx_\b:_\b:_\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b/_\b=\n-ScaledIdentityMatrix & operator/=(const K &k)\n-vector space division by scalar\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn scaledidmatrix.hh:192\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bc_\ba_\bl_\be_\bd_\bI_\bd_\be_\bn_\bt_\bi_\bt_\by_\bM_\ba_\bt_\br_\bi_\bx_\b:_\b:_\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b<_\b<\n-friend std::ostream & operator<<(std::ostream &s, const ScaledIdentityMatrix<\n-K, n > &a)\n-Sends the matrix to an output stream.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn scaledidmatrix.hh:437\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bc_\ba_\bl_\be_\bd_\bI_\bd_\be_\bn_\bt_\bi_\bt_\by_\bM_\ba_\bt_\br_\bi_\bx_\b:_\b:_\bf_\br_\bo_\bb_\be_\bn_\bi_\bu_\bs_\b__\bn_\bo_\br_\bm_\b2\n-FieldTraits< field_type >::real_type frobenius_norm2() const\n-square of frobenius norm, need for block recursion\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn scaledidmatrix.hh:368\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bc_\ba_\bl_\be_\bd_\bI_\bd_\be_\bn_\bt_\bi_\bt_\by_\bM_\ba_\bt_\br_\bi_\bx_\b:_\b:_\bf_\br_\bo_\bb_\be_\bn_\bi_\bu_\bs_\b__\bn_\bo_\br_\bm\n-FieldTraits< field_type >::real_type frobenius_norm() const\n-frobenius norm: sqrt(sum over squared values of entries)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn scaledidmatrix.hh:362\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bc_\ba_\bl_\be_\bd_\bI_\bd_\be_\bn_\bt_\bi_\bt_\by_\bM_\ba_\bt_\br_\bi_\bx_\b:_\b:_\bi_\bn_\bf_\bi_\bn_\bi_\bt_\by_\b__\bn_\bo_\br_\bm\n-FieldTraits< field_type >::real_type infinity_norm() const\n-infinity norm (row sum norm, how to generalize for blocks?)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn scaledidmatrix.hh:374\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bc_\ba_\bl_\be_\bd_\bI_\bd_\be_\bn_\bt_\bi_\bt_\by_\bM_\ba_\bt_\br_\bi_\bx_\b:_\b:_\bC_\bo_\bn_\bs_\bt_\bR_\bo_\bw_\bI_\bt_\be_\br_\ba_\bt_\bo_\br\n-ConstIterator ConstRowIterator\n-rename the iterators for easier access\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn scaledidmatrix.hh:125\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bc_\ba_\bl_\be_\bd_\bI_\bd_\be_\bn_\bt_\bi_\bt_\by_\bM_\ba_\bt_\br_\bi_\bx_\b:_\b:_\bb_\be_\bf_\bo_\br_\be_\bE_\bn_\bd\n-ConstIterator beforeEnd() const\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn scaledidmatrix.hh:143\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bc_\ba_\bl_\be_\bd_\bI_\bd_\be_\bn_\bt_\bi_\bt_\by_\bM_\ba_\bt_\br_\bi_\bx_\b:_\b:_\bM\n-size_type M() const\n-number of blocks in column direction\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn scaledidmatrix.hh:417\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bc_\ba_\bl_\be_\bd_\bI_\bd_\be_\bn_\bt_\bi_\bt_\by_\bM_\ba_\bt_\br_\bi_\bx_\b:_\b:_\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b[_\b]\n-const_reference operator[](size_type i) const\n-Return const_reference object as row replacement.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn scaledidmatrix.hh:454\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bc_\ba_\bl_\be_\bd_\bI_\bd_\be_\bn_\bt_\bi_\bt_\by_\bM_\ba_\bt_\br_\bi_\bx_\b:_\b:_\bS_\bc_\ba_\bl_\be_\bd_\bI_\bd_\be_\bn_\bt_\bi_\bt_\by_\bM_\ba_\bt_\br_\bi_\bx\n-ScaledIdentityMatrix(const K &k)\n-Constructor initializing the whole matrix with a scalar.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn scaledidmatrix.hh:66\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bc_\ba_\bl_\be_\bd_\bI_\bd_\be_\bn_\bt_\bi_\bt_\by_\bM_\ba_\bt_\br_\bi_\bx_\b:_\b:_\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b*\n-friend auto operator*(const ScaledIdentityMatrix &matrix, Scalar scalar)\n-vector space multiplication with scalar\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn scaledidmatrix.hh:203\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bc_\ba_\bl_\be_\bd_\bI_\bd_\be_\bn_\bt_\bi_\bt_\by_\bM_\ba_\bt_\br_\bi_\bx_\b:_\b:_\bi_\bn_\bf_\bi_\bn_\bi_\bt_\by_\b__\bn_\bo_\br_\bm_\b__\br_\be_\ba_\bl\n-FieldTraits< field_type >::real_type infinity_norm_real() const\n-simplified infinity norm (uses Manhattan norm for complex values)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn scaledidmatrix.hh:380\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bc_\ba_\bl_\be_\bd_\bI_\bd_\be_\bn_\bt_\bi_\bt_\by_\bM_\ba_\bt_\br_\bi_\bx_\b:_\b:_\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b*_\b=\n-ScaledIdentityMatrix & operator*=(const K &k)\n-vector space multiplication with scalar\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn scaledidmatrix.hh:185\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bc_\ba_\bl_\be_\bd_\bI_\bd_\be_\bn_\bt_\bi_\bt_\by_\bM_\ba_\bt_\br_\bi_\bx_\b:_\b:_\bi_\bd_\be_\bn_\bt_\bi_\bc_\ba_\bl\n-bool identical(const ScaledIdentityMatrix< K, n > &other) const\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn scaledidmatrix.hh:78\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bc_\ba_\bl_\be_\bd_\bI_\bd_\be_\bn_\bt_\bi_\bt_\by_\bM_\ba_\bt_\br_\bi_\bx_\b:_\b:_\bi_\bn_\bv_\be_\br_\bt\n-void invert()\n-Compute inverse.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn scaledidmatrix.hh:398\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bc_\ba_\bl_\be_\bd_\bI_\bd_\be_\bn_\bt_\bi_\bt_\by_\bM_\ba_\bt_\br_\bi_\bx_\b:_\b:_\bb_\be_\bg_\bi_\bn\n-Iterator begin()\n-begin iterator\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn scaledidmatrix.hh:94\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bc_\ba_\bl_\be_\bd_\bI_\bd_\be_\bn_\bt_\bi_\bt_\by_\bM_\ba_\bt_\br_\bi_\bx_\b:_\b:_\bs_\bc_\ba_\bl_\ba_\br\n-K & scalar()\n-Get reference to the scalar diagonal value.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn scaledidmatrix.hh:480\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bc_\ba_\bl_\be_\bd_\bI_\bd_\be_\bn_\bt_\bi_\bt_\by_\bM_\ba_\bt_\br_\bi_\bx_\b:_\b:_\br_\be_\bf_\be_\br_\be_\bn_\bc_\be\n-row_type reference\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn scaledidmatrix.hh:47\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bc_\ba_\bl_\be_\bd_\bI_\bd_\be_\bn_\bt_\bi_\bt_\by_\bM_\ba_\bt_\br_\bi_\bx_\b:_\b:_\bb_\bl_\bo_\bc_\bk_\b__\bt_\by_\bp_\be\n-K block_type\n-export the type representing the components\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn scaledidmatrix.hh:40\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bc_\ba_\bl_\be_\bd_\bI_\bd_\be_\bn_\bt_\bi_\bt_\by_\bM_\ba_\bt_\br_\bi_\bx_\b:_\b:_\bm_\bm_\bh_\bv\n-void mmhv(const X &x, Y &y) const\n-y -= A^H x\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn scaledidmatrix.hh:313\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bc_\ba_\bl_\be_\bd_\bI_\bd_\be_\bn_\bt_\bi_\bt_\by_\bM_\ba_\bt_\br_\bi_\bx_\b:_\b:_\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b+_\b=\n-ScaledIdentityMatrix & operator+=(const ScaledIdentityMatrix &y)\n-vector space addition\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn scaledidmatrix.hh:158\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bc_\ba_\bl_\be_\bd_\bI_\bd_\be_\bn_\bt_\bi_\bt_\by_\bM_\ba_\bt_\br_\bi_\bx_\b:_\b:_\bc_\bo_\bn_\bs_\bt_\b__\br_\bo_\bw_\b__\bt_\by_\bp_\be\n-DiagonalRowVectorConst< K, n > const_row_type\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn scaledidmatrix.hh:48\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bc_\ba_\bl_\be_\bd_\bI_\bd_\be_\bn_\bt_\bi_\bt_\by_\bM_\ba_\bt_\br_\bi_\bx_\b:_\b:_\bm_\bt_\bv\n-void mtv(const X &x, Y &y) const\n-y = A^T x\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn scaledidmatrix.hh:246\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bc_\ba_\bl_\be_\bd_\bI_\bd_\be_\bn_\bt_\bi_\bt_\by_\bM_\ba_\bt_\br_\bi_\bx_\b:_\b:_\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b[_\b]\n-reference operator[](size_type i)\n-Return reference object as row replacement.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn scaledidmatrix.hh:448\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bc_\ba_\bl_\be_\bd_\bI_\bd_\be_\bn_\bt_\bi_\bt_\by_\bM_\ba_\bt_\br_\bi_\bx_\b:_\b:_\bb_\be_\bg_\bi_\bn\n-ConstIterator begin() const\n-begin iterator\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn scaledidmatrix.hh:130\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bc_\ba_\bl_\be_\bd_\bI_\bd_\be_\bn_\bt_\bi_\bt_\by_\bM_\ba_\bt_\br_\bi_\bx_\b:_\b:_\bN\n-size_type N() const\n-number of blocks in row direction\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn scaledidmatrix.hh:411\n-_\bD_\bu_\bn_\be_\b:_\b:_\bD_\be_\bn_\bs_\be_\bM_\ba_\bt_\br_\bi_\bx_\bA_\bs_\bs_\bi_\bg_\bn_\be_\br_\b<_\b _\bD_\be_\bn_\bs_\be_\bM_\ba_\bt_\br_\bi_\bx_\b,_\b _\bS_\bc_\ba_\bl_\be_\bd_\bI_\bd_\be_\bn_\bt_\bi_\bt_\by_\bM_\ba_\bt_\br_\bi_\bx_\b<_\b _\bf_\bi_\be_\bl_\bd_\b,_\b _\bN_\b _\b>_\b _\b>_\b:_\b:\n-_\ba_\bp_\bp_\bl_\by\n-static void apply(DenseMatrix &denseMatrix, ScaledIdentityMatrix< field, N >\n-const &rhs)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn scaledidmatrix.hh:493\n-_\bD_\bu_\bn_\be_\b:_\b:_\bF_\bi_\be_\bl_\bd_\bT_\br_\ba_\bi_\bt_\bs_\b<_\b _\bS_\bc_\ba_\bl_\be_\bd_\bI_\bd_\be_\bn_\bt_\bi_\bt_\by_\bM_\ba_\bt_\br_\bi_\bx_\b<_\b _\bK_\b,_\b _\bn_\b _\b>_\b _\b>_\b:_\b:_\bf_\bi_\be_\bl_\bd_\b__\bt_\by_\bp_\be\n-typename ScaledIdentityMatrix< K, n >::field_type field_type\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn scaledidmatrix.hh:506\n-_\bD_\bu_\bn_\be_\b:_\b:_\bF_\bi_\be_\bl_\bd_\bT_\br_\ba_\bi_\bt_\bs_\b<_\b _\bS_\bc_\ba_\bl_\be_\bd_\bI_\bd_\be_\bn_\bt_\bi_\bt_\by_\bM_\ba_\bt_\br_\bi_\bx_\b<_\b _\bK_\b,_\b _\bn_\b _\b>_\b _\b>_\b:_\b:_\br_\be_\ba_\bl_\b__\bt_\by_\bp_\be\n-typename FieldTraits< field_type >::real_type real_type\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn scaledidmatrix.hh:507\n ===============================================================================\n Generated by\u00a0_\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b] 1.9.8\n"}]}, {"source1": "./usr/share/doc/libdune-istl-doc/doxygen/a00023.html", "source2": "./usr/share/doc/libdune-istl-doc/doxygen/a00023.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n dune-istl: btdmatrix.hh File Reference \n+dune-istl: registry.hh File Reference \n \n-\n-
Implementation of the BTDMatrix class. \n-More...
\n-
#include <dune/common/fmatrix.hh>\n-
#include <dune/common/scalarvectorview.hh>\n-
#include <dune/common/scalarmatrixview.hh>\n-
#include <dune/istl/bcrsmatrix.hh >\n-
#include <dune/istl/blocklevel.hh >\n+
#include <cstddef>\n+
#include <iostream>\n+
#include <memory>\n+
#include <string>\n+
#include <utility>\n+
#include "counter.hh "\n+
#include <dune/common/typelist.hh>\n+
#include <dune/common/hybridutilities.hh>\n+
#include <dune/common/parameterizedobject.hh>\n
\n
Go to the source code of this file.
\n
\n namespace Dune
\n-
\n-
Implementation of the BTDMatrix class.
\n-
Author Oliver Sander \n-
\n+\n+
\n+
◆ \n+\n+
\n+
\n+
\n+ \n+ #define DUNE_REGISTRY_PUT \n+ ( \n+ \n+ Tag, \n+ \n+ \n+ \n+ id, \n+ \n+ \n+ \n+ ... \n+ \n+ ) \n+ \n+
\n+
\n+
Value: namespace { \\
\n+
template <> \\
\n+
\n+
{ \\
\n+
static auto getCreator() \\
\n+
{ \\
\n+
return __VA_ARGS__; \\
\n+
} \\
\n+
static std::string name() { return id; } \\
\n+
}; \\
\n+
} \\
\n+
DUNE_INC_COUNTER(Tag)
\n+
#define DUNE_GET_COUNTER(Tag)
Definition counter.hh:17
\n+
\n+
\n+
\n+
\n-#include \n-#include \n-#include <_\bd_\bu_\bn_\be_\b/_\bi_\bs_\bt_\bl_\b/_\bb_\bc_\br_\bs_\bm_\ba_\bt_\br_\bi_\bx_\b._\bh_\bh>\n-#include <_\bd_\bu_\bn_\be_\b/_\bi_\bs_\bt_\bl_\b/_\bb_\bl_\bo_\bc_\bk_\bl_\be_\bv_\be_\bl_\b._\bh_\bh>\n+ * _\bc_\bo_\bm_\bm_\bo_\bn\n+_\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs | _\bM_\ba_\bc_\br_\bo_\bs\n+registry.hh File Reference\n+#include \n+#include \n+#include \n+#include \n+#include \n+#include \"_\bc_\bo_\bu_\bn_\bt_\be_\br_\b._\bh_\bh\"\n+#include \n+#include \n+#include \n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bs_\bo_\bu_\br_\bc_\be_\b _\bc_\bo_\bd_\be_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n-C\bCl\bla\bas\bss\bse\bes\bs\n- class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bB_\bT_\bD_\bM_\ba_\bt_\br_\bi_\bx_\b<_\b _\bB_\b,_\b _\bA_\b _\b>\n-\u00a0 A block-tridiagonal matrix. _\bM_\bo_\br_\be_\b._\b._\b.\n-\u00a0\n-struct \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bF_\bi_\be_\bl_\bd_\bT_\br_\ba_\bi_\bt_\bs_\b<_\b _\bB_\bT_\bD_\bM_\ba_\bt_\br_\bi_\bx_\b<_\b _\bB_\b,_\b _\bA_\b _\b>_\b _\b>\n-\u00a0\n N\bNa\bam\bme\bes\bsp\bpa\bac\bce\bes\bs\n namespace \u00a0 _\bD_\bu_\bn_\be\n \u00a0\n-*\b**\b**\b**\b**\b* D\bDe\bet\bta\bai\bil\ble\bed\bd D\bDe\bes\bsc\bcr\bri\bip\bpt\bti\bio\bon\bn *\b**\b**\b**\b**\b*\n-Implementation of the BTDMatrix class.\n- Author\n- Oliver Sander\n+M\bMa\bac\bcr\bro\bos\bs\n+#define\u00a0 _\bD_\bU_\bN_\bE_\b__\bR_\bE_\bG_\bI_\bS_\bT_\bR_\bY_\b__\bP_\bU_\bT(Tag, id, ...)\n+\u00a0\n+*\b**\b**\b**\b**\b* M\bMa\bac\bcr\bro\bo D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn D\bDo\boc\bcu\bum\bme\ben\bnt\bta\bat\bti\bio\bon\bn *\b**\b**\b**\b**\b*\n+*\b**\b**\b**\b**\b* _\b?\b\u25c6_\b?\b\u00a0D\bDU\bUN\bNE\bE_\b_R\bRE\bEG\bGI\bIS\bST\bTR\bRY\bY_\b_P\bPU\bUT\bT *\b**\b**\b**\b**\b*\n+#define DUNE_REGISTRY_PUT ( \u00a0 Tag,\n+ \u00a0 id,\n+ \u00a0 .\b..\b..\b.\u00a0\n+ )\n+V\bVa\bal\blu\bue\be:\b:\n+namespace { \\\n+template<> \\\n+struct Registry \\\n+{ \\\n+static auto getCreator() \\\n+{ \\\n+return __VA_ARGS__; \\\n+} \\\n+static std::string name() { return id; } \\\n+}; \\\n+} \\\n+DUNE_INC_COUNTER(Tag)\n+_\bD_\bU_\bN_\bE_\b__\bG_\bE_\bT_\b__\bC_\bO_\bU_\bN_\bT_\bE_\bR\n+#define DUNE_GET_COUNTER(Tag)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn counter.hh:17\n ===============================================================================\n Generated by\u00a0_\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b] 1.9.8\n"}]}, {"source1": "./usr/share/doc/libdune-istl-doc/doxygen/a00023_source.html", "source2": "./usr/share/doc/libdune-istl-doc/doxygen/a00023_source.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n dune-istl: btdmatrix.hh Source File \n+dune-istl: registry.hh Source File \n \n
Go to the documentation of this file. \n
\n-
\n-
\n-
5 #ifndef DUNE_ISTL_BTDMATRIX_HH \n-
6 #define DUNE_ISTL_BTDMATRIX_HH \n-
\n-
8 #include <dune/common/fmatrix.hh> \n-
9 #include <dune/common/scalarvectorview.hh> \n-
10 #include <dune/common/scalarmatrixview.hh> \n-
\n-
\n+
3 #ifndef DUNE_ISTL_COMMON_REGISTRY_HH \n+
4 #define DUNE_ISTL_COMMON_REGISTRY_HH \n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n
\n-
\n-
29 template <
class B,
class A=std::allocator<B> >
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
37 using field_type =
typename Imp::BlockTraits<B>::field_type;
\n+
14 #include <dune/common/typelist.hh> \n+
15 #include <dune/common/hybridutilities.hh> \n+
16 #include <dune/common/parameterizedobject.hh> \n+
\n+
\n+
18 #define DUNE_REGISTRY_PUT(Tag, id, ...) \\ \n+
\n+
\n+
21 struct Registry<Tag, DUNE_GET_COUNTER(Tag)> \\ \n+
\n+
23 static auto getCreator() \\ \n+
\n+
25 return __VA_ARGS__; \\ \n+
\n+
27 static std::string name() { return id; } \\ \n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
35 template <
class Tag, std::
size_t index>
\n+
\n+
\n
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
59 for (
size_t i=0; i<size; i++)
\n-
\n-
\n-
\n-
\n-
\n-
65 for (
size_t i=0; i<size; i++) {
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
79 auto nonZeros = (size==0) ? 0 : size + 2*(size-1);
\n-
\n-
\n-
\n-
\n-
\n-
\n-
86 for (
size_t i=0; i<size; i++)
\n-
\n-
\n-
\n-
\n-
\n-
92 for (
size_t i=0; i<size; i++) {
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
121 void solve (V& x,
const V& rhs)
const {
\n-
\n-
\n-
\n-
125 auto && x0 = Impl::asVector(x[0]);
\n-
126 auto && rhs0 = Impl::asVector(rhs[0]);
\n-
127 Impl::asMatrix((*
this )[0][0]).solve(x0, rhs0);
\n-
\n-
\n-
\n-
\n-
\n-
133 std::vector<block_type> c(this->
N ()-1);
\n-
134 for (
size_t i=0; i<this->
N ()-1; i++)
\n-
135 c[i] = (*
this )[i][i+1];
\n-
\n-
\n-
\n-
139 Impl::asMatrix(a_00_inv).invert();
\n-
\n-
\n-
\n-
143 Impl::asMatrix(tmp).rightmultiply(Impl::asMatrix(c[0]));
\n-
\n-
\n-
\n-
\n-
148 auto && d_0 = Impl::asVector(d[0]);
\n-
149 Impl::asMatrix(a_00_inv).mv(Impl::asVector(d_0_tmp),d_0);
\n-
\n-
151 for (
unsigned int i = 1; i < this->
N (); i++) {
\n-
\n-
\n-
\n-
155 tmp = (*this)[i][i-1];
\n-
156 Impl::asMatrix(tmp).rightmultiply(Impl::asMatrix(c[i-1]));
\n-
\n-
\n-
\n-
160 Impl::asMatrix(
id ).invert();
\n-
\n-
\n-
163 Impl::asMatrix(c[i]).leftmultiply(Impl::asMatrix(
id ));
\n-
\n-
\n-
\n-
167 auto && d_i = Impl::asVector(d[i]);
\n-
168 Impl::asMatrix((*
this )[i][i-1]).mmv(Impl::asVector(d[i-1]), d_i);
\n-
\n-
170 Impl::asMatrix(
id ).mv(Impl::asVector(tmpVec), d_i);
\n-
\n-
\n-
\n-
174 x[this->
N () - 1] = d[this->
N () - 1];
\n-
175 for (
int i = this->
N () - 2; i >= 0; i--) {
\n-
\n-
\n-
178 auto && x_i = Impl::asVector(x[i]);
\n-
179 Impl::asMatrix(c[i]).mmv(Impl::asVector(x[i+1]), x_i);
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
195 void endrowsizes () {}
\n-
\n-
197 void endindices () {}
\n-
\n-
\n-
\n-
200 template <
typename B,
typename A>
\n-
\n-
\n-
\n-
\n-
204 using real_type =
typename FieldTraits<field_type>::real_type;
\n-
\n-
\n-
\n-
\n-
\n-
\n-
Implementation of the BCRSMatrix class.
\n-
Helper functions for determining the vector/matrix block level.
\n-
Col col
Definition matrixmatrix.hh:351
\n+
\n+
40 template <
template <
class >
class Base,
class V,
class Tag,
typename ... Args>
\n+
41 auto registryGet(Tag , std::string name, Args... args)
\n+
\n+
\n+
44 std::shared_ptr<Base<V> > result;
\n+
45 Dune::Hybrid::forEach(std::make_index_sequence<count>{},
\n+
\n+
47 using Reg = Registry<Tag, index>;
\n+
48 if (!result && Reg::name() == name) {
\n+
49 result = Reg::getCreator()(Dune::MetaType<V>{}, args...);
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
60 template <
class V,
class Type,
class Tag,
class ... Args>
\n+
61 int addRegistryToFactory(Dune::ParameterizedObjectFactory<Type(Args...), std::string>& factory,
\n+
\n+
\n+
64 Dune::Hybrid::forEach(std::make_index_sequence<count>{},
\n+
\n+
\n+
\n+
\n+
69 using Reg = Registry<Tag, index>;
\n+
70 auto genericcreator = Reg::getCreator();
\n+
71 factory.define(Reg::name(), [genericcreator](Args... args){
\n+
72 return genericcreator(V{}, args...);
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
#define DUNE_GET_COUNTER(Tag)
Definition counter.hh:17
\n
Definition allocator.hh:11
\n-
A sparse block matrix with compressed row storage.
Definition bcrsmatrix.hh:466
\n-
void endrowsizes()
indicate that size of all rows is defined
Definition bcrsmatrix.hh:1146
\n-
@ random
Build entries randomly.
Definition bcrsmatrix.hh:526
\n-
void addindex(size_type row, size_type col)
add index (row,col) to the matrix
Definition bcrsmatrix.hh:1188
\n-
void endindices()
indicate that all indices are defined, check consistency
Definition bcrsmatrix.hh:1269
\n-
size_type N() const
number of rows (counted in blocks)
Definition bcrsmatrix.hh:2001
\n-
void setSize(size_type rows, size_type columns, size_type nnz=0)
Set the size of the matrix.
Definition bcrsmatrix.hh:858
\n-
BCRSMatrix & operator=(const BCRSMatrix &Mat)
assignment
Definition bcrsmatrix.hh:908
\n-
A block-tridiagonal matrix.
Definition btdmatrix.hh:31
\n-
BTDMatrix(size_type size)
Definition btdmatrix.hh:54
\n-
void solve(V &x, const V &rhs) const
Use the Thomas algorithm to solve the system Ax=b in O(n) time.
Definition btdmatrix.hh:121
\n-
A::size_type size_type
implement row_type with compressed vector
Definition btdmatrix.hh:49
\n-
A allocator_type
export the allocator type
Definition btdmatrix.hh:43
\n-
B block_type
export the type representing the components
Definition btdmatrix.hh:40
\n-
typename Imp::BlockTraits< B >::field_type field_type
export the type representing the field
Definition btdmatrix.hh:37
\n-
BTDMatrix & operator=(const BTDMatrix &other)
assignment
Definition btdmatrix.hh:104
\n-
BTDMatrix()
Default constructor.
Definition btdmatrix.hh:52
\n-
void setSize(size_type size)
Resize the matrix. Invalidates the content!
Definition btdmatrix.hh:77
\n-
typename FieldTraits< field_type >::real_type real_type
Definition btdmatrix.hh:204
\n-
typename BTDMatrix< B, A >::field_type field_type
Definition btdmatrix.hh:203
\n
\n-9#include \n-10#include \n-11#include <_\bd_\bu_\bn_\be_\b/_\bi_\bs_\bt_\bl_\b/_\bb_\bc_\br_\bs_\bm_\ba_\bt_\br_\bi_\bx_\b._\bh_\bh>\n-12#include <_\bd_\bu_\bn_\be_\b/_\bi_\bs_\bt_\bl_\b/_\bb_\bl_\bo_\bc_\bk_\bl_\be_\bv_\be_\bl_\b._\bh_\bh>\n+3#ifndef DUNE_ISTL_COMMON_REGISTRY_HH\n+4#define DUNE_ISTL_COMMON_REGISTRY_HH\n+5\n+6#include \n+7#include \n+8#include \n+9#include \n+10#include \n+11\n+12#include \"_\bc_\bo_\bu_\bn_\bt_\be_\br_\b._\bh_\bh\"\n 13\n-19namespace _\bD_\bu_\bn_\be {\n-29 template >\n-_\b3_\b0 class _\bB_\bT_\bD_\bM_\ba_\bt_\br_\bi_\bx : public _\bB_\bC_\bR_\bS_\bM_\ba_\bt_\br_\bi_\bx\n-31 {\n-32 public:\n-33\n-34 //===== type definitions and constants\n-35\n-_\b3_\b7 using _\bf_\bi_\be_\bl_\bd_\b__\bt_\by_\bp_\be = typename Imp::BlockTraits::field_type;\n+14#include \n+15#include \n+16#include \n+17\n+_\b1_\b8#define DUNE_REGISTRY_PUT(Tag, id, ...) \\\n+19 namespace { \\\n+20 template<> \\\n+21 struct Registry \\\n+22 { \\\n+23 static auto getCreator() \\\n+24 { \\\n+25 return __VA_ARGS__; \\\n+26 } \\\n+27 static std::string name() { return id; } \\\n+28 }; \\\n+29 } \\\n+30 DUNE_INC_COUNTER(Tag)\n+31\n+32\n+33namespace _\bD_\bu_\bn_\be {\n+34 namespace {\n+35 template\n+36 struct Registry;\n+37 }\n 38\n-_\b4_\b0 typedef B _\bb_\bl_\bo_\bc_\bk_\b__\bt_\by_\bp_\be;\n-41\n-_\b4_\b3 typedef A _\ba_\bl_\bl_\bo_\bc_\ba_\bt_\bo_\br_\b__\bt_\by_\bp_\be;\n-44\n-46 //typedef BCRSMatrix::row_type row_type;\n-47\n-_\b4_\b9 typedef typename A::size_type _\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be;\n-50\n-_\b5_\b2 _\bB_\bT_\bD_\bM_\ba_\bt_\br_\bi_\bx() : _\bB_\bC_\bR_\bS_\bM_\ba_\bt_\br_\bi_\bx() {}\n-53\n-_\b5_\b4 explicit _\bB_\bT_\bD_\bM_\ba_\bt_\br_\bi_\bx(_\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be size)\n-55 : _\bB_\bC_\bR_\bS_\bM_\ba_\bt_\br_\bi_\bx(size, size, _\bB_\bC_\bR_\bS_\bM_\ba_\bt_\br_\bi_\bx::_\br_\ba_\bn_\bd_\bo_\bm)\n-56 {\n-57 // Set number of entries for each row\n-58 // All rows get three entries, except for the first and the last one\n-59 for (size_t i=0; i_\bB_\bC_\bR_\bS_\bM_\ba_\bt_\br_\bi_\bx_\b<_\bB_\b,_\bA_\b>_\b:_\b:_\bs_\be_\bt_\br_\bo_\bw_\bs_\bi_\bz_\be(i, 3 - (i==0) - (i==(size-1)));\n-61\n-62 this->_\bB_\bC_\bR_\bS_\bM_\ba_\bt_\br_\bi_\bx_\b<_\bB_\b,_\bA_\b>_\b:_\b:_\be_\bn_\bd_\br_\bo_\bw_\bs_\bi_\bz_\be_\bs();\n-63\n-64 // The actual entries for each row\n-65 for (size_t i=0; i0)\n-67 this->_\bB_\bC_\bR_\bS_\bM_\ba_\bt_\br_\bi_\bx_\b<_\bB_\b,_\bA_\b>_\b:_\b:_\ba_\bd_\bd_\bi_\bn_\bd_\be_\bx(i, i-1);\n-68 this->_\bB_\bC_\bR_\bS_\bM_\ba_\bt_\br_\bi_\bx_\b<_\bB_\b,_\bA_\b>_\b:_\b:_\ba_\bd_\bd_\bi_\bn_\bd_\be_\bx(i, i );\n-69 if (i_\bB_\bC_\bR_\bS_\bM_\ba_\bt_\br_\bi_\bx_\b<_\bB_\b,_\bA_\b>_\b:_\b:_\ba_\bd_\bd_\bi_\bn_\bd_\be_\bx(i, i+1);\n-71 }\n-72\n-73 this->_\bB_\bC_\bR_\bS_\bM_\ba_\bt_\br_\bi_\bx_\b<_\bB_\b,_\bA_\b>_\b:_\b:_\be_\bn_\bd_\bi_\bn_\bd_\bi_\bc_\be_\bs();\n-74 }\n-75\n-_\b7_\b7 void _\bs_\be_\bt_\bS_\bi_\bz_\be(size_type size)\n-78 {\n-79 auto nonZeros = (size==0) ? 0 : size + 2*(size-1);\n-80 this->_\bB_\bC_\bR_\bS_\bM_\ba_\bt_\br_\bi_\bx_\b<_\bB_\b,_\bA_\b>_\b:_\b:_\bs_\be_\bt_\bS_\bi_\bz_\be(size, // rows\n-81 size, // columns\n-82 nonZeros);\n-83\n-84 // Set number of entries for each row\n-85 // All rows get three entries, except for the first and the last one\n-86 for (size_t i=0; i_\bB_\bC_\bR_\bS_\bM_\ba_\bt_\br_\bi_\bx_\b<_\bB_\b,_\bA_\b>_\b:_\b:_\bs_\be_\bt_\br_\bo_\bw_\bs_\bi_\bz_\be(i, 3 - (i==0) - (i==(size-1)));\n-88\n-89 this->_\bB_\bC_\bR_\bS_\bM_\ba_\bt_\br_\bi_\bx_\b<_\bB_\b,_\bA_\b>_\b:_\b:_\be_\bn_\bd_\br_\bo_\bw_\bs_\bi_\bz_\be_\bs();\n-90\n-91 // The actual entries for each row\n-92 for (size_t i=0; i0)\n-94 this->_\bB_\bC_\bR_\bS_\bM_\ba_\bt_\br_\bi_\bx_\b<_\bB_\b,_\bA_\b>_\b:_\b:_\ba_\bd_\bd_\bi_\bn_\bd_\be_\bx(i, i-1);\n-95 this->_\bB_\bC_\bR_\bS_\bM_\ba_\bt_\br_\bi_\bx_\b<_\bB_\b,_\bA_\b>_\b:_\b:_\ba_\bd_\bd_\bi_\bn_\bd_\be_\bx(i, i );\n-96 if (i_\bB_\bC_\bR_\bS_\bM_\ba_\bt_\br_\bi_\bx_\b<_\bB_\b,_\bA_\b>_\b:_\b:_\ba_\bd_\bd_\bi_\bn_\bd_\be_\bx(i, i+1);\n-98 }\n-99\n-100 this->_\bB_\bC_\bR_\bS_\bM_\ba_\bt_\br_\bi_\bx_\b<_\bB_\b,_\bA_\b>_\b:_\b:_\be_\bn_\bd_\bi_\bn_\bd_\bi_\bc_\be_\bs();\n-101 }\n-102\n-_\b1_\b0_\b4 _\bB_\bT_\bD_\bM_\ba_\bt_\br_\bi_\bx& _\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b=_\b (const _\bB_\bT_\bD_\bM_\ba_\bt_\br_\bi_\bx& other) {\n-105 this->_\bB_\bC_\bR_\bS_\bM_\ba_\bt_\br_\bi_\bx_\b<_\bB_\b,_\bA_\b>_\b:_\b:_\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b=(other);\n-106 return *this;\n-107 }\n-108\n-_\b1_\b1_\b0 _\bB_\bT_\bD_\bM_\ba_\bt_\br_\bi_\bx& _\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b=_\b (const _\bf_\bi_\be_\bl_\bd_\b__\bt_\by_\bp_\be& k) {\n-111 this->_\bB_\bC_\bR_\bS_\bM_\ba_\bt_\br_\bi_\bx_\b<_\bB_\b,_\bA_\b>_\b:_\b:_\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b=(k);\n-112 return *this;\n-113 }\n-114\n-120 template \n-_\b1_\b2_\b1 void _\bs_\bo_\bl_\bv_\be (V& x, const V& rhs) const {\n-122\n-123 // special handling for 1x1 matrices. The generic algorithm doesn't work\n-for them\n-124 if (this->_\bN()==1) {\n-125 auto&& x0 = Impl::asVector(x[0]);\n-126 auto&& rhs0 = Impl::asVector(rhs[0]);\n-127 Impl::asMatrix((*this)[0][0]).solve(x0, rhs0);\n-128 return;\n-129 }\n-130\n-131 // Make copies of the rhs and the right matrix band\n-132 V d = rhs;\n-133 std::vector c(this->_\bN()-1);\n-134 for (size_t i=0; i_\bN()-1; i++)\n-135 c[i] = (*this)[i][i+1];\n-136\n-137 /* Modify the coefficients. */\n-138 _\bb_\bl_\bo_\bc_\bk_\b__\bt_\by_\bp_\be a_00_inv = (*this)[0][0];\n-139 Impl::asMatrix(a_00_inv).invert();\n-140\n-141 //c[0] /= (*this)[0][0]; /* Division by zero risk. */\n-142 _\bb_\bl_\bo_\bc_\bk_\b__\bt_\by_\bp_\be tmp = a_00_inv;\n-143 Impl::asMatrix(tmp).rightmultiply(Impl::asMatrix(c[0]));\n-144 c[0] = tmp;\n-145\n-146 // d = a^{-1} d /* Division by zero would imply a singular matrix. */\n-147 auto d_0_tmp = d[0];\n-148 auto&& d_0 = Impl::asVector(d[0]);\n-149 Impl::asMatrix(a_00_inv).mv(Impl::asVector(d_0_tmp),d_0);\n-150\n-151 for (unsigned int i = 1; i < this->_\bN(); i++) {\n-152\n-153 // id = ( a_ii - c_{i-1} a_{i, i-1} ) ^{-1}\n-154 _\bb_\bl_\bo_\bc_\bk_\b__\bt_\by_\bp_\be tmp;\n-155 tmp = (*this)[i][i-1];\n-156 Impl::asMatrix(tmp).rightmultiply(Impl::asMatrix(c[i-1]));\n-157\n-158 _\bb_\bl_\bo_\bc_\bk_\b__\bt_\by_\bp_\be id = (*this)[i][i];\n-159 id -= tmp;\n-160 Impl::asMatrix(id).invert(); /* Division by zero risk. */\n-161\n-162 if (i_\bN() - 1] = d[this->_\bN() - 1];\n-175 for (int i = this->_\bN() - 2; i >= 0; i--) {\n-176 //x[i] = d[i] - c[i] * x[i + 1];\n-177 x[i] = d[i];\n-178 auto&& x_i = Impl::asVector(x[i]);\n-179 Impl::asMatrix(c[i]).mmv(Impl::asVector(x[i+1]), x_i);\n-180 }\n-181\n-182 }\n-183\n-184 private:\n-185\n-186 // ////////////////////////////////////////////////////////////////////////\n-////\n-187 // The following methods from the base class should now actually be called\n-188 // ////////////////////////////////////////////////////////////////////////\n-////\n-189\n-190 // createbegin and createend should be in there, too, but I can't get it to\n-compile\n-191 // BCRSMatrix::CreateIterator createbegin () {}\n-192 // BCRSMatrix::CreateIterator createend () {}\n-193 void setrowsize (_\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be i, _\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be s) {}\n-194 void incrementrowsize (_\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be i) {}\n-195 void endrowsizes () {}\n-196 void addindex (_\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be row, _\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be _\bc_\bo_\bl) {}\n-197 void endindices () {}\n-198 };\n-199\n-200 template\n-_\b2_\b0_\b1 struct FieldTraits< _\bB_\bT_\bD_\bM_\ba_\bt_\br_\bi_\bx >\n-202 {\n-_\b2_\b0_\b3 using _\bf_\bi_\be_\bl_\bd_\b__\bt_\by_\bp_\be = typename _\bB_\bT_\bD_\bM_\ba_\bt_\br_\bi_\bx_\b<_\bB_\b,_\b _\bA_\b>_\b:_\b:_\bf_\bi_\be_\bl_\bd_\b__\bt_\by_\bp_\be;\n-_\b2_\b0_\b4 using _\br_\be_\ba_\bl_\b__\bt_\by_\bp_\be = typename FieldTraits::real_type;\n-205 };\n-206\n-209} // end namespace Dune\n-210\n-211#endif\n-_\bb_\bc_\br_\bs_\bm_\ba_\bt_\br_\bi_\bx_\b._\bh_\bh\n-Implementation of the BCRSMatrix class.\n-_\bb_\bl_\bo_\bc_\bk_\bl_\be_\bv_\be_\bl_\b._\bh_\bh\n-Helper functions for determining the vector/matrix block level.\n-_\bc_\bo_\bl\n-Col col\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn matrixmatrix.hh:351\n+39 namespace {\n+40 template class Base, class V, class Tag, typename... Args>\n+41 auto registryGet(Tag , std::string name, Args... args)\n+42 {\n+43 constexpr auto count = _\bD_\bU_\bN_\bE_\b__\bG_\bE_\bT_\b__\bC_\bO_\bU_\bN_\bT_\bE_\bR(Tag);\n+44 std::shared_ptr > result;\n+45 Dune::Hybrid::forEach(std::make_index_sequence{},\n+46 [&](auto index) {\n+47 using Reg = Registry;\n+48 if(!result && Reg::name() == name) {\n+49 result = Reg::getCreator()(Dune::MetaType{}, args...);\n+50 }\n+51 });\n+52 return result;\n+53 }\n+54\n+55 /*\n+56 Register all creators from the registry in the Parameterizedobjectfactory An\n+57 object of V is passed in the creator and should be used to determine the\n+58 template arguments.\n+59 */\n+60 template\n+61 int addRegistryToFactory(Dune::ParameterizedObjectFactory& factory,\n+62 Tag){\n+63 constexpr auto count = _\bD_\bU_\bN_\bE_\b__\bG_\bE_\bT_\b__\bC_\bO_\bU_\bN_\bT_\bE_\bR(Tag);\n+64 Dune::Hybrid::forEach(std::make_index_sequence{},\n+65 [&](auto index) {\n+66 // we first get the generic lambda\n+67 // and later specialize it with given parameters.\n+68 // doing all at once leads to an ICE with g++-6\n+69 using Reg = Registry;\n+70 auto genericcreator = Reg::getCreator();\n+71 factory.define(Reg::name(), [genericcreator](Args... args){\n+72 return genericcreator(V{}, args...);\n+73 });\n+74 });\n+75 return count;\n+76 }\n+77 } // end anonymous namespace\n+78} // end namespace Dune\n+79\n+80#endif // DUNE_ISTL_COMMON_REGISTRY_HH\n+_\bc_\bo_\bu_\bn_\bt_\be_\br_\b._\bh_\bh\n+_\bD_\bU_\bN_\bE_\b__\bG_\bE_\bT_\b__\bC_\bO_\bU_\bN_\bT_\bE_\bR\n+#define DUNE_GET_COUNTER(Tag)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn counter.hh:17\n _\bD_\bu_\bn_\be\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn allocator.hh:11\n-_\bD_\bu_\bn_\be_\b:_\b:_\bB_\bC_\bR_\bS_\bM_\ba_\bt_\br_\bi_\bx\n-A sparse block matrix with compressed row storage.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn bcrsmatrix.hh:466\n-_\bD_\bu_\bn_\be_\b:_\b:_\bB_\bC_\bR_\bS_\bM_\ba_\bt_\br_\bi_\bx_\b:_\b:_\be_\bn_\bd_\br_\bo_\bw_\bs_\bi_\bz_\be_\bs\n-void endrowsizes()\n-indicate that size of all rows is defined\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn bcrsmatrix.hh:1146\n-_\bD_\bu_\bn_\be_\b:_\b:_\bB_\bC_\bR_\bS_\bM_\ba_\bt_\br_\bi_\bx_\b:_\b:_\br_\ba_\bn_\bd_\bo_\bm\n-@ random\n-Build entries randomly.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn bcrsmatrix.hh:526\n-_\bD_\bu_\bn_\be_\b:_\b:_\bB_\bC_\bR_\bS_\bM_\ba_\bt_\br_\bi_\bx_\b:_\b:_\ba_\bd_\bd_\bi_\bn_\bd_\be_\bx\n-void addindex(size_type row, size_type col)\n-add index (row,col) to the matrix\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn bcrsmatrix.hh:1188\n-_\bD_\bu_\bn_\be_\b:_\b:_\bB_\bC_\bR_\bS_\bM_\ba_\bt_\br_\bi_\bx_\b:_\b:_\be_\bn_\bd_\bi_\bn_\bd_\bi_\bc_\be_\bs\n-void endindices()\n-indicate that all indices are defined, check consistency\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn bcrsmatrix.hh:1269\n-_\bD_\bu_\bn_\be_\b:_\b:_\bB_\bC_\bR_\bS_\bM_\ba_\bt_\br_\bi_\bx_\b:_\b:_\bN\n-size_type N() const\n-number of rows (counted in blocks)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn bcrsmatrix.hh:2001\n-_\bD_\bu_\bn_\be_\b:_\b:_\bB_\bC_\bR_\bS_\bM_\ba_\bt_\br_\bi_\bx_\b:_\b:_\bs_\be_\bt_\bS_\bi_\bz_\be\n-void setSize(size_type rows, size_type columns, size_type nnz=0)\n-Set the size of the matrix.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn bcrsmatrix.hh:858\n-_\bD_\bu_\bn_\be_\b:_\b:_\bB_\bC_\bR_\bS_\bM_\ba_\bt_\br_\bi_\bx_\b:_\b:_\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b=\n-BCRSMatrix & operator=(const BCRSMatrix &Mat)\n-assignment\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn bcrsmatrix.hh:908\n-_\bD_\bu_\bn_\be_\b:_\b:_\bB_\bT_\bD_\bM_\ba_\bt_\br_\bi_\bx\n-A block-tridiagonal matrix.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn btdmatrix.hh:31\n-_\bD_\bu_\bn_\be_\b:_\b:_\bB_\bT_\bD_\bM_\ba_\bt_\br_\bi_\bx_\b:_\b:_\bB_\bT_\bD_\bM_\ba_\bt_\br_\bi_\bx\n-BTDMatrix(size_type size)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn btdmatrix.hh:54\n-_\bD_\bu_\bn_\be_\b:_\b:_\bB_\bT_\bD_\bM_\ba_\bt_\br_\bi_\bx_\b:_\b:_\bs_\bo_\bl_\bv_\be\n-void solve(V &x, const V &rhs) const\n-Use the Thomas algorithm to solve the system Ax=b in O(n) time.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn btdmatrix.hh:121\n-_\bD_\bu_\bn_\be_\b:_\b:_\bB_\bT_\bD_\bM_\ba_\bt_\br_\bi_\bx_\b:_\b:_\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be\n-A::size_type size_type\n-implement row_type with compressed vector\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn btdmatrix.hh:49\n-_\bD_\bu_\bn_\be_\b:_\b:_\bB_\bT_\bD_\bM_\ba_\bt_\br_\bi_\bx_\b:_\b:_\ba_\bl_\bl_\bo_\bc_\ba_\bt_\bo_\br_\b__\bt_\by_\bp_\be\n-A allocator_type\n-export the allocator type\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn btdmatrix.hh:43\n-_\bD_\bu_\bn_\be_\b:_\b:_\bB_\bT_\bD_\bM_\ba_\bt_\br_\bi_\bx_\b:_\b:_\bb_\bl_\bo_\bc_\bk_\b__\bt_\by_\bp_\be\n-B block_type\n-export the type representing the components\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn btdmatrix.hh:40\n-_\bD_\bu_\bn_\be_\b:_\b:_\bB_\bT_\bD_\bM_\ba_\bt_\br_\bi_\bx_\b:_\b:_\bf_\bi_\be_\bl_\bd_\b__\bt_\by_\bp_\be\n-typename Imp::BlockTraits< B >::field_type field_type\n-export the type representing the field\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn btdmatrix.hh:37\n-_\bD_\bu_\bn_\be_\b:_\b:_\bB_\bT_\bD_\bM_\ba_\bt_\br_\bi_\bx_\b:_\b:_\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b=\n-BTDMatrix & operator=(const BTDMatrix &other)\n-assignment\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn btdmatrix.hh:104\n-_\bD_\bu_\bn_\be_\b:_\b:_\bB_\bT_\bD_\bM_\ba_\bt_\br_\bi_\bx_\b:_\b:_\bB_\bT_\bD_\bM_\ba_\bt_\br_\bi_\bx\n-BTDMatrix()\n-Default constructor.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn btdmatrix.hh:52\n-_\bD_\bu_\bn_\be_\b:_\b:_\bB_\bT_\bD_\bM_\ba_\bt_\br_\bi_\bx_\b:_\b:_\bs_\be_\bt_\bS_\bi_\bz_\be\n-void setSize(size_type size)\n-Resize the matrix. Invalidates the content!\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn btdmatrix.hh:77\n-_\bD_\bu_\bn_\be_\b:_\b:_\bF_\bi_\be_\bl_\bd_\bT_\br_\ba_\bi_\bt_\bs_\b<_\b _\bB_\bT_\bD_\bM_\ba_\bt_\br_\bi_\bx_\b<_\b _\bB_\b,_\b _\bA_\b _\b>_\b _\b>_\b:_\b:_\br_\be_\ba_\bl_\b__\bt_\by_\bp_\be\n-typename FieldTraits< field_type >::real_type real_type\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn btdmatrix.hh:204\n-_\bD_\bu_\bn_\be_\b:_\b:_\bF_\bi_\be_\bl_\bd_\bT_\br_\ba_\bi_\bt_\bs_\b<_\b _\bB_\bT_\bD_\bM_\ba_\bt_\br_\bi_\bx_\b<_\b _\bB_\b,_\b _\bA_\b _\b>_\b _\b>_\b:_\b:_\bf_\bi_\be_\bl_\bd_\b__\bt_\by_\bp_\be\n-typename BTDMatrix< B, A >::field_type field_type\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn btdmatrix.hh:203\n ===============================================================================\n Generated by\u00a0_\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b] 1.9.8\n"}]}, {"source1": "./usr/share/doc/libdune-istl-doc/doxygen/a00026.html", "source2": "./usr/share/doc/libdune-istl-doc/doxygen/a00026.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n dune-istl: vbvector.hh File Reference \n+dune-istl: bdmatrix.hh File Reference \n dune istl \n \n-
??? \n+
Implementation of the BDMatrix class. \n More...
\n-
#include <cmath>\n-
#include <complex>\n-
#include <iostream>\n-
#include <iterator>\n-
#include <memory>\n-
#include <dune/common/ftraits.hh>\n-
#include <dune/common/indexediterator.hh>\n-
#include <dune/common/iteratorfacades.hh>\n-
#include "istlexception.hh "\n-
#include "bvector.hh "\n-
#include <dune/istl/blocklevel.hh >\n+
#include <memory>\n+
#include <dune/common/rangeutilities.hh>\n+
#include <dune/common/scalarmatrixview.hh>\n+
#include <dune/istl/bcrsmatrix.hh >\n+
#include <dune/istl/blocklevel.hh >\n
\n
Go to the source code of this file.
\n
\n namespace Dune
\n
\n-
???
\n+
Implementation of the BDMatrix class.
\n+
Author Oliver Sander \n
\n \n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,37 +1,30 @@\n dune-istl\u00a02.10\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bi_\bs_\bt_\bl\n _\bC_\bl_\ba_\bs_\bs_\be_\bs | _\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs\n-vbvector.hh File Reference\n-??? _\bM_\bo_\br_\be_\b._\b._\b.\n-#include
\n-#include \n-#include \n-#include \n+bdmatrix.hh File Reference\n+Implementation of the BDMatrix class. _\bM_\bo_\br_\be_\b._\b._\b.\n #include \n-#include \n-#include \n-#include \n-#include \"_\bi_\bs_\bt_\bl_\be_\bx_\bc_\be_\bp_\bt_\bi_\bo_\bn_\b._\bh_\bh\"\n-#include \"_\bb_\bv_\be_\bc_\bt_\bo_\br_\b._\bh_\bh\"\n+#include \n+#include \n+#include <_\bd_\bu_\bn_\be_\b/_\bi_\bs_\bt_\bl_\b/_\bb_\bc_\br_\bs_\bm_\ba_\bt_\br_\bi_\bx_\b._\bh_\bh>\n #include <_\bd_\bu_\bn_\be_\b/_\bi_\bs_\bt_\bl_\b/_\bb_\bl_\bo_\bc_\bk_\bl_\be_\bv_\be_\bl_\b._\bh_\bh>\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bs_\bo_\bu_\br_\bc_\be_\b _\bc_\bo_\bd_\be_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n C\bCl\bla\bas\bss\bse\bes\bs\n- class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bV_\ba_\br_\bi_\ba_\bb_\bl_\be_\bB_\bl_\bo_\bc_\bk_\bV_\be_\bc_\bt_\bo_\br_\b<_\b _\bB_\b,_\b _\bA_\b _\b>\n-\u00a0 A Vector of blocks with different blocksizes. _\bM_\bo_\br_\be_\b._\b._\b.\n+ class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bB_\bD_\bM_\ba_\bt_\br_\bi_\bx_\b<_\b _\bB_\b,_\b _\bA_\b _\b>\n+\u00a0 A block-diagonal matrix. _\bM_\bo_\br_\be_\b._\b._\b.\n \u00a0\n- class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bV_\ba_\br_\bi_\ba_\bb_\bl_\be_\bB_\bl_\bo_\bc_\bk_\bV_\be_\bc_\bt_\bo_\br_\b<_\b _\bB_\b,_\b _\bA_\b _\b>_\b:_\b:_\bC_\br_\be_\ba_\bt_\be_\bI_\bt_\be_\br_\ba_\bt_\bo_\br\n-\u00a0 Iterator class for sequential creation of blocks. _\bM_\bo_\br_\be_\b._\b._\b.\n-\u00a0\n-struct \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bF_\bi_\be_\bl_\bd_\bT_\br_\ba_\bi_\bt_\bs_\b<_\b _\bV_\ba_\br_\bi_\ba_\bb_\bl_\be_\bB_\bl_\bo_\bc_\bk_\bV_\be_\bc_\bt_\bo_\br_\b<_\b _\bB_\b,_\b _\bA_\b _\b>_\b _\b>\n+struct \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bF_\bi_\be_\bl_\bd_\bT_\br_\ba_\bi_\bt_\bs_\b<_\b _\bB_\bD_\bM_\ba_\bt_\br_\bi_\bx_\b<_\b _\bB_\b,_\b _\bA_\b _\b>_\b _\b>\n \u00a0\n N\bNa\bam\bme\bes\bsp\bpa\bac\bce\bes\bs\n namespace \u00a0 _\bD_\bu_\bn_\be\n \u00a0\n *\b**\b**\b**\b**\b* D\bDe\bet\bta\bai\bil\ble\bed\bd D\bDe\bes\bsc\bcr\bri\bip\bpt\bti\bio\bon\bn *\b**\b**\b**\b**\b*\n-???\n+Implementation of the BDMatrix class.\n+ Author\n+ Oliver Sander\n ===============================================================================\n Generated by\u00a0_\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b] 1.9.8\n"}]}, {"source1": "./usr/share/doc/libdune-istl-doc/doxygen/a00026_source.html", "source2": "./usr/share/doc/libdune-istl-doc/doxygen/a00026_source.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n dune-istl: vbvector.hh Source File \n+dune-istl: bdmatrix.hh Source File \n \n \n
\n
Go to the documentation of this file. \n
\n
\n
\n-
5 #ifndef DUNE_ISTL_VBVECTOR_HH \n-
6 #define DUNE_ISTL_VBVECTOR_HH \n+
5 #ifndef DUNE_ISTL_BDMATRIX_HH \n+
6 #define DUNE_ISTL_BDMATRIX_HH \n
\n-
\n-
\n-
\n-
\n-
\n-
\n-
14 #include <dune/common/ftraits.hh> \n-
15 #include <dune/common/indexediterator.hh> \n-
16 #include <dune/common/iteratorfacades.hh> \n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
43 template <
class B,
class A=std::allocator<B> >
\n-
\n-
\n-
\n-
\n-
\n-
\n-
49 using Base = Imp::block_vector_unmanaged<B,typename A::size_type>;
\n-
\n-
\n-
52 using window_type = Imp::BlockVectorWindow<B,A>;
\n-
\n-
\n-
55 using VectorWindows = std::vector<window_type, typename std::allocator_traits<A>::template rebind_alloc<window_type>>;
\n-
\n-
\n-
58 static_assert (not std::is_same_v<B,bool>,
"Block type 'bool' not supported by VariableBlockVector." );
\n-
\n-
\n+
\n+
\n+
10 #include <dune/common/rangeutilities.hh> \n+
11 #include <dune/common/scalarmatrixview.hh> \n+
\n+
\n+
\n+
\n+
\n+
31 template <
class B,
class A=std::allocator<B> >
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
39 using field_type =
typename Imp::BlockTraits<B>::field_type;
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
59 for (
int i=0; i<size; i++)
\n+
\n
\n-
\n+
\n
\n-
65 using field_type =
typename Imp::BlockTraits<B>::field_type;
\n+
64 for (
int i=0; i<size; i++)
\n+
\n
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n+
\n+
\n+
\n+
\n+
\n+
\n+
72 BDMatrix (std::initializer_list<B>
const &list)
\n+
\n+
\n+
\n+
76 for (
auto it = list.begin(); it != list.end(); ++it, ++i)
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
87 for (
auto i : range(size))
\n+
\n+
\n+
\n
\n-
\n-
\n-
\n+
92 for (
auto i : range(size))
\n+
\n+
\n+
\n+
\n+
\n
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
128 storage_(numBlocks*blockSize)
\n-
\n-
\n-
\n+
\n+
\n+
\n+
\n+
\n+
\n+
116 void solve (V& x,
const V& rhs)
const {
\n+
\n+
\n+
119 auto && xv = Impl::asVector(x[i]);
\n+
120 auto && rhsv = Impl::asVector(rhs[i]);
\n+
121 Impl::asMatrix((*
this )[i][i]).solve(xv,rhsv);
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
128 Impl::asMatrix((*
this )[i][i]).
invert ();
\n+
\n+
\n+
\n+
\n
\n-
\n-
\n-
135 block[i].set(blockSize,this->p+(i*blockSize));
\n+
\n+
\n+
\n
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
143 Base(static_cast<const Base&>(a)),
\n-
\n-
\n-
\n-
\n-
\n-
\n-
150 if (block.size()>0) {
\n-
151 block[0].set(block[0].getsize(),this->p);
\n-
\n-
153 block[i].set(block[i].getsize(),block[i-1].getptr()+block[i-1].getsize());
\n-
\n-
\n-
\n-
157 initialized = a.initialized;
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
181 swap (storage_, other.storage_);
\n-
182 swap (block, other.block);
\n-
183 swap (initialized, other.initialized);
\n-
\n-
185 other.syncBaseArray();
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
203 block.resize(numBlocks);
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
213 storage_.resize(numBlocks*blockSize);
\n-
214 block.resize(numBlocks);
\n-
\n-
\n-
\n-
\n-
219 block[i].set(blockSize,this->p+(i*blockSize));
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
230 (
static_cast< Imp::block_vector_unmanaged<B,size_type>&
> (*this)) = k;
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
237 class CreateIterator;
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
249 operator size_type ()
const \n-
\n-
251 return target->getsize();
\n-
\n-
\n-
254 SizeProxy& operator= (size_type size)
\n-
\n-
256 target->setsize(size);
\n-
\n-
\n-
\n-
\n-
\n-
262 friend class CreateIterator;
\n-
\n-
264 SizeProxy (window_type& t) :
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
311 if (not isEnd && i==v.block.size() && not v.initialized)
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
335 return (i!=it.i) || (&v!=&it.v);
\n-
\n-
\n-
\n-
\n-
\n-
\n-
341 return (i==it.i) && (&v==&it.v);
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
353 v.block[i].setsize(_k);
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
379 #ifdef DUNE_ISTL_WITH_CHECKING \n-
380 if (initialized) DUNE_THROW(
ISTLError ,
"no CreateIterator in initialized state" );
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
399 #ifdef DUNE_ISTL_WITH_CHECKING \n-
400 if (i>=block.size()) DUNE_THROW(
ISTLError ,
"index out of range" );
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
408 #ifdef DUNE_ISTL_WITH_CHECKING \n-
409 if (i<0 || i>=block.size()) DUNE_THROW(
ISTLError ,
"index out of range" );
\n-
\n-
\n-
\n-
\n-
\n-
414 using Iterator = IndexedIterator<typename VectorWindows::iterator>;
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
446 using ConstIterator = IndexedIterator<typename VectorWindows::const_iterator>;
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
487 tmp+=std::min(i, block.size());
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
495 tmp+=std::min(i, block.size());
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
521 if (this->initialized)
\n-
522 DUNE_THROW(
ISTLError ,
"Attempt to re-allocate already initialized VariableBlockVector" );
\n-
\n-
\n-
\n-
526 for (
size_type i = 0; i < block.size(); i++)
\n-
527 storageNeeded += block[i].
size ();
\n-
\n-
529 storage_.resize(storageNeeded);
\n-
\n-
\n-
\n-
533 block[0].setptr(this->p);
\n-
\n-
535 block[j].setptr(block[j-1].getptr()+block[j-1].getsize());
\n-
\n-
\n-
538 this->initialized =
true ;
\n-
\n-
\n-
541 void syncBaseArray () noexcept
\n-
\n-
543 this->p = storage_.data();
\n-
544 this->n = storage_.size();
\n-
\n-
\n-
547 VectorWindows block = {};
\n-
548 std::vector<B, A> storage_ = {};
\n-
549 bool initialized =
false ;
\n-
\n-
\n-
\n-
555 template <
class B,
class A>
\n-
\n-
\n-
\n-
\n-
This file implements a vector space as a tensor product of a given vector space. The number of compon...
\n-
\n-
Helper functions for determining the vector/matrix block level.
\n+
\n+
\n+
\n+
\n+
\n+
142 void endrowsizes () {}
\n+
\n+
144 void endindices () {}
\n+
\n+
\n+
\n+
147 template <
typename B,
typename A>
\n+
\n+
\n+
\n+
\n+
151 using real_type =
typename FieldTraits<field_type>::real_type;
\n+
\n+
\n+
\n+
\n+
\n+
Implementation of the BCRSMatrix class.
\n+
Helper functions for determining the vector/matrix block level.
\n+
Col col
Definition matrixmatrix.hh:351
\n
Definition allocator.hh:11
\n-
A vector of blocks with memory management.
Definition bvector.hh:392
\n-
derive error class from the base class in common
Definition istlexception.hh:19
\n-
A Vector of blocks with different blocksizes.
Definition vbvector.hh:48
\n-
VariableBlockVector(size_type numBlocks, size_type blockSize)
Construct a vector with given number of blocks each having a constant size.
Definition vbvector.hh:125
\n-
VariableBlockVector()
Constructor without arguments makes an empty vector.
Definition vbvector.hh:102
\n-
friend void swap(VariableBlockVector &lhs, VariableBlockVector &rhs) noexcept
Free function to swap the storage and internal state of lhs with rhs.
Definition vbvector.hh:190
\n-
Iterator iterator
Export the iterator type using std naming rules.
Definition vbvector.hh:443
\n-
VariableBlockVector & operator=(VariableBlockVector tmp)
Copy and move assignment.
Definition vbvector.hh:171
\n-
VariableBlockVector(size_type numBlocks)
Construct a vector with given number of blocks, but size of each block is not yet known.
Definition vbvector.hh:112
\n-
typename Imp::BlockTraits< B >::field_type field_type
export the type representing the field
Definition vbvector.hh:65
\n-
typename A::size_type size_type
The size type for the index access.
Definition vbvector.hh:83
\n-
size_type N() const noexcept
number of blocks in the vector (are of variable size here)
Definition vbvector.hh:502
\n-
VariableBlockVector(const VariableBlockVector &a)
Copy constructor, has copy semantics.
Definition vbvector.hh:142
\n-
window_type & operator[](size_type i)
random access to blocks
Definition vbvector.hh:397
\n-
A allocator_type
export the allocator type
Definition vbvector.hh:68
\n-
CreateIterator createend()
get create iterator pointing to one after the last block
Definition vbvector.hh:386
\n-
VariableBlockVector(VariableBlockVector &&tmp)
Move constructor:
Definition vbvector.hh:161
\n-
CreateIterator createbegin()
get initial create iterator
Definition vbvector.hh:377
\n-
ConstIterator const_iterator
Export the const iterator type using std naming rules.
Definition vbvector.hh:449
\n-
window_type & reference
Export type used for references to container entries.
Definition vbvector.hh:74
\n-
ConstIterator rend() const
end ConstIterator
Definition vbvector.hh:478
\n-
const window_type & const_reference
Export type used for const references to container entries.
Definition vbvector.hh:80
\n-
ConstIterator find(size_type i) const
random access returning iterator (end if not contained)
Definition vbvector.hh:492
\n-
ConstIterator beforeEnd() const
Definition vbvector.hh:465
\n-
Iterator find(size_type i)
random access returning iterator (end if not contained)
Definition vbvector.hh:484
\n-
IndexedIterator< typename VectorWindows::const_iterator > ConstIterator
Const iterator.
Definition vbvector.hh:446
\n-
~VariableBlockVector()=default
\n-
ConstIterator beforeBegin() const
Definition vbvector.hh:472
\n-
void resize(size_type numBlocks)
same effect as constructor with same argument
Definition vbvector.hh:196
\n-
Iterator end()
end Iterator
Definition vbvector.hh:423
\n-
void swap(VariableBlockVector &other) noexcept
Exchange the storage and internal state with other.
Definition vbvector.hh:178
\n-
ConstIterator begin() const
begin ConstIterator
Definition vbvector.hh:452
\n-
size_type size() const noexcept
Definition vbvector.hh:511
\n-
void resize(size_type numBlocks, size_type blockSize)
same effect as constructor with same argument
Definition vbvector.hh:210
\n-
IndexedIterator< typename VectorWindows::iterator > Iterator
Definition vbvector.hh:414
\n-
ConstIterator end() const
end ConstIterator
Definition vbvector.hh:458
\n-
Iterator beforeBegin()
Definition vbvector.hh:437
\n-
Iterator beforeEnd()
Definition vbvector.hh:430
\n-
Iterator begin()
begin Iterator
Definition vbvector.hh:417
\n-
Iterator class for sequential creation of blocks.
Definition vbvector.hh:275
\n-
bool operator==(const CreateIterator &it) const
equality
Definition vbvector.hh:339
\n-
size_type index() const
dereferencing
Definition vbvector.hh:345
\n-
SizeProxy reference
reference type
Definition vbvector.hh:295
\n-
size_type * pointer
pointer type
Definition vbvector.hh:292
\n-
bool operator!=(const CreateIterator &it) const
inequality
Definition vbvector.hh:333
\n-
~CreateIterator()
Definition vbvector.hh:304
\n-
size_type value_type
value type
Definition vbvector.hh:281
\n-
CreateIterator(VariableBlockVector &_v, int _i, bool _isEnd)
constructor
Definition vbvector.hh:298
\n-
void setblocksize(size_type _k)
set size of current block
Definition vbvector.hh:351
\n-
size_type & operator*()
Access size of current block.
Definition vbvector.hh:362
\n-
std::output_iterator_tag iterator_category
iterator category
Definition vbvector.hh:278
\n-
CreateIterator & operator++()
prefix increment
Definition vbvector.hh:316
\n-
void difference_type
difference type (unused)
Definition vbvector.hh:289
\n-
FieldTraits< B >::real_type real_type
Definition vbvector.hh:559
\n-
FieldTraits< B >::field_type field_type
Definition vbvector.hh:558
\n+
A sparse block matrix with compressed row storage.
Definition bcrsmatrix.hh:466
\n+
void endrowsizes()
indicate that size of all rows is defined
Definition bcrsmatrix.hh:1146
\n+
@ random
Build entries randomly.
Definition bcrsmatrix.hh:526
\n+
void endindices()
indicate that all indices are defined, check consistency
Definition bcrsmatrix.hh:1269
\n+
size_type N() const
number of rows (counted in blocks)
Definition bcrsmatrix.hh:2001
\n+
void setSize(size_type rows, size_type columns, size_type nnz=0)
Set the size of the matrix.
Definition bcrsmatrix.hh:858
\n+
BCRSMatrix & operator=(const BCRSMatrix &Mat)
assignment
Definition bcrsmatrix.hh:908
\n+
A block-diagonal matrix.
Definition bdmatrix.hh:33
\n+
typename Imp::BlockTraits< B >::field_type field_type
export the type representing the field
Definition bdmatrix.hh:39
\n+
A::size_type size_type
implement row_type with compressed vector
Definition bdmatrix.hh:51
\n+
BDMatrix()
Default constructor.
Definition bdmatrix.hh:54
\n+
BDMatrix(std::initializer_list< B > const &list)
Construct from a std::initializer_list.
Definition bdmatrix.hh:72
\n+
B block_type
export the type representing the components
Definition bdmatrix.hh:42
\n+
void solve(V &x, const V &rhs) const
Solve the system Ax=b in O(n) time.
Definition bdmatrix.hh:116
\n+
A allocator_type
export the allocator type
Definition bdmatrix.hh:45
\n+
BDMatrix(int size)
Definition bdmatrix.hh:56
\n+
BDMatrix & operator=(const BDMatrix &other)
assignment
Definition bdmatrix.hh:99
\n+
void setSize(size_type size)
Resize the matrix. Invalidates the content!
Definition bdmatrix.hh:81
\n+
void invert()
Inverts the matrix.
Definition bdmatrix.hh:126
\n+
typename BDMatrix< B, A >::field_type field_type
Definition bdmatrix.hh:150
\n+
typename FieldTraits< field_type >::real_type real_type
Definition bdmatrix.hh:151
\n
\n \n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,685 +1,227 @@\n dune-istl\u00a02.10\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bi_\bs_\bt_\bl\n-vbvector.hh\n+bdmatrix.hh\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bd_\bo_\bc_\bu_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n 1// SPDX-FileCopyrightText: Copyright \u00c2\u00a9 DUNE Project contributors, see file\n LICENSE.md in module root\n 2// SPDX-License-Identifier: LicenseRef-GPL-2.0-only-with-DUNE-exception\n 3// -*- tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 2 -*-\n 4// vi: set et ts=4 sw=2 sts=2:\n-5#ifndef DUNE_ISTL_VBVECTOR_HH\n-6#define DUNE_ISTL_VBVECTOR_HH\n+5#ifndef DUNE_ISTL_BDMATRIX_HH\n+6#define DUNE_ISTL_BDMATRIX_HH\n 7\n-8#include
\n-9#include \n-10#include \n-11#include \n-12#include \n-13\n-14#include \n-15#include \n-16#include \n-17#include \"_\bi_\bs_\bt_\bl_\be_\bx_\bc_\be_\bp_\bt_\bi_\bo_\bn_\b._\bh_\bh\"\n-18#include \"_\bb_\bv_\be_\bc_\bt_\bo_\br_\b._\bh_\bh\"\n-19\n-20#include <_\bd_\bu_\bn_\be_\b/_\bi_\bs_\bt_\bl_\b/_\bb_\bl_\bo_\bc_\bk_\bl_\be_\bv_\be_\bl_\b._\bh_\bh>\n-21\n-26namespace _\bD_\bu_\bn_\be {\n-27\n-43 template >\n-_\b4_\b4 class _\bV_\ba_\br_\bi_\ba_\bb_\bl_\be_\bB_\bl_\bo_\bc_\bk_\bV_\be_\bc_\bt_\bo_\br : public Imp::block_vector_unmanaged\n-45 // this derivation gives us all the blas level 1 and norms\n-46 // on the large array. However, access operators have to be\n-47 // overwritten.\n-48 {\n-49 using Base = Imp::block_vector_unmanaged;\n-50\n-51 // just a shorthand\n-52 using window_type = Imp::BlockVectorWindow;\n-53\n-54 // data-structure holding the windows (but not the actual data)\n-55 using VectorWindows = std::vector::template rebind_alloc>;\n-56\n-57 // block type bool is not supported since std::vector is used for\n-storage\n-58 static_assert(not std::is_same_v, \"Block type 'bool' not supported\n-by VariableBlockVector.\");\n-59\n-60 public:\n+8#include \n+9\n+10#include \n+11#include \n+12\n+13#include <_\bd_\bu_\bn_\be_\b/_\bi_\bs_\bt_\bl_\b/_\bb_\bc_\br_\bs_\bm_\ba_\bt_\br_\bi_\bx_\b._\bh_\bh>\n+14#include <_\bd_\bu_\bn_\be_\b/_\bi_\bs_\bt_\bl_\b/_\bb_\bl_\bo_\bc_\bk_\bl_\be_\bv_\be_\bl_\b._\bh_\bh>\n+15\n+21namespace _\bD_\bu_\bn_\be {\n+31 template >\n+_\b3_\b2 class _\bB_\bD_\bM_\ba_\bt_\br_\bi_\bx : public _\bB_\bC_\bR_\bS_\bM_\ba_\bt_\br_\bi_\bx\n+33 {\n+34 public:\n+35\n+36 //===== type definitions and constants\n+37\n+_\b3_\b9 using _\bf_\bi_\be_\bl_\bd_\b__\bt_\by_\bp_\be = typename Imp::BlockTraits::field_type;\n+40\n+_\b4_\b2 typedef B _\bb_\bl_\bo_\bc_\bk_\b__\bt_\by_\bp_\be;\n+43\n+_\b4_\b5 typedef A _\ba_\bl_\bl_\bo_\bc_\ba_\bt_\bo_\br_\b__\bt_\by_\bp_\be;\n+46\n+48 //typedef BCRSMatrix::row_type row_type;\n+49\n+_\b5_\b1 typedef typename A::size_type _\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be;\n+52\n+_\b5_\b4 _\bB_\bD_\bM_\ba_\bt_\br_\bi_\bx() : _\bB_\bC_\bR_\bS_\bM_\ba_\bt_\br_\bi_\bx() {}\n+55\n+_\b5_\b6 explicit _\bB_\bD_\bM_\ba_\bt_\br_\bi_\bx(int size)\n+57 : _\bB_\bC_\bR_\bS_\bM_\ba_\bt_\br_\bi_\bx(size, size, _\bB_\bC_\bR_\bS_\bM_\ba_\bt_\br_\bi_\bx::_\br_\ba_\bn_\bd_\bo_\bm) {\n+58\n+59 for (int i=0; i_\bB_\bC_\bR_\bS_\bM_\ba_\bt_\br_\bi_\bx_\b<_\bB_\b,_\bA_\b>_\b:_\b:_\bs_\be_\bt_\br_\bo_\bw_\bs_\bi_\bz_\be(i, 1);\n 61\n-62 //===== type definitions and constants\n+62 this->_\bB_\bC_\bR_\bS_\bM_\ba_\bt_\br_\bi_\bx_\b<_\bB_\b,_\bA_\b>_\b:_\b:_\be_\bn_\bd_\br_\bo_\bw_\bs_\bi_\bz_\be_\bs();\n 63\n-_\b6_\b5 using _\bf_\bi_\be_\bl_\bd_\b__\bt_\by_\bp_\be = typename Imp::BlockTraits::field_type;\n+64 for (int i=0; i_\bB_\bC_\bR_\bS_\bM_\ba_\bt_\br_\bi_\bx_\b<_\bB_\b,_\bA_\b>_\b:_\b:_\ba_\bd_\bd_\bi_\bn_\bd_\be_\bx(i, i);\n 66\n-_\b6_\b8 using _\ba_\bl_\bl_\bo_\bc_\ba_\bt_\bo_\br_\b__\bt_\by_\bp_\be = A;\n-69\n-_\b7_\b4 using _\br_\be_\bf_\be_\br_\be_\bn_\bc_\be = window_type&;\n-75\n-_\b8_\b0 using _\bc_\bo_\bn_\bs_\bt_\b__\br_\be_\bf_\be_\br_\be_\bn_\bc_\be = const window_type&;\n-81\n-_\b8_\b3 using _\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be = typename A::size_type;\n-84\n-_\b9_\b0 using _\bv_\ba_\bl_\bu_\be_\b__\bt_\by_\bp_\be = _\bB_\bl_\bo_\bc_\bk_\bV_\be_\bc_\bt_\bo_\br_\b<_\bB_\b,_\bA_\b>;\n+67 this->_\bB_\bC_\bR_\bS_\bM_\ba_\bt_\br_\bi_\bx_\b<_\bB_\b,_\bA_\b>_\b:_\b:_\be_\bn_\bd_\bi_\bn_\bd_\bi_\bc_\be_\bs();\n+68\n+69 }\n+70\n+_\b7_\b2 _\bB_\bD_\bM_\ba_\bt_\br_\bi_\bx (std::initializer_list const &list)\n+73 : _\bB_\bD_\bM_\ba_\bt_\br_\bi_\bx(list.size())\n+74 {\n+75 size_t i=0;\n+76 for (auto it = list.begin(); it != list.end(); ++it, ++i)\n+77 (*this)[i][i] = *it;\n+78 }\n+79\n+_\b8_\b1 void _\bs_\be_\bt_\bS_\bi_\bz_\be(_\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be size)\n+82 {\n+83 this->_\bB_\bC_\bR_\bS_\bM_\ba_\bt_\br_\bi_\bx_\b<_\bB_\b,_\bA_\b>_\b:_\b:_\bs_\be_\bt_\bS_\bi_\bz_\be(size, // rows\n+84 size, // columns\n+85 size); // nonzeros\n+86\n+87 for (auto i : range(size))\n+88 this->_\bB_\bC_\bR_\bS_\bM_\ba_\bt_\br_\bi_\bx_\b<_\bB_\b,_\bA_\b>_\b:_\b:_\bs_\be_\bt_\br_\bo_\bw_\bs_\bi_\bz_\be(i, 1);\n+89\n+90 this->_\bB_\bC_\bR_\bS_\bM_\ba_\bt_\br_\bi_\bx_\b<_\bB_\b,_\bA_\b>_\b:_\b:_\be_\bn_\bd_\br_\bo_\bw_\bs_\bi_\bz_\be_\bs();\n 91\n-_\b9_\b4 using _\bb_\bl_\bo_\bc_\bk_\b__\bt_\by_\bp_\be = _\bB_\bl_\bo_\bc_\bk_\bV_\be_\bc_\bt_\bo_\br_\b<_\bB_\b,_\bA_\b>;\n-95\n-96 //===== constructors and such\n+92 for (auto i : range(size))\n+93 this->_\bB_\bC_\bR_\bS_\bM_\ba_\bt_\br_\bi_\bx_\b<_\bB_\b,_\bA_\b>_\b:_\b:_\ba_\bd_\bd_\bi_\bn_\bd_\be_\bx(i, i);\n+94\n+95 this->_\bB_\bC_\bR_\bS_\bM_\ba_\bt_\br_\bi_\bx_\b<_\bB_\b,_\bA_\b>_\b:_\b:_\be_\bn_\bd_\bi_\bn_\bd_\bi_\bc_\be_\bs();\n+96 }\n 97\n-_\b1_\b0_\b2 _\bV_\ba_\br_\bi_\ba_\bb_\bl_\be_\bB_\bl_\bo_\bc_\bk_\bV_\be_\bc_\bt_\bo_\br () :\n-103 Base()\n-104 {}\n-105\n-_\b1_\b1_\b2 explicit _\bV_\ba_\br_\bi_\ba_\bb_\bl_\be_\bB_\bl_\bo_\bc_\bk_\bV_\be_\bc_\bt_\bo_\br (_\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be numBlocks) :\n-113 Base(),\n-114 block(numBlocks)\n-115 {}\n-116\n-_\b1_\b2_\b5 _\bV_\ba_\br_\bi_\ba_\bb_\bl_\be_\bB_\bl_\bo_\bc_\bk_\bV_\be_\bc_\bt_\bo_\br (_\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be numBlocks, _\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be blockSize) :\n-126 Base(),\n-127 block(numBlocks),\n-128 storage_(numBlocks*blockSize)\n-129 {\n-130 // and we can allocate the big array in the base class\n-131 syncBaseArray();\n+_\b9_\b9 _\bB_\bD_\bM_\ba_\bt_\br_\bi_\bx& _\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b=_\b (const _\bB_\bD_\bM_\ba_\bt_\br_\bi_\bx& other) {\n+100 this->_\bB_\bC_\bR_\bS_\bM_\ba_\bt_\br_\bi_\bx_\b<_\bB_\b,_\bA_\b>_\b:_\b:_\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b=(other);\n+101 return *this;\n+102 }\n+103\n+_\b1_\b0_\b5 _\bB_\bD_\bM_\ba_\bt_\br_\bi_\bx& _\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b=_\b (const _\bf_\bi_\be_\bl_\bd_\b__\bt_\by_\bp_\be& k) {\n+106 this->_\bB_\bC_\bR_\bS_\bM_\ba_\bt_\br_\bi_\bx_\b<_\bB_\b,_\bA_\b>_\b:_\b:_\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b=(k);\n+107 return *this;\n+108 }\n+109\n+115 template \n+_\b1_\b1_\b6 void _\bs_\bo_\bl_\bv_\be (V& x, const V& rhs) const {\n+117 for (_\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be i=0; i_\bN(); i++)\n+118 {\n+119 auto&& xv = Impl::asVector(x[i]);\n+120 auto&& rhsv = Impl::asVector(rhs[i]);\n+121 Impl::asMatrix((*this)[i][i]).solve(xv,rhsv);\n+122 }\n+123 }\n+124\n+_\b1_\b2_\b6 void _\bi_\bn_\bv_\be_\br_\bt() {\n+127 for (_\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be i=0; i_\bN(); i++)\n+128 Impl::asMatrix((*this)[i][i])._\bi_\bn_\bv_\be_\br_\bt();\n+129 }\n+130\n+131 private:\n 132\n-133 // set the windows into the big array\n-134 for (_\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be i=0; ip+(i*blockSize));\n+133 // ////////////////////////////////////////////////////////////////////////\n+////\n+134 // The following methods from the base class should now actually be called\n+135 // ////////////////////////////////////////////////////////////////////////\n+////\n 136\n-137 // and the vector is usable\n-138 initialized = true;\n-139 }\n-140\n-_\b1_\b4_\b2 _\bV_\ba_\br_\bi_\ba_\bb_\bl_\be_\bB_\bl_\bo_\bc_\bk_\bV_\be_\bc_\bt_\bo_\br (const _\bV_\ba_\br_\bi_\ba_\bb_\bl_\be_\bB_\bl_\bo_\bc_\bk_\bV_\be_\bc_\bt_\bo_\br& a) :\n-143 Base(static_cast(a)),\n-144 block(a.block),\n-145 storage_(a.storage_)\n-146 {\n-147 syncBaseArray();\n-148\n-149 // and we must set the windows\n-150 if (block.size()>0) {\n-151 block[0].set(block[0].getsize(),this->p); // first block\n-152 for (_\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be i=1; ip+(i*blockSize));\n-220\n-221 // and the vector is usable\n-222 initialized = true;\n-223 }\n-224\n-225 //===== assignment from scalar\n-226\n-_\b2_\b2_\b8 _\bV_\ba_\br_\bi_\ba_\bb_\bl_\be_\bB_\bl_\bo_\bc_\bk_\bV_\be_\bc_\bt_\bo_\br& _\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b=_\b (const _\bf_\bi_\be_\bl_\bd_\b__\bt_\by_\bp_\be& k)\n-229 {\n-230 (static_cast&>(*this)) = k;\n-231 return *this;\n-232 }\n-233\n-234\n-235 //===== the creation interface\n-236\n-237 class CreateIterator;\n-238\n-239#ifndef DOXYGEN\n-240\n-241 // The window_type does not hand out a reference to its size,\n-242 // so in order to provide a valid iterator, we need a workaround\n-243 // to make assignment possible. This proxy enables just that by\n-244 // implicitly converting to the stored size for read access and\n-245 // tunneling assignment to the accessor method of the window.\n-246 struct SizeProxy\n-247 {\n-248\n-249 operator size_type () const\n-250 {\n-251 return target->getsize();\n-252 }\n-253\n-254 SizeProxy& operator= (size_type size)\n-255 {\n-256 target->setsize(size);\n-257 return *this;\n-258 }\n-259\n-260 private:\n-261\n-262 friend class CreateIterator;\n-263\n-264 SizeProxy (window_type& t) :\n-265 target(&t)\n-266 {}\n-267\n-268 window_type* target;\n-269 };\n-270\n-271#endif // DOXYGEN\n-272\n-_\b2_\b7_\b4 class _\bC_\br_\be_\ba_\bt_\be_\bI_\bt_\be_\br_\ba_\bt_\bo_\br\n-275 {\n-276 public:\n-_\b2_\b7_\b8 using _\bi_\bt_\be_\br_\ba_\bt_\bo_\br_\b__\bc_\ba_\bt_\be_\bg_\bo_\br_\by = std::output_iterator_tag;\n-279\n-_\b2_\b8_\b1 using _\bv_\ba_\bl_\bu_\be_\b__\bt_\by_\bp_\be = _\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be;\n-282\n-_\b2_\b8_\b9 using _\bd_\bi_\bf_\bf_\be_\br_\be_\bn_\bc_\be_\b__\bt_\by_\bp_\be = void;\n-290\n-_\b2_\b9_\b2 using _\bp_\bo_\bi_\bn_\bt_\be_\br = _\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be*;\n-293\n-_\b2_\b9_\b5 using _\br_\be_\bf_\be_\br_\be_\bn_\bc_\be = SizeProxy;\n-296\n-_\b2_\b9_\b8 _\bC_\br_\be_\ba_\bt_\be_\bI_\bt_\be_\br_\ba_\bt_\bo_\br (_\bV_\ba_\br_\bi_\ba_\bb_\bl_\be_\bB_\bl_\bo_\bc_\bk_\bV_\be_\bc_\bt_\bo_\br& _v, int _i, bool _isEnd) :\n-299 v(_v),\n-300 i(_i),\n-301 isEnd(_isEnd)\n-302 {}\n-303\n-_\b3_\b0_\b4 _\b~_\bC_\br_\be_\ba_\bt_\be_\bI_\bt_\be_\br_\ba_\bt_\bo_\br ()\n-305 {\n-306 // When the iterator gets destructed, we allocate the memory\n-307 // for the VariableBlockVector if\n-308 // 1. the current iterator was not created as enditerator\n-309 // 2. we're at the last block\n-310 // 3. the vector hasn't been initialized earlier\n-311 if (not isEnd && i==v.block.size() && not v.initialized)\n-312 v.allocate();\n-313 }\n-314\n-_\b3_\b1_\b6 _\bC_\br_\be_\ba_\bt_\be_\bI_\bt_\be_\br_\ba_\bt_\bo_\br& _\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b+_\b+()\n-317 {\n-318 // go to next block\n-319 ++i;\n-320\n-321 return *this;\n-322 }\n-323\n-_\b3_\b2_\b5 _\bC_\br_\be_\ba_\bt_\be_\bI_\bt_\be_\br_\ba_\bt_\bo_\br _\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b+_\b+_\b (int)\n-326 {\n-327 _\bC_\br_\be_\ba_\bt_\be_\bI_\bt_\be_\br_\ba_\bt_\bo_\br tmp(*this);\n-328 this->_\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b+_\b+();\n-329 return tmp;\n-330 }\n-331\n-_\b3_\b3_\b3 bool _\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b!_\b=_\b (const _\bC_\br_\be_\ba_\bt_\be_\bI_\bt_\be_\br_\ba_\bt_\bo_\br& it) const\n-334 {\n-335 return (i!=it.i) || (&v!=&it.v);\n-336 }\n-337\n-_\b3_\b3_\b9 bool _\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b=_\b=_\b (const _\bC_\br_\be_\ba_\bt_\be_\bI_\bt_\be_\br_\ba_\bt_\bo_\br& it) const\n-340 {\n-341 return (i==it.i) && (&v==&it.v);\n-342 }\n-343\n-_\b3_\b4_\b5 _\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be _\bi_\bn_\bd_\be_\bx () const\n-346 {\n-347 return i;\n-348 }\n-349\n-_\b3_\b5_\b1 void _\bs_\be_\bt_\bb_\bl_\bo_\bc_\bk_\bs_\bi_\bz_\be (_\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be _k)\n-352 {\n-353 v.block[i].setsize(_k);\n-354 }\n-355\n-357#ifdef DOXYGEN\n-358 _\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be&\n-359#else\n-360 SizeProxy\n-361#endif\n-_\b3_\b6_\b2 _\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b*()\n-363 {\n-364 return {v.block[i]};\n-365 }\n-366\n-367 private:\n-368 _\bV_\ba_\br_\bi_\ba_\bb_\bl_\be_\bB_\bl_\bo_\bc_\bk_\bV_\be_\bc_\bt_\bo_\br& v; // my vector\n-369 _\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be i; // current block to be defined\n-370 const bool isEnd; // flag if this object was created as the end iterator.\n-371 };\n-372\n-373 // CreateIterator wants to set all the arrays ...\n-_\b3_\b7_\b4 friend class _\bC_\br_\be_\ba_\bt_\be_\bI_\bt_\be_\br_\ba_\bt_\bo_\br;\n-375\n-_\b3_\b7_\b7 _\bC_\br_\be_\ba_\bt_\be_\bI_\bt_\be_\br_\ba_\bt_\bo_\br _\bc_\br_\be_\ba_\bt_\be_\bb_\be_\bg_\bi_\bn ()\n-378 {\n-379#ifdef DUNE_ISTL_WITH_CHECKING\n-380 if (initialized) DUNE_THROW(_\bI_\bS_\bT_\bL_\bE_\br_\br_\bo_\br,\"no CreateIterator in initialized\n-state\");\n-381#endif\n-382 return _\bC_\br_\be_\ba_\bt_\be_\bI_\bt_\be_\br_\ba_\bt_\bo_\br(*this, 0, false);\n-383 }\n-384\n-_\b3_\b8_\b6 _\bC_\br_\be_\ba_\bt_\be_\bI_\bt_\be_\br_\ba_\bt_\bo_\br _\bc_\br_\be_\ba_\bt_\be_\be_\bn_\bd ()\n-387 {\n-388 return _\bC_\br_\be_\ba_\bt_\be_\bI_\bt_\be_\br_\ba_\bt_\bo_\br(*this, block.size(), true);\n-389 }\n-390\n-391\n-392 //===== access to components\n-393 // has to be overwritten from base class because it must\n-394 // return access to the windows\n-395\n-_\b3_\b9_\b7 window_type& _\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b[_\b]_\b (_\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be i)\n-398 {\n-399#ifdef DUNE_ISTL_WITH_CHECKING\n-400 if (i>=block.size()) DUNE_THROW(_\bI_\bS_\bT_\bL_\bE_\br_\br_\bo_\br,\"index out of range\");\n-401#endif\n-402 return block[i];\n-403 }\n-404\n-_\b4_\b0_\b6 const window_type& _\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b[_\b]_\b (_\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be i) const\n-407 {\n-408#ifdef DUNE_ISTL_WITH_CHECKING\n-409 if (i<0 || i>=block.size()) DUNE_THROW(_\bI_\bS_\bT_\bL_\bE_\br_\br_\bo_\br,\"index out of range\");\n-410#endif\n-411 return block[i];\n-412 }\n-413\n-_\b4_\b1_\b4 using _\bI_\bt_\be_\br_\ba_\bt_\bo_\br = IndexedIterator;\n-415\n-_\b4_\b1_\b7 _\bI_\bt_\be_\br_\ba_\bt_\bo_\br _\bb_\be_\bg_\bi_\bn ()\n-418 {\n-419 return _\bI_\bt_\be_\br_\ba_\bt_\bo_\br{block.begin()};\n-420 }\n-421\n-_\b4_\b2_\b3 _\bI_\bt_\be_\br_\ba_\bt_\bo_\br _\be_\bn_\bd ()\n-424 {\n-425 return _\bI_\bt_\be_\br_\ba_\bt_\bo_\br{block.end()};\n-426 }\n-427\n-_\b4_\b3_\b0 _\bI_\bt_\be_\br_\ba_\bt_\bo_\br _\bb_\be_\bf_\bo_\br_\be_\bE_\bn_\bd ()\n-431 {\n-432 return _\bI_\bt_\be_\br_\ba_\bt_\bo_\br{--block.end()};\n-433 }\n-434\n-_\b4_\b3_\b7 _\bI_\bt_\be_\br_\ba_\bt_\bo_\br _\bb_\be_\bf_\bo_\br_\be_\bB_\be_\bg_\bi_\bn ()\n-438 {\n-439 return _\bI_\bt_\be_\br_\ba_\bt_\bo_\br{--block.begin()};\n-440 }\n-441\n-_\b4_\b4_\b3 using _\bi_\bt_\be_\br_\ba_\bt_\bo_\br = _\bI_\bt_\be_\br_\ba_\bt_\bo_\br;\n-444\n-_\b4_\b4_\b6 using _\bC_\bo_\bn_\bs_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br = IndexedIterator;\n-447\n-_\b4_\b4_\b9 using _\bc_\bo_\bn_\bs_\bt_\b__\bi_\bt_\be_\br_\ba_\bt_\bo_\br = _\bC_\bo_\bn_\bs_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br;\n-450\n-_\b4_\b5_\b2 _\bC_\bo_\bn_\bs_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br _\bb_\be_\bg_\bi_\bn () const\n-453 {\n-454 return _\bC_\bo_\bn_\bs_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br{block.begin()};\n-455 }\n-456\n-_\b4_\b5_\b8 _\bC_\bo_\bn_\bs_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br _\be_\bn_\bd () const\n-459 {\n-460 return _\bC_\bo_\bn_\bs_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br{block.end()};\n-461 }\n-462\n-_\b4_\b6_\b5 _\bC_\bo_\bn_\bs_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br _\bb_\be_\bf_\bo_\br_\be_\bE_\bn_\bd () const\n-466 {\n-467 return _\bC_\bo_\bn_\bs_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br{--block.end()};\n-468 }\n-469\n-_\b4_\b7_\b2 _\bC_\bo_\bn_\bs_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br _\bb_\be_\bf_\bo_\br_\be_\bB_\be_\bg_\bi_\bn () const\n-473 {\n-474 return _\bC_\bo_\bn_\bs_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br{--block.begin()};\n-475 }\n-476\n-_\b4_\b7_\b8 _\bC_\bo_\bn_\bs_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br _\br_\be_\bn_\bd () const\n-479 {\n-480 return _\bC_\bo_\bn_\bs_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br{block.rend()};\n-481 }\n-482\n-_\b4_\b8_\b4 _\bI_\bt_\be_\br_\ba_\bt_\bo_\br _\bf_\bi_\bn_\bd (_\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be i)\n-485 {\n-486 _\bI_\bt_\be_\br_\ba_\bt_\bo_\br tmp = block.begin();\n-487 tmp+=std::min(i, block.size());\n-488 return tmp;\n-489 }\n-490\n-_\b4_\b9_\b2 _\bC_\bo_\bn_\bs_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br _\bf_\bi_\bn_\bd (_\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be i) const\n-493 {\n-494 _\bC_\bo_\bn_\bs_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br tmp = block.begin();\n-495 tmp+=std::min(i, block.size());\n-496 return tmp;\n-497 }\n-498\n-499 //===== sizes\n-500\n-_\b5_\b0_\b2 _\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be _\bN () const noexcept\n-503 {\n-504 return block.size();\n-505 }\n-506\n-_\b5_\b1_\b1 _\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be _\bs_\bi_\bz_\be () const noexcept\n-512 {\n-513 return block.size();\n-514 }\n-515\n-516\n-517 private:\n-518\n-519 void allocate ()\n-520 {\n-521 if (this->initialized)\n-522 DUNE_THROW(_\bI_\bS_\bT_\bL_\bE_\br_\br_\bo_\br, \"Attempt to re-allocate already initialized\n-VariableBlockVector\");\n-523\n-524 // calculate space needed:\n-525 _\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be storageNeeded = 0;\n-526 for(_\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be i = 0; i < block.size(); i++)\n-527 storageNeeded += block[i]._\bs_\bi_\bz_\be();\n-528\n-529 storage_.resize(storageNeeded);\n-530 syncBaseArray();\n-531\n-532 // and we set the window pointers\n-533 block[0].setptr(this->p); // pointer to first block\n-534 for (_\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be j=1; jinitialized = true;\n-539 }\n-540\n-541 void syncBaseArray () noexcept\n-542 {\n-543 this->p = storage_.data();\n-544 this->n = storage_.size();\n-545 }\n-546\n-547 VectorWindows block = {}; // vector of blocks pointing to the array in the\n-base class\n-548 std::vector storage_ = {};\n-549 bool initialized = false; // true if vector has been initialized\n-550 };\n-551\n-555 template\n-_\b5_\b5_\b6 struct FieldTraits< _\bV_\ba_\br_\bi_\ba_\bb_\bl_\be_\bB_\bl_\bo_\bc_\bk_\bV_\be_\bc_\bt_\bo_\br >\n-557 {\n-_\b5_\b5_\b8 typedef typename FieldTraits::field_type _\bf_\bi_\be_\bl_\bd_\b__\bt_\by_\bp_\be;\n-_\b5_\b5_\b9 typedef typename FieldTraits::real_type _\br_\be_\ba_\bl_\b__\bt_\by_\bp_\be;\n-560 };\n-568} // end namespace\n-569\n-570#endif\n-_\bb_\bv_\be_\bc_\bt_\bo_\br_\b._\bh_\bh\n-This file implements a vector space as a tensor product of a given vector\n-space. The number of compon...\n-_\bi_\bs_\bt_\bl_\be_\bx_\bc_\be_\bp_\bt_\bi_\bo_\bn_\b._\bh_\bh\n+137 // createbegin and createend should be in there, too, but I can't get it to\n+compile\n+138 // BCRSMatrix::CreateIterator createbegin () {}\n+139 // BCRSMatrix::CreateIterator createend () {}\n+140 void setrowsize (_\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be i, _\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be s) {}\n+141 void incrementrowsize (_\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be i) {}\n+142 void endrowsizes () {}\n+143 void addindex (_\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be row, _\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be _\bc_\bo_\bl) {}\n+144 void endindices () {}\n+145 };\n+146\n+147 template\n+_\b1_\b4_\b8 struct FieldTraits< _\bB_\bD_\bM_\ba_\bt_\br_\bi_\bx >\n+149 {\n+_\b1_\b5_\b0 using _\bf_\bi_\be_\bl_\bd_\b__\bt_\by_\bp_\be = typename _\bB_\bD_\bM_\ba_\bt_\br_\bi_\bx_\b<_\bB_\b,_\b _\bA_\b>_\b:_\b:_\bf_\bi_\be_\bl_\bd_\b__\bt_\by_\bp_\be;\n+_\b1_\b5_\b1 using _\br_\be_\ba_\bl_\b__\bt_\by_\bp_\be = typename FieldTraits::real_type;\n+152 };\n+155} // end namespace Dune\n+156\n+157#endif\n+_\bb_\bc_\br_\bs_\bm_\ba_\bt_\br_\bi_\bx_\b._\bh_\bh\n+Implementation of the BCRSMatrix class.\n _\bb_\bl_\bo_\bc_\bk_\bl_\be_\bv_\be_\bl_\b._\bh_\bh\n Helper functions for determining the vector/matrix block level.\n+_\bc_\bo_\bl\n+Col col\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn matrixmatrix.hh:351\n _\bD_\bu_\bn_\be\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn allocator.hh:11\n-_\bD_\bu_\bn_\be_\b:_\b:_\bB_\bl_\bo_\bc_\bk_\bV_\be_\bc_\bt_\bo_\br\n-A vector of blocks with memory management.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn bvector.hh:392\n-_\bD_\bu_\bn_\be_\b:_\b:_\bI_\bS_\bT_\bL_\bE_\br_\br_\bo_\br\n-derive error class from the base class in common\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn istlexception.hh:19\n-_\bD_\bu_\bn_\be_\b:_\b:_\bV_\ba_\br_\bi_\ba_\bb_\bl_\be_\bB_\bl_\bo_\bc_\bk_\bV_\be_\bc_\bt_\bo_\br\n-A Vector of blocks with different blocksizes.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn vbvector.hh:48\n-_\bD_\bu_\bn_\be_\b:_\b:_\bV_\ba_\br_\bi_\ba_\bb_\bl_\be_\bB_\bl_\bo_\bc_\bk_\bV_\be_\bc_\bt_\bo_\br_\b:_\b:_\bV_\ba_\br_\bi_\ba_\bb_\bl_\be_\bB_\bl_\bo_\bc_\bk_\bV_\be_\bc_\bt_\bo_\br\n-VariableBlockVector(size_type numBlocks, size_type blockSize)\n-Construct a vector with given number of blocks each having a constant size.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn vbvector.hh:125\n-_\bD_\bu_\bn_\be_\b:_\b:_\bV_\ba_\br_\bi_\ba_\bb_\bl_\be_\bB_\bl_\bo_\bc_\bk_\bV_\be_\bc_\bt_\bo_\br_\b:_\b:_\bV_\ba_\br_\bi_\ba_\bb_\bl_\be_\bB_\bl_\bo_\bc_\bk_\bV_\be_\bc_\bt_\bo_\br\n-VariableBlockVector()\n-Constructor without arguments makes an empty vector.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn vbvector.hh:102\n-_\bD_\bu_\bn_\be_\b:_\b:_\bV_\ba_\br_\bi_\ba_\bb_\bl_\be_\bB_\bl_\bo_\bc_\bk_\bV_\be_\bc_\bt_\bo_\br_\b:_\b:_\bs_\bw_\ba_\bp\n-friend void swap(VariableBlockVector &lhs, VariableBlockVector &rhs) noexcept\n-Free function to swap the storage and internal state of lhs with rhs.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn vbvector.hh:190\n-_\bD_\bu_\bn_\be_\b:_\b:_\bV_\ba_\br_\bi_\ba_\bb_\bl_\be_\bB_\bl_\bo_\bc_\bk_\bV_\be_\bc_\bt_\bo_\br_\b:_\b:_\bi_\bt_\be_\br_\ba_\bt_\bo_\br\n-Iterator iterator\n-Export the iterator type using std naming rules.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn vbvector.hh:443\n-_\bD_\bu_\bn_\be_\b:_\b:_\bV_\ba_\br_\bi_\ba_\bb_\bl_\be_\bB_\bl_\bo_\bc_\bk_\bV_\be_\bc_\bt_\bo_\br_\b:_\b:_\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b=\n-VariableBlockVector & operator=(VariableBlockVector tmp)\n-Copy and move assignment.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn vbvector.hh:171\n-_\bD_\bu_\bn_\be_\b:_\b:_\bV_\ba_\br_\bi_\ba_\bb_\bl_\be_\bB_\bl_\bo_\bc_\bk_\bV_\be_\bc_\bt_\bo_\br_\b:_\b:_\bV_\ba_\br_\bi_\ba_\bb_\bl_\be_\bB_\bl_\bo_\bc_\bk_\bV_\be_\bc_\bt_\bo_\br\n-VariableBlockVector(size_type numBlocks)\n-Construct a vector with given number of blocks, but size of each block is not\n-yet known.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn vbvector.hh:112\n-_\bD_\bu_\bn_\be_\b:_\b:_\bV_\ba_\br_\bi_\ba_\bb_\bl_\be_\bB_\bl_\bo_\bc_\bk_\bV_\be_\bc_\bt_\bo_\br_\b:_\b:_\bf_\bi_\be_\bl_\bd_\b__\bt_\by_\bp_\be\n+_\bD_\bu_\bn_\be_\b:_\b:_\bB_\bC_\bR_\bS_\bM_\ba_\bt_\br_\bi_\bx\n+A sparse block matrix with compressed row storage.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn bcrsmatrix.hh:466\n+_\bD_\bu_\bn_\be_\b:_\b:_\bB_\bC_\bR_\bS_\bM_\ba_\bt_\br_\bi_\bx_\b:_\b:_\be_\bn_\bd_\br_\bo_\bw_\bs_\bi_\bz_\be_\bs\n+void endrowsizes()\n+indicate that size of all rows is defined\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn bcrsmatrix.hh:1146\n+_\bD_\bu_\bn_\be_\b:_\b:_\bB_\bC_\bR_\bS_\bM_\ba_\bt_\br_\bi_\bx_\b:_\b:_\br_\ba_\bn_\bd_\bo_\bm\n+@ random\n+Build entries randomly.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn bcrsmatrix.hh:526\n+_\bD_\bu_\bn_\be_\b:_\b:_\bB_\bC_\bR_\bS_\bM_\ba_\bt_\br_\bi_\bx_\b:_\b:_\be_\bn_\bd_\bi_\bn_\bd_\bi_\bc_\be_\bs\n+void endindices()\n+indicate that all indices are defined, check consistency\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn bcrsmatrix.hh:1269\n+_\bD_\bu_\bn_\be_\b:_\b:_\bB_\bC_\bR_\bS_\bM_\ba_\bt_\br_\bi_\bx_\b:_\b:_\bN\n+size_type N() const\n+number of rows (counted in blocks)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn bcrsmatrix.hh:2001\n+_\bD_\bu_\bn_\be_\b:_\b:_\bB_\bC_\bR_\bS_\bM_\ba_\bt_\br_\bi_\bx_\b:_\b:_\bs_\be_\bt_\bS_\bi_\bz_\be\n+void setSize(size_type rows, size_type columns, size_type nnz=0)\n+Set the size of the matrix.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn bcrsmatrix.hh:858\n+_\bD_\bu_\bn_\be_\b:_\b:_\bB_\bC_\bR_\bS_\bM_\ba_\bt_\br_\bi_\bx_\b:_\b:_\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b=\n+BCRSMatrix & operator=(const BCRSMatrix &Mat)\n+assignment\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn bcrsmatrix.hh:908\n+_\bD_\bu_\bn_\be_\b:_\b:_\bB_\bD_\bM_\ba_\bt_\br_\bi_\bx\n+A block-diagonal matrix.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn bdmatrix.hh:33\n+_\bD_\bu_\bn_\be_\b:_\b:_\bB_\bD_\bM_\ba_\bt_\br_\bi_\bx_\b:_\b:_\bf_\bi_\be_\bl_\bd_\b__\bt_\by_\bp_\be\n typename Imp::BlockTraits< B >::field_type field_type\n export the type representing the field\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn vbvector.hh:65\n-_\bD_\bu_\bn_\be_\b:_\b:_\bV_\ba_\br_\bi_\ba_\bb_\bl_\be_\bB_\bl_\bo_\bc_\bk_\bV_\be_\bc_\bt_\bo_\br_\b:_\b:_\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be\n-typename A::size_type size_type\n-The size type for the index access.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn vbvector.hh:83\n-_\bD_\bu_\bn_\be_\b:_\b:_\bV_\ba_\br_\bi_\ba_\bb_\bl_\be_\bB_\bl_\bo_\bc_\bk_\bV_\be_\bc_\bt_\bo_\br_\b:_\b:_\bN\n-size_type N() const noexcept\n-number of blocks in the vector (are of variable size here)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn vbvector.hh:502\n-_\bD_\bu_\bn_\be_\b:_\b:_\bV_\ba_\br_\bi_\ba_\bb_\bl_\be_\bB_\bl_\bo_\bc_\bk_\bV_\be_\bc_\bt_\bo_\br_\b:_\b:_\bV_\ba_\br_\bi_\ba_\bb_\bl_\be_\bB_\bl_\bo_\bc_\bk_\bV_\be_\bc_\bt_\bo_\br\n-VariableBlockVector(const VariableBlockVector &a)\n-Copy constructor, has copy semantics.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn vbvector.hh:142\n-_\bD_\bu_\bn_\be_\b:_\b:_\bV_\ba_\br_\bi_\ba_\bb_\bl_\be_\bB_\bl_\bo_\bc_\bk_\bV_\be_\bc_\bt_\bo_\br_\b:_\b:_\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b[_\b]\n-window_type & operator[](size_type i)\n-random access to blocks\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn vbvector.hh:397\n-_\bD_\bu_\bn_\be_\b:_\b:_\bV_\ba_\br_\bi_\ba_\bb_\bl_\be_\bB_\bl_\bo_\bc_\bk_\bV_\be_\bc_\bt_\bo_\br_\b:_\b:_\ba_\bl_\bl_\bo_\bc_\ba_\bt_\bo_\br_\b__\bt_\by_\bp_\be\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn bdmatrix.hh:39\n+_\bD_\bu_\bn_\be_\b:_\b:_\bB_\bD_\bM_\ba_\bt_\br_\bi_\bx_\b:_\b:_\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be\n+A::size_type size_type\n+implement row_type with compressed vector\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn bdmatrix.hh:51\n+_\bD_\bu_\bn_\be_\b:_\b:_\bB_\bD_\bM_\ba_\bt_\br_\bi_\bx_\b:_\b:_\bB_\bD_\bM_\ba_\bt_\br_\bi_\bx\n+BDMatrix()\n+Default constructor.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn bdmatrix.hh:54\n+_\bD_\bu_\bn_\be_\b:_\b:_\bB_\bD_\bM_\ba_\bt_\br_\bi_\bx_\b:_\b:_\bB_\bD_\bM_\ba_\bt_\br_\bi_\bx\n+BDMatrix(std::initializer_list< B > const &list)\n+Construct from a std::initializer_list.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn bdmatrix.hh:72\n+_\bD_\bu_\bn_\be_\b:_\b:_\bB_\bD_\bM_\ba_\bt_\br_\bi_\bx_\b:_\b:_\bb_\bl_\bo_\bc_\bk_\b__\bt_\by_\bp_\be\n+B block_type\n+export the type representing the components\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn bdmatrix.hh:42\n+_\bD_\bu_\bn_\be_\b:_\b:_\bB_\bD_\bM_\ba_\bt_\br_\bi_\bx_\b:_\b:_\bs_\bo_\bl_\bv_\be\n+void solve(V &x, const V &rhs) const\n+Solve the system Ax=b in O(n) time.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn bdmatrix.hh:116\n+_\bD_\bu_\bn_\be_\b:_\b:_\bB_\bD_\bM_\ba_\bt_\br_\bi_\bx_\b:_\b:_\ba_\bl_\bl_\bo_\bc_\ba_\bt_\bo_\br_\b__\bt_\by_\bp_\be\n A allocator_type\n export the allocator type\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn vbvector.hh:68\n-_\bD_\bu_\bn_\be_\b:_\b:_\bV_\ba_\br_\bi_\ba_\bb_\bl_\be_\bB_\bl_\bo_\bc_\bk_\bV_\be_\bc_\bt_\bo_\br_\b:_\b:_\bc_\br_\be_\ba_\bt_\be_\be_\bn_\bd\n-CreateIterator createend()\n-get create iterator pointing to one after the last block\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn vbvector.hh:386\n-_\bD_\bu_\bn_\be_\b:_\b:_\bV_\ba_\br_\bi_\ba_\bb_\bl_\be_\bB_\bl_\bo_\bc_\bk_\bV_\be_\bc_\bt_\bo_\br_\b:_\b:_\bV_\ba_\br_\bi_\ba_\bb_\bl_\be_\bB_\bl_\bo_\bc_\bk_\bV_\be_\bc_\bt_\bo_\br\n-VariableBlockVector(VariableBlockVector &&tmp)\n-Move constructor:\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn vbvector.hh:161\n-_\bD_\bu_\bn_\be_\b:_\b:_\bV_\ba_\br_\bi_\ba_\bb_\bl_\be_\bB_\bl_\bo_\bc_\bk_\bV_\be_\bc_\bt_\bo_\br_\b:_\b:_\bc_\br_\be_\ba_\bt_\be_\bb_\be_\bg_\bi_\bn\n-CreateIterator createbegin()\n-get initial create iterator\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn vbvector.hh:377\n-_\bD_\bu_\bn_\be_\b:_\b:_\bV_\ba_\br_\bi_\ba_\bb_\bl_\be_\bB_\bl_\bo_\bc_\bk_\bV_\be_\bc_\bt_\bo_\br_\b:_\b:_\bc_\bo_\bn_\bs_\bt_\b__\bi_\bt_\be_\br_\ba_\bt_\bo_\br\n-ConstIterator const_iterator\n-Export the const iterator type using std naming rules.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn vbvector.hh:449\n-_\bD_\bu_\bn_\be_\b:_\b:_\bV_\ba_\br_\bi_\ba_\bb_\bl_\be_\bB_\bl_\bo_\bc_\bk_\bV_\be_\bc_\bt_\bo_\br_\b:_\b:_\br_\be_\bf_\be_\br_\be_\bn_\bc_\be\n-window_type & reference\n-Export type used for references to container entries.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn vbvector.hh:74\n-_\bD_\bu_\bn_\be_\b:_\b:_\bV_\ba_\br_\bi_\ba_\bb_\bl_\be_\bB_\bl_\bo_\bc_\bk_\bV_\be_\bc_\bt_\bo_\br_\b:_\b:_\br_\be_\bn_\bd\n-ConstIterator rend() const\n-end ConstIterator\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn vbvector.hh:478\n-_\bD_\bu_\bn_\be_\b:_\b:_\bV_\ba_\br_\bi_\ba_\bb_\bl_\be_\bB_\bl_\bo_\bc_\bk_\bV_\be_\bc_\bt_\bo_\br_\b:_\b:_\bc_\bo_\bn_\bs_\bt_\b__\br_\be_\bf_\be_\br_\be_\bn_\bc_\be\n-const window_type & const_reference\n-Export type used for const references to container entries.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn vbvector.hh:80\n-_\bD_\bu_\bn_\be_\b:_\b:_\bV_\ba_\br_\bi_\ba_\bb_\bl_\be_\bB_\bl_\bo_\bc_\bk_\bV_\be_\bc_\bt_\bo_\br_\b:_\b:_\bf_\bi_\bn_\bd\n-ConstIterator find(size_type i) const\n-random access returning iterator (end if not contained)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn vbvector.hh:492\n-_\bD_\bu_\bn_\be_\b:_\b:_\bV_\ba_\br_\bi_\ba_\bb_\bl_\be_\bB_\bl_\bo_\bc_\bk_\bV_\be_\bc_\bt_\bo_\br_\b:_\b:_\bb_\be_\bf_\bo_\br_\be_\bE_\bn_\bd\n-ConstIterator beforeEnd() const\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn vbvector.hh:465\n-_\bD_\bu_\bn_\be_\b:_\b:_\bV_\ba_\br_\bi_\ba_\bb_\bl_\be_\bB_\bl_\bo_\bc_\bk_\bV_\be_\bc_\bt_\bo_\br_\b:_\b:_\bf_\bi_\bn_\bd\n-Iterator find(size_type i)\n-random access returning iterator (end if not contained)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn vbvector.hh:484\n-_\bD_\bu_\bn_\be_\b:_\b:_\bV_\ba_\br_\bi_\ba_\bb_\bl_\be_\bB_\bl_\bo_\bc_\bk_\bV_\be_\bc_\bt_\bo_\br_\b:_\b:_\bC_\bo_\bn_\bs_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br\n-IndexedIterator< typename VectorWindows::const_iterator > ConstIterator\n-Const iterator.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn vbvector.hh:446\n-_\bD_\bu_\bn_\be_\b:_\b:_\bV_\ba_\br_\bi_\ba_\bb_\bl_\be_\bB_\bl_\bo_\bc_\bk_\bV_\be_\bc_\bt_\bo_\br_\b:_\b:_\b~_\bV_\ba_\br_\bi_\ba_\bb_\bl_\be_\bB_\bl_\bo_\bc_\bk_\bV_\be_\bc_\bt_\bo_\br\n-~VariableBlockVector()=default\n-_\bD_\bu_\bn_\be_\b:_\b:_\bV_\ba_\br_\bi_\ba_\bb_\bl_\be_\bB_\bl_\bo_\bc_\bk_\bV_\be_\bc_\bt_\bo_\br_\b:_\b:_\bb_\be_\bf_\bo_\br_\be_\bB_\be_\bg_\bi_\bn\n-ConstIterator beforeBegin() const\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn vbvector.hh:472\n-_\bD_\bu_\bn_\be_\b:_\b:_\bV_\ba_\br_\bi_\ba_\bb_\bl_\be_\bB_\bl_\bo_\bc_\bk_\bV_\be_\bc_\bt_\bo_\br_\b:_\b:_\br_\be_\bs_\bi_\bz_\be\n-void resize(size_type numBlocks)\n-same effect as constructor with same argument\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn vbvector.hh:196\n-_\bD_\bu_\bn_\be_\b:_\b:_\bV_\ba_\br_\bi_\ba_\bb_\bl_\be_\bB_\bl_\bo_\bc_\bk_\bV_\be_\bc_\bt_\bo_\br_\b:_\b:_\be_\bn_\bd\n-Iterator end()\n-end Iterator\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn vbvector.hh:423\n-_\bD_\bu_\bn_\be_\b:_\b:_\bV_\ba_\br_\bi_\ba_\bb_\bl_\be_\bB_\bl_\bo_\bc_\bk_\bV_\be_\bc_\bt_\bo_\br_\b:_\b:_\bs_\bw_\ba_\bp\n-void swap(VariableBlockVector &other) noexcept\n-Exchange the storage and internal state with other.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn vbvector.hh:178\n-_\bD_\bu_\bn_\be_\b:_\b:_\bV_\ba_\br_\bi_\ba_\bb_\bl_\be_\bB_\bl_\bo_\bc_\bk_\bV_\be_\bc_\bt_\bo_\br_\b:_\b:_\bb_\be_\bg_\bi_\bn\n-ConstIterator begin() const\n-begin ConstIterator\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn vbvector.hh:452\n-_\bD_\bu_\bn_\be_\b:_\b:_\bV_\ba_\br_\bi_\ba_\bb_\bl_\be_\bB_\bl_\bo_\bc_\bk_\bV_\be_\bc_\bt_\bo_\br_\b:_\b:_\bs_\bi_\bz_\be\n-size_type size() const noexcept\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn vbvector.hh:511\n-_\bD_\bu_\bn_\be_\b:_\b:_\bV_\ba_\br_\bi_\ba_\bb_\bl_\be_\bB_\bl_\bo_\bc_\bk_\bV_\be_\bc_\bt_\bo_\br_\b:_\b:_\br_\be_\bs_\bi_\bz_\be\n-void resize(size_type numBlocks, size_type blockSize)\n-same effect as constructor with same argument\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn vbvector.hh:210\n-_\bD_\bu_\bn_\be_\b:_\b:_\bV_\ba_\br_\bi_\ba_\bb_\bl_\be_\bB_\bl_\bo_\bc_\bk_\bV_\be_\bc_\bt_\bo_\br_\b:_\b:_\bI_\bt_\be_\br_\ba_\bt_\bo_\br\n-IndexedIterator< typename VectorWindows::iterator > Iterator\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn vbvector.hh:414\n-_\bD_\bu_\bn_\be_\b:_\b:_\bV_\ba_\br_\bi_\ba_\bb_\bl_\be_\bB_\bl_\bo_\bc_\bk_\bV_\be_\bc_\bt_\bo_\br_\b:_\b:_\be_\bn_\bd\n-ConstIterator end() const\n-end ConstIterator\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn vbvector.hh:458\n-_\bD_\bu_\bn_\be_\b:_\b:_\bV_\ba_\br_\bi_\ba_\bb_\bl_\be_\bB_\bl_\bo_\bc_\bk_\bV_\be_\bc_\bt_\bo_\br_\b:_\b:_\bb_\be_\bf_\bo_\br_\be_\bB_\be_\bg_\bi_\bn\n-Iterator beforeBegin()\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn vbvector.hh:437\n-_\bD_\bu_\bn_\be_\b:_\b:_\bV_\ba_\br_\bi_\ba_\bb_\bl_\be_\bB_\bl_\bo_\bc_\bk_\bV_\be_\bc_\bt_\bo_\br_\b:_\b:_\bb_\be_\bf_\bo_\br_\be_\bE_\bn_\bd\n-Iterator beforeEnd()\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn vbvector.hh:430\n-_\bD_\bu_\bn_\be_\b:_\b:_\bV_\ba_\br_\bi_\ba_\bb_\bl_\be_\bB_\bl_\bo_\bc_\bk_\bV_\be_\bc_\bt_\bo_\br_\b:_\b:_\bb_\be_\bg_\bi_\bn\n-Iterator begin()\n-begin Iterator\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn vbvector.hh:417\n-_\bD_\bu_\bn_\be_\b:_\b:_\bV_\ba_\br_\bi_\ba_\bb_\bl_\be_\bB_\bl_\bo_\bc_\bk_\bV_\be_\bc_\bt_\bo_\br_\b:_\b:_\bC_\br_\be_\ba_\bt_\be_\bI_\bt_\be_\br_\ba_\bt_\bo_\br\n-Iterator class for sequential creation of blocks.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn vbvector.hh:275\n-_\bD_\bu_\bn_\be_\b:_\b:_\bV_\ba_\br_\bi_\ba_\bb_\bl_\be_\bB_\bl_\bo_\bc_\bk_\bV_\be_\bc_\bt_\bo_\br_\b:_\b:_\bC_\br_\be_\ba_\bt_\be_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\b:_\b:_\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b=_\b=\n-bool operator==(const CreateIterator &it) const\n-equality\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn vbvector.hh:339\n-_\bD_\bu_\bn_\be_\b:_\b:_\bV_\ba_\br_\bi_\ba_\bb_\bl_\be_\bB_\bl_\bo_\bc_\bk_\bV_\be_\bc_\bt_\bo_\br_\b:_\b:_\bC_\br_\be_\ba_\bt_\be_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\b:_\b:_\bi_\bn_\bd_\be_\bx\n-size_type index() const\n-dereferencing\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn vbvector.hh:345\n-_\bD_\bu_\bn_\be_\b:_\b:_\bV_\ba_\br_\bi_\ba_\bb_\bl_\be_\bB_\bl_\bo_\bc_\bk_\bV_\be_\bc_\bt_\bo_\br_\b:_\b:_\bC_\br_\be_\ba_\bt_\be_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\b:_\b:_\br_\be_\bf_\be_\br_\be_\bn_\bc_\be\n-SizeProxy reference\n-reference type\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn vbvector.hh:295\n-_\bD_\bu_\bn_\be_\b:_\b:_\bV_\ba_\br_\bi_\ba_\bb_\bl_\be_\bB_\bl_\bo_\bc_\bk_\bV_\be_\bc_\bt_\bo_\br_\b:_\b:_\bC_\br_\be_\ba_\bt_\be_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\b:_\b:_\bp_\bo_\bi_\bn_\bt_\be_\br\n-size_type * pointer\n-pointer type\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn vbvector.hh:292\n-_\bD_\bu_\bn_\be_\b:_\b:_\bV_\ba_\br_\bi_\ba_\bb_\bl_\be_\bB_\bl_\bo_\bc_\bk_\bV_\be_\bc_\bt_\bo_\br_\b:_\b:_\bC_\br_\be_\ba_\bt_\be_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\b:_\b:_\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b!_\b=\n-bool operator!=(const CreateIterator &it) const\n-inequality\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn vbvector.hh:333\n-_\bD_\bu_\bn_\be_\b:_\b:_\bV_\ba_\br_\bi_\ba_\bb_\bl_\be_\bB_\bl_\bo_\bc_\bk_\bV_\be_\bc_\bt_\bo_\br_\b:_\b:_\bC_\br_\be_\ba_\bt_\be_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\b:_\b:_\b~_\bC_\br_\be_\ba_\bt_\be_\bI_\bt_\be_\br_\ba_\bt_\bo_\br\n-~CreateIterator()\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn vbvector.hh:304\n-_\bD_\bu_\bn_\be_\b:_\b:_\bV_\ba_\br_\bi_\ba_\bb_\bl_\be_\bB_\bl_\bo_\bc_\bk_\bV_\be_\bc_\bt_\bo_\br_\b:_\b:_\bC_\br_\be_\ba_\bt_\be_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\b:_\b:_\bv_\ba_\bl_\bu_\be_\b__\bt_\by_\bp_\be\n-size_type value_type\n-value type\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn vbvector.hh:281\n-_\bD_\bu_\bn_\be_\b:_\b:_\bV_\ba_\br_\bi_\ba_\bb_\bl_\be_\bB_\bl_\bo_\bc_\bk_\bV_\be_\bc_\bt_\bo_\br_\b:_\b:_\bC_\br_\be_\ba_\bt_\be_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\b:_\b:_\bC_\br_\be_\ba_\bt_\be_\bI_\bt_\be_\br_\ba_\bt_\bo_\br\n-CreateIterator(VariableBlockVector &_v, int _i, bool _isEnd)\n-constructor\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn vbvector.hh:298\n-_\bD_\bu_\bn_\be_\b:_\b:_\bV_\ba_\br_\bi_\ba_\bb_\bl_\be_\bB_\bl_\bo_\bc_\bk_\bV_\be_\bc_\bt_\bo_\br_\b:_\b:_\bC_\br_\be_\ba_\bt_\be_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\b:_\b:_\bs_\be_\bt_\bb_\bl_\bo_\bc_\bk_\bs_\bi_\bz_\be\n-void setblocksize(size_type _k)\n-set size of current block\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn vbvector.hh:351\n-_\bD_\bu_\bn_\be_\b:_\b:_\bV_\ba_\br_\bi_\ba_\bb_\bl_\be_\bB_\bl_\bo_\bc_\bk_\bV_\be_\bc_\bt_\bo_\br_\b:_\b:_\bC_\br_\be_\ba_\bt_\be_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\b:_\b:_\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b*\n-size_type & operator*()\n-Access size of current block.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn vbvector.hh:362\n-_\bD_\bu_\bn_\be_\b:_\b:_\bV_\ba_\br_\bi_\ba_\bb_\bl_\be_\bB_\bl_\bo_\bc_\bk_\bV_\be_\bc_\bt_\bo_\br_\b:_\b:_\bC_\br_\be_\ba_\bt_\be_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\b:_\b:_\bi_\bt_\be_\br_\ba_\bt_\bo_\br_\b__\bc_\ba_\bt_\be_\bg_\bo_\br_\by\n-std::output_iterator_tag iterator_category\n-iterator category\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn vbvector.hh:278\n-_\bD_\bu_\bn_\be_\b:_\b:_\bV_\ba_\br_\bi_\ba_\bb_\bl_\be_\bB_\bl_\bo_\bc_\bk_\bV_\be_\bc_\bt_\bo_\br_\b:_\b:_\bC_\br_\be_\ba_\bt_\be_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\b:_\b:_\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b+_\b+\n-CreateIterator & operator++()\n-prefix increment\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn vbvector.hh:316\n-_\bD_\bu_\bn_\be_\b:_\b:_\bV_\ba_\br_\bi_\ba_\bb_\bl_\be_\bB_\bl_\bo_\bc_\bk_\bV_\be_\bc_\bt_\bo_\br_\b:_\b:_\bC_\br_\be_\ba_\bt_\be_\bI_\bt_\be_\br_\ba_\bt_\bo_\br_\b:_\b:_\bd_\bi_\bf_\bf_\be_\br_\be_\bn_\bc_\be_\b__\bt_\by_\bp_\be\n-void difference_type\n-difference type (unused)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn vbvector.hh:289\n-_\bD_\bu_\bn_\be_\b:_\b:_\bF_\bi_\be_\bl_\bd_\bT_\br_\ba_\bi_\bt_\bs_\b<_\b _\bV_\ba_\br_\bi_\ba_\bb_\bl_\be_\bB_\bl_\bo_\bc_\bk_\bV_\be_\bc_\bt_\bo_\br_\b<_\b _\bB_\b,_\b _\bA_\b _\b>_\b _\b>_\b:_\b:_\br_\be_\ba_\bl_\b__\bt_\by_\bp_\be\n-FieldTraits< B >::real_type real_type\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn vbvector.hh:559\n-_\bD_\bu_\bn_\be_\b:_\b:_\bF_\bi_\be_\bl_\bd_\bT_\br_\ba_\bi_\bt_\bs_\b<_\b _\bV_\ba_\br_\bi_\ba_\bb_\bl_\be_\bB_\bl_\bo_\bc_\bk_\bV_\be_\bc_\bt_\bo_\br_\b<_\b _\bB_\b,_\b _\bA_\b _\b>_\b _\b>_\b:_\b:_\bf_\bi_\be_\bl_\bd_\b__\bt_\by_\bp_\be\n-FieldTraits< B >::field_type field_type\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn vbvector.hh:558\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn bdmatrix.hh:45\n+_\bD_\bu_\bn_\be_\b:_\b:_\bB_\bD_\bM_\ba_\bt_\br_\bi_\bx_\b:_\b:_\bB_\bD_\bM_\ba_\bt_\br_\bi_\bx\n+BDMatrix(int size)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn bdmatrix.hh:56\n+_\bD_\bu_\bn_\be_\b:_\b:_\bB_\bD_\bM_\ba_\bt_\br_\bi_\bx_\b:_\b:_\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b=\n+BDMatrix & operator=(const BDMatrix &other)\n+assignment\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn bdmatrix.hh:99\n+_\bD_\bu_\bn_\be_\b:_\b:_\bB_\bD_\bM_\ba_\bt_\br_\bi_\bx_\b:_\b:_\bs_\be_\bt_\bS_\bi_\bz_\be\n+void setSize(size_type size)\n+Resize the matrix. Invalidates the content!\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn bdmatrix.hh:81\n+_\bD_\bu_\bn_\be_\b:_\b:_\bB_\bD_\bM_\ba_\bt_\br_\bi_\bx_\b:_\b:_\bi_\bn_\bv_\be_\br_\bt\n+void invert()\n+Inverts the matrix.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn bdmatrix.hh:126\n+_\bD_\bu_\bn_\be_\b:_\b:_\bF_\bi_\be_\bl_\bd_\bT_\br_\ba_\bi_\bt_\bs_\b<_\b _\bB_\bD_\bM_\ba_\bt_\br_\bi_\bx_\b<_\b _\bB_\b,_\b _\bA_\b _\b>_\b _\b>_\b:_\b:_\bf_\bi_\be_\bl_\bd_\b__\bt_\by_\bp_\be\n+typename BDMatrix< B, A >::field_type field_type\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn bdmatrix.hh:150\n+_\bD_\bu_\bn_\be_\b:_\b:_\bF_\bi_\be_\bl_\bd_\bT_\br_\ba_\bi_\bt_\bs_\b<_\b _\bB_\bD_\bM_\ba_\bt_\br_\bi_\bx_\b<_\b _\bB_\b,_\b _\bA_\b _\b>_\b _\b>_\b:_\b:_\br_\be_\ba_\bl_\b__\bt_\by_\bp_\be\n+typename FieldTraits< field_type >::real_type real_type\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn bdmatrix.hh:151\n ===============================================================================\n Generated by\u00a0_\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b] 1.9.8\n"}]}, {"source1": "./usr/share/doc/libdune-istl-doc/doxygen/a00029.html", "source2": "./usr/share/doc/libdune-istl-doc/doxygen/a00029.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n dune-istl: supermatrix.hh File Reference \n+dune-istl: renumberer.hh File Reference \n \n-
#include "bcrsmatrix.hh "\n-
#include "bvector.hh "\n-
#include <dune/common/fmatrix.hh>\n-
#include <dune/common/fvector.hh>\n-
#include <dune/common/typetraits.hh>\n-
#include <limits>\n-
#include <dune/istl/bccsmatrixinitializer.hh >\n-
#include "superlufunctions.hh "\n+
#include "aggregates.hh "\n
\n
Go to the source code of this file.
\n
\n
\n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,50 +1,26 @@\n dune-istl\u00a02.10\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bi_\bs_\bt_\bl\n-_\bC_\bl_\ba_\bs_\bs_\be_\bs | _\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs\n-supermatrix.hh File Reference\n-#include \"_\bb_\bc_\br_\bs_\bm_\ba_\bt_\br_\bi_\bx_\b._\bh_\bh\"\n-#include \"_\bb_\bv_\be_\bc_\bt_\bo_\br_\b._\bh_\bh\"\n-#include
\n-#include \n-#include \n-#include \n-#include <_\bd_\bu_\bn_\be_\b/_\bi_\bs_\bt_\bl_\b/_\bb_\bc_\bc_\bs_\bm_\ba_\bt_\br_\bi_\bx_\bi_\bn_\bi_\bt_\bi_\ba_\bl_\bi_\bz_\be_\br_\b._\bh_\bh>\n-#include \"_\bs_\bu_\bp_\be_\br_\bl_\bu_\bf_\bu_\bn_\bc_\bt_\bi_\bo_\bn_\bs_\b._\bh_\bh\"\n+ * _\bp_\ba_\ba_\bm_\bg\n+_\bC_\bl_\ba_\bs_\bs_\be_\bs | _\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs | _\bF_\bu_\bn_\bc_\bt_\bi_\bo_\bn_\bs\n+renumberer.hh File Reference\n+#include \"_\ba_\bg_\bg_\br_\be_\bg_\ba_\bt_\be_\bs_\b._\bh_\bh\"\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bs_\bo_\bu_\br_\bc_\be_\b _\bc_\bo_\bd_\be_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n C\bCl\bla\bas\bss\bse\bes\bs\n-struct \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bS_\bu_\bp_\be_\br_\bM_\ba_\bt_\br_\bi_\bx_\bC_\br_\be_\ba_\bt_\be_\bS_\bp_\ba_\br_\bs_\be_\bC_\bh_\bo_\bo_\bs_\be_\br_\b<_\b _\bT_\b _\b>\n-\u00a0\n-struct \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bS_\bu_\bp_\be_\br_\bM_\ba_\bt_\br_\bi_\bx_\bP_\br_\bi_\bn_\bt_\be_\br_\b<_\b _\bT_\b _\b>\n-\u00a0\n-struct \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bB_\ba_\bs_\be_\bG_\be_\bt_\bS_\bu_\bp_\be_\br_\bL_\bU_\bT_\by_\bp_\be_\b<_\b _\bT_\b _\b>\n-\u00a0\n-struct \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bt_\bS_\bu_\bp_\be_\br_\bL_\bU_\bT_\by_\bp_\be_\b<_\b _\bT_\b _\b>\n-\u00a0\n-struct \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bt_\bS_\bu_\bp_\be_\br_\bL_\bU_\bT_\by_\bp_\be_\b<_\b _\bd_\bo_\bu_\bb_\bl_\be_\b _\b>\n-\u00a0\n-struct \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bt_\bS_\bu_\bp_\be_\br_\bL_\bU_\bT_\by_\bp_\be_\b<_\b _\bf_\bl_\bo_\ba_\bt_\b _\b>\n-\u00a0\n-struct \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bt_\bS_\bu_\bp_\be_\br_\bL_\bU_\bT_\by_\bp_\be_\b<_\b _\bs_\bt_\bd_\b:_\b:_\bc_\bo_\bm_\bp_\bl_\be_\bx_\b<_\b _\bd_\bo_\bu_\bb_\bl_\be_\b _\b>_\b _\b>\n-\u00a0\n-struct \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bt_\bS_\bu_\bp_\be_\br_\bL_\bU_\bT_\by_\bp_\be_\b<_\b _\bs_\bt_\bd_\b:_\b:_\bc_\bo_\bm_\bp_\bl_\be_\bx_\b<_\b _\bf_\bl_\bo_\ba_\bt_\b _\b>_\b _\b>\n-\u00a0\n-struct \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bS_\bu_\bp_\be_\br_\bL_\bU_\bM_\ba_\bt_\br_\bi_\bx_\b<_\b _\bM_\b _\b>\n-\u00a0 Utility class for converting an _\bI_\bS_\bT_\bL _\bM_\ba_\bt_\br_\bi_\bx into a _\bS_\bu_\bp_\be_\br_\bL_\bU _\bM_\ba_\bt_\br_\bi_\bx.\n- _\bM_\bo_\br_\be_\b._\b._\b.\n-\u00a0\n-struct \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bS_\bu_\bp_\be_\br_\bM_\ba_\bt_\br_\bi_\bx_\bI_\bn_\bi_\bt_\bi_\ba_\bl_\bi_\bz_\be_\br_\b<_\b _\bM_\b _\b>\n-\u00a0\n- class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bS_\bu_\bp_\be_\br_\bL_\bU_\bM_\ba_\bt_\br_\bi_\bx_\b<_\b _\bB_\bC_\bR_\bS_\bM_\ba_\bt_\br_\bi_\bx_\b<_\b _\bB_\b,_\b _\bT_\bA_\b _\b>_\b _\b>\n-\u00a0 Converter for _\bB_\bC_\bR_\bS_\bM_\ba_\bt_\br_\bi_\bx to _\bS_\bu_\bp_\be_\br_\bL_\bU _\bM_\ba_\bt_\br_\bi_\bx. _\bM_\bo_\br_\be_\b._\b._\b.\n-\u00a0\n- class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bS_\bu_\bp_\be_\br_\bM_\ba_\bt_\br_\bi_\bx_\bI_\bn_\bi_\bt_\bi_\ba_\bl_\bi_\bz_\be_\br_\b<_\b _\bB_\bC_\bR_\bS_\bM_\ba_\bt_\br_\bi_\bx_\b<_\b _\bB_\b,_\b _\bA_\b _\b>_\b _\b>\n+class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bA_\bm_\bg_\b:_\b:_\bA_\bg_\bg_\br_\be_\bg_\ba_\bt_\be_\bR_\be_\bn_\bu_\bm_\bb_\be_\br_\be_\br_\b<_\b _\bG_\b _\b>\n \u00a0\n N\bNa\bam\bme\bes\bsp\bpa\bac\bce\bes\bs\n namespace \u00a0 _\bD_\bu_\bn_\be\n \u00a0\n+namespace \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bA_\bm_\bg\n+\u00a0\n+F\bFu\bun\bnc\bct\bti\bio\bon\bns\bs\n+template\n+void\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bA_\bm_\bg_\b:_\b:_\br_\be_\bn_\bu_\bm_\bb_\be_\br_\bA_\bg_\bg_\br_\be_\bg_\ba_\bt_\be_\bs (const G &graph, I index, I endIndex, V\n+ &visitedMap, _\bA_\bg_\bg_\br_\be_\bg_\ba_\bt_\be_\bs_\bM_\ba_\bp< typename G::VertexDescriptor > &aggregates)\n+\u00a0\n ===============================================================================\n Generated by\u00a0_\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b] 1.9.8\n"}]}, {"source1": "./usr/share/doc/libdune-istl-doc/doxygen/a00029_source.html", "source2": "./usr/share/doc/libdune-istl-doc/doxygen/a00029_source.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n dune-istl: supermatrix.hh Source File \n+dune-istl: renumberer.hh Source File \n \n
Go to the documentation of this file. \n
\n
\n
\n-
5 #ifndef DUNE_ISTL_SUPERMATRIX_HH \n-
6 #define DUNE_ISTL_SUPERMATRIX_HH \n+
5 #ifndef DUNE_AMG_RENUMBERER_HH \n+
6 #define DUNE_AMG_RENUMBERER_HH \n
\n-
\n+
\n
\n-
\n-
\n-
12 #include <dune/common/fmatrix.hh> \n-
13 #include <dune/common/fvector.hh> \n-
14 #include <dune/common/typetraits.hh> \n-
\n-
\n-
\n-
\n-
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
19 typedef typename G::VertexDescriptor
Vertex ;
\n
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n+
\n+
\n+
\n+
\n+
30 void operator() (
const typename G::ConstEdgeIterator& edge);
\n
\n-
32 #if __has_include("slu_sdefs.h") \n-
\n-
\n-
\n-
36 static void create(SuperMatrix *
mat ,
int n,
int m,
int offset,
\n-
37 float *values,
int *rowindex,
int * colindex,
\n-
38 Stype_t stype, Dtype_t dtype, Mtype_t mtype)
\n-
\n-
40 sCreate_CompCol_Matrix(
mat , n, m, offset, values, rowindex, colindex,
\n-
\n-
\n-
\n-
\n-
\n-
46 struct SuperMatrixPrinter<float>
\n-
\n-
48 static void print(
char * name, SuperMatrix*
mat )
\n-
\n-
50 sPrint_CompCol_Matrix(name,
mat );
\n-
\n-
\n-
\n-
\n-
55 #if __has_include("slu_ddefs.h") \n-
\n-
57 struct SuperMatrixCreateSparseChooser<double>
\n-
\n-
59 static void create(SuperMatrix *
mat ,
int n,
int m,
int offset,
\n-
60 double *values,
int *rowindex,
int * colindex,
\n-
61 Stype_t stype, Dtype_t dtype, Mtype_t mtype)
\n-
\n-
63 dCreate_CompCol_Matrix(
mat , n, m, offset, values, rowindex, colindex,
\n-
\n-
\n-
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
41 : number_(0), aggregates_(aggregates)
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
53 aggregates_[edge.target()]=number_;
\n+
\n+
\n+
\n+
\n+
\n+
\n+
62 template <
class G,
class I,
class V>
\n+
\n+
\n+
\n+
\n+
\n
\n-
\n-
69 struct SuperMatrixPrinter<double>
\n-
\n-
71 static void print(
char * name, SuperMatrix*
mat )
\n-
\n-
73 dPrint_CompCol_Matrix(name,
mat );
\n-
\n-
\n-
\n-
\n-
78 #if __has_include("slu_cdefs.h") \n-
\n-
80 struct SuperMatrixCreateSparseChooser<
std ::complex<float> >
\n-
\n-
82 static void create(SuperMatrix *
mat ,
int n,
int m,
int offset,
\n-
83 std::complex<float> *values,
int *rowindex,
int * colindex,
\n-
84 Stype_t stype, Dtype_t dtype, Mtype_t mtype)
\n-
\n-
86 cCreate_CompCol_Matrix(
mat , n, m, offset,
reinterpret_cast< ::complex*
> (values),
\n-
87 rowindex, colindex, stype, dtype, mtype);
\n-
\n-
\n-
\n-
\n-
92 struct SuperMatrixPrinter<
std ::complex<float> >
\n-
\n-
94 static void print(
char * name, SuperMatrix*
mat )
\n-
\n-
96 cPrint_CompCol_Matrix(name,
mat );
\n-
\n-
\n-
\n-
\n-
101 #if __has_include("slu_zdefs.h") \n-
\n-
103 struct SuperMatrixCreateSparseChooser<
std ::complex<double> >
\n-
\n-
105 static void create(SuperMatrix *
mat ,
int n,
int m,
int offset,
\n-
106 std::complex<double> *values,
int *rowindex,
int * colindex,
\n-
107 Stype_t stype, Dtype_t dtype, Mtype_t mtype)
\n-
\n-
109 zCreate_CompCol_Matrix(
mat , n, m, offset,
reinterpret_cast< doublecomplex*
> (values),
\n-
110 rowindex, colindex, stype, dtype, mtype);
\n-
\n-
\n-
\n-
\n-
115 struct SuperMatrixPrinter<
std ::complex<double> >
\n-
\n-
117 static void print(
char * name, SuperMatrix*
mat )
\n-
\n-
119 zPrint_CompCol_Matrix(name,
mat );
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
136 std::is_same<T,float>::value ? SLU_S :
\n-
137 ( std::is_same<T,std::complex<double> >::value ? SLU_Z :
\n-
138 ( std::is_same<T,std::complex<float> >::value ? SLU_C : SLU_D ));
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
184 template <
class M,
class X,
class TM,
class TD,
class T1>
\n-
\n-
\n-
187 template <
class T,
bool flag>
\n-
\n-
\n-
193 template <
class B,
class TA>
\n-
\n-
\n-
195 :
public ISTL::Impl::BCCSMatrix<typename BCRSMatrix<B,TA>::field_type, int>
\n-
\n-
197 template <
class M,
class X,
class TM,
class TD,
class T1>
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
221 if (this->N_+this->M_*this->Nnz_ != 0)
\n-
\n-
\n-
\n-
\n-
\n-
226 operator SuperMatrix&()
\n-
\n-
\n-
\n-
\n-
\n-
\n-
232 operator const SuperMatrix&()
const \n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
239 if (this->N_ + this->M_ + this->Nnz_!=0)
\n-
\n-
\n-
\n-
\n-
\n-
245 ISTL::Impl::BCCSMatrixInitializer<Matrix, int> initializer(*
this );
\n-
\n-
247 copyToBCCSMatrix(initializer,
mat );
\n-
\n-
\n-
250 ::create (&A, this->N_, this->M_, this->colstart[this->N_],
\n-
251 this->values,this->rowindex, this->colstart, SLU_NC,
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
258 if (this->N_ + this->M_ + this->Nnz_!=0)
\n-
\n-
\n-
\n-
\n-
\n-
264 ISTL::Impl::BCCSMatrixInitializer<Matrix, int> initializer(*
this );
\n-
\n-
266 copyToBCCSMatrix(initializer,
mat );
\n-
\n-
\n-
269 ::create (&A, this->N_, this->M_, this->colstart[this->N_],
\n-
270 this->values,this->rowindex, this->colstart, SLU_NC,
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
283 if (this->N_+this->M_+this->Nnz_!=0)
\n-
\n-
\n-
\n-
\n-
\n-
289 copyToBCCSMatrix(initializer, ISTL::Impl::MatrixRowSubset<
Matrix ,std::set<std::size_t> >(
mat ,mrs));
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
299 copyToBCCSMatrix(initializer,
mat );
\n-
\n-
\n-
\n-
\n-
\n-
\n-
305 ISTL::Impl::BCCSMatrix<typename BCRSMatrix<B,TA>::field_type,
int >::free();
\n-
306 SUPERLU_FREE(A.Store);
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
312 template <
class B,
class A>
\n-
\n-
\n-
314 :
public ISTL::Impl::BCCSMatrixInitializer<BCRSMatrix<B,A>, int>
\n-
\n-
316 template <
class I,
class S,
class D>
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
331 ISTL::Impl::BCCSMatrixInitializer<BCRSMatrix<B,A>,
int >::createMatrix();
\n-
\n-
333 ::create (&slumat->A, slumat->N_, slumat->M_, slumat->colstart[this->cols],
\n-
334 slumat->values,slumat->rowindex, slumat->colstart, SLU_NC,
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
This file implements a vector space as a tensor product of a given vector space. The number of compon...
\n-
Implementation of the BCRSMatrix class.
\n-
\n-
\n-
Matrix & mat
Definition matrixmatrix.hh:347
\n-
\n+
68 for (I index1=index; index1 != endIndex; ++index1)
\n+
\n+
70 !
get (visitedMap, index1.index())) {
\n+
\n+
72 aggregates.template breadthFirstSearch<false>(index1.index(), aggregates[index1.index()],
\n+
73 graph, renumberer, visitedMap);
\n+
74 aggregates[index1.index()] = renumberer;
\n+
\n+
\n+
77 for (; index != endIndex; ++index)
\n+
78 put(visitedMap, index.index(),
false );
\n+
\n+
\n+
\n+
\n+
\n+
\n+
Provides classes for the Coloring process of AMG.
\n
Definition allocator.hh:11
\n-
Initializer for SuperLU Matrices representing the subdomains.
Definition overlappingschwarz.hh:47
\n-
static auto coldim(const M &A)
Definition matrixutils.hh:219
\n-
static auto rowdim(const M &A)
Definition matrixutils.hh:214
\n-
A sparse block matrix with compressed row storage.
Definition bcrsmatrix.hh:466
\n-
A::size_type size_type
The type for the index access and the size.
Definition bcrsmatrix.hh:497
\n-
Sequential overlapping Schwarz preconditioner.
Definition overlappingschwarz.hh:755
\n-
Definition overlappingschwarz.hh:694
\n-
SuperLu Solver.
Definition superlu.hh:271
\n-
Definition supermatrix.hh:26
\n-
Definition supermatrix.hh:30
\n-
Definition supermatrix.hh:126
\n-
static const Dtype_t type
Definition supermatrix.hh:127
\n-
Definition supermatrix.hh:132
\n-
double float_type
Definition supermatrix.hh:144
\n-
float float_type
Definition supermatrix.hh:151
\n-
double float_type
Definition supermatrix.hh:158
\n-
float float_type
Definition supermatrix.hh:165
\n-
Utility class for converting an ISTL Matrix into a SuperLU Matrix.
Definition supermatrix.hh:175
\n-
Definition supermatrix.hh:179
\n-
virtual void free()
free allocated space.
Definition supermatrix.hh:303
\n-
SuperLUMatrix< BCRSMatrix< B, TA > > & operator=(const SuperLUMatrix< BCRSMatrix< B, TA > > &mat)
Definition supermatrix.hh:256
\n-
SuperLUMatrix< BCRSMatrix< B, TA > > & operator=(const BCRSMatrix< B, TA > &mat)
Definition supermatrix.hh:237
\n-
SuperLUMatrix(const Matrix &mat)
Constructor that initializes the data.
Definition supermatrix.hh:212
\n-
virtual void setMatrix(const Matrix &mat)
Initialize data from given matrix.
Definition supermatrix.hh:293
\n-
SuperLUMatrix()
Definition supermatrix.hh:215
\n-
Matrix::size_type size_type
Definition supermatrix.hh:206
\n-
BCRSMatrix< B, TA > Matrix
The type of the matrix to convert.
Definition supermatrix.hh:202
\n-
virtual void setMatrix(const Matrix &mat, const std::set< std::size_t > &mrs)
Initialize data from a given set of matrix rows and columns.
Definition supermatrix.hh:281
\n-
virtual ~SuperLUMatrix()
Destructor.
Definition supermatrix.hh:219
\n-
Dune::SuperLUMatrix< Matrix > SuperLUMatrix
Definition supermatrix.hh:320
\n-
BCRSMatrix< B, A > Matrix
Definition supermatrix.hh:319
\n-
SuperMatrixInitializer()
Definition supermatrix.hh:326
\n-
virtual void createMatrix() const
Definition supermatrix.hh:329
\n-
SuperMatrixInitializer(SuperLUMatrix &lum)
Definition supermatrix.hh:322
\n+
PropertyMapTypeSelector< Amg::VertexVisitedTag, Amg::PropertiesGraph< G, Amg::VertexProperties, EP, VM, EM > >::Type get(const Amg::VertexVisitedTag &tag, Amg::PropertiesGraph< G, Amg::VertexProperties, EP, VM, EM > &graph)
Definition dependency.hh:293
\n+
void renumberAggregates(const G &graph, I index, I endIndex, V &visitedMap, AggregatesMap< typename G::VertexDescriptor > &aggregates)
Definition renumberer.hh:63
\n+
Class providing information about the mapping of the vertices onto aggregates.
Definition aggregates.hh:560
\n+
Definition renumberer.hh:16
\n+
void operator++()
Definition renumberer.hh:57
\n+
G::VertexDescriptor Vertex
The vertex type.
Definition renumberer.hh:19
\n+
void operator()(const typename G::ConstEdgeIterator &edge)
Definition renumberer.hh:51
\n+
AggregatesMap< Vertex > & aggregates_
Definition renumberer.hh:36
\n+
AggregateRenumberer(AggregatesMap< Vertex > &aggregates)
Constructor.
Definition renumberer.hh:40
\n+
Vertex number_
Definition renumberer.hh:35
\n
\n-13#include \n-14#include \n-15#include \n-16\n-17#include <_\bd_\bu_\bn_\be_\b/_\bi_\bs_\bt_\bl_\b/_\bb_\bc_\bc_\bs_\bm_\ba_\bt_\br_\bi_\bx_\bi_\bn_\bi_\bt_\bi_\ba_\bl_\bi_\bz_\be_\br_\b._\bh_\bh>\n-18\n-19#include \"_\bs_\bu_\bp_\be_\br_\bl_\bu_\bf_\bu_\bn_\bc_\bt_\bi_\bo_\bn_\bs_\b._\bh_\bh\"\n+10namespace _\bD_\bu_\bn_\be\n+11{\n+12 namespace Amg\n+13 {\n+14 template\n+_\b1_\b5 class _\bA_\bg_\bg_\br_\be_\bg_\ba_\bt_\be_\bR_\be_\bn_\bu_\bm_\bb_\be_\br_\be_\br\n+16 {\n+17 public:\n+_\b1_\b9 typedef typename G::VertexDescriptor _\bV_\be_\br_\bt_\be_\bx;\n 20\n-21namespace _\bD_\bu_\bn_\be\n-22{\n-23\n-24 template\n-_\b2_\b5 struct _\bS_\bu_\bp_\be_\br_\bM_\ba_\bt_\br_\bi_\bx_\bC_\br_\be_\ba_\bt_\be_\bS_\bp_\ba_\br_\bs_\be_\bC_\bh_\bo_\bo_\bs_\be_\br\n-26 {};\n-27\n-28 template\n-_\b2_\b9 struct _\bS_\bu_\bp_\be_\br_\bM_\ba_\bt_\br_\bi_\bx_\bP_\br_\bi_\bn_\bt_\be_\br\n-30 {};\n+25 _\bA_\bg_\bg_\br_\be_\bg_\ba_\bt_\be_\bR_\be_\bn_\bu_\bm_\bb_\be_\br_\be_\br(_\bA_\bg_\bg_\br_\be_\bg_\ba_\bt_\be_\bs_\bM_\ba_\bp_\b<_\bV_\be_\br_\bt_\be_\bx_\b>& aggregates);\n+26\n+28 operator _\bV_\be_\br_\bt_\be_\bx() const;\n+29\n+30 void _\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b(_\b)(const typename G::ConstEdgeIterator& edge);\n 31\n-32#if __has_include(\"slu_sdefs.h\")\n-33 template<>\n-34 struct _\bS_\bu_\bp_\be_\br_\bM_\ba_\bt_\br_\bi_\bx_\bC_\br_\be_\ba_\bt_\be_\bS_\bp_\ba_\br_\bs_\be_\bC_\bh_\bo_\bo_\bs_\be_\br\n-35 {\n-36 static void create(SuperMatrix *_\bm_\ba_\bt, int n, int m, int offset,\n-37 float *values, int *rowindex, int* colindex,\n-38 Stype_t stype, Dtype_t dtype, Mtype_t mtype)\n-39 {\n-40 sCreate_CompCol_Matrix(_\bm_\ba_\bt, n, m, offset, values, rowindex, colindex,\n-41 stype, dtype, mtype);\n-42 }\n-43 };\n-44\n-45 template<>\n-46 struct SuperMatrixPrinter\n-47 {\n-48 static void print(char* name, SuperMatrix* _\bm_\ba_\bt)\n-49 {\n-50 sPrint_CompCol_Matrix(name, _\bm_\ba_\bt);\n-51 }\n-52 };\n-53#endif\n-54\n-55#if __has_include(\"slu_ddefs.h\")\n-56 template<>\n-57 struct SuperMatrixCreateSparseChooser\n+32 void _\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b+_\b+();\n+33\n+34 protected:\n+_\b3_\b5 _\bV_\be_\br_\bt_\be_\bx _\bn_\bu_\bm_\bb_\be_\br_\b_;\n+_\b3_\b6 _\bA_\bg_\bg_\br_\be_\bg_\ba_\bt_\be_\bs_\bM_\ba_\bp_\b<_\bV_\be_\br_\bt_\be_\bx_\b>& _\ba_\bg_\bg_\br_\be_\bg_\ba_\bt_\be_\bs_\b_;\n+37 };\n+38\n+39 template\n+_\b4_\b0 _\bA_\bg_\bg_\br_\be_\bg_\ba_\bt_\be_\bR_\be_\bn_\bu_\bm_\bb_\be_\br_\be_\br_\b<_\bG_\b>_\b:_\b:_\bA_\bg_\bg_\br_\be_\bg_\ba_\bt_\be_\bR_\be_\bn_\bu_\bm_\bb_\be_\br_\be_\br(_\bA_\bg_\bg_\br_\be_\bg_\ba_\bt_\be_\bs_\bM_\ba_\bp_\b<_\bV_\be_\br_\bt_\be_\bx_\b>&\n+aggregates)\n+41 : number_(0), aggregates_(aggregates)\n+42 {}\n+43\n+44 template\n+_\b4_\b5 _\bA_\bg_\bg_\br_\be_\bg_\ba_\bt_\be_\bR_\be_\bn_\bu_\bm_\bb_\be_\br_\be_\br_\b<_\bG_\b>_\b:_\b:_\bo_\bp_\be_\br_\ba_\bt_\bo_\br _\bV_\be_\br_\bt_\be_\bx() const\n+46 {\n+47 return number_;\n+48 }\n+49\n+50 template\n+_\b5_\b1 void _\bA_\bg_\bg_\br_\be_\bg_\ba_\bt_\be_\bR_\be_\bn_\bu_\bm_\bb_\be_\br_\be_\br_\b<_\bG_\b>_\b:_\b:_\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b(_\b)(const typename G::ConstEdgeIterator&\n+edge)\n+52 {\n+53 aggregates_[edge.target()]=number_;\n+54 }\n+55\n+56 template\n+_\b5_\b7 void _\bA_\bg_\bg_\br_\be_\bg_\ba_\bt_\be_\bR_\be_\bn_\bu_\bm_\bb_\be_\br_\be_\br_\b<_\bG_\b>_\b:_\b:_\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b+_\b+()\n 58 {\n-59 static void create(SuperMatrix *_\bm_\ba_\bt, int n, int m, int offset,\n-60 double *values, int *rowindex, int* colindex,\n-61 Stype_t stype, Dtype_t dtype, Mtype_t mtype)\n-62 {\n-63 dCreate_CompCol_Matrix(_\bm_\ba_\bt, n, m, offset, values, rowindex, colindex,\n-64 stype, dtype, mtype);\n-65 }\n-66 };\n+59 ++number_;\n+60 }\n+61\n+62 template\n+_\b6_\b3 void _\br_\be_\bn_\bu_\bm_\bb_\be_\br_\bA_\bg_\bg_\br_\be_\bg_\ba_\bt_\be_\bs(const G& graph, I index, I endIndex, V& visitedMap,\n+64 _\bA_\bg_\bg_\br_\be_\bg_\ba_\bt_\be_\bs_\bM_\ba_\bp_\b<_\bt_\by_\bp_\be_\bn_\ba_\bm_\be_\b _\bG_\b:_\b:_\bV_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b>& aggregates)\n+65 {\n+66 _\bA_\bg_\bg_\br_\be_\bg_\ba_\bt_\be_\bR_\be_\bn_\bu_\bm_\bb_\be_\br_\be_\br_\b<_\bG_\b> renumberer(aggregates);\n 67\n-68 template<>\n-69 struct SuperMatrixPrinter\n-70 {\n-71 static void print(char* name, SuperMatrix* _\bm_\ba_\bt)\n-72 {\n-73 dPrint_CompCol_Matrix(name, _\bm_\ba_\bt);\n-74 }\n-75 };\n-76#endif\n-77\n-78#if __has_include(\"slu_cdefs.h\")\n-79 template<>\n-80 struct SuperMatrixCreateSparseChooser<_\bs_\bt_\bd::complex >\n-81 {\n-82 static void create(SuperMatrix *_\bm_\ba_\bt, int n, int m, int offset,\n-83 std::complex *values, int *rowindex, int* colindex,\n-84 Stype_t stype, Dtype_t dtype, Mtype_t mtype)\n-85 {\n-86 cCreate_CompCol_Matrix(_\bm_\ba_\bt, n, m, offset, reinterpret_cast< ::complex*>\n-(values),\n-87 rowindex, colindex, stype, dtype, mtype);\n-88 }\n-89 };\n-90\n-91 template<>\n-92 struct SuperMatrixPrinter<_\bs_\bt_\bd::complex >\n-93 {\n-94 static void print(char* name, SuperMatrix* _\bm_\ba_\bt)\n-95 {\n-96 cPrint_CompCol_Matrix(name, _\bm_\ba_\bt);\n-97 }\n-98 };\n-99#endif\n-100\n-101#if __has_include(\"slu_zdefs.h\")\n-102 template<>\n-103 struct SuperMatrixCreateSparseChooser<_\bs_\bt_\bd::complex >\n-104 {\n-105 static void create(SuperMatrix *_\bm_\ba_\bt, int n, int m, int offset,\n-106 std::complex *values, int *rowindex, int* colindex,\n-107 Stype_t stype, Dtype_t dtype, Mtype_t mtype)\n-108 {\n-109 zCreate_CompCol_Matrix(_\bm_\ba_\bt, n, m, offset, reinterpret_cast\n-(values),\n-110 rowindex, colindex, stype, dtype, mtype);\n-111 }\n-112 };\n-113\n-114 template<>\n-115 struct SuperMatrixPrinter<_\bs_\bt_\bd::complex >\n-116 {\n-117 static void print(char* name, SuperMatrix* _\bm_\ba_\bt)\n-118 {\n-119 zPrint_CompCol_Matrix(name, _\bm_\ba_\bt);\n-120 }\n-121 };\n-122#endif\n-123\n-124 template\n-_\b1_\b2_\b5 struct _\bB_\ba_\bs_\be_\bG_\be_\bt_\bS_\bu_\bp_\be_\br_\bL_\bU_\bT_\by_\bp_\be\n-126 {\n-_\b1_\b2_\b7 static const Dtype_t _\bt_\by_\bp_\be;\n-128 };\n-129\n-130 template\n-_\b1_\b3_\b1 struct _\bG_\be_\bt_\bS_\bu_\bp_\be_\br_\bL_\bU_\bT_\by_\bp_\be\n-132 {};\n-133\n-134 template\n-135 const Dtype_t _\bB_\ba_\bs_\be_\bG_\be_\bt_\bS_\bu_\bp_\be_\br_\bL_\bU_\bT_\by_\bp_\be_\b<_\bT_\b>_\b:_\b:_\bt_\by_\bp_\be =\n-136 std::is_same::value ? SLU_S :\n-137 ( std::is_same >::value ? SLU_Z :\n-138 ( std::is_same >::value ? SLU_C : SLU_D ));\n-139\n-140 template<>\n-_\b1_\b4_\b1 struct _\bG_\be_\bt_\bS_\bu_\bp_\be_\br_\bL_\bU_\bT_\by_\bp_\be\n-142 : public _\bB_\ba_\bs_\be_\bG_\be_\bt_\bS_\bu_\bp_\be_\br_\bL_\bU_\bT_\by_\bp_\be\n-143 {\n-_\b1_\b4_\b4 typedef double _\bf_\bl_\bo_\ba_\bt_\b__\bt_\by_\bp_\be;\n-145 };\n-146\n-147 template<>\n-_\b1_\b4_\b8 struct _\bG_\be_\bt_\bS_\bu_\bp_\be_\br_\bL_\bU_\bT_\by_\bp_\be\n-149 : public _\bB_\ba_\bs_\be_\bG_\be_\bt_\bS_\bu_\bp_\be_\br_\bL_\bU_\bT_\by_\bp_\be\n-150 {\n-_\b1_\b5_\b1 typedef float _\bf_\bl_\bo_\ba_\bt_\b__\bt_\by_\bp_\be;\n-152 };\n-153\n-154 template<>\n-_\b1_\b5_\b5 struct _\bG_\be_\bt_\bS_\bu_\bp_\be_\br_\bL_\bU_\bT_\by_\bp_\be<_\bs_\bt_\bd::complex >\n-156 : public _\bB_\ba_\bs_\be_\bG_\be_\bt_\bS_\bu_\bp_\be_\br_\bL_\bU_\bT_\by_\bp_\be >\n-157 {\n-_\b1_\b5_\b8 typedef double _\bf_\bl_\bo_\ba_\bt_\b__\bt_\by_\bp_\be;\n-159 };\n-160\n-161 template<>\n-_\b1_\b6_\b2 struct _\bG_\be_\bt_\bS_\bu_\bp_\be_\br_\bL_\bU_\bT_\by_\bp_\be<_\bs_\bt_\bd::complex >\n-163 : public _\bB_\ba_\bs_\be_\bG_\be_\bt_\bS_\bu_\bp_\be_\br_\bL_\bU_\bT_\by_\bp_\be >\n-164 {\n-_\b1_\b6_\b5 typedef float _\bf_\bl_\bo_\ba_\bt_\b__\bt_\by_\bp_\be;\n-166\n-167 };\n-168\n-173 template\n-_\b1_\b7_\b4 struct _\bS_\bu_\bp_\be_\br_\bL_\bU_\bM_\ba_\bt_\br_\bi_\bx\n-175 {};\n-176\n-177 template\n-_\b1_\b7_\b8 struct _\bS_\bu_\bp_\be_\br_\bM_\ba_\bt_\br_\bi_\bx_\bI_\bn_\bi_\bt_\bi_\ba_\bl_\bi_\bz_\be_\br\n-179 {};\n-180\n-181 template\n-182 class _\bS_\bu_\bp_\be_\br_\bL_\bU;\n-183\n-184 template\n-185 class _\bS_\be_\bq_\bO_\bv_\be_\br_\bl_\ba_\bp_\bp_\bi_\bn_\bg_\bS_\bc_\bh_\bw_\ba_\br_\bz;\n-186\n-187 template\n-188 struct _\bS_\be_\bq_\bO_\bv_\be_\br_\bl_\ba_\bp_\bp_\bi_\bn_\bg_\bS_\bc_\bh_\bw_\ba_\br_\bz_\bA_\bs_\bs_\be_\bm_\bb_\bl_\be_\br_\bH_\be_\bl_\bp_\be_\br;\n-189\n-193 template\n-_\b1_\b9_\b4 class _\bS_\bu_\bp_\be_\br_\bL_\bU_\bM_\ba_\bt_\br_\bi_\bx<_\bB_\bC_\bR_\bS_\bM_\ba_\bt_\br_\bi_\bx >\n-195 : public ISTL::Impl::BCCSMatrix::field_type, int>\n-196 {\n-197 template\n-_\b1_\b9_\b8 friend class _\bS_\be_\bq_\bO_\bv_\be_\br_\bl_\ba_\bp_\bp_\bi_\bn_\bg_\bS_\bc_\bh_\bw_\ba_\br_\bz;\n-199 friend struct _\bS_\bu_\bp_\be_\br_\bM_\ba_\bt_\br_\bi_\bx_\bI_\bn_\bi_\bt_\bi_\ba_\bl_\bi_\bz_\be_\br<_\bB_\bC_\bR_\bS_\bM_\ba_\bt_\br_\bi_\bx >;\n-200 public:\n-_\b2_\b0_\b2 typedef _\bB_\bC_\bR_\bS_\bM_\ba_\bt_\br_\bi_\bx_\b<_\bB_\b,_\bT_\bA_\b> _\bM_\ba_\bt_\br_\bi_\bx;\n-203\n-204 friend struct _\bS_\be_\bq_\bO_\bv_\be_\br_\bl_\ba_\bp_\bp_\bi_\bn_\bg_\bS_\bc_\bh_\bw_\ba_\br_\bz_\bA_\bs_\bs_\be_\bm_\bb_\bl_\be_\br_\bH_\be_\bl_\bp_\be_\br<_\bS_\bu_\bp_\be_\br_\bL_\bU<_\bM_\ba_\bt_\br_\bi_\bx>, true>;\n-205\n-_\b2_\b0_\b6 typedef typename _\bM_\ba_\bt_\br_\bi_\bx_\b:_\b:_\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be _\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be;\n-207\n-_\b2_\b1_\b2 explicit _\bS_\bu_\bp_\be_\br_\bL_\bU_\bM_\ba_\bt_\br_\bi_\bx(const _\bM_\ba_\bt_\br_\bi_\bx& _\bm_\ba_\bt) : ISTL::Impl::\n-BCCSMatrix<_\bB_\bC_\bR_\bS_\bM_\ba_\bt_\br_\bi_\bx, int>(_\bm_\ba_\bt)\n-213 {}\n-214\n-_\b2_\b1_\b5 _\bS_\bu_\bp_\be_\br_\bL_\bU_\bM_\ba_\bt_\br_\bi_\bx() : ISTL::Impl::BCCSMatrix::\n-field_type, int>()\n-216 {}\n-217\n-_\b2_\b1_\b9 virtual _\b~_\bS_\bu_\bp_\be_\br_\bL_\bU_\bM_\ba_\bt_\br_\bi_\bx()\n-220 {\n-221 if (this->N_+this->M_*this->Nnz_ != 0)\n-222 free();\n-223 }\n-224\n-_\b2_\b2_\b6 operator SuperMatrix&()\n-227 {\n-228 return A;\n-229 }\n-230\n-_\b2_\b3_\b2 operator const SuperMatrix&() const\n-233 {\n-234 return A;\n-235 }\n-236\n-_\b2_\b3_\b7 _\bS_\bu_\bp_\be_\br_\bL_\bU_\bM_\ba_\bt_\br_\bi_\bx_\b<_\bB_\bC_\bR_\bS_\bM_\ba_\bt_\br_\bi_\bx_\b<_\bB_\b,_\bT_\bA_\b> >& _\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b=(const _\bB_\bC_\bR_\bS_\bM_\ba_\bt_\br_\bi_\bx_\b<_\bB_\b,_\bT_\bA_\b>& _\bm_\ba_\bt)\n-238 {\n-239 if (this->N_ + this->M_ + this->Nnz_!=0)\n-240 free();\n-241\n-242 using _\bM_\ba_\bt_\br_\bi_\bx = _\bB_\bC_\bR_\bS_\bM_\ba_\bt_\br_\bi_\bx_\b<_\bB_\b,_\bT_\bA_\b>;\n-243 this->N_ = _\bM_\ba_\bt_\br_\bi_\bx_\bD_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b<_\bM_\ba_\bt_\br_\bi_\bx_\b>_\b:_\b:_\br_\bo_\bw_\bd_\bi_\bm(_\bm_\ba_\bt);\n-244 this->M_ = _\bM_\ba_\bt_\br_\bi_\bx_\bD_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b<_\bM_\ba_\bt_\br_\bi_\bx_\b>_\b:_\b:_\bc_\bo_\bl_\bd_\bi_\bm(_\bm_\ba_\bt);\n-245 ISTL::Impl::BCCSMatrixInitializer initializer(*this);\n-246\n-247 copyToBCCSMatrix(initializer, _\bm_\ba_\bt);\n-248\n-249 _\bS_\bu_\bp_\be_\br_\bM_\ba_\bt_\br_\bi_\bx_\bC_\br_\be_\ba_\bt_\be_\bS_\bp_\ba_\br_\bs_\be_\bC_\bh_\bo_\bo_\bs_\be_\br_\b<_\bt_\by_\bp_\be_\bn_\ba_\bm_\be_\b _\bM_\ba_\bt_\br_\bi_\bx_\b:_\b:_\bf_\bi_\be_\bl_\bd_\b__\bt_\by_\bp_\be_\b>\n-250_\b _\b:_\b:_\bc_\br_\be_\ba_\bt_\be(&A, this->N_, this->M_, this->colstart[this->N_],\n-251 this->values,this->rowindex, this->colstart, SLU_NC,\n-252 static_cast(_\bG_\be_\bt_\bS_\bu_\bp_\be_\br_\bL_\bU_\bT_\by_\bp_\be_\b<_\bt_\by_\bp_\be_\bn_\ba_\bm_\be_\b _\bM_\ba_\bt_\br_\bi_\bx_\b:_\b:_\bf_\bi_\be_\bl_\bd_\b__\bt_\by_\bp_\be_\b>_\b:_\b:_\bt_\by_\bp_\be),\n-SLU_GE);\n-253 return *this;\n-254 }\n-255\n-_\b2_\b5_\b6 _\bS_\bu_\bp_\be_\br_\bL_\bU_\bM_\ba_\bt_\br_\bi_\bx_\b<_\bB_\bC_\bR_\bS_\bM_\ba_\bt_\br_\bi_\bx_\b<_\bB_\b,_\bT_\bA_\b> >& _\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b=(const _\bS_\bu_\bp_\be_\br_\bL_\bU_\bM_\ba_\bt_\br_\bi_\bx\n-<_\bB_\bC_\bR_\bS_\bM_\ba_\bt_\br_\bi_\bx_\b<_\bB_\b,_\bT_\bA_\b> >& _\bm_\ba_\bt)\n-257 {\n-258 if (this->N_ + this->M_ + this->Nnz_!=0)\n-259 free();\n-260\n-261 using _\bM_\ba_\bt_\br_\bi_\bx = _\bB_\bC_\bR_\bS_\bM_\ba_\bt_\br_\bi_\bx_\b<_\bB_\b,_\bT_\bA_\b>;\n-262 this->N_ = _\bM_\ba_\bt_\br_\bi_\bx_\bD_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b<_\bM_\ba_\bt_\br_\bi_\bx_\b>_\b:_\b:_\br_\bo_\bw_\bd_\bi_\bm(_\bm_\ba_\bt);\n-263 this->M_ = _\bM_\ba_\bt_\br_\bi_\bx_\bD_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b<_\bM_\ba_\bt_\br_\bi_\bx_\b>_\b:_\b:_\bc_\bo_\bl_\bd_\bi_\bm(_\bm_\ba_\bt);\n-264 ISTL::Impl::BCCSMatrixInitializer initializer(*this);\n-265\n-266 copyToBCCSMatrix(initializer, _\bm_\ba_\bt);\n-267\n-268 _\bS_\bu_\bp_\be_\br_\bM_\ba_\bt_\br_\bi_\bx_\bC_\br_\be_\ba_\bt_\be_\bS_\bp_\ba_\br_\bs_\be_\bC_\bh_\bo_\bo_\bs_\be_\br_\b<_\bB_\b>\n-269_\b _\b:_\b:_\bc_\br_\be_\ba_\bt_\be(&A, this->N_, this->M_, this->colstart[this->N_],\n-270 this->values,this->rowindex, this->colstart, SLU_NC,\n-271 static_cast(_\bG_\be_\bt_\bS_\bu_\bp_\be_\br_\bL_\bU_\bT_\by_\bp_\be_\b<_\bB_\b>_\b:_\b:_\bt_\by_\bp_\be), SLU_GE);\n-272 return *this;\n-273 }\n-274\n-_\b2_\b8_\b1 virtual void _\bs_\be_\bt_\bM_\ba_\bt_\br_\bi_\bx(const _\bM_\ba_\bt_\br_\bi_\bx& _\bm_\ba_\bt, const std::set& mrs)\n-282 {\n-283 if(this->N_+this->M_+this->Nnz_!=0)\n-284 free();\n-285 this->N_=mrs.size()*_\bM_\ba_\bt_\br_\bi_\bx_\bD_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b<_\bt_\by_\bp_\be_\bn_\ba_\bm_\be_\b _\bM_\ba_\bt_\br_\bi_\bx_\b:_\b:_\bb_\bl_\bo_\bc_\bk_\b__\bt_\by_\bp_\be_\b>_\b:_\b:_\br_\bo_\bw_\bd_\bi_\bm(*\n-(_\bm_\ba_\bt[0].begin()));\n-286 this->M_=mrs.size()*_\bM_\ba_\bt_\br_\bi_\bx_\bD_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b<_\bt_\by_\bp_\be_\bn_\ba_\bm_\be_\b _\bM_\ba_\bt_\br_\bi_\bx_\b:_\b:_\bb_\bl_\bo_\bc_\bk_\b__\bt_\by_\bp_\be_\b>_\b:_\b:_\bc_\bo_\bl_\bd_\bi_\bm(*\n-(_\bm_\ba_\bt[0].begin()));\n-287 _\bS_\bu_\bp_\be_\br_\bM_\ba_\bt_\br_\bi_\bx_\bI_\bn_\bi_\bt_\bi_\ba_\bl_\bi_\bz_\be_\br_\b<_\bM_\ba_\bt_\br_\bi_\bx_\b> initializer(*this);\n-288\n-289 copyToBCCSMatrix(initializer, ISTL::Impl::MatrixRowSubset<_\bM_\ba_\bt_\br_\bi_\bx,std::\n-set >(_\bm_\ba_\bt,mrs));\n-290 }\n-291\n-_\b2_\b9_\b3 virtual void _\bs_\be_\bt_\bM_\ba_\bt_\br_\bi_\bx(const _\bM_\ba_\bt_\br_\bi_\bx& _\bm_\ba_\bt)\n-294 {\n-295 this->N_=_\bM_\ba_\bt_\br_\bi_\bx_\bD_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b<_\bM_\ba_\bt_\br_\bi_\bx_\b>_\b:_\b:_\br_\bo_\bw_\bd_\bi_\bm(_\bm_\ba_\bt);\n-296 this->M_=_\bM_\ba_\bt_\br_\bi_\bx_\bD_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b<_\bM_\ba_\bt_\br_\bi_\bx_\b>_\b:_\b:_\bc_\bo_\bl_\bd_\bi_\bm(_\bm_\ba_\bt);\n-297 _\bS_\bu_\bp_\be_\br_\bM_\ba_\bt_\br_\bi_\bx_\bI_\bn_\bi_\bt_\bi_\ba_\bl_\bi_\bz_\be_\br_\b<_\bM_\ba_\bt_\br_\bi_\bx_\b> initializer(*this);\n-298\n-299 copyToBCCSMatrix(initializer, _\bm_\ba_\bt);\n-300 }\n-301\n-_\b3_\b0_\b3 virtual void _\bf_\br_\be_\be()\n-304 {\n-305 ISTL::Impl::BCCSMatrix::field_type, int>::free();\n-306 SUPERLU_FREE(A.Store);\n-307 }\n-308 private:\n-309 SuperMatrix A;\n-310 };\n-311\n-312 template\n-_\b3_\b1_\b3 class _\bS_\bu_\bp_\be_\br_\bM_\ba_\bt_\br_\bi_\bx_\bI_\bn_\bi_\bt_\bi_\ba_\bl_\bi_\bz_\be_\br<_\bB_\bC_\bR_\bS_\bM_\ba_\bt_\br_\bi_\bx >\n-314 : public ISTL::Impl::BCCSMatrixInitializer, int>\n-315 {\n-316 template\n-_\b3_\b1_\b7 friend class _\bO_\bv_\be_\br_\bl_\ba_\bp_\bp_\bi_\bn_\bg_\bS_\bc_\bh_\bw_\ba_\br_\bz_\bI_\bn_\bi_\bt_\bi_\ba_\bl_\bi_\bz_\be_\br;\n-318 public:\n-_\b3_\b1_\b9 typedef _\bB_\bC_\bR_\bS_\bM_\ba_\bt_\br_\bi_\bx_\b<_\bB_\b,_\bA_\b> _\bM_\ba_\bt_\br_\bi_\bx;\n-_\b3_\b2_\b0 typedef _\bD_\bu_\bn_\be_\b:_\b:_\bS_\bu_\bp_\be_\br_\bL_\bU_\bM_\ba_\bt_\br_\bi_\bx_\b<_\bM_\ba_\bt_\br_\bi_\bx_\b> _\bS_\bu_\bp_\be_\br_\bL_\bU_\bM_\ba_\bt_\br_\bi_\bx;\n-321\n-_\b3_\b2_\b2 _\bS_\bu_\bp_\be_\br_\bM_\ba_\bt_\br_\bi_\bx_\bI_\bn_\bi_\bt_\bi_\ba_\bl_\bi_\bz_\be_\br(_\bS_\bu_\bp_\be_\br_\bL_\bU_\bM_\ba_\bt_\br_\bi_\bx& lum) : ISTL::Impl::\n-BCCSMatrixInitializer<_\bB_\bC_\bR_\bS_\bM_\ba_\bt_\br_\bi_\bx, int>(lum)\n-323 ,slumat(&lum)\n-324 {}\n-325\n-_\b3_\b2_\b6 _\bS_\bu_\bp_\be_\br_\bM_\ba_\bt_\br_\bi_\bx_\bI_\bn_\bi_\bt_\bi_\ba_\bl_\bi_\bz_\be_\br() : ISTL::Impl::\n-BCCSMatrixInitializer<_\bB_\bC_\bR_\bS_\bM_\ba_\bt_\br_\bi_\bx, int>()\n-327 {}\n-328\n-_\b3_\b2_\b9 virtual void _\bc_\br_\be_\ba_\bt_\be_\bM_\ba_\bt_\br_\bi_\bx() const\n-330 {\n-331 ISTL::Impl::BCCSMatrixInitializer, int>::createMatrix();\n-332 _\bS_\bu_\bp_\be_\br_\bM_\ba_\bt_\br_\bi_\bx_\bC_\br_\be_\ba_\bt_\be_\bS_\bp_\ba_\br_\bs_\be_\bC_\bh_\bo_\bo_\bs_\be_\br_\b<_\bt_\by_\bp_\be_\bn_\ba_\bm_\be_\b _\bM_\ba_\bt_\br_\bi_\bx_\b:_\b:_\bf_\bi_\be_\bl_\bd_\b__\bt_\by_\bp_\be_\b>\n-333_\b _\b:_\b:_\bc_\br_\be_\ba_\bt_\be(&slumat->A, slumat->N_, slumat->M_, slumat->colstart[this->cols],\n-334 slumat->values,slumat->rowindex, slumat->colstart, SLU_NC,\n-335 static_cast(_\bG_\be_\bt_\bS_\bu_\bp_\be_\br_\bL_\bU_\bT_\by_\bp_\be_\b<_\bt_\by_\bp_\be_\bn_\ba_\bm_\be_\b _\bM_\ba_\bt_\br_\bi_\bx_\b:_\b:_\bf_\bi_\be_\bl_\bd_\b__\bt_\by_\bp_\be_\b>_\b:_\b:_\bt_\by_\bp_\be),\n-SLU_GE);\n-336 }\n-337 private:\n-338 _\bS_\bu_\bp_\be_\br_\bL_\bU_\bM_\ba_\bt_\br_\bi_\bx* slumat;\n-339 };\n-340}\n-341#endif // HAVE_SUPERLU\n-342#endif\n-_\bb_\bv_\be_\bc_\bt_\bo_\br_\b._\bh_\bh\n-This file implements a vector space as a tensor product of a given vector\n-space. The number of compon...\n-_\bb_\bc_\br_\bs_\bm_\ba_\bt_\br_\bi_\bx_\b._\bh_\bh\n-Implementation of the BCRSMatrix class.\n-_\bs_\bu_\bp_\be_\br_\bl_\bu_\bf_\bu_\bn_\bc_\bt_\bi_\bo_\bn_\bs_\b._\bh_\bh\n-_\bb_\bc_\bc_\bs_\bm_\ba_\bt_\br_\bi_\bx_\bi_\bn_\bi_\bt_\bi_\ba_\bl_\bi_\bz_\be_\br_\b._\bh_\bh\n-_\bm_\ba_\bt\n-Matrix & mat\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn matrixmatrix.hh:347\n-_\bs_\bt_\bd\n-STL namespace.\n+68 for(I index1=index; index1 != endIndex; ++index1)\n+69 if(aggregates[index1.index()]!=_\bA_\bg_\bg_\br_\be_\bg_\ba_\bt_\be_\bs_\bM_\ba_\bp_\b<_\bt_\by_\bp_\be_\bn_\ba_\bm_\be_\b _\bG_\b:_\b:_\bV_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b>_\b:_\b:\n+_\bI_\bS_\bO_\bL_\bA_\bT_\bE_\bD &&\n+70 !_\bg_\be_\bt(visitedMap, index1.index())) {\n+71\n+72 aggregates.template breadthFirstSearch(index1.index(), aggregates\n+[index1.index()],\n+73 graph, renumberer, visitedMap);\n+74 aggregates[index1.index()] = renumberer;\n+75 ++renumberer;\n+76 }\n+77 for(; index != endIndex; ++index)\n+78 put(visitedMap, index.index(), false);\n+79 }\n+80\n+81 } // namespace AMG\n+82} // namespace Dune\n+83#endif\n+_\ba_\bg_\bg_\br_\be_\bg_\ba_\bt_\be_\bs_\b._\bh_\bh\n+Provides classes for the Coloring process of AMG.\n _\bD_\bu_\bn_\be\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn allocator.hh:11\n-_\bD_\bu_\bn_\be_\b:_\b:_\bO_\bv_\be_\br_\bl_\ba_\bp_\bp_\bi_\bn_\bg_\bS_\bc_\bh_\bw_\ba_\br_\bz_\bI_\bn_\bi_\bt_\bi_\ba_\bl_\bi_\bz_\be_\br\n-Initializer for SuperLU Matrices representing the subdomains.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn overlappingschwarz.hh:47\n-_\bD_\bu_\bn_\be_\b:_\b:_\bM_\ba_\bt_\br_\bi_\bx_\bD_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b:_\b:_\bc_\bo_\bl_\bd_\bi_\bm\n-static auto coldim(const M &A)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn matrixutils.hh:219\n-_\bD_\bu_\bn_\be_\b:_\b:_\bM_\ba_\bt_\br_\bi_\bx_\bD_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b:_\b:_\br_\bo_\bw_\bd_\bi_\bm\n-static auto rowdim(const M &A)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn matrixutils.hh:214\n-_\bD_\bu_\bn_\be_\b:_\b:_\bB_\bC_\bR_\bS_\bM_\ba_\bt_\br_\bi_\bx\n-A sparse block matrix with compressed row storage.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn bcrsmatrix.hh:466\n-_\bD_\bu_\bn_\be_\b:_\b:_\bB_\bC_\bR_\bS_\bM_\ba_\bt_\br_\bi_\bx_\b:_\b:_\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be\n-A::size_type size_type\n-The type for the index access and the size.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn bcrsmatrix.hh:497\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\be_\bq_\bO_\bv_\be_\br_\bl_\ba_\bp_\bp_\bi_\bn_\bg_\bS_\bc_\bh_\bw_\ba_\br_\bz\n-Sequential overlapping Schwarz preconditioner.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn overlappingschwarz.hh:755\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\be_\bq_\bO_\bv_\be_\br_\bl_\ba_\bp_\bp_\bi_\bn_\bg_\bS_\bc_\bh_\bw_\ba_\br_\bz_\bA_\bs_\bs_\be_\bm_\bb_\bl_\be_\br_\bH_\be_\bl_\bp_\be_\br\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn overlappingschwarz.hh:694\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bu_\bp_\be_\br_\bL_\bU\n-SuperLu Solver.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn superlu.hh:271\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bu_\bp_\be_\br_\bM_\ba_\bt_\br_\bi_\bx_\bC_\br_\be_\ba_\bt_\be_\bS_\bp_\ba_\br_\bs_\be_\bC_\bh_\bo_\bo_\bs_\be_\br\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn supermatrix.hh:26\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bu_\bp_\be_\br_\bM_\ba_\bt_\br_\bi_\bx_\bP_\br_\bi_\bn_\bt_\be_\br\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn supermatrix.hh:30\n-_\bD_\bu_\bn_\be_\b:_\b:_\bB_\ba_\bs_\be_\bG_\be_\bt_\bS_\bu_\bp_\be_\br_\bL_\bU_\bT_\by_\bp_\be\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn supermatrix.hh:126\n-_\bD_\bu_\bn_\be_\b:_\b:_\bB_\ba_\bs_\be_\bG_\be_\bt_\bS_\bu_\bp_\be_\br_\bL_\bU_\bT_\by_\bp_\be_\b:_\b:_\bt_\by_\bp_\be\n-static const Dtype_t type\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn supermatrix.hh:127\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bt_\bS_\bu_\bp_\be_\br_\bL_\bU_\bT_\by_\bp_\be\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn supermatrix.hh:132\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bt_\bS_\bu_\bp_\be_\br_\bL_\bU_\bT_\by_\bp_\be_\b<_\b _\bd_\bo_\bu_\bb_\bl_\be_\b _\b>_\b:_\b:_\bf_\bl_\bo_\ba_\bt_\b__\bt_\by_\bp_\be\n-double float_type\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn supermatrix.hh:144\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bt_\bS_\bu_\bp_\be_\br_\bL_\bU_\bT_\by_\bp_\be_\b<_\b _\bf_\bl_\bo_\ba_\bt_\b _\b>_\b:_\b:_\bf_\bl_\bo_\ba_\bt_\b__\bt_\by_\bp_\be\n-float float_type\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn supermatrix.hh:151\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bt_\bS_\bu_\bp_\be_\br_\bL_\bU_\bT_\by_\bp_\be_\b<_\b _\bs_\bt_\bd_\b:_\b:_\bc_\bo_\bm_\bp_\bl_\be_\bx_\b<_\b _\bd_\bo_\bu_\bb_\bl_\be_\b _\b>_\b _\b>_\b:_\b:_\bf_\bl_\bo_\ba_\bt_\b__\bt_\by_\bp_\be\n-double float_type\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn supermatrix.hh:158\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bt_\bS_\bu_\bp_\be_\br_\bL_\bU_\bT_\by_\bp_\be_\b<_\b _\bs_\bt_\bd_\b:_\b:_\bc_\bo_\bm_\bp_\bl_\be_\bx_\b<_\b _\bf_\bl_\bo_\ba_\bt_\b _\b>_\b _\b>_\b:_\b:_\bf_\bl_\bo_\ba_\bt_\b__\bt_\by_\bp_\be\n-float float_type\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn supermatrix.hh:165\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bu_\bp_\be_\br_\bL_\bU_\bM_\ba_\bt_\br_\bi_\bx\n-Utility class for converting an ISTL Matrix into a SuperLU Matrix.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn supermatrix.hh:175\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bu_\bp_\be_\br_\bM_\ba_\bt_\br_\bi_\bx_\bI_\bn_\bi_\bt_\bi_\ba_\bl_\bi_\bz_\be_\br\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn supermatrix.hh:179\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bu_\bp_\be_\br_\bL_\bU_\bM_\ba_\bt_\br_\bi_\bx_\b<_\b _\bB_\bC_\bR_\bS_\bM_\ba_\bt_\br_\bi_\bx_\b<_\b _\bB_\b,_\b _\bT_\bA_\b _\b>_\b _\b>_\b:_\b:_\bf_\br_\be_\be\n-virtual void free()\n-free allocated space.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn supermatrix.hh:303\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bu_\bp_\be_\br_\bL_\bU_\bM_\ba_\bt_\br_\bi_\bx_\b<_\b _\bB_\bC_\bR_\bS_\bM_\ba_\bt_\br_\bi_\bx_\b<_\b _\bB_\b,_\b _\bT_\bA_\b _\b>_\b _\b>_\b:_\b:_\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b=\n-SuperLUMatrix< BCRSMatrix< B, TA > > & operator=(const SuperLUMatrix<\n-BCRSMatrix< B, TA > > &mat)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn supermatrix.hh:256\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bu_\bp_\be_\br_\bL_\bU_\bM_\ba_\bt_\br_\bi_\bx_\b<_\b _\bB_\bC_\bR_\bS_\bM_\ba_\bt_\br_\bi_\bx_\b<_\b _\bB_\b,_\b _\bT_\bA_\b _\b>_\b _\b>_\b:_\b:_\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b=\n-SuperLUMatrix< BCRSMatrix< B, TA > > & operator=(const BCRSMatrix< B, TA >\n-&mat)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn supermatrix.hh:237\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bu_\bp_\be_\br_\bL_\bU_\bM_\ba_\bt_\br_\bi_\bx_\b<_\b _\bB_\bC_\bR_\bS_\bM_\ba_\bt_\br_\bi_\bx_\b<_\b _\bB_\b,_\b _\bT_\bA_\b _\b>_\b _\b>_\b:_\b:_\bS_\bu_\bp_\be_\br_\bL_\bU_\bM_\ba_\bt_\br_\bi_\bx\n-SuperLUMatrix(const Matrix &mat)\n-Constructor that initializes the data.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn supermatrix.hh:212\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bu_\bp_\be_\br_\bL_\bU_\bM_\ba_\bt_\br_\bi_\bx_\b<_\b _\bB_\bC_\bR_\bS_\bM_\ba_\bt_\br_\bi_\bx_\b<_\b _\bB_\b,_\b _\bT_\bA_\b _\b>_\b _\b>_\b:_\b:_\bs_\be_\bt_\bM_\ba_\bt_\br_\bi_\bx\n-virtual void setMatrix(const Matrix &mat)\n-Initialize data from given matrix.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn supermatrix.hh:293\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bu_\bp_\be_\br_\bL_\bU_\bM_\ba_\bt_\br_\bi_\bx_\b<_\b _\bB_\bC_\bR_\bS_\bM_\ba_\bt_\br_\bi_\bx_\b<_\b _\bB_\b,_\b _\bT_\bA_\b _\b>_\b _\b>_\b:_\b:_\bS_\bu_\bp_\be_\br_\bL_\bU_\bM_\ba_\bt_\br_\bi_\bx\n-SuperLUMatrix()\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn supermatrix.hh:215\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bu_\bp_\be_\br_\bL_\bU_\bM_\ba_\bt_\br_\bi_\bx_\b<_\b _\bB_\bC_\bR_\bS_\bM_\ba_\bt_\br_\bi_\bx_\b<_\b _\bB_\b,_\b _\bT_\bA_\b _\b>_\b _\b>_\b:_\b:_\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be\n-Matrix::size_type size_type\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn supermatrix.hh:206\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bu_\bp_\be_\br_\bL_\bU_\bM_\ba_\bt_\br_\bi_\bx_\b<_\b _\bB_\bC_\bR_\bS_\bM_\ba_\bt_\br_\bi_\bx_\b<_\b _\bB_\b,_\b _\bT_\bA_\b _\b>_\b _\b>_\b:_\b:_\bM_\ba_\bt_\br_\bi_\bx\n-BCRSMatrix< B, TA > Matrix\n-The type of the matrix to convert.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn supermatrix.hh:202\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bu_\bp_\be_\br_\bL_\bU_\bM_\ba_\bt_\br_\bi_\bx_\b<_\b _\bB_\bC_\bR_\bS_\bM_\ba_\bt_\br_\bi_\bx_\b<_\b _\bB_\b,_\b _\bT_\bA_\b _\b>_\b _\b>_\b:_\b:_\bs_\be_\bt_\bM_\ba_\bt_\br_\bi_\bx\n-virtual void setMatrix(const Matrix &mat, const std::set< std::size_t > &mrs)\n-Initialize data from a given set of matrix rows and columns.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn supermatrix.hh:281\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bu_\bp_\be_\br_\bL_\bU_\bM_\ba_\bt_\br_\bi_\bx_\b<_\b _\bB_\bC_\bR_\bS_\bM_\ba_\bt_\br_\bi_\bx_\b<_\b _\bB_\b,_\b _\bT_\bA_\b _\b>_\b _\b>_\b:_\b:_\b~_\bS_\bu_\bp_\be_\br_\bL_\bU_\bM_\ba_\bt_\br_\bi_\bx\n-virtual ~SuperLUMatrix()\n-Destructor.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn supermatrix.hh:219\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bu_\bp_\be_\br_\bM_\ba_\bt_\br_\bi_\bx_\bI_\bn_\bi_\bt_\bi_\ba_\bl_\bi_\bz_\be_\br_\b<_\b _\bB_\bC_\bR_\bS_\bM_\ba_\bt_\br_\bi_\bx_\b<_\b _\bB_\b,_\b _\bA_\b _\b>_\b _\b>_\b:_\b:_\bS_\bu_\bp_\be_\br_\bL_\bU_\bM_\ba_\bt_\br_\bi_\bx\n-Dune::SuperLUMatrix< Matrix > SuperLUMatrix\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn supermatrix.hh:320\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bu_\bp_\be_\br_\bM_\ba_\bt_\br_\bi_\bx_\bI_\bn_\bi_\bt_\bi_\ba_\bl_\bi_\bz_\be_\br_\b<_\b _\bB_\bC_\bR_\bS_\bM_\ba_\bt_\br_\bi_\bx_\b<_\b _\bB_\b,_\b _\bA_\b _\b>_\b _\b>_\b:_\b:_\bM_\ba_\bt_\br_\bi_\bx\n-BCRSMatrix< B, A > Matrix\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn supermatrix.hh:319\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bu_\bp_\be_\br_\bM_\ba_\bt_\br_\bi_\bx_\bI_\bn_\bi_\bt_\bi_\ba_\bl_\bi_\bz_\be_\br_\b<_\b _\bB_\bC_\bR_\bS_\bM_\ba_\bt_\br_\bi_\bx_\b<_\b _\bB_\b,_\b _\bA_\b _\b>_\b _\b>_\b:_\b:_\bS_\bu_\bp_\be_\br_\bM_\ba_\bt_\br_\bi_\bx_\bI_\bn_\bi_\bt_\bi_\ba_\bl_\bi_\bz_\be_\br\n-SuperMatrixInitializer()\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn supermatrix.hh:326\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bu_\bp_\be_\br_\bM_\ba_\bt_\br_\bi_\bx_\bI_\bn_\bi_\bt_\bi_\ba_\bl_\bi_\bz_\be_\br_\b<_\b _\bB_\bC_\bR_\bS_\bM_\ba_\bt_\br_\bi_\bx_\b<_\b _\bB_\b,_\b _\bA_\b _\b>_\b _\b>_\b:_\b:_\bc_\br_\be_\ba_\bt_\be_\bM_\ba_\bt_\br_\bi_\bx\n-virtual void createMatrix() const\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn supermatrix.hh:329\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bu_\bp_\be_\br_\bM_\ba_\bt_\br_\bi_\bx_\bI_\bn_\bi_\bt_\bi_\ba_\bl_\bi_\bz_\be_\br_\b<_\b _\bB_\bC_\bR_\bS_\bM_\ba_\bt_\br_\bi_\bx_\b<_\b _\bB_\b,_\b _\bA_\b _\b>_\b _\b>_\b:_\b:_\bS_\bu_\bp_\be_\br_\bM_\ba_\bt_\br_\bi_\bx_\bI_\bn_\bi_\bt_\bi_\ba_\bl_\bi_\bz_\be_\br\n-SuperMatrixInitializer(SuperLUMatrix &lum)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn supermatrix.hh:322\n+_\bD_\bu_\bn_\be_\b:_\b:_\bg_\be_\bt\n+PropertyMapTypeSelector< Amg::VertexVisitedTag, Amg::PropertiesGraph< G, Amg::\n+VertexProperties, EP, VM, EM > >::Type get(const Amg::VertexVisitedTag &tag,\n+Amg::PropertiesGraph< G, Amg::VertexProperties, EP, VM, EM > &graph)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn dependency.hh:293\n+_\bD_\bu_\bn_\be_\b:_\b:_\bA_\bm_\bg_\b:_\b:_\br_\be_\bn_\bu_\bm_\bb_\be_\br_\bA_\bg_\bg_\br_\be_\bg_\ba_\bt_\be_\bs\n+void renumberAggregates(const G &graph, I index, I endIndex, V &visitedMap,\n+AggregatesMap< typename G::VertexDescriptor > &aggregates)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn renumberer.hh:63\n+_\bD_\bu_\bn_\be_\b:_\b:_\bA_\bm_\bg_\b:_\b:_\bA_\bg_\bg_\br_\be_\bg_\ba_\bt_\be_\bs_\bM_\ba_\bp\n+Class providing information about the mapping of the vertices onto aggregates.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn aggregates.hh:560\n+_\bD_\bu_\bn_\be_\b:_\b:_\bA_\bm_\bg_\b:_\b:_\bA_\bg_\bg_\br_\be_\bg_\ba_\bt_\be_\bR_\be_\bn_\bu_\bm_\bb_\be_\br_\be_\br\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn renumberer.hh:16\n+_\bD_\bu_\bn_\be_\b:_\b:_\bA_\bm_\bg_\b:_\b:_\bA_\bg_\bg_\br_\be_\bg_\ba_\bt_\be_\bR_\be_\bn_\bu_\bm_\bb_\be_\br_\be_\br_\b:_\b:_\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b+_\b+\n+void operator++()\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn renumberer.hh:57\n+_\bD_\bu_\bn_\be_\b:_\b:_\bA_\bm_\bg_\b:_\b:_\bA_\bg_\bg_\br_\be_\bg_\ba_\bt_\be_\bR_\be_\bn_\bu_\bm_\bb_\be_\br_\be_\br_\b:_\b:_\bV_\be_\br_\bt_\be_\bx\n+G::VertexDescriptor Vertex\n+The vertex type.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn renumberer.hh:19\n+_\bD_\bu_\bn_\be_\b:_\b:_\bA_\bm_\bg_\b:_\b:_\bA_\bg_\bg_\br_\be_\bg_\ba_\bt_\be_\bR_\be_\bn_\bu_\bm_\bb_\be_\br_\be_\br_\b:_\b:_\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b(_\b)\n+void operator()(const typename G::ConstEdgeIterator &edge)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn renumberer.hh:51\n+_\bD_\bu_\bn_\be_\b:_\b:_\bA_\bm_\bg_\b:_\b:_\bA_\bg_\bg_\br_\be_\bg_\ba_\bt_\be_\bR_\be_\bn_\bu_\bm_\bb_\be_\br_\be_\br_\b:_\b:_\ba_\bg_\bg_\br_\be_\bg_\ba_\bt_\be_\bs_\b_\n+AggregatesMap< Vertex > & aggregates_\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn renumberer.hh:36\n+_\bD_\bu_\bn_\be_\b:_\b:_\bA_\bm_\bg_\b:_\b:_\bA_\bg_\bg_\br_\be_\bg_\ba_\bt_\be_\bR_\be_\bn_\bu_\bm_\bb_\be_\br_\be_\br_\b:_\b:_\bA_\bg_\bg_\br_\be_\bg_\ba_\bt_\be_\bR_\be_\bn_\bu_\bm_\bb_\be_\br_\be_\br\n+AggregateRenumberer(AggregatesMap< Vertex > &aggregates)\n+Constructor.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn renumberer.hh:40\n+_\bD_\bu_\bn_\be_\b:_\b:_\bA_\bm_\bg_\b:_\b:_\bA_\bg_\bg_\br_\be_\bg_\ba_\bt_\be_\bR_\be_\bn_\bu_\bm_\bb_\be_\br_\be_\br_\b:_\b:_\bn_\bu_\bm_\bb_\be_\br_\b_\n+Vertex number_\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn renumberer.hh:35\n ===============================================================================\n Generated by\u00a0_\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b] 1.9.8\n"}]}, {"source1": "./usr/share/doc/libdune-istl-doc/doxygen/a00032.html", "source2": "./usr/share/doc/libdune-istl-doc/doxygen/a00032.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n dune-istl: bdmatrix.hh File Reference \n+dune-istl: matrixhierarchy.hh File Reference \n \n \n-
Implementation of the BDMatrix class. \n+
Provides a classes representing the hierarchies in AMG. \n More...
\n-
#include <memory>\n-
#include <dune/common/rangeutilities.hh>\n-
#include <dune/common/scalarmatrixview.hh>\n-
#include <dune/istl/bcrsmatrix.hh >\n-
#include <dune/istl/blocklevel.hh >\n+
\n
Go to the source code of this file.
\n
\n+template<typename M , typename C1 > bool Dune::Amg::repartitionAndDistributeMatrix (const M &origMatrix, std::shared_ptr< M > newMatrix, SequentialInformation &origComm, std::shared_ptr< SequentialInformation > &newComm, RedistributeInformation < SequentialInformation > &ri, int nparts, C1 &criterion) template<typename M , typename C , typename C1 > bool Dune::Amg::repartitionAndDistributeMatrix (const M &origMatrix, std::shared_ptr< M > newMatrix, C &origComm, std::shared_ptr< C > &newComm, RedistributeInformation < C > &ri, int nparts, C1 &criterion)
\n
\n-
Implementation of the BDMatrix class.
\n-
Author Oliver Sander \n+
Provides a classes representing the hierarchies in AMG.
\n+
Author Markus Blatt \n
\n \n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,30 +1,68 @@\n dune-istl\u00a02.10\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bi_\bs_\bt_\bl\n-_\bC_\bl_\ba_\bs_\bs_\be_\bs | _\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs\n-bdmatrix.hh File Reference\n-Implementation of the BDMatrix class. _\bM_\bo_\br_\be_\b._\b._\b.\n-#include
\n-#include \n-#include \n-#include <_\bd_\bu_\bn_\be_\b/_\bi_\bs_\bt_\bl_\b/_\bb_\bc_\br_\bs_\bm_\ba_\bt_\br_\bi_\bx_\b._\bh_\bh>\n-#include <_\bd_\bu_\bn_\be_\b/_\bi_\bs_\bt_\bl_\b/_\bb_\bl_\bo_\bc_\bk_\bl_\be_\bv_\be_\bl_\b._\bh_\bh>\n+ * _\bp_\ba_\ba_\bm_\bg\n+_\bC_\bl_\ba_\bs_\bs_\be_\bs | _\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs | _\bE_\bn_\bu_\bm_\be_\br_\ba_\bt_\bi_\bo_\bn_\bs | _\bF_\bu_\bn_\bc_\bt_\bi_\bo_\bn_\bs\n+matrixhierarchy.hh File Reference\n+_\bI_\bt_\be_\br_\ba_\bt_\bi_\bv_\be_\b _\bS_\bo_\bl_\bv_\be_\br_\bs_\b _\bT_\be_\bm_\bp_\bl_\ba_\bt_\be_\b _\bL_\bi_\bb_\br_\ba_\br_\by_\b _\b(_\bI_\bS_\bT_\bL_\b) \u00bb _\bI_\bt_\be_\br_\ba_\bt_\bi_\bv_\be_\b _\bS_\bo_\bl_\bv_\be_\br_\bs \u00bb _\bP_\br_\be_\bc_\bo_\bn_\bd_\bi_\bt_\bi_\bo_\bn_\be_\br_\bs\n+\u00bb _\bP_\ba_\br_\ba_\bl_\bl_\be_\bl_\b _\bA_\bl_\bg_\be_\bb_\br_\ba_\bi_\bc_\b _\bM_\bu_\bl_\bt_\bi_\bg_\br_\bi_\bd\n+Provides a classes representing the hierarchies in AMG. _\bM_\bo_\br_\be_\b._\b._\b.\n+#include \n+#include \n+#include \"_\ba_\bg_\bg_\br_\be_\bg_\ba_\bt_\be_\bs_\b._\bh_\bh\"\n+#include \"_\bg_\br_\ba_\bp_\bh_\b._\bh_\bh\"\n+#include \"_\bg_\ba_\bl_\be_\br_\bk_\bi_\bn_\b._\bh_\bh\"\n+#include \"_\br_\be_\bn_\bu_\bm_\bb_\be_\br_\be_\br_\b._\bh_\bh\"\n+#include \"_\bg_\br_\ba_\bp_\bh_\bc_\br_\be_\ba_\bt_\bo_\br_\b._\bh_\bh\"\n+#include \"_\bh_\bi_\be_\br_\ba_\br_\bc_\bh_\by_\b._\bh_\bh\"\n+#include <_\bd_\bu_\bn_\be_\b/_\bi_\bs_\bt_\bl_\b/_\bb_\bv_\be_\bc_\bt_\bo_\br_\b._\bh_\bh>\n+#include \n+#include <_\bd_\bu_\bn_\be_\b/_\bi_\bs_\bt_\bl_\b/_\bm_\ba_\bt_\br_\bi_\bx_\bu_\bt_\bi_\bl_\bs_\b._\bh_\bh>\n+#include <_\bd_\bu_\bn_\be_\b/_\bi_\bs_\bt_\bl_\b/_\bm_\ba_\bt_\br_\bi_\bx_\br_\be_\bd_\bi_\bs_\bt_\br_\bi_\bb_\bu_\bt_\be_\b._\bh_\bh>\n+#include <_\bd_\bu_\bn_\be_\b/_\bi_\bs_\bt_\bl_\b/_\bp_\ba_\ba_\bm_\bg_\b/_\bd_\be_\bp_\be_\bn_\bd_\be_\bn_\bc_\by_\b._\bh_\bh>\n+#include <_\bd_\bu_\bn_\be_\b/_\bi_\bs_\bt_\bl_\b/_\bp_\ba_\ba_\bm_\bg_\b/_\bi_\bn_\bd_\bi_\bc_\be_\bs_\bc_\bo_\ba_\br_\bs_\be_\bn_\be_\br_\b._\bh_\bh>\n+#include <_\bd_\bu_\bn_\be_\b/_\bi_\bs_\bt_\bl_\b/_\bp_\ba_\ba_\bm_\bg_\b/_\bg_\bl_\bo_\bb_\ba_\bl_\ba_\bg_\bg_\br_\be_\bg_\ba_\bt_\be_\bs_\b._\bh_\bh>\n+#include <_\bd_\bu_\bn_\be_\b/_\bi_\bs_\bt_\bl_\b/_\bp_\ba_\ba_\bm_\bg_\b/_\bc_\bo_\bn_\bs_\bt_\br_\bu_\bc_\bt_\bi_\bo_\bn_\b._\bh_\bh>\n+#include <_\bd_\bu_\bn_\be_\b/_\bi_\bs_\bt_\bl_\b/_\bp_\ba_\ba_\bm_\bg_\b/_\bs_\bm_\bo_\bo_\bt_\bh_\be_\br_\b._\bh_\bh>\n+#include <_\bd_\bu_\bn_\be_\b/_\bi_\bs_\bt_\bl_\b/_\bp_\ba_\ba_\bm_\bg_\b/_\bt_\br_\ba_\bn_\bs_\bf_\be_\br_\b._\bh_\bh>\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bs_\bo_\bu_\br_\bc_\be_\b _\bc_\bo_\bd_\be_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n C\bCl\bla\bas\bss\bse\bes\bs\n- class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bB_\bD_\bM_\ba_\bt_\br_\bi_\bx_\b<_\b _\bB_\b,_\b _\bA_\b _\b>\n-\u00a0 A block-diagonal matrix. _\bM_\bo_\br_\be_\b._\b._\b.\n+ class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bA_\bm_\bg_\b:_\b:_\bM_\ba_\bt_\br_\bi_\bx_\bH_\bi_\be_\br_\ba_\br_\bc_\bh_\by_\b<_\b _\bM_\b,_\b _\bP_\bI_\b,_\b _\bA_\b _\b>\n+\u00a0 The hierarchies build by the coarsening process. _\bM_\bo_\br_\be_\b._\b._\b.\n \u00a0\n-struct \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bF_\bi_\be_\bl_\bd_\bT_\br_\ba_\bi_\bt_\bs_\b<_\b _\bB_\bD_\bM_\ba_\bt_\br_\bi_\bx_\b<_\b _\bB_\b,_\b _\bA_\b _\b>_\b _\b>\n+struct \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bA_\bm_\bg_\b:_\b:_\bM_\ba_\bt_\br_\bi_\bx_\bH_\bi_\be_\br_\ba_\br_\bc_\bh_\by_\b<_\b _\bM_\b,_\b _\bP_\bI_\b,_\b _\bA_\b _\b>_\b:_\b:_\bM_\ba_\bt_\br_\bi_\bx_\bS_\bt_\ba_\bt_\bs_\b<_\b _\bM_\ba_\bt_\br_\bi_\bx_\b,_\b _\bt_\br_\bu_\be_\b _\b>_\b:_\b:\n+ _\bc_\ba_\bl_\bc\n+\u00a0\n+ class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bA_\bm_\bg_\b:_\b:_\bC_\bo_\ba_\br_\bs_\be_\bn_\bC_\br_\bi_\bt_\be_\br_\bi_\bo_\bn_\b<_\b _\bT_\b _\b>\n+\u00a0 The criterion describing the stop criteria for the coarsening process.\n+ _\bM_\bo_\br_\be_\b._\b._\b.\n \u00a0\n N\bNa\bam\bme\bes\bsp\bpa\bac\bce\bes\bs\n namespace \u00a0 _\bD_\bu_\bn_\be\n \u00a0\n+namespace \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bA_\bm_\bg\n+\u00a0\n+E\bEn\bnu\bum\bme\ber\bra\bat\bti\bio\bon\bns\bs\n+enum \u00a0 { _\bD_\bu_\bn_\be_\b:_\b:_\bA_\bm_\bg_\b:_\b:_\bM_\bA_\bX_\b__\bP_\bR_\bO_\bC_\bE_\bS_\bS_\bE_\bS = 72000 }\n+\u00a0\n+F\bFu\bun\bnc\bct\bti\bio\bon\bns\bs\n+template\n+bool\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bA_\bm_\bg_\b:_\b:_\br_\be_\bp_\ba_\br_\bt_\bi_\bt_\bi_\bo_\bn_\bA_\bn_\bd_\bD_\bi_\bs_\bt_\br_\bi_\bb_\bu_\bt_\be_\bM_\ba_\bt_\br_\bi_\bx (const M &origMatrix, std::\n+ shared_ptr< M > newMatrix, _\bS_\be_\bq_\bu_\be_\bn_\bt_\bi_\ba_\bl_\bI_\bn_\bf_\bo_\br_\bm_\ba_\bt_\bi_\bo_\bn &origComm, std::\n+ shared_ptr< _\bS_\be_\bq_\bu_\be_\bn_\bt_\bi_\ba_\bl_\bI_\bn_\bf_\bo_\br_\bm_\ba_\bt_\bi_\bo_\bn > &newComm, _\bR_\be_\bd_\bi_\bs_\bt_\br_\bi_\bb_\bu_\bt_\be_\bI_\bn_\bf_\bo_\br_\bm_\ba_\bt_\bi_\bo_\bn<\n+ _\bS_\be_\bq_\bu_\be_\bn_\bt_\bi_\ba_\bl_\bI_\bn_\bf_\bo_\br_\bm_\ba_\bt_\bi_\bo_\bn > &ri, int nparts, C1 &criterion)\n+\u00a0\n+template\n+bool\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bA_\bm_\bg_\b:_\b:_\br_\be_\bp_\ba_\br_\bt_\bi_\bt_\bi_\bo_\bn_\bA_\bn_\bd_\bD_\bi_\bs_\bt_\br_\bi_\bb_\bu_\bt_\be_\bM_\ba_\bt_\br_\bi_\bx (const M &origMatrix, std::\n+ shared_ptr< M > newMatrix, C &origComm, std::shared_ptr< C > &newComm,\n+ _\bR_\be_\bd_\bi_\bs_\bt_\br_\bi_\bb_\bu_\bt_\be_\bI_\bn_\bf_\bo_\br_\bm_\ba_\bt_\bi_\bo_\bn< C > &ri, int nparts, C1 &criterion)\n+\u00a0\n *\b**\b**\b**\b**\b* D\bDe\bet\bta\bai\bil\ble\bed\bd D\bDe\bes\bsc\bcr\bri\bip\bpt\bti\bio\bon\bn *\b**\b**\b**\b**\b*\n-Implementation of the BDMatrix class.\n+Provides a classes representing the hierarchies in AMG.\n Author\n- Oliver Sander\n+ Markus Blatt\n ===============================================================================\n Generated by\u00a0_\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b] 1.9.8\n"}]}, {"source1": "./usr/share/doc/libdune-istl-doc/doxygen/a00032_source.html", "source2": "./usr/share/doc/libdune-istl-doc/doxygen/a00032_source.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n dune-istl: bdmatrix.hh Source File \n+dune-istl: matrixhierarchy.hh Source File \n \n
\n
Go to the documentation of this file. \n
\n
\n
\n-
5 #ifndef DUNE_ISTL_BDMATRIX_HH \n-
6 #define DUNE_ISTL_BDMATRIX_HH \n+
5 #ifndef DUNE_AMG_MATRIXHIERARCHY_HH \n+
6 #define DUNE_AMG_MATRIXHIERARCHY_HH \n
\n-
\n-
\n-
10 #include <dune/common/rangeutilities.hh> \n-
11 #include <dune/common/scalarmatrixview.hh> \n-
\n-
\n-
\n-
\n-
\n-
31 template <
class B,
class A=std::allocator<B> >
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
39 using field_type =
typename Imp::BlockTraits<B>::field_type;
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
17 #include <dune/common/parallel/indexset.hh> \n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n
\n-
\n-
\n-
\n-
\n-
\n-
\n-
59 for (
int i=0; i<size; i++)
\n-
\n-
\n-
\n-
\n-
64 for (
int i=0; i<size; i++)
\n-
\n-
\n-
\n+
59 template <
class M,
class PI,
class A=std::allocator<M> >
\n+
\n+
\n+
\n+
\n+
\n+
\n+
67 typedef typename MatrixOperator::matrix_type
Matrix ;
\n
\n-
\n-
\n-
\n-
\n-
72 BDMatrix (std::initializer_list<B>
const &list)
\n-
\n-
\n-
\n-
76 for (
auto it = list.begin(); it != list.end(); ++it, ++i)
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
85 using AAllocator =
typename std::allocator_traits<Allocator>::template rebind_alloc<AggregatesMap*>;
\n
\n-
87 for (
auto i : range(size))
\n-
\n+
\n
\n-
\n-
\n-
92 for (
auto i : range(size))
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
116 void solve (V& x,
const V& rhs)
const {
\n-
\n-
\n-
119 auto && xv = Impl::asVector(x[i]);
\n-
120 auto && rhsv = Impl::asVector(rhs[i]);
\n-
121 Impl::asMatrix((*
this )[i][i]).solve(xv,rhsv);
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
128 Impl::asMatrix((*
this )[i][i]).
invert ();
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
142 void endrowsizes () {}
\n-
\n-
144 void endindices () {}
\n-
\n-
\n-
\n-
147 template <
typename B,
typename A>
\n-
\n-
\n-
\n-
\n-
151 using real_type =
typename FieldTraits<field_type>::real_type;
\n-
\n-
\n-
\n+
\n+
\n+
94 using RILAllocator =
typename std::allocator_traits<Allocator>::template rebind_alloc<RedistributeInfoType>;
\n+
\n+
\n+
\n+
\n+
105 std::shared_ptr<ParallelInformation> pinfo = std::make_shared<ParallelInformation>());
\n+
\n+
\n+
\n+
114 template <
typename O,
typename T>
\n+
115 void build (
const T& criterion);
\n+
\n+
\n+
\n+
\n+
131 template <
class V,
class BA,
class TA>
\n+
\n+
\n+
139 template <
class S,
class TA>
\n+
\n+
\n+
\n+
147 std::size_t
levels ()
const ;
\n+
\n+
\n+
\n+
\n
\n-
\n-
Implementation of the BCRSMatrix class.
\n-
Helper functions for determining the vector/matrix block level.
\n-
Col col
Definition matrixmatrix.hh:351
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
228 template <
class Matrix,
bool pr
int >
\n+
\n+
\n+
\n+
235 static void stats([[maybe_unused]]
const Matrix & matrix)
\n+
\n+
\n+
\n+
239 template <
class Matrix>
\n+
240 struct MatrixStats<
Matrix ,true>
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
249 min=std::numeric_limits<size_type>::max();
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
256 min=std::min(min, row.size());
\n+
257 max=std::max(max, row.size());
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
268 static void stats(
const Matrix & matrix)
\n+
\n+
270 calc c= for_each(matrix.begin(), matrix.end(), calc());
\n+
271 dinfo<<
"Matrix row: min=" <<c.min<<
" max=" <<c.max
\n+
272 <<
" average=" <<
static_cast< double > (c.sum)/matrix.N()
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
315 template <
typename M,
typename C1>
\n+
\n+
\n+
317 [[maybe_unused]] std::shared_ptr<M> newMatrix,
\n+
\n+
319 [[maybe_unused]] std::shared_ptr<SequentialInformation>& newComm,
\n+
\n+
321 [[maybe_unused]]
int nparts,
\n+
322 [[maybe_unused]] C1& criterion)
\n+
\n+
324 DUNE_THROW(NotImplemented,
"Redistribution does not make sense in sequential code!" );
\n+
\n+
\n+
\n+
\n+
328 template <
typename M,
typename C,
typename C1>
\n+
\n+
\n+
330 std::shared_ptr<M> newMatrix,
\n+
\n+
332 std::shared_ptr<C>& newComm,
\n+
\n+
334 int nparts, C1& criterion)
\n+
\n+
\n+
337 #ifdef AMG_REPART_ON_COMM_GRAPH \n+
\n+
\n+
\n+
341 criterion.debugLevel()>1);
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
355 if (origComm.communicator().rank()==0)
\n+
356 std::cout<<
"Original matrix" <<std::endl;
\n+
357 origComm.communicator().barrier();
\n+
\n+
\n+
\n+
361 newComm, ri.getInterface(),
\n+
362 criterion.debugLevel()>1);
\n+
\n+
\n+
365 if (origComm.communicator().rank()==0 && criterion.debugLevel()>1)
\n+
366 std::cout<<
"Repartitioning took " <<time.elapsed()<<
" seconds." <<std::endl;
\n+
\n+
\n+
\n+
\n+
371 ri.checkInterface(origComm.indexSet(), newComm->indexSet(), origComm.communicator());
\n+
\n+
\n+
\n+
\n+
\n+
377 if (origComm.communicator().rank()==0)
\n+
378 std::cout<<
"Original matrix" <<std::endl;
\n+
379 origComm.communicator().barrier();
\n+
380 if (newComm->communicator().size()>0)
\n+
\n+
382 origComm.communicator().barrier();
\n+
\n+
\n+
385 if (origComm.communicator().rank()==0 && criterion.debugLevel()>1)
\n+
386 std::cout<<
"Redistributing matrix took " <<time.elapsed()<<
" seconds." <<std::endl;
\n+
387 return existentOnRedist;
\n+
\n+
\n+
\n+
\n+
391 template <
class M,
class IS,
class A>
\n+
\n+
\n+
393 std::shared_ptr<ParallelInformation> pinfo)
\n+
394 : matrices_(fineMatrix),
\n+
395 parallelInformation_(pinfo)
\n+
\n+
\n+
398 DUNE_THROW(
ISTLError ,
"MatrixOperator and ParallelInformation must belong to the same category!" );
\n+
\n+
\n+
\n+
401 template <
class M,
class IS,
class A>
\n+
402 template <
typename O,
typename T>
\n+
\n+
\n+
\n+
405 prolongDamp_ = criterion.getProlongationDampingFactor();
\n+
406 typedef O OverlapFlags;
\n+
\n+
\n+
\n+
\n+
\n+
412 typedef bigunsignedint<
sizeof (int)*8*noints> BIGINT;
\n+
\n+
414 MatIterator mlevel = matrices_.finest();
\n+
415 MatrixStats<typename M::matrix_type,MINIMAL_DEBUG_LEVEL<=INFO_DEBUG_LEVEL>::stats(mlevel->getmat());
\n+
\n+
417 PInfoIterator infoLevel = parallelInformation_.finest();
\n+
\n+
419 finenonzeros = infoLevel->communicator().sum(finenonzeros);
\n+
420 BIGINT allnonzeros = finenonzeros;
\n+
\n+
\n+
\n+
\n+
\n+
426 BIGINT unknowns = mlevel->getmat().N();
\n+
\n+
428 unknowns = infoLevel->communicator().sum(unknowns);
\n+
429 double dunknowns=unknowns.todouble();
\n+
430 infoLevel->buildGlobalLookup(mlevel->getmat().N());
\n+
\n+
\n+
433 for (; level < criterion.maxLevel(); ++level, ++mlevel) {
\n+
434 assert(matrices_.levels()==redistributes_.size());
\n+
435 rank = infoLevel->communicator().rank();
\n+
436 if (rank==0 && criterion.debugLevel()>1)
\n+
437 std::cout<<
"Level " <<level<<
" has " <<dunknowns<<
" unknowns, " <<dunknowns/infoLevel->communicator().size()
\n+
438 <<
" unknowns per proc (procs=" <<infoLevel->communicator().size()<<
")" <<std::endl;
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
450 && dunknowns < 30*infoLevel->communicator().size()))
\n+
451 && infoLevel->communicator().size()>1 &&
\n+
452 dunknowns/infoLevel->communicator().size() <= criterion.coarsenTarget())
\n+
\n+
\n+
455 std::shared_ptr<Matrix> redistMat = std::make_shared<Matrix>();
\n+
456 std::shared_ptr<ParallelInformation> redistComm;
\n+
457 std::size_t nodomains = (std::size_t)std::ceil(dunknowns/(criterion.minAggregateSize()
\n+
458 *criterion.coarsenTarget()));
\n+
459 if ( nodomains<=criterion.minAggregateSize()/2 ||
\n+
460 dunknowns <= criterion.coarsenTarget() )
\n+
\n+
\n+
463 bool existentOnNextLevel =
\n+
\n+
465 redistComm, redistributes_.back(), nodomains,
\n+
\n+
467 BIGINT unknownsRedist = redistMat->N();
\n+
468 unknownsRedist = infoLevel->communicator().sum(unknownsRedist);
\n+
469 dunknowns= unknownsRedist.todouble();
\n+
470 if (redistComm->communicator().rank()==0 && criterion.debugLevel()>1)
\n+
471 std::cout<<
"Level " <<level<<
" (redistributed) has " <<dunknowns<<
" unknowns, " <<dunknowns/redistComm->communicator().size()
\n+
472 <<
" unknowns per proc (procs=" <<redistComm->communicator().size()<<
")" <<std::endl;
\n+
473 MatrixArgs args(redistMat, *redistComm);
\n+
\n+
475 assert(mlevel.isRedistributed());
\n+
476 infoLevel.addRedistributed(redistComm);
\n+
477 infoLevel->freeGlobalLookup();
\n+
\n+
479 if (!existentOnNextLevel)
\n+
\n+
\n+
\n+
\n+
484 matrix = &(mlevel.getRedistributed());
\n+
485 info = &(infoLevel.getRedistributed());
\n+
486 info->buildGlobalLookup(matrix->getmat().N());
\n+
\n+
\n+
489 rank = info->communicator().rank();
\n+
490 if (dunknowns <= criterion.coarsenTarget())
\n+
\n+
\n+
\n+
\n+
\n+
496 typedef typename GraphCreator::GraphTuple GraphTuple;
\n+
\n+
\n+
\n+
500 std::vector<bool> excluded(matrix->getmat().N(),
false );
\n+
\n+
502 GraphTuple graphs = GraphCreator::create(*matrix, excluded, *info, OverlapFlags());
\n+
\n+
\n+
\n+
506 aggregatesMaps_.push_back(aggregatesMap);
\n+
\n+
\n+
\n+
510 auto [noAggregates, isoAggregates, oneAggregates, skippedAggregates] =
\n+
511 aggregatesMap->
buildAggregates (matrix->getmat(), *(std::get<1>(graphs)), criterion, level==0);
\n+
\n+
513 if (rank==0 && criterion.debugLevel()>2)
\n+
514 std::cout<<
" Have built " <<noAggregates<<
" aggregates totally (" <<isoAggregates<<
" isolated aggregates, " <<
\n+
515 oneAggregates<<
" aggregates of one vertex, and skipped " <<
\n+
516 skippedAggregates<<
" aggregates)." <<std::endl;
\n+
\n+
\n+
\n+
520 int start, end, overlapStart, overlapEnd;
\n+
521 int procs=info->communicator().rank();
\n+
522 int n = UNKNOWNS/procs;
\n+
523 int bigger = UNKNOWNS%procs;
\n+
\n+
\n+
\n+
\n+
528 end = (rank+1)*(n+1);
\n+
\n+
530 start = bigger + rank * n;
\n+
531 end = bigger + (rank + 1) * n;
\n+
\n+
\n+
\n+
\n+
536 overlapStart = start - 1;
\n+
\n+
538 overlapStart = start;
\n+
\n+
\n+
541 overlapEnd = end + 1;
\n+
\n+
\n+
\n+
545 assert((UNKNOWNS)*(overlapEnd-overlapStart)==aggregatesMap->
noVertices ());
\n+
546 for (
int j=0; j< UNKNOWNS; ++j)
\n+
547 for (
int i=0; i < UNKNOWNS; ++i)
\n+
\n+
549 if (i>=overlapStart && i<overlapEnd)
\n+
\n+
551 int no = (j/2)*((UNKNOWNS)/2)+i/2;
\n+
552 (*aggregatesMap)[j*(overlapEnd-overlapStart)+i-overlapStart]=no;
\n+
\n+
\n+
\n+
\n+
557 if (criterion.debugLevel()>1 && info->communicator().rank()==0)
\n+
558 std::cout<<
"aggregating finished." <<std::endl;
\n+
\n+
560 BIGINT gnoAggregates=noAggregates;
\n+
561 gnoAggregates = info->communicator().sum(gnoAggregates);
\n+
562 double dgnoAggregates = gnoAggregates.todouble();
\n+
\n+
564 BIGINT gnoAggregates=((UNKNOWNS)/2)*((UNKNOWNS)/2);
\n+
\n+
\n+
567 if (criterion.debugLevel()>2 && rank==0)
\n+
568 std::cout <<
"Building " <<dgnoAggregates<<
" aggregates took " <<watch.elapsed()<<
" seconds." <<std::endl;
\n+
\n+
570 if (dgnoAggregates==0 || dunknowns/dgnoAggregates<criterion.minCoarsenRate())
\n+
\n+
\n+
\n+
\n+
575 std::cerr <<
"Stopped coarsening because of rate breakdown " <<dunknowns<<
"/" <<dgnoAggregates
\n+
576 <<
"=" <<dunknowns/dgnoAggregates<<
"<" \n+
577 <<criterion.minCoarsenRate()<<std::endl;
\n+
\n+
579 std::cerr<<
"Could not build any aggregates. Probably no connected nodes." <<std::endl;
\n+
\n+
581 aggregatesMap->
free ();
\n+
582 delete aggregatesMap;
\n+
583 aggregatesMaps_.pop_back();
\n+
\n+
585 if (criterion.accumulate() && mlevel.isRedistributed() && info->communicator().size()>1) {
\n+
\n+
\n+
\n+
589 delete &(mlevel.getRedistributed().getmat());
\n+
590 mlevel.deleteRedistributed();
\n+
591 delete &(infoLevel.getRedistributed());
\n+
592 infoLevel.deleteRedistributed();
\n+
593 redistributes_.back().resetSetup();
\n+
\n+
\n+
\n+
\n+
598 unknowns = noAggregates;
\n+
599 dunknowns = dgnoAggregates;
\n+
\n+
601 CommunicationArgs commargs(info->communicator(),info->category());
\n+
602 parallelInformation_.addCoarser(commargs);
\n+
\n+
\n+
\n+
606 typename PropertyMapTypeSelector<VertexVisitedTag,PropertiesGraph>::Type visitedMap =
\n+
\n+
\n+
\n+
\n+
\n+
612 *(std::get<1>(graphs)),
\n+
\n+
\n+
\n+
\n+
617 criterion.useFixedOrder());
\n+
618 GraphCreator::free(graphs);
\n+
\n+
620 if (criterion.debugLevel()>2) {
\n+
\n+
622 std::cout<<
"Coarsening of index sets took " <<watch.elapsed()<<
" seconds." <<std::endl;
\n+
\n+
\n+
\n+
\n+
627 infoLevel->buildGlobalLookup(aggregates);
\n+
\n+
\n+
630 infoLevel->globalLookup());
\n+
\n+
\n+
633 if (criterion.debugLevel()>2) {
\n+
\n+
635 std::cout<<
"Communicating global aggregate numbers took " <<watch.elapsed()<<
" seconds." <<std::endl;
\n+
\n+
\n+
\n+
639 std::vector<bool>& visited=excluded;
\n+
\n+
641 typedef std::vector<bool>::iterator Iterator;
\n+
642 typedef IteratorPropertyMap<Iterator, IdentityMap> VisitedMap2;
\n+
643 Iterator end = visited.end();
\n+
644 for (Iterator iter= visited.begin(); iter != end; ++iter)
\n+
\n+
\n+
647 VisitedMap2 visitedMap2(visited.begin(), Dune::IdentityMap());
\n+
\n+
649 std::shared_ptr<typename MatrixOperator::matrix_type>
\n+
650 coarseMatrix(productBuilder.build(*(std::get<0>(graphs)), visitedMap2,
\n+
\n+
\n+
\n+
\n+
655 dverb<<
"Building of sparsity pattern took " <<watch.elapsed()<<std::endl;
\n+
\n+
657 info->freeGlobalLookup();
\n+
\n+
659 delete std::get<0>(graphs);
\n+
660 productBuilder.calculate(matrix->getmat(), *aggregatesMap, *coarseMatrix, *infoLevel, OverlapFlags());
\n+
\n+
662 if (criterion.debugLevel()>2) {
\n+
\n+
664 std::cout<<
"Calculation entries of Galerkin product took " <<watch.elapsed()<<
" seconds." <<std::endl;
\n+
\n+
\n+
\n+
668 allnonzeros = allnonzeros + infoLevel->communicator().sum(nonzeros);
\n+
669 MatrixArgs args(coarseMatrix, *infoLevel);
\n+
\n+
671 matrices_.addCoarser(args);
\n+
\n+
\n+
\n+
\n+
676 infoLevel->freeGlobalLookup();
\n+
\n+
\n+
\n+
680 aggregatesMaps_.push_back(aggregatesMap);
\n+
\n+
682 if (criterion.debugLevel()>0) {
\n+
683 if (level==criterion.maxLevel()) {
\n+
684 BIGINT unknownsLevel = mlevel->getmat().N();
\n+
685 unknownsLevel = infoLevel->communicator().sum(unknownsLevel);
\n+
686 if (rank==0 && criterion.debugLevel()>1) {
\n+
687 double dunknownsLevel = unknownsLevel.todouble();
\n+
688 std::cout<<
"Level " <<level<<
" has " <<dunknownsLevel<<
" unknowns, " <<dunknownsLevel/infoLevel->communicator().size()
\n+
689 <<
" unknowns per proc (procs=" <<infoLevel->communicator().size()<<
")" <<std::endl;
\n+
\n+
\n+
\n+
\n+
694 if (criterion.accumulate() && !redistributes_.back().isSetup() &&
\n+
695 infoLevel->communicator().size()>1) {
\n+
696 #if HAVE_MPI && !HAVE_PARMETIS \n+
\n+
698 infoLevel->communicator().rank()==0)
\n+
699 std::cerr<<
"Successive accumulation of data on coarse levels only works with ParMETIS installed." \n+
700 <<
" Fell back to accumulation to one domain on coarsest level" <<std::endl;
\n+
\n+
\n+
\n+
704 std::shared_ptr<Matrix> redistMat = std::make_shared<Matrix>();
\n+
705 std::shared_ptr<ParallelInformation> redistComm;
\n+
\n+
\n+
\n+
709 redistComm, redistributes_.back(), nodomains,criterion);
\n+
710 MatrixArgs args(redistMat, *redistComm);
\n+
711 BIGINT unknownsRedist = redistMat->N();
\n+
712 unknownsRedist = infoLevel->communicator().sum(unknownsRedist);
\n+
\n+
714 if (redistComm->communicator().rank()==0 && criterion.debugLevel()>1) {
\n+
715 double dunknownsRedist = unknownsRedist.todouble();
\n+
716 std::cout<<
"Level " <<level<<
" redistributed has " <<dunknownsRedist<<
" unknowns, " <<dunknownsRedist/redistComm->communicator().size()
\n+
717 <<
" unknowns per proc (procs=" <<redistComm->communicator().size()<<
")" <<std::endl;
\n+
\n+
\n+
720 infoLevel.addRedistributed(redistComm);
\n+
721 infoLevel->freeGlobalLookup();
\n+
\n+
\n+
724 int levels = matrices_.levels();
\n+
725 maxlevels_ = parallelInformation_.finest()->communicator().max(levels);
\n+
726 assert(matrices_.levels()==redistributes_.size());
\n+
727 if (hasCoarsest() && rank==0 && criterion.debugLevel()>1)
\n+
728 std::cout<<
"operator complexity: " <<allnonzeros.todouble()/finenonzeros.todouble()<<std::endl;
\n+
\n+
\n+
\n+
\n+
732 template <
class M,
class IS,
class A>
\n+
\n+
\n+
\n+
739 template <
class M,
class IS,
class A>
\n+
\n+
\n+
\n+
\n+
743 return parallelInformation_;
\n+
\n+
\n+
\n+
746 template <
class M,
class IS,
class A>
\n+
\n+
\n+
\n+
749 int levels=aggregatesMaps().size();
\n+
750 int maxlevels=parallelInformation_.
finest ()->communicator().max(levels);
\n+
751 std::size_t size=(*(aggregatesMaps().begin()))->noVertices();
\n+
\n+
753 std::vector<std::size_t> tmp;
\n+
754 std::vector<std::size_t> *coarse, *fine;
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
771 if (levels==maxlevels) {
\n+
772 const AggregatesMap & map = *(*(++aggregatesMaps().rbegin()));
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
781 srand((
unsigned )std::clock());
\n+
782 std::set<size_t> used;
\n+
783 for (
typename std::vector<std::size_t>::iterator iter=coarse->begin(); iter != coarse->end();
\n+
\n+
\n+
786 std::pair<std::set<std::size_t>::iterator,
bool > ibpair
\n+
787 = used.insert(
static_cast< std::size_t
> ((((
double )rand())/(RAND_MAX+1.0)))*coarse->size());
\n+
\n+
789 while (!ibpair.second)
\n+
790 ibpair = used.insert(
static_cast< std::size_t
> ((((
double )rand())/(RAND_MAX+1.0))*coarse->size()));
\n+
791 *iter=*(ibpair.first);
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
799 for (
typename AggregatesMapList::const_reverse_iterator aggregates=++aggregatesMaps().rbegin();
\n+
800 aggregates != aggregatesMaps().rend(); ++aggregates,--levels) {
\n+
\n+
802 fine->resize((*aggregates)->noVertices());
\n+
803 fine->assign(fine->size(), 0);
\n+
\n+
805 ::prolongateVector(*(*aggregates), *coarse, *fine,
static_cast< std::size_t
> (1), *pinfo);
\n+
\n+
807 std::swap(coarse, fine);
\n+
\n+
\n+
\n+
811 assert(coarse==&data);
\n+
\n+
\n+
\n+
814 template <
class M,
class IS,
class A>
\n+
\n+
\n+
\n+
\n+
818 return aggregatesMaps_;
\n+
\n+
\n+
820 template <
class M,
class IS,
class A>
\n+
\n+
\n+
\n+
\n+
824 return redistributes_;
\n+
\n+
\n+
\n+
827 template <
class M,
class IS,
class A>
\n+
\n+
\n+
\n+
830 typedef typename AggregatesMapList::reverse_iterator AggregatesMapIterator;
\n+
\n+
\n+
\n+
834 AggregatesMapIterator amap = aggregatesMaps_.rbegin();
\n+
835 InfoIterator info = parallelInformation_.coarsest();
\n+
836 for (Iterator level=matrices_.coarsest(), finest=matrices_.finest(); level != finest; --level, --info, ++amap) {
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
843 template <
class M,
class IS,
class A>
\n+
844 template <
class V,
class BA,
class TA>
\n+
\n+
\n+
\n+
847 assert(hierarchy.levels()==1);
\n+
\n+
849 typedef typename RedistributeInfoList::const_iterator RIter;
\n+
850 RIter redist = redistributes_.begin();
\n+
\n+
852 Iterator matrix = matrices_.finest(), coarsest = matrices_.coarsest();
\n+
\n+
854 if (redist->isSetup())
\n+
855 hierarchy.addRedistributedOnCoarsest(matrix.getRedistributed().getmat().N());
\n+
856 Dune::dvverb<<
"Level " <<level<<
" has " <<matrices_.finest()->getmat().N()<<
" unknowns!" <<std::endl;
\n+
\n+
858 while (matrix != coarsest) {
\n+
859 ++matrix; ++level; ++redist;
\n+
860 Dune::dvverb<<
"Level " <<level<<
" has " <<matrix->getmat().N()<<
" unknowns!" <<std::endl;
\n+
\n+
862 hierarchy.addCoarser(matrix->getmat().N());
\n+
863 if (redist->isSetup())
\n+
864 hierarchy.addRedistributedOnCoarsest(matrix.getRedistributed().getmat().N());
\n+
\n+
\n+
\n+
\n+
\n+
\n+
870 template <
class M,
class IS,
class A>
\n+
871 template <
class S,
class TA>
\n+
\n+
\n+
\n+
\n+
875 assert(smoothers.
levels ()==0);
\n+
\n+
\n+
878 typedef typename AggregatesMapList::const_iterator AggregatesIterator;
\n+
\n+
\n+
881 cargs.setArgs(sargs);
\n+
882 PinfoIterator pinfo = parallelInformation_.finest();
\n+
883 AggregatesIterator aggregates = aggregatesMaps_.begin();
\n+
\n+
885 for (MatrixIterator matrix = matrices_.finest(), coarsest = matrices_.coarsest();
\n+
886 matrix != coarsest; ++matrix, ++pinfo, ++aggregates, ++level) {
\n+
887 cargs.setMatrix(matrix->getmat(), **aggregates);
\n+
888 cargs.setComm(*pinfo);
\n+
\n+
\n+
891 if (maxlevels()>levels()) {
\n+
\n+
893 cargs.setMatrix(matrices_.coarsest()->getmat(), **aggregates);
\n+
894 cargs.setComm(*pinfo);
\n+
\n+
\n+
\n+
\n+
\n+
\n+
900 template <
class M,
class IS,
class A>
\n+
\n+
\n+
\n+
\n+
904 typedef typename AggregatesMapList::iterator AggregatesMapIterator;
\n+
\n+
\n+
\n+
908 AggregatesMapIterator amap = aggregatesMaps_.begin();
\n+
\n+
910 InfoIterator info = parallelInformation_.finest();
\n+
911 typename RedistributeInfoList::iterator riIter = redistributes_.begin();
\n+
912 Iterator level = matrices_.finest(), coarsest=matrices_.coarsest();
\n+
913 if (level.isRedistributed()) {
\n+
914 info->buildGlobalLookup(level->getmat().N());
\n+
\n+
916 const_cast< Matrix &
> (level.getRedistributed().getmat()),
\n+
917 *info,info.getRedistributed(), *riIter);
\n+
918 info->freeGlobalLookup();
\n+
\n+
\n+
921 for (; level!=coarsest; ++amap) {
\n+
922 const Matrix & fine = (level.isRedistributed() ? level.getRedistributed() : *level).getmat();
\n+
\n+
\n+
\n+
926 productBuilder.
calculate (fine, *(*amap),
const_cast< Matrix &
> (level->getmat()), *info, copyFlags);
\n+
927 if (level.isRedistributed()) {
\n+
928 info->buildGlobalLookup(level->getmat().N());
\n+
\n+
930 const_cast< Matrix &
> (level.getRedistributed().getmat()), *info,
\n+
931 info.getRedistributed(), *riIter);
\n+
932 info->freeGlobalLookup();
\n+
\n+
\n+
\n+
\n+
\n+
937 template <
class M,
class IS,
class A>
\n+
\n+
\n+
\n+
940 return matrices_.levels();
\n+
\n+
\n+
\n+
943 template <
class M,
class IS,
class A>
\n+
\n+
\n+
949 template <
class M,
class IS,
class A>
\n+
\n+
\n+
\n+
952 return levels()==maxlevels() &&
\n+
953 (!matrices_.coarsest().isRedistributed() ||matrices_.coarsest()->getmat().N()>0);
\n+
\n+
\n+
\n+
956 template <
class M,
class IS,
class A>
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
Provides a classes representing the hierarchies in AMG.
\n+
Classes for the generic construction and application of the smoothers.
\n+
Prolongation and restriction for amg.
\n+
Provdes class for identifying aggregates globally.
\n+
Provides a class for building the galerkin product based on a aggregation scheme.
\n+
Provides classes for initializing the link attributes of a matrix graph.
\n+
Provides a class for building the index set and remote indices on the coarse level.
\n+
Helper classes for the construction of classes without empty constructor.
\n+
Provides classes for the Coloring process of AMG.
\n+
\n+
Provides classes for building the matrix graph.
\n+
Some handy generic functions for ISTL matrices.
\n+
This file implements a vector space as a tensor product of a given vector space. The number of compon...
\n+
Functionality for redistributing a sparse matrix.
\n+
auto countNonZeros(const M &, typename std::enable_if_t< Dune::IsNumber< M >::value > *sfinae=nullptr)
Get the number of nonzero fields in the matrix.
Definition matrixutils.hh:119
\n+
const AggregatesMapList & aggregatesMaps() const
Get the hierarchy of the mappings of the nodes onto aggregates.
Definition matrixhierarchy.hh:816
\n+
bool isBuilt() const
Whether the hierarchy was built.
Definition matrixhierarchy.hh:957
\n+
bool hasCoarsest() const
Definition matrixhierarchy.hh:950
\n+
std::size_t levels() const
Get the number of levels in the hierarchy.
Definition hierarchy.hh:322
\n+
std::size_t levels() const
Get the number of levels in the hierarchy.
Definition matrixhierarchy.hh:938
\n+
void addCoarser(Arguments &args)
Add an element on a coarser level.
Definition hierarchy.hh:334
\n+
const RedistributeInfoList & redistributeInformation() const
Get the hierarchy of the information about redistributions,.
Definition matrixhierarchy.hh:822
\n+
const ParallelInformationHierarchy & parallelInformation() const
Get the hierarchy of the parallel data distribution information.
Definition matrixhierarchy.hh:741
\n+
bool repartitionAndDistributeMatrix(const M &origMatrix, std::shared_ptr< M > newMatrix, SequentialInformation &origComm, std::shared_ptr< SequentialInformation > &newComm, RedistributeInformation< SequentialInformation > &ri, int nparts, C1 &criterion)
Definition matrixhierarchy.hh:316
\n+
const_iterator begin() const
Definition aggregates.hh:725
\n+
const ParallelMatrixHierarchy & matrices() const
Get the matrix hierarchy.
Definition matrixhierarchy.hh:734
\n+
std::size_t maxlevels() const
Get the max number of levels in the hierarchy of processors.
Definition matrixhierarchy.hh:944
\n+
const_iterator end() const
Definition aggregates.hh:730
\n+
static const V ISOLATED
Identifier of isolated vertices.
Definition aggregates.hh:571
\n+
void recalculateGalerkin(const F ©Flags)
Recalculate the galerkin products.
Definition matrixhierarchy.hh:902
\n+
const void * Arguments
A type holding all the arguments needed to call the constructor.
Definition construction.hh:44
\n+
std::size_t noVertices() const
Get the number of vertices.
\n+
static std::shared_ptr< T > construct(Arguments &args)
Construct an object with the specified arguments.
Definition construction.hh:52
\n+
void coarsenVector(Hierarchy< BlockVector< V, BA >, TA > &hierarchy) const
Coarsen the vector hierarchy according to the matrix hierarchy.
Definition matrixhierarchy.hh:845
\n+
const AggregateDescriptor * const_iterator
Definition aggregates.hh:723
\n+
MatrixHierarchy(std::shared_ptr< MatrixOperator > fineMatrix, std::shared_ptr< ParallelInformation > pinfo=std::make_shared< ParallelInformation >())
Constructor.
Definition matrixhierarchy.hh:392
\n+
AccumulationMode
Identifiers for the different accumulation modes.
Definition parameters.hh:231
\n+
Iterator finest()
Get an iterator positioned at the finest level.
Definition hierarchy.hh:377
\n+
void build(const T &criterion)
Build the matrix hierarchy using aggregation.
Definition matrixhierarchy.hh:403
\n+
void free()
Free the allocated memory.
\n+
void coarsenSmoother(Hierarchy< S, TA > &smoothers, const typename SmootherTraits< S >::Arguments &args) const
Coarsen the smoother hierarchy according to the matrix hierarchy.
Definition matrixhierarchy.hh:872
\n+
void buildDependency(G &graph, const typename C::Matrix &matrix, C criterion, bool finestLevel)
Build the dependency of the matrix graph.
\n+
std::tuple< int, int, int, int > buildAggregates(const M &matrix, G &graph, const C &criterion, bool finestLevel)
Build the aggregates.
\n+
void calculate(const M &fine, const AggregatesMap< V > &aggregates, M &coarse, const I &pinfo, const O ©)
Calculate the galerkin product.
\n+
void getCoarsestAggregatesOnFinest(std::vector< std::size_t > &data) const
Get the mapping of fine level unknowns to coarse level aggregates.
Definition matrixhierarchy.hh:747
\n+
~MatrixHierarchy()
Definition matrixhierarchy.hh:828
\n+
@ MAX_PROCESSES
Hard limit for the number of processes allowed.
Definition matrixhierarchy.hh:50
\n+
@ atOnceAccu
Accumulate data to one process at once.
Definition parameters.hh:243
\n+
@ successiveAccu
Successively accumulate to fewer processes.
Definition parameters.hh:247
\n
Definition allocator.hh:11
\n-
A sparse block matrix with compressed row storage.
Definition bcrsmatrix.hh:466
\n-
void endrowsizes()
indicate that size of all rows is defined
Definition bcrsmatrix.hh:1146
\n-
@ random
Build entries randomly.
Definition bcrsmatrix.hh:526
\n-
void endindices()
indicate that all indices are defined, check consistency
Definition bcrsmatrix.hh:1269
\n-
size_type N() const
number of rows (counted in blocks)
Definition bcrsmatrix.hh:2001
\n-
void setSize(size_type rows, size_type columns, size_type nnz=0)
Set the size of the matrix.
Definition bcrsmatrix.hh:858
\n-
BCRSMatrix & operator=(const BCRSMatrix &Mat)
assignment
Definition bcrsmatrix.hh:908
\n-
A block-diagonal matrix.
Definition bdmatrix.hh:33
\n-
typename Imp::BlockTraits< B >::field_type field_type
export the type representing the field
Definition bdmatrix.hh:39
\n-
A::size_type size_type
implement row_type with compressed vector
Definition bdmatrix.hh:51
\n-
BDMatrix()
Default constructor.
Definition bdmatrix.hh:54
\n-
BDMatrix(std::initializer_list< B > const &list)
Construct from a std::initializer_list.
Definition bdmatrix.hh:72
\n-
B block_type
export the type representing the components
Definition bdmatrix.hh:42
\n-
void solve(V &x, const V &rhs) const
Solve the system Ax=b in O(n) time.
Definition bdmatrix.hh:116
\n-
A allocator_type
export the allocator type
Definition bdmatrix.hh:45
\n-
BDMatrix(int size)
Definition bdmatrix.hh:56
\n-
BDMatrix & operator=(const BDMatrix &other)
assignment
Definition bdmatrix.hh:99
\n-
void setSize(size_type size)
Resize the matrix. Invalidates the content!
Definition bdmatrix.hh:81
\n-
void invert()
Inverts the matrix.
Definition bdmatrix.hh:126
\n-
typename BDMatrix< B, A >::field_type field_type
Definition bdmatrix.hh:150
\n-
typename FieldTraits< field_type >::real_type real_type
Definition bdmatrix.hh:151
\n+
void printGlobalSparseMatrix(const M &mat, C &ooc, std::ostream &os)
Definition matrixutils.hh:154
\n+
PropertyMapTypeSelector< Amg::VertexVisitedTag, Amg::PropertiesGraph< G, Amg::VertexProperties, EP, VM, EM > >::Type get(const Amg::VertexVisitedTag &tag, Amg::PropertiesGraph< G, Amg::VertexProperties, EP, VM, EM > &graph)
Definition dependency.hh:293
\n+
void redistributeMatrixEntries(M &origMatrix, M &newMatrix, C &origComm, C &newComm, RedistributeInformation< C > &ri)
Definition matrixredistribute.hh:757
\n+
bool commGraphRepartition(const M &mat, Dune::OwnerOverlapCopyCommunication< T1, T2 > &oocomm, Metis::idx_t nparts, std::shared_ptr< Dune::OwnerOverlapCopyCommunication< T1, T2 > > &outcomm, RedistributeInterface &redistInf, bool verbose=false)
Definition repartition.hh:822
\n+
void redistributeMatrix(M &origMatrix, M &newMatrix, C &origComm, C &newComm, RedistributeInformation< C > &ri)
Redistribute a matrix according to given domain decompositions.
Definition matrixredistribute.hh:820
\n+
bool graphRepartition(const G &graph, Dune::OwnerOverlapCopyCommunication< T1, T2 > &oocomm, Metis::idx_t nparts, std::shared_ptr< Dune::OwnerOverlapCopyCommunication< T1, T2 > > &outcomm, RedistributeInterface &redistInf, bool verbose=false)
execute a graph repartition for a giving graph and indexset.
Definition repartition.hh:1228
\n+
A vector of blocks with memory management.
Definition bvector.hh:392
\n+
derive error class from the base class in common
Definition istlexception.hh:19
\n+
A generic dynamic dense matrix.
Definition matrix.hh:561
\n+
A::size_type size_type
Type for indices and sizes.
Definition matrix.hh:577
\n+
MatrixImp::DenseMatrixBase< T, A >::window_type row_type
The type implementing a matrix row.
Definition matrix.hh:574
\n+
Definition matrixredistribute.hh:22
\n+
Class providing information about the mapping of the vertices onto aggregates.
Definition aggregates.hh:560
\n+
Class representing the properties of an edge in the matrix graph.
Definition dependency.hh:39
\n+
Class representing a node in the matrix graph.
Definition dependency.hh:126
\n+
Definition galerkin.hh:99
\n+
Definition galerkin.hh:118
\n+
Definition globalaggregates.hh:131
\n+
The (undirected) graph of a matrix.
Definition graph.hh:51
\n+
Attaches properties to the edges and vertices of a graph.
Definition graph.hh:978
\n+
Graph::VertexDescriptor VertexDescriptor
The vertex descriptor.
Definition graph.hh:988
\n+
Definition graphcreator.hh:22
\n+
A hierarchy of containers (e.g. matrices or vectors)
Definition hierarchy.hh:40
\n+
LevelIterator< Hierarchy< MatrixOperator, Allocator >, MatrixOperator > Iterator
Type of the mutable iterator.
Definition hierarchy.hh:216
\n+
LevelIterator< const Hierarchy< MatrixOperator, Allocator >, const MatrixOperator > ConstIterator
Type of the const iterator.
Definition hierarchy.hh:219
\n+
Definition indicescoarsener.hh:36
\n+
The hierarchies build by the coarsening process.
Definition matrixhierarchy.hh:61
\n+
typename std::allocator_traits< Allocator >::template rebind_alloc< AggregatesMap * > AAllocator
Allocator for pointers.
Definition matrixhierarchy.hh:85
\n+
Dune::Amg::Hierarchy< ParallelInformation, Allocator > ParallelInformationHierarchy
The type of the parallel informarion hierarchy.
Definition matrixhierarchy.hh:82
\n+
std::list< AggregatesMap *, AAllocator > AggregatesMapList
The type of the aggregates maps list.
Definition matrixhierarchy.hh:88
\n+
PI ParallelInformation
The type of the index set.
Definition matrixhierarchy.hh:70
\n+
Dune::Amg::Hierarchy< MatrixOperator, Allocator > ParallelMatrixHierarchy
The type of the parallel matrix hierarchy.
Definition matrixhierarchy.hh:79
\n+
A Allocator
The allocator to use.
Definition matrixhierarchy.hh:73
\n+
RedistributeInformation< ParallelInformation > RedistributeInfoType
The type of the redistribute information.
Definition matrixhierarchy.hh:91
\n+
double getProlongationDampingFactor() const
Definition matrixhierarchy.hh:188
\n+
typename std::allocator_traits< Allocator >::template rebind_alloc< RedistributeInfoType > RILAllocator
Allocator for RedistributeInfoType.
Definition matrixhierarchy.hh:94
\n+
std::list< RedistributeInfoType, RILAllocator > RedistributeInfoList
The type of the list of redistribute information.
Definition matrixhierarchy.hh:97
\n+
Dune::Amg::AggregatesMap< typename MatrixGraph< Matrix >::VertexDescriptor > AggregatesMap
The type of the aggregates map we use.
Definition matrixhierarchy.hh:76
\n+
MatrixOperator::matrix_type Matrix
The type of the matrix.
Definition matrixhierarchy.hh:67
\n+
M MatrixOperator
The type of the matrix operator.
Definition matrixhierarchy.hh:64
\n+
void operator()(const matrix_row &row)
Definition matrixhierarchy.hh:254
\n+
Matrix::row_type matrix_row
Definition matrixhierarchy.hh:245
\n+
size_type min
Definition matrixhierarchy.hh:261
\n+
calc()
Definition matrixhierarchy.hh:247
\n+
size_type max
Definition matrixhierarchy.hh:262
\n+
size_type sum
Definition matrixhierarchy.hh:263
\n+
Matrix::size_type size_type
Definition matrixhierarchy.hh:244
\n+
The criterion describing the stop criteria for the coarsening process.
Definition matrixhierarchy.hh:283
\n+
CoarsenCriterion(const Dune::Amg::Parameters &parms)
Definition matrixhierarchy.hh:309
\n+
T AggregationCriterion
The criterion for tagging connections as strong and nodes as isolated. This might be e....
Definition matrixhierarchy.hh:289
\n+
CoarsenCriterion(int maxLevel=100, int coarsenTarget=1000, double minCoarsenRate=1.2, double prolongDamp=1.6, AccumulationMode accumulate=successiveAccu, bool useFixedOrder=false)
Constructor.
Definition matrixhierarchy.hh:304
\n+
All parameters for AMG.
Definition parameters.hh:416
\n+
\n+
Tag idnetifying the visited property of a vertex.
Definition properties.hh:29
\n+
The default class for the smoother arguments.
Definition smoother.hh:38
\n+
Definition transfer.hh:32
\n+
static Category category(const OP &op, decltype(op.category()) *=nullptr)
Helperfunction to extract the solver category either from an enum, or from the newly introduced virtu...
Definition solvercategory.hh:34
\n
\n-9\n-10#include \n-11#include \n-12\n-13#include <_\bd_\bu_\bn_\be_\b/_\bi_\bs_\bt_\bl_\b/_\bb_\bc_\br_\bs_\bm_\ba_\bt_\br_\bi_\bx_\b._\bh_\bh>\n-14#include <_\bd_\bu_\bn_\be_\b/_\bi_\bs_\bt_\bl_\b/_\bb_\bl_\bo_\bc_\bk_\bl_\be_\bv_\be_\bl_\b._\bh_\bh>\n-15\n-21namespace _\bD_\bu_\bn_\be {\n-31 template >\n-_\b3_\b2 class _\bB_\bD_\bM_\ba_\bt_\br_\bi_\bx : public _\bB_\bC_\bR_\bS_\bM_\ba_\bt_\br_\bi_\bx\n-33 {\n-34 public:\n-35\n-36 //===== type definitions and constants\n-37\n-_\b3_\b9 using _\bf_\bi_\be_\bl_\bd_\b__\bt_\by_\bp_\be = typename Imp::BlockTraits::field_type;\n-40\n-_\b4_\b2 typedef B _\bb_\bl_\bo_\bc_\bk_\b__\bt_\by_\bp_\be;\n-43\n-_\b4_\b5 typedef A _\ba_\bl_\bl_\bo_\bc_\ba_\bt_\bo_\br_\b__\bt_\by_\bp_\be;\n-46\n-48 //typedef BCRSMatrix::row_type row_type;\n-49\n-_\b5_\b1 typedef typename A::size_type _\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be;\n+8#include \n+9#include \n+10#include \"_\ba_\bg_\bg_\br_\be_\bg_\ba_\bt_\be_\bs_\b._\bh_\bh\"\n+11#include \"_\bg_\br_\ba_\bp_\bh_\b._\bh_\bh\"\n+12#include \"_\bg_\ba_\bl_\be_\br_\bk_\bi_\bn_\b._\bh_\bh\"\n+13#include \"_\br_\be_\bn_\bu_\bm_\bb_\be_\br_\be_\br_\b._\bh_\bh\"\n+14#include \"_\bg_\br_\ba_\bp_\bh_\bc_\br_\be_\ba_\bt_\bo_\br_\b._\bh_\bh\"\n+15#include \"_\bh_\bi_\be_\br_\ba_\br_\bc_\bh_\by_\b._\bh_\bh\"\n+16#include <_\bd_\bu_\bn_\be_\b/_\bi_\bs_\bt_\bl_\b/_\bb_\bv_\be_\bc_\bt_\bo_\br_\b._\bh_\bh>\n+17#include \n+18#include <_\bd_\bu_\bn_\be_\b/_\bi_\bs_\bt_\bl_\b/_\bm_\ba_\bt_\br_\bi_\bx_\bu_\bt_\bi_\bl_\bs_\b._\bh_\bh>\n+19#include <_\bd_\bu_\bn_\be_\b/_\bi_\bs_\bt_\bl_\b/_\bm_\ba_\bt_\br_\bi_\bx_\br_\be_\bd_\bi_\bs_\bt_\br_\bi_\bb_\bu_\bt_\be_\b._\bh_\bh>\n+20#include <_\bd_\bu_\bn_\be_\b/_\bi_\bs_\bt_\bl_\b/_\bp_\ba_\ba_\bm_\bg_\b/_\bd_\be_\bp_\be_\bn_\bd_\be_\bn_\bc_\by_\b._\bh_\bh>\n+21#include <_\bd_\bu_\bn_\be_\b/_\bi_\bs_\bt_\bl_\b/_\bp_\ba_\ba_\bm_\bg_\b/_\bg_\br_\ba_\bp_\bh_\b._\bh_\bh>\n+22#include <_\bd_\bu_\bn_\be_\b/_\bi_\bs_\bt_\bl_\b/_\bp_\ba_\ba_\bm_\bg_\b/_\bi_\bn_\bd_\bi_\bc_\be_\bs_\bc_\bo_\ba_\br_\bs_\be_\bn_\be_\br_\b._\bh_\bh>\n+23#include <_\bd_\bu_\bn_\be_\b/_\bi_\bs_\bt_\bl_\b/_\bp_\ba_\ba_\bm_\bg_\b/_\bg_\bl_\bo_\bb_\ba_\bl_\ba_\bg_\bg_\br_\be_\bg_\ba_\bt_\be_\bs_\b._\bh_\bh>\n+24#include <_\bd_\bu_\bn_\be_\b/_\bi_\bs_\bt_\bl_\b/_\bp_\ba_\ba_\bm_\bg_\b/_\bc_\bo_\bn_\bs_\bt_\br_\bu_\bc_\bt_\bi_\bo_\bn_\b._\bh_\bh>\n+25#include <_\bd_\bu_\bn_\be_\b/_\bi_\bs_\bt_\bl_\b/_\bp_\ba_\ba_\bm_\bg_\b/_\bs_\bm_\bo_\bo_\bt_\bh_\be_\br_\b._\bh_\bh>\n+26#include <_\bd_\bu_\bn_\be_\b/_\bi_\bs_\bt_\bl_\b/_\bp_\ba_\ba_\bm_\bg_\b/_\bt_\br_\ba_\bn_\bs_\bf_\be_\br_\b._\bh_\bh>\n+27\n+28namespace _\bD_\bu_\bn_\be\n+29{\n+30 namespace Amg\n+31 {\n+42 enum {\n+50 _\bM_\bA_\bX_\b__\bP_\bR_\bO_\bC_\bE_\bS_\bS_\bE_\bS = 72000\n+_\b5_\b1 };\n 52\n-_\b5_\b4 _\bB_\bD_\bM_\ba_\bt_\br_\bi_\bx() : _\bB_\bC_\bR_\bS_\bM_\ba_\bt_\br_\bi_\bx() {}\n-55\n-_\b5_\b6 explicit _\bB_\bD_\bM_\ba_\bt_\br_\bi_\bx(int size)\n-57 : _\bB_\bC_\bR_\bS_\bM_\ba_\bt_\br_\bi_\bx(size, size, _\bB_\bC_\bR_\bS_\bM_\ba_\bt_\br_\bi_\bx::_\br_\ba_\bn_\bd_\bo_\bm) {\n-58\n-59 for (int i=0; i_\bB_\bC_\bR_\bS_\bM_\ba_\bt_\br_\bi_\bx_\b<_\bB_\b,_\bA_\b>_\b:_\b:_\bs_\be_\bt_\br_\bo_\bw_\bs_\bi_\bz_\be(i, 1);\n-61\n-62 this->_\bB_\bC_\bR_\bS_\bM_\ba_\bt_\br_\bi_\bx_\b<_\bB_\b,_\bA_\b>_\b:_\b:_\be_\bn_\bd_\br_\bo_\bw_\bs_\bi_\bz_\be_\bs();\n-63\n-64 for (int i=0; i_\bB_\bC_\bR_\bS_\bM_\ba_\bt_\br_\bi_\bx_\b<_\bB_\b,_\bA_\b>_\b:_\b:_\ba_\bd_\bd_\bi_\bn_\bd_\be_\bx(i, i);\n-66\n-67 this->_\bB_\bC_\bR_\bS_\bM_\ba_\bt_\br_\bi_\bx_\b<_\bB_\b,_\bA_\b>_\b:_\b:_\be_\bn_\bd_\bi_\bn_\bd_\bi_\bc_\be_\bs();\n+59 template >\n+_\b6_\b0 class _\bM_\ba_\bt_\br_\bi_\bx_\bH_\bi_\be_\br_\ba_\br_\bc_\bh_\by\n+61 {\n+62 public:\n+_\b6_\b4 typedef M _\bM_\ba_\bt_\br_\bi_\bx_\bO_\bp_\be_\br_\ba_\bt_\bo_\br;\n+65\n+_\b6_\b7 typedef typename MatrixOperator::matrix_type _\bM_\ba_\bt_\br_\bi_\bx;\n 68\n-69 }\n-70\n-_\b7_\b2 _\bB_\bD_\bM_\ba_\bt_\br_\bi_\bx (std::initializer_list const &list)\n-73 : _\bB_\bD_\bM_\ba_\bt_\br_\bi_\bx(list.size())\n-74 {\n-75 size_t i=0;\n-76 for (auto it = list.begin(); it != list.end(); ++it, ++i)\n-77 (*this)[i][i] = *it;\n-78 }\n-79\n-_\b8_\b1 void _\bs_\be_\bt_\bS_\bi_\bz_\be(_\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be size)\n-82 {\n-83 this->_\bB_\bC_\bR_\bS_\bM_\ba_\bt_\br_\bi_\bx_\b<_\bB_\b,_\bA_\b>_\b:_\b:_\bs_\be_\bt_\bS_\bi_\bz_\be(size, // rows\n-84 size, // columns\n-85 size); // nonzeros\n+_\b7_\b0 typedef PI _\bP_\ba_\br_\ba_\bl_\bl_\be_\bl_\bI_\bn_\bf_\bo_\br_\bm_\ba_\bt_\bi_\bo_\bn;\n+71\n+_\b7_\b3 typedef A _\bA_\bl_\bl_\bo_\bc_\ba_\bt_\bo_\br;\n+74\n+_\b7_\b6 typedef _\bD_\bu_\bn_\be_\b:_\b:_\bA_\bm_\bg_\b:_\b:_\bA_\bg_\bg_\br_\be_\bg_\ba_\bt_\be_\bs_\bM_\ba_\bp_\b<_\bt_\by_\bp_\be_\bn_\ba_\bm_\be_\b _\bM_\ba_\bt_\br_\bi_\bx_\bG_\br_\ba_\bp_\bh_\b<_\bM_\ba_\bt_\br_\bi_\bx_\b>_\b:_\b:\n+_\bV_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br> _\bA_\bg_\bg_\br_\be_\bg_\ba_\bt_\be_\bs_\bM_\ba_\bp;\n+77\n+_\b7_\b9 typedef _\bD_\bu_\bn_\be_\b:_\b:_\bA_\bm_\bg_\b:_\b:_\bH_\bi_\be_\br_\ba_\br_\bc_\bh_\by_\b<_\bM_\ba_\bt_\br_\bi_\bx_\bO_\bp_\be_\br_\ba_\bt_\bo_\br_\b,_\bA_\bl_\bl_\bo_\bc_\ba_\bt_\bo_\br_\b>\n+_\bP_\ba_\br_\ba_\bl_\bl_\be_\bl_\bM_\ba_\bt_\br_\bi_\bx_\bH_\bi_\be_\br_\ba_\br_\bc_\bh_\by;\n+80\n+_\b8_\b2 typedef _\bD_\bu_\bn_\be_\b:_\b:_\bA_\bm_\bg_\b:_\b:_\bH_\bi_\be_\br_\ba_\br_\bc_\bh_\by_\b<_\bP_\ba_\br_\ba_\bl_\bl_\be_\bl_\bI_\bn_\bf_\bo_\br_\bm_\ba_\bt_\bi_\bo_\bn_\b,_\bA_\bl_\bl_\bo_\bc_\ba_\bt_\bo_\br_\b>\n+_\bP_\ba_\br_\ba_\bl_\bl_\be_\bl_\bI_\bn_\bf_\bo_\br_\bm_\ba_\bt_\bi_\bo_\bn_\bH_\bi_\be_\br_\ba_\br_\bc_\bh_\by;\n+83\n+_\b8_\b5 using _\bA_\bA_\bl_\bl_\bo_\bc_\ba_\bt_\bo_\br = typename std::allocator_traits::template\n+rebind_alloc;\n 86\n-87 for (auto i : range(size))\n-88 this->_\bB_\bC_\bR_\bS_\bM_\ba_\bt_\br_\bi_\bx_\b<_\bB_\b,_\bA_\b>_\b:_\b:_\bs_\be_\bt_\br_\bo_\bw_\bs_\bi_\bz_\be(i, 1);\n+_\b8_\b8 typedef std::list _\bA_\bg_\bg_\br_\be_\bg_\ba_\bt_\be_\bs_\bM_\ba_\bp_\bL_\bi_\bs_\bt;\n 89\n-90 this->_\bB_\bC_\bR_\bS_\bM_\ba_\bt_\br_\bi_\bx_\b<_\bB_\b,_\bA_\b>_\b:_\b:_\be_\bn_\bd_\br_\bo_\bw_\bs_\bi_\bz_\be_\bs();\n-91\n-92 for (auto i : range(size))\n-93 this->_\bB_\bC_\bR_\bS_\bM_\ba_\bt_\br_\bi_\bx_\b<_\bB_\b,_\bA_\b>_\b:_\b:_\ba_\bd_\bd_\bi_\bn_\bd_\be_\bx(i, i);\n-94\n-95 this->_\bB_\bC_\bR_\bS_\bM_\ba_\bt_\br_\bi_\bx_\b<_\bB_\b,_\bA_\b>_\b:_\b:_\be_\bn_\bd_\bi_\bn_\bd_\bi_\bc_\be_\bs();\n-96 }\n-97\n-_\b9_\b9 _\bB_\bD_\bM_\ba_\bt_\br_\bi_\bx& _\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b=_\b (const _\bB_\bD_\bM_\ba_\bt_\br_\bi_\bx& other) {\n-100 this->_\bB_\bC_\bR_\bS_\bM_\ba_\bt_\br_\bi_\bx_\b<_\bB_\b,_\bA_\b>_\b:_\b:_\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b=(other);\n-101 return *this;\n-102 }\n-103\n-_\b1_\b0_\b5 _\bB_\bD_\bM_\ba_\bt_\br_\bi_\bx& _\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b=_\b (const _\bf_\bi_\be_\bl_\bd_\b__\bt_\by_\bp_\be& k) {\n-106 this->_\bB_\bC_\bR_\bS_\bM_\ba_\bt_\br_\bi_\bx_\b<_\bB_\b,_\bA_\b>_\b:_\b:_\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b=(k);\n-107 return *this;\n-108 }\n-109\n-115 template \n-_\b1_\b1_\b6 void _\bs_\bo_\bl_\bv_\be (V& x, const V& rhs) const {\n-117 for (_\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be i=0; i_\bN(); i++)\n-118 {\n-119 auto&& xv = Impl::asVector(x[i]);\n-120 auto&& rhsv = Impl::asVector(rhs[i]);\n-121 Impl::asMatrix((*this)[i][i]).solve(xv,rhsv);\n-122 }\n-123 }\n-124\n-_\b1_\b2_\b6 void _\bi_\bn_\bv_\be_\br_\bt() {\n-127 for (_\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be i=0; i_\bN(); i++)\n-128 Impl::asMatrix((*this)[i][i])._\bi_\bn_\bv_\be_\br_\bt();\n-129 }\n-130\n-131 private:\n-132\n-133 // ////////////////////////////////////////////////////////////////////////\n-////\n-134 // The following methods from the base class should now actually be called\n-135 // ////////////////////////////////////////////////////////////////////////\n-////\n-136\n-137 // createbegin and createend should be in there, too, but I can't get it to\n-compile\n-138 // BCRSMatrix::CreateIterator createbegin () {}\n-139 // BCRSMatrix::CreateIterator createend () {}\n-140 void setrowsize (_\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be i, _\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be s) {}\n-141 void incrementrowsize (_\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be i) {}\n-142 void endrowsizes () {}\n-143 void addindex (_\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be row, _\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be _\bc_\bo_\bl) {}\n-144 void endindices () {}\n-145 };\n-146\n-147 template\n-_\b1_\b4_\b8 struct FieldTraits< _\bB_\bD_\bM_\ba_\bt_\br_\bi_\bx >\n-149 {\n-_\b1_\b5_\b0 using _\bf_\bi_\be_\bl_\bd_\b__\bt_\by_\bp_\be = typename _\bB_\bD_\bM_\ba_\bt_\br_\bi_\bx_\b<_\bB_\b,_\b _\bA_\b>_\b:_\b:_\bf_\bi_\be_\bl_\bd_\b__\bt_\by_\bp_\be;\n-_\b1_\b5_\b1 using _\br_\be_\ba_\bl_\b__\bt_\by_\bp_\be = typename FieldTraits::real_type;\n-152 };\n-155} // end namespace Dune\n+_\b9_\b1 typedef _\bR_\be_\bd_\bi_\bs_\bt_\br_\bi_\bb_\bu_\bt_\be_\bI_\bn_\bf_\bo_\br_\bm_\ba_\bt_\bi_\bo_\bn_\b<_\bP_\ba_\br_\ba_\bl_\bl_\be_\bl_\bI_\bn_\bf_\bo_\br_\bm_\ba_\bt_\bi_\bo_\bn_\b> _\bR_\be_\bd_\bi_\bs_\bt_\br_\bi_\bb_\bu_\bt_\be_\bI_\bn_\bf_\bo_\bT_\by_\bp_\be;\n+92\n+_\b9_\b4 using _\bR_\bI_\bL_\bA_\bl_\bl_\bo_\bc_\ba_\bt_\bo_\br = typename std::allocator_traits::template\n+rebind_alloc;\n+95\n+_\b9_\b7 typedef std::list _\bR_\be_\bd_\bi_\bs_\bt_\br_\bi_\bb_\bu_\bt_\be_\bI_\bn_\bf_\bo_\bL_\bi_\bs_\bt;\n+98\n+104 _\bM_\ba_\bt_\br_\bi_\bx_\bH_\bi_\be_\br_\ba_\br_\bc_\bh_\by(std::shared_ptr fineMatrix,\n+105 std::shared_ptr pinfo = std::\n+make_shared());\n+106\n+107 _\b~_\bM_\ba_\bt_\br_\bi_\bx_\bH_\bi_\be_\br_\ba_\br_\bc_\bh_\by();\n+108\n+114 template\n+115 void _\bb_\bu_\bi_\bl_\bd(const T& criterion);\n+116\n+124 template\n+125 void _\br_\be_\bc_\ba_\bl_\bc_\bu_\bl_\ba_\bt_\be_\bG_\ba_\bl_\be_\br_\bk_\bi_\bn(const F& copyFlags);\n+126\n+131 template\n+132 void _\bc_\bo_\ba_\br_\bs_\be_\bn_\bV_\be_\bc_\bt_\bo_\br(_\bH_\bi_\be_\br_\ba_\br_\bc_\bh_\by<_\bB_\bl_\bo_\bc_\bk_\bV_\be_\bc_\bt_\bo_\br_\b<_\bV_\b,_\bB_\bA_\b>, TA>& hierarchy) const;\n+133\n+139 template\n+140 void _\bc_\bo_\ba_\br_\bs_\be_\bn_\bS_\bm_\bo_\bo_\bt_\bh_\be_\br(_\bH_\bi_\be_\br_\ba_\br_\bc_\bh_\by_\b<_\bS_\b,_\bT_\bA_\b>& smoothers,\n+141 const typename _\bS_\bm_\bo_\bo_\bt_\bh_\be_\br_\bT_\br_\ba_\bi_\bt_\bs_\b<_\bS_\b>_\b:_\b:_\bA_\br_\bg_\bu_\bm_\be_\bn_\bt_\bs& args) const;\n+142\n+147 std::size_t _\bl_\be_\bv_\be_\bl_\bs() const;\n+148\n+153 std::size_t _\bm_\ba_\bx_\bl_\be_\bv_\be_\bl_\bs() const;\n+154\n+155 bool _\bh_\ba_\bs_\bC_\bo_\ba_\br_\bs_\be_\bs_\bt() const;\n 156\n-157#endif\n-_\bb_\bc_\br_\bs_\bm_\ba_\bt_\br_\bi_\bx_\b._\bh_\bh\n-Implementation of the BCRSMatrix class.\n-_\bb_\bl_\bo_\bc_\bk_\bl_\be_\bv_\be_\bl_\b._\bh_\bh\n-Helper functions for determining the vector/matrix block level.\n-_\bc_\bo_\bl\n-Col col\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn matrixmatrix.hh:351\n+161 bool _\bi_\bs_\bB_\bu_\bi_\bl_\bt() const;\n+162\n+167 const _\bP_\ba_\br_\ba_\bl_\bl_\be_\bl_\bM_\ba_\bt_\br_\bi_\bx_\bH_\bi_\be_\br_\ba_\br_\bc_\bh_\by& _\bm_\ba_\bt_\br_\bi_\bc_\be_\bs() const;\n+168\n+173 const _\bP_\ba_\br_\ba_\bl_\bl_\be_\bl_\bI_\bn_\bf_\bo_\br_\bm_\ba_\bt_\bi_\bo_\bn_\bH_\bi_\be_\br_\ba_\br_\bc_\bh_\by& _\bp_\ba_\br_\ba_\bl_\bl_\be_\bl_\bI_\bn_\bf_\bo_\br_\bm_\ba_\bt_\bi_\bo_\bn() const;\n+174\n+179 const _\bA_\bg_\bg_\br_\be_\bg_\ba_\bt_\be_\bs_\bM_\ba_\bp_\bL_\bi_\bs_\bt& _\ba_\bg_\bg_\br_\be_\bg_\ba_\bt_\be_\bs_\bM_\ba_\bp_\bs() const;\n+180\n+186 const _\bR_\be_\bd_\bi_\bs_\bt_\br_\bi_\bb_\bu_\bt_\be_\bI_\bn_\bf_\bo_\bL_\bi_\bs_\bt& _\br_\be_\bd_\bi_\bs_\bt_\br_\bi_\bb_\bu_\bt_\be_\bI_\bn_\bf_\bo_\br_\bm_\ba_\bt_\bi_\bo_\bn() const;\n+187\n+_\b1_\b8_\b8 double _\bg_\be_\bt_\bP_\br_\bo_\bl_\bo_\bn_\bg_\ba_\bt_\bi_\bo_\bn_\bD_\ba_\bm_\bp_\bi_\bn_\bg_\bF_\ba_\bc_\bt_\bo_\br() const\n+189 {\n+190 return prolongDamp_;\n+191 }\n+192\n+203 void _\bg_\be_\bt_\bC_\bo_\ba_\br_\bs_\be_\bs_\bt_\bA_\bg_\bg_\br_\be_\bg_\ba_\bt_\be_\bs_\bO_\bn_\bF_\bi_\bn_\be_\bs_\bt(std::vector& data) const;\n+204\n+205 private:\n+206 typedef typename _\bC_\bo_\bn_\bs_\bt_\br_\bu_\bc_\bt_\bi_\bo_\bn_\bT_\br_\ba_\bi_\bt_\bs_\b<_\bM_\ba_\bt_\br_\bi_\bx_\bO_\bp_\be_\br_\ba_\bt_\bo_\br_\b>_\b:_\b:_\bA_\br_\bg_\bu_\bm_\be_\bn_\bt_\bs MatrixArgs;\n+207 typedef typename _\bC_\bo_\bn_\bs_\bt_\br_\bu_\bc_\bt_\bi_\bo_\bn_\bT_\br_\ba_\bi_\bt_\bs_\b<_\bP_\ba_\br_\ba_\bl_\bl_\be_\bl_\bI_\bn_\bf_\bo_\br_\bm_\ba_\bt_\bi_\bo_\bn_\b>_\b:_\b:_\bA_\br_\bg_\bu_\bm_\be_\bn_\bt_\bs\n+CommunicationArgs;\n+209 _\bA_\bg_\bg_\br_\be_\bg_\ba_\bt_\be_\bs_\bM_\ba_\bp_\bL_\bi_\bs_\bt aggregatesMaps_;\n+211 _\bR_\be_\bd_\bi_\bs_\bt_\br_\bi_\bb_\bu_\bt_\be_\bI_\bn_\bf_\bo_\bL_\bi_\bs_\bt redistributes_;\n+213 _\bP_\ba_\br_\ba_\bl_\bl_\be_\bl_\bM_\ba_\bt_\br_\bi_\bx_\bH_\bi_\be_\br_\ba_\br_\bc_\bh_\by matrices_;\n+215 _\bP_\ba_\br_\ba_\bl_\bl_\be_\bl_\bI_\bn_\bf_\bo_\br_\bm_\ba_\bt_\bi_\bo_\bn_\bH_\bi_\be_\br_\ba_\br_\bc_\bh_\by parallelInformation_;\n+216\n+218 bool built_;\n+219\n+221 int maxlevels_;\n+222\n+223 double prolongDamp_;\n+224\n+228 template\n+229 struct MatrixStats\n+230 {\n+231\n+235 static void stats([[maybe_unused]] const _\bM_\ba_\bt_\br_\bi_\bx& matrix)\n+236 {}\n+237 };\n+238\n+239 template\n+240 struct MatrixStats<_\bM_\ba_\bt_\br_\bi_\bx,true>\n+241 {\n+_\b2_\b4_\b2 struct calc\n+243 {\n+_\b2_\b4_\b4 typedef typename _\bM_\ba_\bt_\br_\bi_\bx_\b:_\b:_\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be _\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be;\n+_\b2_\b4_\b5 typedef typename _\bM_\ba_\bt_\br_\bi_\bx_\b:_\b:_\br_\bo_\bw_\b__\bt_\by_\bp_\be _\bm_\ba_\bt_\br_\bi_\bx_\b__\br_\bo_\bw;\n+246\n+_\b2_\b4_\b7 _\bc_\ba_\bl_\bc()\n+248 {\n+249 min=std::numeric_limits::max();\n+250 max=0;\n+251 sum=0;\n+252 }\n+253\n+_\b2_\b5_\b4 void _\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b(_\b)(const _\bm_\ba_\bt_\br_\bi_\bx_\b__\br_\bo_\bw& row)\n+255 {\n+256 min=std::min(min, row.size());\n+257 max=std::max(max, row.size());\n+258 sum += row.size();\n+259 }\n+260\n+_\b2_\b6_\b1 _\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be _\bm_\bi_\bn;\n+_\b2_\b6_\b2 _\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be _\bm_\ba_\bx;\n+_\b2_\b6_\b3 _\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be _\bs_\bu_\bm;\n+264 };\n+268 static void stats(const _\bM_\ba_\bt_\br_\bi_\bx& matrix)\n+269 {\n+270 calc c= for_each(matrix.begin(), matrix.end(), calc());\n+271 dinfo<<\"Matrix row: min=\"<(c.sum)/matrix.N()\n+273 <\n+_\b2_\b8_\b2 class _\bC_\bo_\ba_\br_\bs_\be_\bn_\bC_\br_\bi_\bt_\be_\br_\bi_\bo_\bn : public T\n+283 {\n+284 public:\n+_\b2_\b8_\b9 typedef T _\bA_\bg_\bg_\br_\be_\bg_\ba_\bt_\bi_\bo_\bn_\bC_\br_\bi_\bt_\be_\br_\bi_\bo_\bn;\n+290\n+_\b3_\b0_\b4 _\bC_\bo_\ba_\br_\bs_\be_\bn_\bC_\br_\bi_\bt_\be_\br_\bi_\bo_\bn(int maxLevel=100, int coarsenTarget=1000, double\n+minCoarsenRate=1.2,\n+305 double prolongDamp=1.6, _\bA_\bc_\bc_\bu_\bm_\bu_\bl_\ba_\bt_\bi_\bo_\bn_\bM_\bo_\bd_\be accumulate=_\bs_\bu_\bc_\bc_\be_\bs_\bs_\bi_\bv_\be_\bA_\bc_\bc_\bu, bool\n+useFixedOrder = false)\n+306 : _\bA_\bg_\bg_\br_\be_\bg_\ba_\bt_\bi_\bo_\bn_\bC_\br_\bi_\bt_\be_\br_\bi_\bo_\bn(_\bD_\bu_\bn_\be::Amg::_\bP_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bs(maxLevel, coarsenTarget,\n+minCoarsenRate, prolongDamp, accumulate, useFixedOrder))\n+307 {}\n+308\n+_\b3_\b0_\b9 _\bC_\bo_\ba_\br_\bs_\be_\bn_\bC_\br_\bi_\bt_\be_\br_\bi_\bo_\bn(const _\bD_\bu_\bn_\be_\b:_\b:_\bA_\bm_\bg_\b:_\b:_\bP_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bs& parms)\n+310 : _\bA_\bg_\bg_\br_\be_\bg_\ba_\bt_\bi_\bo_\bn_\bC_\br_\bi_\bt_\be_\br_\bi_\bo_\bn(parms)\n+311 {}\n+312\n+313 };\n+314\n+315 template\n+_\b3_\b1_\b6 bool _\br_\be_\bp_\ba_\br_\bt_\bi_\bt_\bi_\bo_\bn_\bA_\bn_\bd_\bD_\bi_\bs_\bt_\br_\bi_\bb_\bu_\bt_\be_\bM_\ba_\bt_\br_\bi_\bx([[maybe_unused]] const M& origMatrix,\n+317 [[maybe_unused]] std::shared_ptr newMatrix,\n+318 [[maybe_unused]] _\bS_\be_\bq_\bu_\be_\bn_\bt_\bi_\ba_\bl_\bI_\bn_\bf_\bo_\br_\bm_\ba_\bt_\bi_\bo_\bn& origComm,\n+319 [[maybe_unused]] std::shared_ptr
![\"doxygen\"/](\"doxygen.svg\")
1.9.8\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,35 +1,41 @@\n dune-istl\u00a02.10\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bi_\bs_\bt_\bl\n-_\bC_\bl_\ba_\bs_\bs_\be_\bs | _\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs | _\bT_\by_\bp_\be_\bd_\be_\bf_\bs\n-allocator.hh File Reference\n-#include