>;\n-280 public:\n-_\b2_\b8_\b5 typedef X _\bd_\bo_\bm_\ba_\bi_\bn_\b__\bt_\by_\bp_\be;\n-_\b2_\b9_\b0 typedef Y _\br_\ba_\bn_\bg_\be_\b__\bt_\by_\bp_\be;\n-_\b2_\b9_\b2 typedef typename X::field_type _\bf_\bi_\be_\bl_\bd_\b__\bt_\by_\bp_\be;\n-_\b2_\b9_\b7 typedef C _\bc_\bo_\bm_\bm_\bu_\bn_\bi_\bc_\ba_\bt_\bi_\bo_\bn_\b__\bt_\by_\bp_\be;\n-298\n-_\b3_\b0_\b6 _\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-307 : _preconditioner(stackobject_to_shared_ptr(p)), _communication(c)\n-308 { }\n-309\n-_\b3_\b1_\b7 _\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 _\bc_\bo_\bm_\bm_\bu_\bn_\bi_\bc_\ba_\bt_\bi_\bo_\bn_\b__\bt_\by_\bp_\be&\n-c)\n-318 : _preconditioner(p), _communication(c)\n-319 { }\n-320\n-_\b3_\b2_\b6 virtual void _\bp_\br_\be (X& x, Y& b)\n-327 {\n-328 _communication.copyOwnerToAll(x,x); // make dirichlet values consistent\n-329 _preconditioner->pre(x,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 _preconditioner->apply(v,d);\n-340 _communication.copyOwnerToAll(v,v);\n-341 }\n-342\n-343 template\n-_\b3_\b4_\b4 void _\ba_\bp_\bp_\bl_\by (X& v, const Y& d)\n-345 {\n-346 _preconditioner->template apply(v,d);\n-347 _communication.copyOwnerToAll(v,v);\n-348 }\n-349\n-_\b3_\b5_\b5 virtual void _\bp_\bo_\bs_\bt (X& x)\n-356 {\n-357 _preconditioner->post(x);\n-358 }\n-359\n-_\b3_\b6_\b1 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-362 {\n-363 return _\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-364 }\n-365\n-366 private:\n-368 std::shared_ptr _preconditioner;\n-369\n-371 const _\bc_\bo_\bm_\bm_\bu_\bn_\bi_\bc_\ba_\bt_\bi_\bo_\bn_\b__\bt_\by_\bp_\be& _communication;\n-372 };\n-373\n-376} // end namespace\n-377\n-378#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-_\bs_\bo_\bl_\bv_\be_\br_\bs_\b._\bh_\bh\n-Implementations of the inverse operator 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-_\bp_\br_\be_\bc_\bo_\bn_\bd_\bi_\bt_\bi_\bo_\bn_\be_\br_\bs_\b._\bh_\bh\n-Define general preconditioner interface.\n-_\bi_\bo_\b._\bh_\bh\n-Some generic functions for pretty printing vectors and matrices.\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-_\bv_\bb_\bv_\be_\bc_\bt_\bo_\br_\b._\bh_\bh\n-???\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-_\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:_\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+8#include \n+9\n+10#include \"_\bs_\bo_\bl_\bv_\be_\br_\bc_\ba_\bt_\be_\bg_\bo_\br_\by_\b._\bh_\bh\"\n+11\n+12namespace _\bD_\bu_\bn_\be {\n+17 //=====================================================================\n+30 //=====================================================================\n+31 template\n+_\b3_\b2 class _\bP_\br_\be_\bc_\bo_\bn_\bd_\bi_\bt_\bi_\bo_\bn_\be_\br {\n+33 public:\n+_\b3_\b5 typedef X _\bd_\bo_\bm_\ba_\bi_\bn_\b__\bt_\by_\bp_\be;\n+_\b3_\b7 typedef Y _\br_\ba_\bn_\bg_\be_\b__\bt_\by_\bp_\be;\n+_\b3_\b9 typedef typename X::field_type _\bf_\bi_\be_\bl_\bd_\b__\bt_\by_\bp_\be;\n+40\n+_\b6_\b9 virtual void _\bp_\br_\be (X& x, Y& b) = 0;\n+70\n+_\b8_\b1 virtual void _\ba_\bp_\bp_\bl_\by (X& v, const Y& d) = 0;\n+82\n+_\b9_\b1 virtual void _\bp_\bo_\bs_\bt (X& x) = 0;\n+92\n+_\b9_\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+95#if DUNE_ISTL_SUPPORT_OLD_CATEGORY_INTERFACE\n+96 {\n+97 DUNE_THROW(Dune::Exception,\"It is necessary to implement the category method\n+in a derived classes, in the future this method will pure virtual.\");\n+98 }\n+99#else\n+100 = 0;\n+101#endif\n+102\n+_\b1_\b0_\b4 virtual _\b~_\bP_\br_\be_\bc_\bo_\bn_\bd_\bi_\bt_\bi_\bo_\bn_\be_\br () {}\n+105\n+106 };\n+107\n+111}\n+112#endif\n+_\bs_\bo_\bl_\bv_\be_\br_\bc_\ba_\bt_\be_\bg_\bo_\br_\by_\b._\bh_\bh\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:_\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:109\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_\bO_\bp_\be_\br_\ba_\bt_\bo_\br\n-An overlapping Schwarz operator.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn schwarz.hh:75\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_\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 schwarz.hh:146\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_\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 the sequential assembled linear operator.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn schwarz.hh:133\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_\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 schwarz.hh:125\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_\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 schwarz.hh:116\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_\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 schwarz.hh:98\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_\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 schwarz.hh:86\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_\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 schwarz.hh:81\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_\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 schwarz.hh:91\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_\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 schwarz.hh:93\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_\bO_\bp_\be_\br_\ba_\bt_\bo_\br_\b:_\b:_\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-OverlappingSchwarzOperator(const matrix_type &A, const communication_type &com)\n-constructor: just store a reference to a matrix.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn schwarz.hh:107\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_\bO_\bp_\be_\br_\ba_\bt_\bo_\br_\b:_\b:_\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-OverlappingSchwarzOperator(const std::shared_ptr< matrix_type > A, const\n-communication_type &com)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn schwarz.hh:111\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_\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 schwarz.hh:139\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:32\n-_\bD_\bu_\bn_\be_\b:_\b:_\bP_\ba_\br_\bS_\bS_\bO_\bR\n-A parallel SSOR preconditioner.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn schwarz.hh:175\n-_\bD_\bu_\bn_\be_\b:_\b:_\bP_\ba_\br_\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 schwarz.hh:184\n-_\bD_\bu_\bn_\be_\b:_\b:_\bP_\ba_\br_\bS_\bS_\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 schwarz.hh:186\n-_\bD_\bu_\bn_\be_\b:_\b:_\bP_\ba_\br_\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 schwarz.hh:233\n-_\bD_\bu_\bn_\be_\b:_\b:_\bP_\ba_\br_\bS_\bS_\bO_\bR_\b:_\b:_\bP_\ba_\br_\bS_\bS_\bO_\bR\n-ParSSOR(const matrix_type &A, int n, field_type w, const communication_type &c)\n-Constructor.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn schwarz.hh:197\n-_\bD_\bu_\bn_\be_\b:_\b:_\bP_\ba_\br_\bS_\bS_\bO_\bR_\b:_\b:_\bp_\bo_\bs_\bt\n-virtual void post(X &x)\n+_\bD_\bu_\bn_\be_\b:_\b:_\bP_\br_\be_\bc_\bo_\bn_\bd_\bi_\bt_\bi_\bo_\bn_\be_\br_\b:_\b:_\bp_\bo_\bs_\bt\n+virtual void post(X &x)=0\n Clean up.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn schwarz.hh:230\n-_\bD_\bu_\bn_\be_\b:_\b:_\bP_\ba_\br_\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 schwarz.hh:180\n-_\bD_\bu_\bn_\be_\b:_\b:_\bP_\ba_\br_\bS_\bS_\bO_\bR_\b:_\b:_\br_\ba_\bn_\bg_\be_\b__\bt_\by_\bp_\be\n+_\bD_\bu_\bn_\be_\b:_\b:_\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(X &v, const Y &d)=0\n+Apply one step of the preconditioner to the system A(v)=d.\n+_\bD_\bu_\bn_\be_\b:_\b:_\bP_\br_\be_\bc_\bo_\bn_\bd_\bi_\bt_\bi_\bo_\bn_\be_\br_\b:_\b:_\b~_\bP_\br_\be_\bc_\bo_\bn_\bd_\bi_\bt_\bi_\bo_\bn_\be_\br\n+virtual ~Preconditioner()\n+every abstract base class has a virtual destructor\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn preconditioner.hh:104\n+_\bD_\bu_\bn_\be_\b:_\b:_\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 Y range_type\n The range type of the preconditioner.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn schwarz.hh:182\n-_\bD_\bu_\bn_\be_\b:_\b:_\bP_\ba_\br_\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 schwarz.hh:178\n-_\bD_\bu_\bn_\be_\b:_\b:_\bP_\ba_\br_\bS_\bS_\bO_\bR_\b:_\b:_\ba_\bp_\bp_\bl_\by\n-virtual void apply(X &v, const Y &d)\n-Apply the precondtioner.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn schwarz.hh:216\n-_\bD_\bu_\bn_\be_\b:_\b:_\bP_\ba_\br_\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 schwarz.hh:206\n-_\bD_\bu_\bn_\be_\b:_\b:_\bB_\bl_\bo_\bc_\bk_\bP_\br_\be_\bc_\bo_\bn_\bd_\bi_\bt_\bi_\bo_\bn_\be_\br\n-Block parallel preconditioner.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn schwarz.hh:278\n-_\bD_\bu_\bn_\be_\b:_\b:_\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(X &x, Y &b)\n-Prepare the preconditioner.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn schwarz.hh:326\n-_\bD_\bu_\bn_\be_\b:_\b:_\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+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn preconditioner.hh:37\n+_\bD_\bu_\bn_\be_\b:_\b:_\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 X domain_type\n The domain type of the preconditioner.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn schwarz.hh:285\n-_\bD_\bu_\bn_\be_\b:_\b:_\bB_\bl_\bo_\bc_\bk_\bP_\br_\be_\bc_\bo_\bn_\bd_\bi_\bt_\bi_\bo_\bn_\be_\br_\b:_\b:_\bB_\bl_\bo_\bc_\bk_\bP_\br_\be_\bc_\bo_\bn_\bd_\bi_\bt_\bi_\bo_\bn_\be_\br\n-BlockPreconditioner(const std::shared_ptr< P > &p, const communication_type &c)\n-Constructor.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn schwarz.hh:317\n-_\bD_\bu_\bn_\be_\b:_\b:_\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(X &v, const Y &d)\n-Apply the preconditioner.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn schwarz.hh:337\n-_\bD_\bu_\bn_\be_\b:_\b:_\bB_\bl_\bo_\bc_\bk_\bP_\br_\be_\bc_\bo_\bn_\bd_\bi_\bt_\bi_\bo_\bn_\be_\br_\b:_\b:_\bB_\bl_\bo_\bc_\bk_\bP_\br_\be_\bc_\bo_\bn_\bd_\bi_\bt_\bi_\bo_\bn_\be_\br\n-BlockPreconditioner(P &p, const communication_type &c)\n-Constructor.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn schwarz.hh:306\n-_\bD_\bu_\bn_\be_\b:_\b:_\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 schwarz.hh:344\n-_\bD_\bu_\bn_\be_\b:_\b:_\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 schwarz.hh:297\n-_\bD_\bu_\bn_\be_\b:_\b:_\bB_\bl_\bo_\bc_\bk_\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+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn preconditioner.hh:35\n+_\bD_\bu_\bn_\be_\b:_\b:_\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 =0\n+Category of the preconditioner (see SolverCategory::Category)\n+_\bD_\bu_\bn_\be_\b:_\b:_\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 X::field_type field_type\n The field type of the preconditioner.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn schwarz.hh:292\n-_\bD_\bu_\bn_\be_\b:_\b:_\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(X &x)\n-Clean up.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn schwarz.hh:355\n-_\bD_\bu_\bn_\be_\b:_\b:_\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-Y range_type\n-The range type of the preconditioner.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn schwarz.hh:290\n-_\bD_\bu_\bn_\be_\b:_\b:_\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 schwarz.hh:361\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn preconditioner.hh:39\n+_\bD_\bu_\bn_\be_\b:_\b:_\bP_\br_\be_\bc_\bo_\bn_\bd_\bi_\bt_\bi_\bo_\bn_\be_\br_\b:_\b:_\bp_\br_\be\n+virtual void pre(X &x, Y &b)=0\n+Prepare the preconditioner.\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:_\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 ===============================================================================\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: blocklevel.hh File Reference \n+dune-istl: matrixutils.hh File Reference \n \n \n-
Helper functions for determining the vector/matrix block level. \n+
Some handy generic functions for ISTL matrices. \n More...
\n-
#include <algorithm>\n-
#include <type_traits>\n-
#include <dune/common/indices.hh>\n+
#include <set>\n+
#include <vector>\n+
#include <limits>\n
#include <dune/common/typetraits.hh>\n-
#include <dune/common/hybridutilities.hh>\n+
#include <dune/common/fmatrix.hh>\n+
#include <dune/common/dynmatrix.hh>\n+
#include <dune/common/diagonalmatrix.hh>\n+
#include <dune/common/scalarmatrixview.hh>\n+
#include <dune/istl/scaledidmatrix.hh >\n+
#include "istlexception.hh "\n
\n
Go to the source code of this file.
\n
\n+struct Dune::CheckIfDiagonalPresent< Matrix, blocklevel, l > Check whether the a matrix has diagonal values on blocklevel recursion levels. More... struct Dune::CheckIfDiagonalPresent< Matrix, 0, l > struct Dune::CheckIfDiagonalPresent< MultiTypeBlockMatrix< T1, Args... >, blocklevel, l > struct Dune::MatrixDimension< M > struct Dune::MatrixDimension< Matrix< B, TA > > struct Dune::MatrixDimension< BCRSMatrix< B, TA > > struct Dune::MatrixDimension< BCRSMatrix< FieldMatrix< B, n, m >, TA > > struct Dune::MatrixDimension< FieldMatrix< K, n, m > > struct Dune::MatrixDimension< Dune::DynamicMatrix< T > > struct Dune::MatrixDimension< Matrix< FieldMatrix< K, n, m >, TA > > struct Dune::MatrixDimension< DiagonalMatrix< K, n > > struct Dune::MatrixDimension< ScaledIdentityMatrix< K, n > > struct Dune::IsMatrix< T > Test whether a type is an ISTL Matrix . More... struct Dune::IsMatrix< DenseMatrix< T > > struct Dune::IsMatrix< BCRSMatrix< T, A > > struct Dune::PointerCompare< T >
\n namespace Dune
\n template<typename T > constexpr std::size_t Dune::maxBlockLevel () Determine the maximum block level of a possibly nested vector/matrix type. template<typename T > constexpr std::size_t Dune::minBlockLevel () Determine the minimum block level of a possibly nested vector/matrix type. template<typename T > constexpr bool Dune::hasUniqueBlockLevel () Determine if a vector/matrix has a uniquely determinable block level. template<typename T > constexpr std::size_t Dune::blockLevel () Determine the block level of a possibly nested vector/matrix type. template<class M > auto Dune::countNonZeros (const M &, typename std::enable_if_t< Dune::IsNumber< M >::value > *sfinae=nullptr) Get the number of nonzero fields in the matrix. template<class M > auto Dune::countNonZeros (const M &matrix, typename std::enable_if_t<!Dune::IsNumber< M >::value > *sfinae=nullptr) template<class M , class C > void Dune::printGlobalSparseMatrix (const M &mat , C &ooc, std::ostream &os)
\n
\n-
Helper functions for determining the vector/matrix block level.
\n+
Some handy generic functions for ISTL matrices.
\n+
Author Markus Blatt \n
\n \n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,43 +1,80 @@\n dune-istl\u00a02.9.0\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bi_\bs_\bt_\bl\n-_\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs | _\bF_\bu_\bn_\bc_\bt_\bi_\bo_\bn_\bs\n-blocklevel.hh File Reference\n-Helper functions for determining the vector/matrix block level. _\bM_\bo_\br_\be_\b._\b._\b.\n-#include
\n-#include \n-#include \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+matrixutils.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 _\bS_\bp_\ba_\br_\bs_\be_\b _\bM_\ba_\bt_\br_\bi_\bx_\b _\ba_\bn_\bd_\b _\bV_\be_\bc_\bt_\bo_\br_\b _\bc_\bl_\ba_\bs_\bs_\be_\bs\n+Some handy generic functions for ISTL matrices. _\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 \n+#include <_\bd_\bu_\bn_\be_\b/_\bi_\bs_\bt_\bl_\b/_\bs_\bc_\ba_\bl_\be_\bd_\bi_\bd_\bm_\ba_\bt_\br_\bi_\bx_\b._\bh_\bh>\n+#include \"_\bi_\bs_\bt_\bl_\be_\bx_\bc_\be_\bp_\bt_\bi_\bo_\bn_\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:_\bC_\bh_\be_\bc_\bk_\bI_\bf_\bD_\bi_\ba_\bg_\bo_\bn_\ba_\bl_\bP_\br_\be_\bs_\be_\bn_\bt_\b<_\b _\bM_\ba_\bt_\br_\bi_\bx_\b,_\b _\bb_\bl_\bo_\bc_\bk_\bl_\be_\bv_\be_\bl_\b,_\b _\bl_\b _\b>\n+\u00a0 Check whether the a matrix has diagonal values on blocklevel recursion\n+ levels. _\bM_\bo_\br_\be_\b._\b._\b.\n+\u00a0\n+struct \u00a0 _\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 _\bM_\ba_\bt_\br_\bi_\bx_\b,_\b _\b0_\b,_\b _\bl_\b _\b>\n+\u00a0\n+struct \u00a0 _\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 _\bM_\bu_\bl_\bt_\bi_\bT_\by_\bp_\be_\bB_\bl_\bo_\bc_\bk_\bM_\ba_\bt_\br_\bi_\bx_\b<_\b _\bT_\b1_\b,_\b _\bA_\br_\bg_\bs_\b._\b._\b._\b _\b>_\b,\n+ _\bb_\bl_\bo_\bc_\bk_\bl_\be_\bv_\be_\bl_\b,_\b _\bl_\b _\b>\n+\u00a0\n+struct \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bM_\ba_\bt_\br_\bi_\bx_\bD_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b<_\b _\bM_\b _\b>\n+\u00a0\n+struct \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bM_\ba_\bt_\br_\bi_\bx_\bD_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b<_\b _\bM_\ba_\bt_\br_\bi_\bx_\b<_\b _\bB_\b,_\b _\bT_\bA_\b _\b>_\b _\b>\n+\u00a0\n+struct \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bM_\ba_\bt_\br_\bi_\bx_\bD_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\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\n+struct \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bM_\ba_\bt_\br_\bi_\bx_\bD_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b<_\b _\bB_\bC_\bR_\bS_\bM_\ba_\bt_\br_\bi_\bx_\b<_\b _\bF_\bi_\be_\bl_\bd_\bM_\ba_\bt_\br_\bi_\bx_\b<_\b _\bB_\b,_\b _\bn_\b,_\b _\bm_\b _\b>_\b,_\b _\bT_\bA_\b _\b>_\b _\b>\n+\u00a0\n+struct \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bM_\ba_\bt_\br_\bi_\bx_\bD_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b<_\b _\bF_\bi_\be_\bl_\bd_\bM_\ba_\bt_\br_\bi_\bx_\b<_\b _\bK_\b,_\b _\bn_\b,_\b _\bm_\b _\b>_\b _\b>\n+\u00a0\n+struct \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bM_\ba_\bt_\br_\bi_\bx_\bD_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b<_\b _\bD_\bu_\bn_\be_\b:_\b:_\bD_\by_\bn_\ba_\bm_\bi_\bc_\bM_\ba_\bt_\br_\bi_\bx_\b<_\b _\bT_\b _\b>_\b _\b>\n+\u00a0\n+struct \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bM_\ba_\bt_\br_\bi_\bx_\bD_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b<_\b _\bM_\ba_\bt_\br_\bi_\bx_\b<_\b _\bF_\bi_\be_\bl_\bd_\bM_\ba_\bt_\br_\bi_\bx_\b<_\b _\bK_\b,_\b _\bn_\b,_\b _\bm_\b _\b>_\b,_\b _\bT_\bA_\b _\b>_\b _\b>\n+\u00a0\n+struct \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bM_\ba_\bt_\br_\bi_\bx_\bD_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b<_\b _\bD_\bi_\ba_\bg_\bo_\bn_\ba_\bl_\bM_\ba_\bt_\br_\bi_\bx_\b<_\b _\bK_\b,_\b _\bn_\b _\b>_\b _\b>\n+\u00a0\n+struct \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bM_\ba_\bt_\br_\bi_\bx_\bD_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\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+\u00a0\n+struct \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bI_\bs_\bM_\ba_\bt_\br_\bi_\bx_\b<_\b _\bT_\b _\b>\n+\u00a0 Test whether a type is an _\bI_\bS_\bT_\bL _\bM_\ba_\bt_\br_\bi_\bx. _\bM_\bo_\br_\be_\b._\b._\b.\n+\u00a0\n+struct \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bI_\bs_\bM_\ba_\bt_\br_\bi_\bx_\b<_\b _\bD_\be_\bn_\bs_\be_\bM_\ba_\bt_\br_\bi_\bx_\b<_\b _\bT_\b _\b>_\b _\b>\n+\u00a0\n+struct \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bI_\bs_\bM_\ba_\bt_\br_\bi_\bx_\b<_\b _\bB_\bC_\bR_\bS_\bM_\ba_\bt_\br_\bi_\bx_\b<_\b _\bT_\b,_\b _\bA_\b _\b>_\b _\b>\n+\u00a0\n+struct \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bP_\bo_\bi_\bn_\bt_\be_\br_\bC_\bo_\bm_\bp_\ba_\br_\be_\b<_\b _\bT_\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 F\bFu\bun\bnc\bct\bti\bio\bon\bns\bs\n-template\n-constexpr std::size_t\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bm_\ba_\bx_\bB_\bl_\bo_\bc_\bk_\bL_\be_\bv_\be_\bl ()\n-\u00a0 Determine the maximum block level of a possibly nested\n- vector/matrix type.\n-\u00a0\n-template\n-constexpr std::size_t\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bm_\bi_\bn_\bB_\bl_\bo_\bc_\bk_\bL_\be_\bv_\be_\bl ()\n-\u00a0 Determine the minimum block level of a possibly nested\n- vector/matrix type.\n-\u00a0\n-template\n- constexpr bool\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bh_\ba_\bs_\bU_\bn_\bi_\bq_\bu_\be_\bB_\bl_\bo_\bc_\bk_\bL_\be_\bv_\be_\bl ()\n-\u00a0 Determine if a vector/matrix has a uniquely determinable\n- block level.\n-\u00a0\n-template\n-constexpr std::size_t\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bb_\bl_\bo_\bc_\bk_\bL_\be_\bv_\be_\bl ()\n-\u00a0 Determine the block level of a possibly nested vector/\n- matrix type.\n+template\n+auto\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bc_\bo_\bu_\bn_\bt_\bN_\bo_\bn_\bZ_\be_\br_\bo_\bs (const M &, typename std::enable_if_t< Dune::\n+ IsNumber< M >::value > *sfinae=nullptr)\n+\u00a0 Get the number of nonzero fields in the matrix.\n+\u00a0\n+template\n+auto\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bc_\bo_\bu_\bn_\bt_\bN_\bo_\bn_\bZ_\be_\br_\bo_\bs (const M &matrix, typename std::enable_if_t::value > *sfinae=nullptr)\n+\u00a0\n+template\n+void\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bp_\br_\bi_\bn_\bt_\bG_\bl_\bo_\bb_\ba_\bl_\bS_\bp_\ba_\br_\bs_\be_\bM_\ba_\bt_\br_\bi_\bx (const M &_\bm_\ba_\bt, C &ooc, std::ostream &os)\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-Helper functions for determining the vector/matrix block level.\n+Some handy generic functions for ISTL matrices.\n+ Author\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/a00014_source.html", "source2": "./usr/share/doc/libdune-istl-doc/doxygen/a00014_source.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n dune-istl: blocklevel.hh Source File \n+dune-istl: matrixutils.hh Source File \n \n \n
\n
Go to the documentation of this file. \n
\n
\n
\n-
\n-
6 #ifndef DUNE_ISTL_BLOCKLEVEL_HH \n-
7 #define DUNE_ISTL_BLOCKLEVEL_HH \n-
\n-
\n-
\n-
\n-
12 #include <dune/common/indices.hh> \n-
13 #include <dune/common/typetraits.hh> \n-
14 #include <dune/common/hybridutilities.hh> \n-
\n-
\n-
\n-
23 template <
typename ... Args>
\n-
24 class MultiTypeBlockVector;
\n-
25 template <
typename FirstRow,
typename ... Args>
\n-
26 class MultiTypeBlockMatrix;
\n-
\n+
5 #ifndef DUNE_ISTL_MATRIXUTILS_HH \n+
6 #define DUNE_ISTL_MATRIXUTILS_HH \n+
\n+
\n+
\n+
\n+
11 #include <dune/common/typetraits.hh> \n+
12 #include <dune/common/fmatrix.hh> \n+
13 #include <dune/common/dynmatrix.hh> \n+
14 #include <dune/common/diagonalmatrix.hh> \n+
15 #include <dune/common/scalarmatrixview.hh> \n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
23 template <
typename B,
typename A>
\n+
\n+
\n+
26 template <
typename K,
int n,
int m>
\n+
\n
\n-
29 namespace Dune {
namespace Impl {
\n-
\n-
\n-
32 template <
typename T>
struct MaxBlockLevel;
\n-
33 template <
typename T>
struct MinBlockLevel;
\n-
\n-
36 template <
typename M,
template <
typename B>
typename BlockLevel,
typename Op>
\n-
37 constexpr std::size_t blockLevelMultiTypeBlockMatrix(
const Op& op)
\n-
\n-
\n-
40 using namespace Dune::Indices;
\n-
41 using Block00 =
typename std::decay_t<decltype(std::declval<M>()[_0][_0])>;
\n-
42 std::size_t
blockLevel = BlockLevel<Block00>::value() + 1;
\n-
\n-
44 using namespace Dune::Hybrid;
\n-
45 forEach(integralRange(index_constant<M::N()>()), [&](
auto && i) {
\n-
46 using namespace Dune::Hybrid;
\n-
47 forEach(integralRange(index_constant<M::M()>()), [&](
auto && j) {
\n-
48 using Block =
typename std::decay_t<decltype(std::declval<M>()[i][j])>;
\n-
\n-
\n-
\n-
\n-
\n-
\n-
56 template <
typename V,
template <
typename B>
typename BlockLevel,
typename Op>
\n-
57 constexpr std::size_t blockLevelMultiTypeBlockVector(
const Op& op)
\n-
\n-
\n-
60 using namespace Dune::Indices;
\n-
61 using Block0 =
typename std::decay_t<decltype(std::declval<V>()[_0])>;
\n-
62 std::size_t
blockLevel = BlockLevel<Block0>::value() + 1;
\n-
\n-
64 using namespace Dune::Hybrid;
\n-
65 forEach(integralRange(index_constant<V::size()>()), [&](
auto && i) {
\n-
66 using Block =
typename std::decay_t<decltype(std::declval<V>()[i])>;
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
75 static constexpr std::size_t value(){
\n-
76 if constexpr (IsNumber<T>::value)
\n-
\n-
\n-
79 return MaxBlockLevel<typename T::block_type>::value() + 1;
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
87 static constexpr std::size_t value()
\n-
88 {
return MaxBlockLevel<T>::value(); }
\n-
\n-
\n-
\n-
92 template <
typename FirstRow,
typename ... Args>
\n-
93 struct MaxBlockLevel<
Dune ::MultiTypeBlockMatrix<FirstRow, Args...>>
\n-
\n-
95 static constexpr std::size_t value()
\n-
\n-
97 using M = MultiTypeBlockMatrix<FirstRow, Args...>;
\n-
98 constexpr auto max = [](
const auto & a,
const auto & b){
return std::max(a,b); };
\n-
99 return blockLevelMultiTypeBlockMatrix<M, MaxBlockLevel>(max);
\n-
\n-
\n-
\n-
\n-
104 template <
typename FirstRow,
typename ... Args>
\n-
105 struct MinBlockLevel<
Dune ::MultiTypeBlockMatrix<FirstRow, Args...>>
\n-
\n-
107 static constexpr std::size_t value()
\n-
\n-
109 using M = MultiTypeBlockMatrix<FirstRow, Args...>;
\n-
110 constexpr auto min = [](
const auto & a,
const auto & b){
return std::min(a,b); };
\n-
111 return blockLevelMultiTypeBlockMatrix<M, MinBlockLevel>(min);
\n-
\n-
\n-
\n-
\n-
116 template <
typename ... Args>
\n-
117 struct MaxBlockLevel<
Dune ::MultiTypeBlockVector<Args...>>
\n-
\n-
119 static constexpr std::size_t value()
\n-
\n-
121 using V = MultiTypeBlockVector<Args...>;
\n-
122 constexpr auto max = [](
const auto & a,
const auto & b){
return std::max(a,b); };
\n-
123 return blockLevelMultiTypeBlockVector<V, MaxBlockLevel>(max);
\n-
\n-
\n-
\n-
\n-
128 template <
typename ... Args>
\n-
129 struct MinBlockLevel<
Dune ::MultiTypeBlockVector<Args...>>
\n-
\n-
131 static constexpr std::size_t value()
\n-
\n-
133 using V = MultiTypeBlockVector<Args...>;
\n-
134 constexpr auto min = [](
const auto & a,
const auto & b){
return std::min(a,b); };
\n-
135 return blockLevelMultiTypeBlockVector<V, MinBlockLevel>(min);
\n-
\n-
\n-
\n-
\n-
\n-
141 struct MaxBlockLevel<
Dune ::MultiTypeBlockVector<>>
\n-
\n-
143 static constexpr std::size_t value()
\n-
\n-
\n-
\n-
\n-
\n-
149 struct MinBlockLevel<
Dune ::MultiTypeBlockVector<>>
\n-
\n-
151 static constexpr std::size_t value()
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
162 {
return Impl::MaxBlockLevel<T>::value(); }
\n-
\n-
\n-
\n-
\n-
\n-
167 {
return Impl::MinBlockLevel<T>::value(); }
\n+
29 template <
class T,
class A>
\n+
\n+
\n+
\n+
46 template <
class Matrix, std::
size_t blocklevel, std::
size_t l=blocklevel>
\n+
\n+
\n+
\n+
\n+
\n+
\n+
55 #ifdef DUNE_ISTL_WITH_CHECKING \n+
\n+
\n+
58 for (Row row =
mat .begin(); row!=
mat .end(); ++row) {
\n+
59 Entry diagonal = row->find(row.index());
\n+
60 if (diagonal==row->end())
\n+
61 DUNE_THROW(
ISTLError ,
"Missing diagonal value in row " <<row.index()
\n+
62 <<
" at block recursion level " <<l-blocklevel);
\n+
\n+
64 auto m = Impl::asMatrix(*diagonal);
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n
\n+
\n+
72 template <
class Matrix, std::
size_t l>
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
78 for (Row row =
mat .begin(); row!=
mat .end(); ++row) {
\n+
79 if (row->find(row.index())==row->end())
\n+
80 DUNE_THROW(
ISTLError ,
"Missing diagonal value in row " <<row.index()
\n+
81 <<
" at block recursion level " <<l);
\n+
\n+
\n+
\n+
\n+
\n+
\n+
86 template <
typename FirstRow,
typename ... Args>
\n+
87 class MultiTypeBlockMatrix;
\n+
\n+
89 template <std::size_t blocklevel, std::size_t l,
typename T1,
typename ... Args>
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
101 #ifdef DUNE_ISTL_WITH_CHECKING \n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
120 [[maybe_unused]]
typename std::enable_if_t<Dune::IsNumber<M>::value>* sfinae =
nullptr )
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
127 [[maybe_unused]]
typename std::enable_if_t<!Dune::IsNumber<M>::value>* sfinae =
nullptr )
\n+
\n+
129 typename M::size_type nonZeros = 0;
\n+
130 for (
auto && row : matrix)
\n+
131 for (
auto && entry : row)
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
145 template <
class G,
class M>
\n+
146 bool operator()(
const std::pair<G,M>& p1,
const std::pair<G,M>& p2)
const \n+
\n+
148 return p1.first<p2.first;
\n+
\n+
\n+
\n+
\n+
153 template <
class M,
class C>
\n+
\n+
\n+
\n+
156 typedef typename C::ParallelIndexSet::const_iterator IIter;
\n+
157 typedef typename C::OwnerSet OwnerSet;
\n+
158 typedef typename C::ParallelIndexSet::GlobalIndex GlobalIndex;
\n+
\n+
\n+
\n+
162 for (IIter idx=ooc.indexSet().begin(), eidx=ooc.indexSet().end();
\n+
\n+
164 gmax=std::max(gmax,idx->global());
\n+
\n+
166 gmax=ooc.communicator().max(gmax);
\n+
167 ooc.buildGlobalLookup();
\n
\n-
\n-
\n-
\n-
172 {
return maxBlockLevel<T>() == minBlockLevel<T>(); }
\n-
\n-
\n-
\n-
\n-
\n-
\n-
178 static_assert (hasUniqueBlockLevel<T>(),
"Block level cannot be uniquely determined!" );
\n-
179 return Impl::MaxBlockLevel<T>::value();
\n-
\n-
\n-
\n-
\n-
\n-
\n+
169 for (IIter idx=ooc.indexSet().begin(), eidx=ooc.indexSet().end();
\n+
\n+
171 if (OwnerSet::contains(idx->local().attribute()))
\n+
\n+
173 typedef typename M::block_type Block;
\n+
\n+
175 std::set<std::pair<GlobalIndex,Block>,CompPair> entries;
\n+
\n+
\n+
178 typedef typename M::ConstColIterator CIter;
\n+
179 for (CIter c=
mat [idx->local()].
begin (), cend=
mat [idx->local()].
end ();
\n+
\n+
181 const typename C::ParallelIndexSet::IndexPair* pair
\n+
182 =ooc.globalLookup().pair(c.index());
\n+
\n+
184 entries.insert(std::make_pair(pair->global(), *c));
\n+
\n+
\n+
\n+
188 GlobalIndex rowidx = idx->global();
\n+
189 GlobalIndex cur=std::numeric_limits<GlobalIndex>::max();
\n+
\n+
191 cur=ooc.communicator().min(rowidx);
\n+
\n+
\n+
194 typedef typename std::set<std::pair<GlobalIndex,Block>,CompPair>::iterator SIter;
\n+
195 for (SIter s=entries.begin(), send=entries.end(); s!=send; ++s)
\n+
196 os<<idx->global()<<
" " <<s->first<<
" " <<s->second<<std::endl;
\n+
\n+
\n+
\n+
\n+
\n+
202 ooc.freeGlobalLookup();
\n+
\n+
204 GlobalIndex cur=std::numeric_limits<GlobalIndex>::max();
\n+
205 while (cur!=ooc.communicator().min(cur)) ;
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
212 static_assert (IsNumber<M>::value,
"MatrixDimension is not implemented for this type!" );
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
226 template <
typename B,
typename TA>
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
260 template <
typename B,
typename TA>
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
269 const B* row = A.r[i].getptr();
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
282 if (A.j_.get()[k] == c) {
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
292 B* a = A.r[i].getptr();
\n+
293 for (
size_type k=0; k<A.r[i].getsize(); k++)
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
318 std::vector<size_type> coldims(A.M(),
\n+
319 std::numeric_limits<size_type>::max());
\n+
\n+
321 for (ConstRowIterator row=A.begin(); row!=A.end(); ++row)
\n+
322 for (ConstColIterator
col =row->begin();
col !=row->end(); ++
col )
\n+
\n+
324 if (coldims[
col .index()]==std::numeric_limits<size_type>::max())
\n+
\n+
\n+
\n+
328 for (
typename std::vector<size_type>::iterator it=coldims.begin();
\n+
329 it!=coldims.end(); ++it)
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
339 template <
typename B,
int n,
int m,
typename TA>
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
364 template <
typename K,
int n,
int m>
\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+
418 template <
typename K,
int n,
int m,
typename TA>
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
445 template <
typename K,
int n>
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
472 template <
typename K,
int 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+
525 template <
typename T,
typename A>
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
This file implements a quadratic matrix of fixed size which is a multiple of the identity.
\n+
Col col
Definition matrixmatrix.hh:351
\n+
Matrix & mat
Definition matrixmatrix.hh:347
\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
Definition allocator.hh:11
\n-
constexpr bool hasUniqueBlockLevel()
Determine if a vector/matrix has a uniquely determinable block level.
Definition blocklevel.hh:171
\n-
constexpr std::size_t maxBlockLevel()
Determine the maximum block level of a possibly nested vector/matrix type.
Definition blocklevel.hh:161
\n-
constexpr std::size_t blockLevel()
Determine the block level of a possibly nested vector/matrix type.
Definition blocklevel.hh:176
\n-
constexpr std::size_t minBlockLevel()
Determine the minimum block level of a possibly nested vector/matrix type.
Definition blocklevel.hh:166
\n+
void printGlobalSparseMatrix(const M &mat, C &ooc, std::ostream &os)
Definition matrixutils.hh:154
\n+
Definition matrixutils.hh:211
\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:500
\n+
row_type::ConstIterator ConstColIterator
Const iterator to the entries of a row.
Definition bcrsmatrix.hh:741
\n+
B block_type
export the type representing the components
Definition bcrsmatrix.hh:491
\n+
Iterator access to matrix rows
Definition bcrsmatrix.hh:579
\n+
A Matrix class to support different block types.
Definition multitypeblockmatrix.hh:46
\n+
derive error class from the base class in common
Definition istlexception.hh:19
\n+
ConstIterator class for sequential access.
Definition matrix.hh:404
\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+
RowIterator end()
Get iterator to one beyond last row.
Definition matrix.hh:620
\n+
RowIterator begin()
Get iterator to first row.
Definition matrix.hh:614
\n+
row_type::const_iterator ConstColIterator
Const iterator for the entries of each row.
Definition matrix.hh:589
\n+
T block_type
Export the type representing the components.
Definition matrix.hh:568
\n+
Definition matrixutils.hh:27
\n+
Check whether the a matrix has diagonal values on blocklevel recursion levels.
Definition matrixutils.hh:48
\n+
static void check(const Matrix &mat)
Check whether the a matrix has diagonal values on blocklevel recursion levels.
Definition matrixutils.hh:53
\n+
static void check(const Matrix &mat)
Definition matrixutils.hh:75
\n+
static void check(const Matrix &)
Check whether the a matrix has diagonal values on blocklevel recursion levels.
Definition matrixutils.hh:99
\n+
MultiTypeBlockMatrix< T1, Args... > Matrix
Definition matrixutils.hh:93
\n+
static size_type rowdim(const Matrix< B, TA > &A, size_type i)
Definition matrixutils.hh:232
\n+
static size_type coldim(const Matrix< B, TA > &A)
Definition matrixutils.hh:250
\n+
static size_type rowdim(const Matrix< B, TA > &A)
Definition matrixutils.hh:242
\n+
typename Matrix< B, TA >::size_type size_type
Definition matrixutils.hh:230
\n+
static size_type coldim(const Matrix< B, TA > &A, size_type c)
Definition matrixutils.hh:237
\n+
typename Matrix< B, TA >::block_type block_type
Definition matrixutils.hh:229
\n+
BCRSMatrix< B, TA > Matrix
Definition matrixutils.hh:263
\n+
static size_type coldim(const Matrix &A)
Definition matrixutils.hh:311
\n+
Matrix::block_type block_type
Definition matrixutils.hh:264
\n+
static size_type coldim(const Matrix &A, size_type c)
Definition matrixutils.hh:276
\n+
Matrix::size_type size_type
Definition matrixutils.hh:265
\n+
static size_type rowdim(const Matrix &A, size_type i)
Definition matrixutils.hh:267
\n+
static size_type rowdim(const Matrix &A)
Definition matrixutils.hh:304
\n+
static size_type coldim(const Matrix &A)
Definition matrixutils.hh:359
\n+
static size_type rowdim(const Matrix &, size_type)
Definition matrixutils.hh:345
\n+
static size_type rowdim(const Matrix &A)
Definition matrixutils.hh:355
\n+
Matrix::size_type size_type
Definition matrixutils.hh:343
\n+
BCRSMatrix< FieldMatrix< B, n, m >,TA > Matrix
Definition matrixutils.hh:342
\n+
static size_type coldim(const Matrix &, size_type)
Definition matrixutils.hh:350
\n+
static size_type rowdim(const Matrix &, size_type)
Definition matrixutils.hh:370
\n+
static size_type coldim(const Matrix &)
Definition matrixutils.hh:385
\n+
Matrix::size_type size_type
Definition matrixutils.hh:368
\n+
FieldMatrix< K, n, m > Matrix
Definition matrixutils.hh:367
\n+
static size_type coldim(const Matrix &, size_type)
Definition matrixutils.hh:375
\n+
static size_type rowdim(const Matrix &)
Definition matrixutils.hh:380
\n+
static size_type coldim(const MatrixType &A)
Definition matrixutils.hh:412
\n+
static size_type rowdim(const MatrixType &A)
Definition matrixutils.hh:407
\n+
static size_type rowdim(const MatrixType &, size_type)
Definition matrixutils.hh:397
\n+
MatrixType::size_type size_type
Definition matrixutils.hh:395
\n+
static size_type coldim(const MatrixType &, size_type)
Definition matrixutils.hh:402
\n+
Dune::DynamicMatrix< T > MatrixType
Definition matrixutils.hh:394
\n+
static size_type coldim(const ThisMatrix &A)
Definition matrixutils.hh:439
\n+
static size_type rowdim(const ThisMatrix &A)
Definition matrixutils.hh:434
\n+
Matrix< FieldMatrix< K, n, m >, TA > ThisMatrix
Definition matrixutils.hh:421
\n+
static size_type coldim(const ThisMatrix &, size_type)
Definition matrixutils.hh:429
\n+
static size_type rowdim(const ThisMatrix &, size_type)
Definition matrixutils.hh:424
\n+
ThisMatrix::size_type size_type
Definition matrixutils.hh:422
\n+
static size_type coldim(const Matrix &, size_type)
Definition matrixutils.hh:456
\n+
Matrix::size_type size_type
Definition matrixutils.hh:449
\n+
static size_type coldim(const Matrix &)
Definition matrixutils.hh:466
\n+
static size_type rowdim(const Matrix &)
Definition matrixutils.hh:461
\n+
DiagonalMatrix< K, n > Matrix
Definition matrixutils.hh:448
\n+
static size_type rowdim(const Matrix &, size_type)
Definition matrixutils.hh:451
\n+
static size_type coldim(const Matrix &)
Definition matrixutils.hh:493
\n+
static size_type rowdim(const Matrix &, size_type)
Definition matrixutils.hh:478
\n+
static size_type coldim(const Matrix &, size_type)
Definition matrixutils.hh:483
\n+
Matrix::size_type size_type
Definition matrixutils.hh:476
\n+
ScaledIdentityMatrix< K, n > Matrix
Definition matrixutils.hh:475
\n+
static size_type rowdim(const Matrix &)
Definition matrixutils.hh:488
\n+
Test whether a type is an ISTL Matrix.
Definition matrixutils.hh:504
\n+
@ value
True if T is an ISTL matrix.
Definition matrixutils.hh:509
\n+
Definition matrixutils.hh:538
\n+
bool operator()(const T *l, const T *r)
Definition matrixutils.hh:539
\n+
A multiple of the identity matrix of static size.
Definition scaledidmatrix.hh:30
\n+
std::size_t size_type
The type used for the index access and size operations.
Definition scaledidmatrix.hh:43
\n
\n \n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,207 +1,782 @@\n dune-istl\u00a02.9.0\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bi_\bs_\bt_\bl\n-blocklevel.hh\n+matrixutils.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 (C) 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\n-6#ifndef DUNE_ISTL_BLOCKLEVEL_HH\n-7#define DUNE_ISTL_BLOCKLEVEL_HH\n-8\n-9#include
\n-10#include \n-11\n-12#include \n-13#include \n-14#include \n-15\n-21// forward declaration\n-22namespace _\bD_\bu_\bn_\be {\n-23template\n-24class MultiTypeBlockVector;\n-25template\n-26class MultiTypeBlockMatrix;\n-27} // end namespace Dune\n+5#ifndef DUNE_ISTL_MATRIXUTILS_HH\n+6#define DUNE_ISTL_MATRIXUTILS_HH\n+7\n+8#include \n+9#include \n+10#include \n+11#include \n+12#include \n+13#include \n+14#include \n+15#include \n+16#include <_\bd_\bu_\bn_\be_\b/_\bi_\bs_\bt_\bl_\b/_\bs_\bc_\ba_\bl_\be_\bd_\bi_\bd_\bm_\ba_\bt_\br_\bi_\bx_\b._\bh_\bh>\n+17#include \"_\bi_\bs_\bt_\bl_\be_\bx_\bc_\be_\bp_\bt_\bi_\bo_\bn_\b._\bh_\bh\"\n+18\n+19namespace _\bD_\bu_\bn_\be\n+20{\n+21\n+22#ifndef DOYXGEN\n+23 template\n+24 class BCRSMatrix;\n+25\n+26 template\n+_\b2_\b7 class _\bF_\bi_\be_\bl_\bd_\bM_\ba_\bt_\br_\bi_\bx;\n 28\n-29namespace _\bD_\bu_\bn_\be { namespace Impl {\n-30\n-31// forward declaration\n-32template struct MaxBlockLevel;\n-33template struct MinBlockLevel;\n-34\n-36template typename BlockLevel, typename Op>\n-37constexpr std::size_t blockLevelMultiTypeBlockMatrix(const Op& op)\n-38{\n-39 // inialize with zeroth diagonal block\n-40 using namespace Dune::Indices;\n-41 using Block00 = typename std::decay_t()[_0][_0])>;\n-42 std::size_t _\bb_\bl_\bo_\bc_\bk_\bL_\be_\bv_\be_\bl = BlockLevel::value() + 1;\n-43 // iterate over all blocks to determine min/max block level\n-44 using namespace Dune::Hybrid;\n-45 forEach(integralRange(index_constant()), [&](auto&& i) {\n-46 using namespace Dune::Hybrid; // needed for icc, see issue #31\n-47 forEach(integralRange(index_constant()), [&](auto&& j) {\n-48 using Block = typename std::decay_t()[i][j])>;\n-49 _\bb_\bl_\bo_\bc_\bk_\bL_\be_\bv_\be_\bl = op(_\bb_\bl_\bo_\bc_\bk_\bL_\be_\bv_\be_\bl, BlockLevel::value() + 1);\n-50 });\n-51 });\n-52 return _\bb_\bl_\bo_\bc_\bk_\bL_\be_\bv_\be_\bl;\n-53}\n-54\n-56template typename BlockLevel, typename Op>\n-57constexpr std::size_t blockLevelMultiTypeBlockVector(const Op& op)\n-58{\n-59 // inialize with zeroth block\n-60 using namespace Dune::Indices;\n-61 using Block0 = typename std::decay_t()[_0])>;\n-62 std::size_t _\bb_\bl_\bo_\bc_\bk_\bL_\be_\bv_\be_\bl = BlockLevel::value() + 1;\n-63 // iterate over all blocks to determine min/max block level\n-64 using namespace Dune::Hybrid;\n-65 forEach(integralRange(index_constant()), [&](auto&& i) {\n-66 using Block = typename std::decay_t()[i])>;\n-67 _\bb_\bl_\bo_\bc_\bk_\bL_\be_\bv_\be_\bl = op(_\bb_\bl_\bo_\bc_\bk_\bL_\be_\bv_\be_\bl, BlockLevel::value() + 1);\n-68 });\n-69 return _\bb_\bl_\bo_\bc_\bk_\bL_\be_\bv_\be_\bl;\n-70}\n+29 template\n+30 class _\bM_\ba_\bt_\br_\bi_\bx;\n+31#endif\n+32\n+46 template\n+_\b4_\b7 struct _\bC_\bh_\be_\bc_\bk_\bI_\bf_\bD_\bi_\ba_\bg_\bo_\bn_\ba_\bl_\bP_\br_\be_\bs_\be_\bn_\bt\n+48 {\n+_\b5_\b3 static void _\bc_\bh_\be_\bc_\bk([[maybe_unused]] const _\bM_\ba_\bt_\br_\bi_\bx& _\bm_\ba_\bt)\n+54 {\n+55#ifdef DUNE_ISTL_WITH_CHECKING\n+56 typedef typename _\bM_\ba_\bt_\br_\bi_\bx_\b:_\b:_\bC_\bo_\bn_\bs_\bt_\bR_\bo_\bw_\bI_\bt_\be_\br_\ba_\bt_\bo_\br Row;\n+57 typedef typename _\bM_\ba_\bt_\br_\bi_\bx_\b:_\b:_\bC_\bo_\bn_\bs_\bt_\bC_\bo_\bl_\bI_\bt_\be_\br_\ba_\bt_\bo_\br Entry;\n+58 for(Row row = _\bm_\ba_\bt.begin(); row!=_\bm_\ba_\bt.end(); ++row) {\n+59 Entry diagonal = row->find(row.index());\n+60 if(diagonal==row->end())\n+61 DUNE_THROW(_\bI_\bS_\bT_\bL_\bE_\br_\br_\bo_\br, \"Missing diagonal value in row \"<_\b:_\b:_\bc_\bh_\be_\bc_\bk(m);\n+66 }\n+67 }\n+68#endif\n+69 }\n+70 };\n 71\n-72template\n-73struct MaxBlockLevel\n-74{\n-75 static constexpr std::size_t value(){\n-76 if constexpr (IsNumber::value)\n-77 return 0;\n-78 else\n-79 return MaxBlockLevel::value() + 1;\n-80 }\n-81};\n-82\n-83template\n-84struct MinBlockLevel\n-85{\n-86 // the default implementation assumes minBlockLevel == maxBlockLevel\n-87 static constexpr std::size_t value()\n-88 { return MaxBlockLevel::value(); }\n-89};\n-90\n-91// max block level for MultiTypeBlockMatrix\n-92template\n-93struct MaxBlockLevel<_\bD_\bu_\bn_\be::MultiTypeBlockMatrix>\n-94{\n-95 static constexpr std::size_t value()\n-96 {\n-97 using M = MultiTypeBlockMatrix;\n-98 constexpr auto max = [](const auto& a, const auto& b){ return std::max(a,b);\n-};\n-99 return blockLevelMultiTypeBlockMatrix(max);\n-100 }\n-101};\n-102\n-103// min block level for MultiTypeBlockMatrix\n-104template\n-105struct MinBlockLevel<_\bD_\bu_\bn_\be::MultiTypeBlockMatrix>\n-106{\n-107 static constexpr std::size_t value()\n-108 {\n-109 using M = MultiTypeBlockMatrix;\n-110 constexpr auto min = [](const auto& a, const auto& b){ return std::min\n-(a,b); };\n-111 return blockLevelMultiTypeBlockMatrix(min);\n-112 }\n-113};\n-114\n-115// max block level for MultiTypeBlockVector\n-116template\n-117struct MaxBlockLevel<_\bD_\bu_\bn_\be::MultiTypeBlockVector>\n-118{\n-119 static constexpr std::size_t value()\n-120 {\n-121 using V = MultiTypeBlockVector;\n-122 constexpr auto max = [](const auto& a, const auto& b){ return std::max\n-(a,b); };\n-123 return blockLevelMultiTypeBlockVector(max);\n-124 }\n-125};\n-126\n-127// min block level for MultiTypeBlockVector\n-128template\n-129struct MinBlockLevel<_\bD_\bu_\bn_\be::MultiTypeBlockVector>\n-130{\n-131 static constexpr std::size_t value()\n-132 {\n-133 using V = MultiTypeBlockVector;\n-134 constexpr auto min = [](const auto& a, const auto& b){ return std::min\n-(a,b); };\n-135 return blockLevelMultiTypeBlockVector(min);\n-136 }\n-137};\n-138\n-139// special case: empty MultiTypeBlockVector\n-140template<>\n-141struct MaxBlockLevel<_\bD_\bu_\bn_\be::MultiTypeBlockVector<>>\n-142{\n-143 static constexpr std::size_t value()\n-144 { return 0; };\n-145};\n-146\n-147// special case: empty MultiTypeBlockVector\n-148template<>\n-149struct MinBlockLevel<_\bD_\bu_\bn_\be::MultiTypeBlockVector<>>\n-150{\n-151 static constexpr std::size_t value()\n-152 { return 0; };\n-153};\n-154\n-155}} // end namespace Dune::Impl\n-156\n-157namespace _\bD_\bu_\bn_\be {\n-158\n-160template\n-_\b1_\b6_\b1constexpr std::size_t _\bm_\ba_\bx_\bB_\bl_\bo_\bc_\bk_\bL_\be_\bv_\be_\bl()\n-162{ return Impl::MaxBlockLevel::value(); }\n-163\n-165template\n-_\b1_\b6_\b6constexpr std::size_t _\bm_\bi_\bn_\bB_\bl_\bo_\bc_\bk_\bL_\be_\bv_\be_\bl()\n-167{ return Impl::MinBlockLevel::value(); }\n+72 template\n+_\b7_\b3 struct _\bC_\bh_\be_\bc_\bk_\bI_\bf_\bD_\bi_\ba_\bg_\bo_\bn_\ba_\bl_\bP_\br_\be_\bs_\be_\bn_\bt<_\bM_\ba_\bt_\br_\bi_\bx,0,l>\n+74 {\n+_\b7_\b5 static void _\bc_\bh_\be_\bc_\bk(const _\bM_\ba_\bt_\br_\bi_\bx& _\bm_\ba_\bt)\n+76 {\n+77 typedef typename _\bM_\ba_\bt_\br_\bi_\bx_\b:_\b:_\bC_\bo_\bn_\bs_\bt_\bR_\bo_\bw_\bI_\bt_\be_\br_\ba_\bt_\bo_\br Row;\n+78 for(Row row = _\bm_\ba_\bt.begin(); row!=_\bm_\ba_\bt.end(); ++row) {\n+79 if(row->find(row.index())==row->end())\n+80 DUNE_THROW(_\bI_\bS_\bT_\bL_\bE_\br_\br_\bo_\br, \"Missing diagonal value in row \"<\n+87 class MultiTypeBlockMatrix;\n+88\n+89 template\n+_\b9_\b0 struct _\bC_\bh_\be_\bc_\bk_\bI_\bf_\bD_\bi_\ba_\bg_\bo_\bn_\ba_\bl_\bP_\br_\be_\bs_\be_\bn_\bt<_\bM_\bu_\bl_\bt_\bi_\bT_\by_\bp_\be_\bB_\bl_\bo_\bc_\bk_\bM_\ba_\bt_\br_\bi_\bx,\n+91 blocklevel,l>\n+92 {\n+_\b9_\b3 typedef _\bM_\bu_\bl_\bt_\bi_\bT_\by_\bp_\be_\bB_\bl_\bo_\bc_\bk_\bM_\ba_\bt_\br_\bi_\bx _\bM_\ba_\bt_\br_\bi_\bx;\n+94\n+_\b9_\b9 static void _\bc_\bh_\be_\bc_\bk(const _\bM_\ba_\bt_\br_\bi_\bx& /* mat */)\n+100 {\n+101#ifdef DUNE_ISTL_WITH_CHECKING\n+102 // TODO Implement check\n+103#endif\n+104 }\n+105 };\n+106\n+118 template\n+_\b1_\b1_\b9 inline auto _\bc_\bo_\bu_\bn_\bt_\bN_\bo_\bn_\bZ_\be_\br_\bo_\bs(const M&,\n+120 [[maybe_unused]] typename std::enable_if_t::value>*\n+sfinae = nullptr)\n+121 {\n+122 return 1;\n+123 }\n+124\n+125 template\n+_\b1_\b2_\b6 inline auto _\bc_\bo_\bu_\bn_\bt_\bN_\bo_\bn_\bZ_\be_\br_\bo_\bs(const M& matrix,\n+127 [[maybe_unused]] typename std::enable_if_t::value>*\n+sfinae = nullptr)\n+128 {\n+129 typename M::size_type nonZeros = 0;\n+130 for(auto&& row : matrix)\n+131 for(auto&& entry : row)\n+132 nonZeros += _\bc_\bo_\bu_\bn_\bt_\bN_\bo_\bn_\bZ_\be_\br_\bo_\bs(entry);\n+133 return nonZeros;\n+134 }\n+135\n+136 /*\n+137 template\n+138 struct ProcessOnFieldsOfMatrix\n+139 */\n+140\n+142 namespace\n+143 {\n+144 struct CompPair {\n+145 template\n+146 bool operator()(const std::pair& p1, const std::pair& p2) const\n+147 {\n+148 return p1.first\n+_\b1_\b5_\b4 void _\bp_\br_\bi_\bn_\bt_\bG_\bl_\bo_\bb_\ba_\bl_\bS_\bp_\ba_\br_\bs_\be_\bM_\ba_\bt_\br_\bi_\bx(const M& _\bm_\ba_\bt, C& ooc, std::ostream& os)\n+155 {\n+156 typedef typename C::ParallelIndexSet::const_iterator IIter;\n+157 typedef typename C::OwnerSet OwnerSet;\n+158 typedef typename C::ParallelIndexSet::GlobalIndex GlobalIndex;\n+159\n+160 GlobalIndex gmax=0;\n+161\n+162 for(IIter idx=ooc.indexSet().begin(), eidx=ooc.indexSet().end();\n+163 idx!=eidx; ++idx)\n+164 gmax=std::max(gmax,idx->global());\n+165\n+166 gmax=ooc.communicator().max(gmax);\n+167 ooc.buildGlobalLookup();\n 168\n-170template\n-_\b1_\b7_\b1constexpr bool _\bh_\ba_\bs_\bU_\bn_\bi_\bq_\bu_\be_\bB_\bl_\bo_\bc_\bk_\bL_\be_\bv_\be_\bl()\n-172{ return maxBlockLevel() == minBlockLevel(); }\n-173\n-175template\n-_\b1_\b7_\b6constexpr std::size_t _\bb_\bl_\bo_\bc_\bk_\bL_\be_\bv_\be_\bl()\n-177{\n-178 static_assert(hasUniqueBlockLevel(), \"Block level cannot be uniquely\n-determined!\");\n-179 return Impl::MaxBlockLevel::value();\n-180}\n-181\n-182} // end namespace Dune\n-183\n-184#endif\n+169 for(IIter idx=ooc.indexSet().begin(), eidx=ooc.indexSet().end();\n+170 idx!=eidx; ++idx) {\n+171 if(OwnerSet::contains(idx->local().attribute()))\n+172 {\n+173 typedef typename M::block_type Block;\n+174\n+175 std::set,CompPair> entries;\n+176\n+177 // sort rows\n+178 typedef typename M::ConstColIterator CIter;\n+179 for(CIter c=_\bm_\ba_\bt[idx->local()]._\bb_\be_\bg_\bi_\bn(), cend=_\bm_\ba_\bt[idx->local()]._\be_\bn_\bd();\n+180 c!=cend; ++c) {\n+181 const typename C::ParallelIndexSet::IndexPair* pair\n+182 =ooc.globalLookup().pair(c.index());\n+183 assert(pair);\n+184 entries.insert(std::make_pair(pair->global(), *c));\n+185 }\n+186\n+187 //wait until its the rows turn.\n+188 GlobalIndex rowidx = idx->global();\n+189 GlobalIndex cur=std::numeric_limits::max();\n+190 while(cur!=rowidx)\n+191 cur=ooc.communicator().min(rowidx);\n+192\n+193 // print rows\n+194 typedef typename std::set,CompPair>::iterator\n+SIter;\n+195 for(SIter s=entries.begin(), send=entries.end(); s!=send; ++s)\n+196 os<global()<<\" \"<first<<\" \"<second<::max();\n+205 while(cur!=ooc.communicator().min(cur)) ;\n+206 }\n+207\n+208 // Default implementation for scalar types\n+209 template\n+_\b2_\b1_\b0 struct _\bM_\ba_\bt_\br_\bi_\bx_\bD_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn\n+211 {\n+212 static_assert(IsNumber::value, \"MatrixDimension is not implemented for\n+this type!\");\n+213\n+_\b2_\b1_\b4 static auto _\br_\bo_\bw_\bd_\bi_\bm(const M& A)\n+215 {\n+216 return 1;\n+217 }\n+218\n+_\b2_\b1_\b9 static auto _\bc_\bo_\bl_\bd_\bi_\bm(const M& A)\n+220 {\n+221 return 1;\n+222 }\n+223 };\n+224\n+225 // Default implementation for scalar types\n+226 template\n+_\b2_\b2_\b7 struct _\bM_\ba_\bt_\br_\bi_\bx_\bD_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn<_\bM_\ba_\bt_\br_\bi_\bx >\n+228 {\n+_\b2_\b2_\b9 using _\bb_\bl_\bo_\bc_\bk_\b__\bt_\by_\bp_\be = typename _\bM_\ba_\bt_\br_\bi_\bx_\b<_\bB_\b,_\bT_\bA_\b>_\b:_\b:_\bb_\bl_\bo_\bc_\bk_\b__\bt_\by_\bp_\be;\n+_\b2_\b3_\b0 using _\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be = typename _\bM_\ba_\bt_\br_\bi_\bx_\b<_\bB_\b,_\bT_\bA_\b>_\b:_\b:_\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be;\n+231\n+_\b2_\b3_\b2 static _\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be _\br_\bo_\bw_\bd_\bi_\bm (const _\bM_\ba_\bt_\br_\bi_\bx_\b<_\bB_\b,_\bT_\bA_\b>& A, _\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be i)\n+233 {\n+234 return _\bM_\ba_\bt_\br_\bi_\bx_\bD_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b<_\bb_\bl_\bo_\bc_\bk_\b__\bt_\by_\bp_\be_\b>_\b:_\b:_\br_\bo_\bw_\bd_\bi_\bm(A[i][0]);\n+235 }\n+236\n+_\b2_\b3_\b7 static _\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be _\bc_\bo_\bl_\bd_\bi_\bm (const _\bM_\ba_\bt_\br_\bi_\bx_\b<_\bB_\b,_\bT_\bA_\b>& A, _\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be c)\n+238 {\n+239 return _\bM_\ba_\bt_\br_\bi_\bx_\bD_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b<_\bb_\bl_\bo_\bc_\bk_\b__\bt_\by_\bp_\be_\b>_\b:_\b:_\bc_\bo_\bl_\bd_\bi_\bm(A[0][c]);\n+240 }\n+241\n+_\b2_\b4_\b2 static _\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be _\br_\bo_\bw_\bd_\bi_\bm (const _\bM_\ba_\bt_\br_\bi_\bx_\b<_\bB_\b,_\bT_\bA_\b>& A)\n+243 {\n+244 _\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be nn=0;\n+245 for (_\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be i=0; i& A)\n+251 {\n+252 _\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be nn=0;\n+253 for (_\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be i=0; i\n+_\b2_\b6_\b1 struct _\bM_\ba_\bt_\br_\bi_\bx_\bD_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn<_\bB_\bC_\bR_\bS_\bM_\ba_\bt_\br_\bi_\bx >\n+262 {\n+_\b2_\b6_\b3 typedef _\bB_\bC_\bR_\bS_\bM_\ba_\bt_\br_\bi_\bx_\b<_\bB_\b,_\bT_\bA_\b> _\bM_\ba_\bt_\br_\bi_\bx;\n+_\b2_\b6_\b4 typedef typename _\bM_\ba_\bt_\br_\bi_\bx_\b:_\b:_\bb_\bl_\bo_\bc_\bk_\b__\bt_\by_\bp_\be _\bb_\bl_\bo_\bc_\bk_\b__\bt_\by_\bp_\be;\n+_\b2_\b6_\b5 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+266\n+_\b2_\b6_\b7 static _\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be _\br_\bo_\bw_\bd_\bi_\bm (const _\bM_\ba_\bt_\br_\bi_\bx& A, _\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be i)\n+268 {\n+269 const B* row = A.r[i].getptr();\n+270 if(row)\n+271 return _\bM_\ba_\bt_\br_\bi_\bx_\bD_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b<_\bb_\bl_\bo_\bc_\bk_\b__\bt_\by_\bp_\be_\b>_\b:_\b:_\br_\bo_\bw_\bd_\bi_\bm(*row);\n+272 else\n+273 return 0;\n+274 }\n+275\n+_\b2_\b7_\b6 static _\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be _\bc_\bo_\bl_\bd_\bi_\bm (const _\bM_\ba_\bt_\br_\bi_\bx& A, _\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be c)\n+277 {\n+278 // find an entry in column c\n+279 if (A.nnz_ > 0)\n+280 {\n+281 for (_\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be k=0; k_\b:_\b:_\bc_\bo_\bl_\bd_\bi_\bm(A.a[k]);\n+284 }\n+285 }\n+286 }\n+287 else\n+288 {\n+289 for (_\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be i=0; i_\b:_\b:_\bc_\bo_\bl_\bd_\bi_\bm(a[k]);\n+296 }\n+297 }\n+298 }\n+299\n+300 // not found\n+301 return 0;\n+302 }\n+303\n+_\b3_\b0_\b4 static _\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be _\br_\bo_\bw_\bd_\bi_\bm (const _\bM_\ba_\bt_\br_\bi_\bx& A){\n+305 _\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be nn=0;\n+306 for (_\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be i=0; i coldims(A.M(),\n+319 std::numeric_limits::max());\n+320\n+321 for (ConstRowIterator row=A.begin(); row!=A.end(); ++row)\n+322 for (ConstColIterator _\bc_\bo_\bl=row->begin(); _\bc_\bo_\bl!=row->end(); ++_\bc_\bo_\bl)\n+323 // only compute blocksizes we don't already have\n+324 if (coldims[_\bc_\bo_\bl.index()]==std::numeric_limits::max())\n+325 coldims[_\bc_\bo_\bl.index()] = _\bM_\ba_\bt_\br_\bi_\bx_\bD_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b<_\bb_\bl_\bo_\bc_\bk_\b__\bt_\by_\bp_\be_\b>_\b:_\b:_\bc_\bo_\bl_\bd_\bi_\bm(*_\bc_\bo_\bl);\n+326\n+327 _\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be sum = 0;\n+328 for (typename std::vector::iterator it=coldims.begin();\n+329 it!=coldims.end(); ++it)\n+330 // skip rows for which no coldim could be determined\n+331 if ((*it)>=0)\n+332 sum += *it;\n+333\n+334 return sum;\n+335 }\n+336 };\n+337\n+338\n+339 template\n+_\b3_\b4_\b0 struct _\bM_\ba_\bt_\br_\bi_\bx_\bD_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn<_\bB_\bC_\bR_\bS_\bM_\ba_\bt_\br_\bi_\bx<_\bF_\bi_\be_\bl_\bd_\bM_\ba_\bt_\br_\bi_\bx ,TA> >\n+341 {\n+_\b3_\b4_\b2 typedef _\bB_\bC_\bR_\bS_\bM_\ba_\bt_\br_\bi_\bx_\b<_\bF_\bi_\be_\bl_\bd_\bM_\ba_\bt_\br_\bi_\bx_\b<_\bB_\b,_\bn_\b,_\bm_\b> ,TA> _\bM_\ba_\bt_\br_\bi_\bx;\n+_\b3_\b4_\b3 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+344\n+_\b3_\b4_\b5 static _\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be _\br_\bo_\bw_\bd_\bi_\bm (const _\bM_\ba_\bt_\br_\bi_\bx& /*A*/, _\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be /*i*/)\n+346 {\n+347 return n;\n+348 }\n+349\n+_\b3_\b5_\b0 static _\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be _\bc_\bo_\bl_\bd_\bi_\bm (const _\bM_\ba_\bt_\br_\bi_\bx& /*A*/, _\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be /*c*/)\n+351 {\n+352 return m;\n+353 }\n+354\n+_\b3_\b5_\b5 static _\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be _\br_\bo_\bw_\bd_\bi_\bm (const _\bM_\ba_\bt_\br_\bi_\bx& A) {\n+356 return A.N()*n;\n+357 }\n+358\n+_\b3_\b5_\b9 static _\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be _\bc_\bo_\bl_\bd_\bi_\bm (const _\bM_\ba_\bt_\br_\bi_\bx& A) {\n+360 return A.M()*m;\n+361 }\n+362 };\n+363\n+364 template\n+_\b3_\b6_\b5 struct _\bM_\ba_\bt_\br_\bi_\bx_\bD_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn<_\bF_\bi_\be_\bl_\bd_\bM_\ba_\bt_\br_\bi_\bx >\n+366 {\n+_\b3_\b6_\b7 typedef _\bF_\bi_\be_\bl_\bd_\bM_\ba_\bt_\br_\bi_\bx_\b<_\bK_\b,_\bn_\b,_\bm_\b> _\bM_\ba_\bt_\br_\bi_\bx;\n+_\b3_\b6_\b8 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+369\n+_\b3_\b7_\b0 static _\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be _\br_\bo_\bw_\bd_\bi_\bm(const _\bM_\ba_\bt_\br_\bi_\bx& /*A*/, _\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be /*r*/)\n+371 {\n+372 return 1;\n+373 }\n+374\n+_\b3_\b7_\b5 static _\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be _\bc_\bo_\bl_\bd_\bi_\bm(const _\bM_\ba_\bt_\br_\bi_\bx& /*A*/, _\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be /*r*/)\n+376 {\n+377 return 1;\n+378 }\n+379\n+_\b3_\b8_\b0 static _\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be _\br_\bo_\bw_\bd_\bi_\bm(const _\bM_\ba_\bt_\br_\bi_\bx& /*A*/)\n+381 {\n+382 return n;\n+383 }\n+384\n+_\b3_\b8_\b5 static _\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be _\bc_\bo_\bl_\bd_\bi_\bm(const _\bM_\ba_\bt_\br_\bi_\bx& /*A*/)\n+386 {\n+387 return m;\n+388 }\n+389 };\n+390\n+391 template \n+_\b3_\b9_\b2 struct _\bM_\ba_\bt_\br_\bi_\bx_\bD_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn<_\bD_\bu_\bn_\be::DynamicMatrix >\n+393 {\n+_\b3_\b9_\b4 typedef Dune::DynamicMatrix _\bM_\ba_\bt_\br_\bi_\bx_\bT_\by_\bp_\be;\n+_\b3_\b9_\b5 typedef typename MatrixType::size_type _\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be;\n+396\n+_\b3_\b9_\b7 static _\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be _\br_\bo_\bw_\bd_\bi_\bm(const _\bM_\ba_\bt_\br_\bi_\bx_\bT_\by_\bp_\be& /*A*/, _\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be /*r*/)\n+398 {\n+399 return 1;\n+400 }\n+401\n+_\b4_\b0_\b2 static _\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be _\bc_\bo_\bl_\bd_\bi_\bm(const _\bM_\ba_\bt_\br_\bi_\bx_\bT_\by_\bp_\be& /*A*/, _\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be /*r*/)\n+403 {\n+404 return 1;\n+405 }\n+406\n+_\b4_\b0_\b7 static _\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be _\br_\bo_\bw_\bd_\bi_\bm(const _\bM_\ba_\bt_\br_\bi_\bx_\bT_\by_\bp_\be& A)\n+408 {\n+409 return A.N();\n+410 }\n+411\n+_\b4_\b1_\b2 static _\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be _\bc_\bo_\bl_\bd_\bi_\bm(const _\bM_\ba_\bt_\br_\bi_\bx_\bT_\by_\bp_\be& A)\n+413 {\n+414 return A.M();\n+415 }\n+416 };\n+417\n+418 template\n+_\b4_\b1_\b9 struct _\bM_\ba_\bt_\br_\bi_\bx_\bD_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn<_\bM_\ba_\bt_\br_\bi_\bx<_\bF_\bi_\be_\bl_\bd_\bM_\ba_\bt_\br_\bi_\bx, TA> >\n+420 {\n+_\b4_\b2_\b1 typedef _\bM_\ba_\bt_\br_\bi_\bx_\b<_\bF_\bi_\be_\bl_\bd_\bM_\ba_\bt_\br_\bi_\bx_\b<_\bK_\b,_\bn_\b,_\bm_\b>, TA> _\bT_\bh_\bi_\bs_\bM_\ba_\bt_\br_\bi_\bx;\n+_\b4_\b2_\b2 typedef typename _\bT_\bh_\bi_\bs_\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+423\n+_\b4_\b2_\b4 static _\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be _\br_\bo_\bw_\bd_\bi_\bm(const _\bT_\bh_\bi_\bs_\bM_\ba_\bt_\br_\bi_\bx& /*A*/, _\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be /*r*/)\n+425 {\n+426 return n;\n+427 }\n+428\n+_\b4_\b2_\b9 static _\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be _\bc_\bo_\bl_\bd_\bi_\bm(const _\bT_\bh_\bi_\bs_\bM_\ba_\bt_\br_\bi_\bx& /*A*/, _\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be /*r*/)\n+430 {\n+431 return m;\n+432 }\n+433\n+_\b4_\b3_\b4 static _\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be _\br_\bo_\bw_\bd_\bi_\bm(const _\bT_\bh_\bi_\bs_\bM_\ba_\bt_\br_\bi_\bx& A)\n+435 {\n+436 return A.N()*n;\n+437 }\n+438\n+_\b4_\b3_\b9 static _\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be _\bc_\bo_\bl_\bd_\bi_\bm(const _\bT_\bh_\bi_\bs_\bM_\ba_\bt_\br_\bi_\bx& A)\n+440 {\n+441 return A.M()*m;\n+442 }\n+443 };\n+444\n+445 template\n+_\b4_\b4_\b6 struct _\bM_\ba_\bt_\br_\bi_\bx_\bD_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn >\n+447 {\n+_\b4_\b4_\b8 typedef DiagonalMatrix _\bM_\ba_\bt_\br_\bi_\bx;\n+_\b4_\b4_\b9 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+450\n+_\b4_\b5_\b1 static _\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be _\br_\bo_\bw_\bd_\bi_\bm(const _\bM_\ba_\bt_\br_\bi_\bx& /*A*/, _\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be /*r*/)\n+452 {\n+453 return 1;\n+454 }\n+455\n+_\b4_\b5_\b6 static _\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be _\bc_\bo_\bl_\bd_\bi_\bm(const _\bM_\ba_\bt_\br_\bi_\bx& /*A*/, _\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be /*r*/)\n+457 {\n+458 return 1;\n+459 }\n+460\n+_\b4_\b6_\b1 static _\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be _\br_\bo_\bw_\bd_\bi_\bm(const _\bM_\ba_\bt_\br_\bi_\bx& /*A*/)\n+462 {\n+463 return n;\n+464 }\n+465\n+_\b4_\b6_\b6 static _\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be _\bc_\bo_\bl_\bd_\bi_\bm(const _\bM_\ba_\bt_\br_\bi_\bx& /*A*/)\n+467 {\n+468 return n;\n+469 }\n+470 };\n+471\n+472 template\n+_\b4_\b7_\b3 struct _\bM_\ba_\bt_\br_\bi_\bx_\bD_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn<_\bS_\bc_\ba_\bl_\be_\bd_\bI_\bd_\be_\bn_\bt_\bi_\bt_\by_\bM_\ba_\bt_\br_\bi_\bx >\n+474 {\n+_\b4_\b7_\b5 typedef _\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> _\bM_\ba_\bt_\br_\bi_\bx;\n+_\b4_\b7_\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+477\n+_\b4_\b7_\b8 static _\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be _\br_\bo_\bw_\bd_\bi_\bm(const _\bM_\ba_\bt_\br_\bi_\bx& /*A*/, _\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be /*r*/)\n+479 {\n+480 return 1;\n+481 }\n+482\n+_\b4_\b8_\b3 static _\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be _\bc_\bo_\bl_\bd_\bi_\bm(const _\bM_\ba_\bt_\br_\bi_\bx& /*A*/, _\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be /*r*/)\n+484 {\n+485 return 1;\n+486 }\n+487\n+_\b4_\b8_\b8 static _\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be _\br_\bo_\bw_\bd_\bi_\bm(const _\bM_\ba_\bt_\br_\bi_\bx& /*A*/)\n+489 {\n+490 return n;\n+491 }\n+492\n+_\b4_\b9_\b3 static _\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be _\bc_\bo_\bl_\bd_\bi_\bm(const _\bM_\ba_\bt_\br_\bi_\bx& /*A*/)\n+494 {\n+495 return n;\n+496 }\n+497 };\n+498\n+502 template\n+_\b5_\b0_\b3 struct _\bI_\bs_\bM_\ba_\bt_\br_\bi_\bx\n+504 {\n+505 enum {\n+509 _\bv_\ba_\bl_\bu_\be = false\n+_\b5_\b1_\b0 };\n+511 };\n+512\n+513 template\n+_\b5_\b1_\b4 struct _\bI_\bs_\bM_\ba_\bt_\br_\bi_\bx >\n+515 {\n+516 enum {\n+520 _\bv_\ba_\bl_\bu_\be = true\n+_\b5_\b2_\b1 };\n+522 };\n+523\n+524\n+525 template\n+_\b5_\b2_\b6 struct _\bI_\bs_\bM_\ba_\bt_\br_\bi_\bx<_\bB_\bC_\bR_\bS_\bM_\ba_\bt_\br_\bi_\bx >\n+527 {\n+528 enum {\n+532 _\bv_\ba_\bl_\bu_\be = true\n+_\b5_\b3_\b3 };\n+534 };\n+535\n+536 template\n+_\b5_\b3_\b7 struct _\bP_\bo_\bi_\bn_\bt_\be_\br_\bC_\bo_\bm_\bp_\ba_\br_\be\n+538 {\n+_\b5_\b3_\b9 bool _\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b(_\b)(const T* l, const T* r)\n+540 {\n+541 return *l < *r;\n+542 }\n+543 };\n+544\n+545}\n+546#endif\n+_\bi_\bs_\bt_\bl_\be_\bx_\bc_\be_\bp_\bt_\bi_\bo_\bn_\b._\bh_\bh\n+_\bs_\bc_\ba_\bl_\be_\bd_\bi_\bd_\bm_\ba_\bt_\br_\bi_\bx_\b._\bh_\bh\n+This file implements a quadratic matrix of fixed size which is a multiple of\n+the identity.\n+_\bc_\bo_\bl\n+Col col\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn matrixmatrix.hh:351\n+_\bm_\ba_\bt\n+Matrix & mat\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn matrixmatrix.hh:347\n+_\bD_\bu_\bn_\be_\b:_\b:_\bc_\bo_\bu_\bn_\bt_\bN_\bo_\bn_\bZ_\be_\br_\bo_\bs\n+auto countNonZeros(const M &, typename std::enable_if_t< Dune::IsNumber< M >::\n+value > *sfinae=nullptr)\n+Get the number of nonzero fields in the matrix.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn matrixutils.hh:119\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:_\bh_\ba_\bs_\bU_\bn_\bi_\bq_\bu_\be_\bB_\bl_\bo_\bc_\bk_\bL_\be_\bv_\be_\bl\n-constexpr bool hasUniqueBlockLevel()\n-Determine if a vector/matrix has a uniquely determinable block level.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn blocklevel.hh:171\n-_\bD_\bu_\bn_\be_\b:_\b:_\bm_\ba_\bx_\bB_\bl_\bo_\bc_\bk_\bL_\be_\bv_\be_\bl\n-constexpr std::size_t maxBlockLevel()\n-Determine the maximum block level of a possibly nested vector/matrix type.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn blocklevel.hh:161\n-_\bD_\bu_\bn_\be_\b:_\b:_\bb_\bl_\bo_\bc_\bk_\bL_\be_\bv_\be_\bl\n-constexpr std::size_t blockLevel()\n-Determine the block level of a possibly nested vector/matrix type.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn blocklevel.hh:176\n-_\bD_\bu_\bn_\be_\b:_\b:_\bm_\bi_\bn_\bB_\bl_\bo_\bc_\bk_\bL_\be_\bv_\be_\bl\n-constexpr std::size_t minBlockLevel()\n-Determine the minimum block level of a possibly nested vector/matrix type.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn blocklevel.hh:166\n+_\bD_\bu_\bn_\be_\b:_\b:_\bp_\br_\bi_\bn_\bt_\bG_\bl_\bo_\bb_\ba_\bl_\bS_\bp_\ba_\br_\bs_\be_\bM_\ba_\bt_\br_\bi_\bx\n+void printGlobalSparseMatrix(const M &mat, C &ooc, std::ostream &os)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn matrixutils.hh:154\n+_\bD_\bu_\bn_\be_\b:_\b:_\bM_\ba_\bt_\br_\bi_\bx_\bD_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn matrixutils.hh:211\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:500\n+_\bD_\bu_\bn_\be_\b:_\b:_\bB_\bC_\bR_\bS_\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+row_type::ConstIterator ConstColIterator\n+Const iterator to the entries of a row.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn bcrsmatrix.hh:741\n+_\bD_\bu_\bn_\be_\b:_\b:_\bB_\bC_\bR_\bS_\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 bcrsmatrix.hh:491\n+_\bD_\bu_\bn_\be_\b:_\b:_\bB_\bC_\bR_\bS_\bM_\ba_\bt_\br_\bi_\bx_\b:_\b:_\bR_\be_\ba_\bl_\bR_\bo_\bw_\bI_\bt_\be_\br_\ba_\bt_\bo_\br\n+Iterator access to matrix rows\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn bcrsmatrix.hh:579\n+_\bD_\bu_\bn_\be_\b:_\b:_\bM_\bu_\bl_\bt_\bi_\bT_\by_\bp_\be_\bB_\bl_\bo_\bc_\bk_\bM_\ba_\bt_\br_\bi_\bx\n+A Matrix class to support different block types.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn multitypeblockmatrix.hh:46\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_\bI_\bm_\bp_\b:_\b:_\bD_\be_\bn_\bs_\be_\bM_\ba_\bt_\br_\bi_\bx_\bB_\ba_\bs_\be_\b:_\b:_\bC_\bo_\bn_\bs_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br\n+ConstIterator class for sequential access.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn matrix.hh:404\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:_\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be\n+A::size_type size_type\n+Type for indices and sizes.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn matrix.hh:577\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:620\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:614\n+_\bD_\bu_\bn_\be_\b:_\b:_\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+row_type::const_iterator ConstColIterator\n+Const iterator for the entries of each row.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn matrix.hh:589\n+_\bD_\bu_\bn_\be_\b:_\b:_\bM_\ba_\bt_\br_\bi_\bx_\b:_\b:_\bb_\bl_\bo_\bc_\bk_\b__\bt_\by_\bp_\be\n+T block_type\n+Export the type representing the components.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn matrix.hh:568\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+_\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\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:48\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:_\bC_\bh_\be_\bc_\bk_\bI_\bf_\bD_\bi_\ba_\bg_\bo_\bn_\ba_\bl_\bP_\br_\be_\bs_\be_\bn_\bt_\b<_\b _\bM_\ba_\bt_\br_\bi_\bx_\b,_\b _\b0_\b,_\b _\bl_\b _\b>_\b:_\b:_\bc_\bh_\be_\bc_\bk\n+static void check(const Matrix &mat)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn matrixutils.hh:75\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 _\bM_\bu_\bl_\bt_\bi_\bT_\by_\bp_\be_\bB_\bl_\bo_\bc_\bk_\bM_\ba_\bt_\br_\bi_\bx_\b<_\b _\bT_\b1_\b,_\b _\bA_\br_\bg_\bs_\b._\b._\b._\b _\b>_\b,_\b _\bb_\bl_\bo_\bc_\bk_\bl_\be_\bv_\be_\bl_\b,\n+_\bl_\b _\b>_\b:_\b:_\bc_\bh_\be_\bc_\bk\n+static void check(const Matrix &)\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:99\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 _\bM_\bu_\bl_\bt_\bi_\bT_\by_\bp_\be_\bB_\bl_\bo_\bc_\bk_\bM_\ba_\bt_\br_\bi_\bx_\b<_\b _\bT_\b1_\b,_\b _\bA_\br_\bg_\bs_\b._\b._\b._\b _\b>_\b,_\b _\bb_\bl_\bo_\bc_\bk_\bl_\be_\bv_\be_\bl_\b,\n+_\bl_\b _\b>_\b:_\b:_\bM_\ba_\bt_\br_\bi_\bx\n+MultiTypeBlockMatrix< T1, Args... > Matrix\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn matrixutils.hh:93\n+_\bD_\bu_\bn_\be_\b:_\b:_\bM_\ba_\bt_\br_\bi_\bx_\bD_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b<_\b _\bM_\ba_\bt_\br_\bi_\bx_\b<_\b _\bB_\b,_\b _\bT_\bA_\b _\b>_\b _\b>_\b:_\b:_\br_\bo_\bw_\bd_\bi_\bm\n+static size_type rowdim(const Matrix< B, TA > &A, size_type i)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn matrixutils.hh:232\n+_\bD_\bu_\bn_\be_\b:_\b:_\bM_\ba_\bt_\br_\bi_\bx_\bD_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b<_\b _\bM_\ba_\bt_\br_\bi_\bx_\b<_\b _\bB_\b,_\b _\bT_\bA_\b _\b>_\b _\b>_\b:_\b:_\bc_\bo_\bl_\bd_\bi_\bm\n+static size_type coldim(const Matrix< B, TA > &A)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn matrixutils.hh:250\n+_\bD_\bu_\bn_\be_\b:_\b:_\bM_\ba_\bt_\br_\bi_\bx_\bD_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b<_\b _\bM_\ba_\bt_\br_\bi_\bx_\b<_\b _\bB_\b,_\b _\bT_\bA_\b _\b>_\b _\b>_\b:_\b:_\br_\bo_\bw_\bd_\bi_\bm\n+static size_type rowdim(const Matrix< B, TA > &A)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn matrixutils.hh:242\n+_\bD_\bu_\bn_\be_\b:_\b:_\bM_\ba_\bt_\br_\bi_\bx_\bD_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b<_\b _\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+typename Matrix< B, TA >::size_type size_type\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn matrixutils.hh:230\n+_\bD_\bu_\bn_\be_\b:_\b:_\bM_\ba_\bt_\br_\bi_\bx_\bD_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b<_\b _\bM_\ba_\bt_\br_\bi_\bx_\b<_\b _\bB_\b,_\b _\bT_\bA_\b _\b>_\b _\b>_\b:_\b:_\bc_\bo_\bl_\bd_\bi_\bm\n+static size_type coldim(const Matrix< B, TA > &A, size_type c)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn matrixutils.hh:237\n+_\bD_\bu_\bn_\be_\b:_\b:_\bM_\ba_\bt_\br_\bi_\bx_\bD_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b<_\b _\bM_\ba_\bt_\br_\bi_\bx_\b<_\b _\bB_\b,_\b _\bT_\bA_\b _\b>_\b _\b>_\b:_\b:_\bb_\bl_\bo_\bc_\bk_\b__\bt_\by_\bp_\be\n+typename Matrix< B, TA >::block_type block_type\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn matrixutils.hh:229\n+_\bD_\bu_\bn_\be_\b:_\b:_\bM_\ba_\bt_\br_\bi_\bx_\bD_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\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+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn matrixutils.hh:263\n+_\bD_\bu_\bn_\be_\b:_\b:_\bM_\ba_\bt_\br_\bi_\bx_\bD_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\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:_\bc_\bo_\bl_\bd_\bi_\bm\n+static size_type coldim(const Matrix &A)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn matrixutils.hh:311\n+_\bD_\bu_\bn_\be_\b:_\b:_\bM_\ba_\bt_\br_\bi_\bx_\bD_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\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:_\bb_\bl_\bo_\bc_\bk_\b__\bt_\by_\bp_\be\n+Matrix::block_type block_type\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn matrixutils.hh:264\n+_\bD_\bu_\bn_\be_\b:_\b:_\bM_\ba_\bt_\br_\bi_\bx_\bD_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\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:_\bc_\bo_\bl_\bd_\bi_\bm\n+static size_type coldim(const Matrix &A, size_type c)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn matrixutils.hh:276\n+_\bD_\bu_\bn_\be_\b:_\b:_\bM_\ba_\bt_\br_\bi_\bx_\bD_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\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 matrixutils.hh:265\n+_\bD_\bu_\bn_\be_\b:_\b:_\bM_\ba_\bt_\br_\bi_\bx_\bD_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\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:_\br_\bo_\bw_\bd_\bi_\bm\n+static size_type rowdim(const Matrix &A, size_type i)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn matrixutils.hh:267\n+_\bD_\bu_\bn_\be_\b:_\b:_\bM_\ba_\bt_\br_\bi_\bx_\bD_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\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:_\br_\bo_\bw_\bd_\bi_\bm\n+static size_type rowdim(const Matrix &A)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn matrixutils.hh:304\n+_\bD_\bu_\bn_\be_\b:_\b:_\bM_\ba_\bt_\br_\bi_\bx_\bD_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b<_\b _\bB_\bC_\bR_\bS_\bM_\ba_\bt_\br_\bi_\bx_\b<_\b _\bF_\bi_\be_\bl_\bd_\bM_\ba_\bt_\br_\bi_\bx_\b<_\b _\bB_\b,_\b _\bn_\b,_\b _\bm_\b _\b>_\b,_\b _\bT_\bA_\b _\b>_\b _\b>_\b:_\b:_\bc_\bo_\bl_\bd_\bi_\bm\n+static size_type coldim(const Matrix &A)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn matrixutils.hh:359\n+_\bD_\bu_\bn_\be_\b:_\b:_\bM_\ba_\bt_\br_\bi_\bx_\bD_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b<_\b _\bB_\bC_\bR_\bS_\bM_\ba_\bt_\br_\bi_\bx_\b<_\b _\bF_\bi_\be_\bl_\bd_\bM_\ba_\bt_\br_\bi_\bx_\b<_\b _\bB_\b,_\b _\bn_\b,_\b _\bm_\b _\b>_\b,_\b _\bT_\bA_\b _\b>_\b _\b>_\b:_\b:_\br_\bo_\bw_\bd_\bi_\bm\n+static size_type rowdim(const Matrix &, size_type)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn matrixutils.hh:345\n+_\bD_\bu_\bn_\be_\b:_\b:_\bM_\ba_\bt_\br_\bi_\bx_\bD_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b<_\b _\bB_\bC_\bR_\bS_\bM_\ba_\bt_\br_\bi_\bx_\b<_\b _\bF_\bi_\be_\bl_\bd_\bM_\ba_\bt_\br_\bi_\bx_\b<_\b _\bB_\b,_\b _\bn_\b,_\b _\bm_\b _\b>_\b,_\b _\bT_\bA_\b _\b>_\b _\b>_\b:_\b:_\br_\bo_\bw_\bd_\bi_\bm\n+static size_type rowdim(const Matrix &A)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn matrixutils.hh:355\n+_\bD_\bu_\bn_\be_\b:_\b:_\bM_\ba_\bt_\br_\bi_\bx_\bD_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b<_\b _\bB_\bC_\bR_\bS_\bM_\ba_\bt_\br_\bi_\bx_\b<_\b _\bF_\bi_\be_\bl_\bd_\bM_\ba_\bt_\br_\bi_\bx_\b<_\b _\bB_\b,_\b _\bn_\b,_\b _\bm_\b _\b>_\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 matrixutils.hh:343\n+_\bD_\bu_\bn_\be_\b:_\b:_\bM_\ba_\bt_\br_\bi_\bx_\bD_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b<_\b _\bB_\bC_\bR_\bS_\bM_\ba_\bt_\br_\bi_\bx_\b<_\b _\bF_\bi_\be_\bl_\bd_\bM_\ba_\bt_\br_\bi_\bx_\b<_\b _\bB_\b,_\b _\bn_\b,_\b _\bm_\b _\b>_\b,_\b _\bT_\bA_\b _\b>_\b _\b>_\b:_\b:_\bM_\ba_\bt_\br_\bi_\bx\n+BCRSMatrix< FieldMatrix< B, n, m >,TA > Matrix\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn matrixutils.hh:342\n+_\bD_\bu_\bn_\be_\b:_\b:_\bM_\ba_\bt_\br_\bi_\bx_\bD_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b<_\b _\bB_\bC_\bR_\bS_\bM_\ba_\bt_\br_\bi_\bx_\b<_\b _\bF_\bi_\be_\bl_\bd_\bM_\ba_\bt_\br_\bi_\bx_\b<_\b _\bB_\b,_\b _\bn_\b,_\b _\bm_\b _\b>_\b,_\b _\bT_\bA_\b _\b>_\b _\b>_\b:_\b:_\bc_\bo_\bl_\bd_\bi_\bm\n+static size_type coldim(const Matrix &, size_type)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn matrixutils.hh:350\n+_\bD_\bu_\bn_\be_\b:_\b:_\bM_\ba_\bt_\br_\bi_\bx_\bD_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b<_\b _\bF_\bi_\be_\bl_\bd_\bM_\ba_\bt_\br_\bi_\bx_\b<_\b _\bK_\b,_\b _\bn_\b,_\b _\bm_\b _\b>_\b _\b>_\b:_\b:_\br_\bo_\bw_\bd_\bi_\bm\n+static size_type rowdim(const Matrix &, size_type)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn matrixutils.hh:370\n+_\bD_\bu_\bn_\be_\b:_\b:_\bM_\ba_\bt_\br_\bi_\bx_\bD_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b<_\b _\bF_\bi_\be_\bl_\bd_\bM_\ba_\bt_\br_\bi_\bx_\b<_\b _\bK_\b,_\b _\bn_\b,_\b _\bm_\b _\b>_\b _\b>_\b:_\b:_\bc_\bo_\bl_\bd_\bi_\bm\n+static size_type coldim(const Matrix &)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn matrixutils.hh:385\n+_\bD_\bu_\bn_\be_\b:_\b:_\bM_\ba_\bt_\br_\bi_\bx_\bD_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b<_\b _\bF_\bi_\be_\bl_\bd_\bM_\ba_\bt_\br_\bi_\bx_\b<_\b _\bK_\b,_\b _\bn_\b,_\b _\bm_\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 matrixutils.hh:368\n+_\bD_\bu_\bn_\be_\b:_\b:_\bM_\ba_\bt_\br_\bi_\bx_\bD_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b<_\b _\bF_\bi_\be_\bl_\bd_\bM_\ba_\bt_\br_\bi_\bx_\b<_\b _\bK_\b,_\b _\bn_\b,_\b _\bm_\b _\b>_\b _\b>_\b:_\b:_\bM_\ba_\bt_\br_\bi_\bx\n+FieldMatrix< K, n, m > Matrix\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn matrixutils.hh:367\n+_\bD_\bu_\bn_\be_\b:_\b:_\bM_\ba_\bt_\br_\bi_\bx_\bD_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b<_\b _\bF_\bi_\be_\bl_\bd_\bM_\ba_\bt_\br_\bi_\bx_\b<_\b _\bK_\b,_\b _\bn_\b,_\b _\bm_\b _\b>_\b _\b>_\b:_\b:_\bc_\bo_\bl_\bd_\bi_\bm\n+static size_type coldim(const Matrix &, size_type)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn matrixutils.hh:375\n+_\bD_\bu_\bn_\be_\b:_\b:_\bM_\ba_\bt_\br_\bi_\bx_\bD_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b<_\b _\bF_\bi_\be_\bl_\bd_\bM_\ba_\bt_\br_\bi_\bx_\b<_\b _\bK_\b,_\b _\bn_\b,_\b _\bm_\b _\b>_\b _\b>_\b:_\b:_\br_\bo_\bw_\bd_\bi_\bm\n+static size_type rowdim(const Matrix &)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn matrixutils.hh:380\n+_\bD_\bu_\bn_\be_\b:_\b:_\bM_\ba_\bt_\br_\bi_\bx_\bD_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b<_\b _\bD_\bu_\bn_\be_\b:_\b:_\bD_\by_\bn_\ba_\bm_\bi_\bc_\bM_\ba_\bt_\br_\bi_\bx_\b<_\b _\bT_\b _\b>_\b _\b>_\b:_\b:_\bc_\bo_\bl_\bd_\bi_\bm\n+static size_type coldim(const MatrixType &A)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn matrixutils.hh:412\n+_\bD_\bu_\bn_\be_\b:_\b:_\bM_\ba_\bt_\br_\bi_\bx_\bD_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b<_\b _\bD_\bu_\bn_\be_\b:_\b:_\bD_\by_\bn_\ba_\bm_\bi_\bc_\bM_\ba_\bt_\br_\bi_\bx_\b<_\b _\bT_\b _\b>_\b _\b>_\b:_\b:_\br_\bo_\bw_\bd_\bi_\bm\n+static size_type rowdim(const MatrixType &A)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn matrixutils.hh:407\n+_\bD_\bu_\bn_\be_\b:_\b:_\bM_\ba_\bt_\br_\bi_\bx_\bD_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b<_\b _\bD_\bu_\bn_\be_\b:_\b:_\bD_\by_\bn_\ba_\bm_\bi_\bc_\bM_\ba_\bt_\br_\bi_\bx_\b<_\b _\bT_\b _\b>_\b _\b>_\b:_\b:_\br_\bo_\bw_\bd_\bi_\bm\n+static size_type rowdim(const MatrixType &, size_type)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn matrixutils.hh:397\n+_\bD_\bu_\bn_\be_\b:_\b:_\bM_\ba_\bt_\br_\bi_\bx_\bD_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b<_\b _\bD_\bu_\bn_\be_\b:_\b:_\bD_\by_\bn_\ba_\bm_\bi_\bc_\bM_\ba_\bt_\br_\bi_\bx_\b<_\b _\bT_\b _\b>_\b _\b>_\b:_\b:_\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be\n+MatrixType::size_type size_type\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn matrixutils.hh:395\n+_\bD_\bu_\bn_\be_\b:_\b:_\bM_\ba_\bt_\br_\bi_\bx_\bD_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b<_\b _\bD_\bu_\bn_\be_\b:_\b:_\bD_\by_\bn_\ba_\bm_\bi_\bc_\bM_\ba_\bt_\br_\bi_\bx_\b<_\b _\bT_\b _\b>_\b _\b>_\b:_\b:_\bc_\bo_\bl_\bd_\bi_\bm\n+static size_type coldim(const MatrixType &, size_type)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn matrixutils.hh:402\n+_\bD_\bu_\bn_\be_\b:_\b:_\bM_\ba_\bt_\br_\bi_\bx_\bD_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b<_\b _\bD_\bu_\bn_\be_\b:_\b:_\bD_\by_\bn_\ba_\bm_\bi_\bc_\bM_\ba_\bt_\br_\bi_\bx_\b<_\b _\bT_\b _\b>_\b _\b>_\b:_\b:_\bM_\ba_\bt_\br_\bi_\bx_\bT_\by_\bp_\be\n+Dune::DynamicMatrix< T > MatrixType\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn matrixutils.hh:394\n+_\bD_\bu_\bn_\be_\b:_\b:_\bM_\ba_\bt_\br_\bi_\bx_\bD_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b<_\b _\bM_\ba_\bt_\br_\bi_\bx_\b<_\b _\bF_\bi_\be_\bl_\bd_\bM_\ba_\bt_\br_\bi_\bx_\b<_\b _\bK_\b,_\b _\bn_\b,_\b _\bm_\b _\b>_\b,_\b _\bT_\bA_\b _\b>_\b _\b>_\b:_\b:_\bc_\bo_\bl_\bd_\bi_\bm\n+static size_type coldim(const ThisMatrix &A)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn matrixutils.hh:439\n+_\bD_\bu_\bn_\be_\b:_\b:_\bM_\ba_\bt_\br_\bi_\bx_\bD_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b<_\b _\bM_\ba_\bt_\br_\bi_\bx_\b<_\b _\bF_\bi_\be_\bl_\bd_\bM_\ba_\bt_\br_\bi_\bx_\b<_\b _\bK_\b,_\b _\bn_\b,_\b _\bm_\b _\b>_\b,_\b _\bT_\bA_\b _\b>_\b _\b>_\b:_\b:_\br_\bo_\bw_\bd_\bi_\bm\n+static size_type rowdim(const ThisMatrix &A)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn matrixutils.hh:434\n+_\bD_\bu_\bn_\be_\b:_\b:_\bM_\ba_\bt_\br_\bi_\bx_\bD_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b<_\b _\bM_\ba_\bt_\br_\bi_\bx_\b<_\b _\bF_\bi_\be_\bl_\bd_\bM_\ba_\bt_\br_\bi_\bx_\b<_\b _\bK_\b,_\b _\bn_\b,_\b _\bm_\b _\b>_\b,_\b _\bT_\bA_\b _\b>_\b _\b>_\b:_\b:_\bT_\bh_\bi_\bs_\bM_\ba_\bt_\br_\bi_\bx\n+Matrix< FieldMatrix< K, n, m >, TA > ThisMatrix\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn matrixutils.hh:421\n+_\bD_\bu_\bn_\be_\b:_\b:_\bM_\ba_\bt_\br_\bi_\bx_\bD_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b<_\b _\bM_\ba_\bt_\br_\bi_\bx_\b<_\b _\bF_\bi_\be_\bl_\bd_\bM_\ba_\bt_\br_\bi_\bx_\b<_\b _\bK_\b,_\b _\bn_\b,_\b _\bm_\b _\b>_\b,_\b _\bT_\bA_\b _\b>_\b _\b>_\b:_\b:_\bc_\bo_\bl_\bd_\bi_\bm\n+static size_type coldim(const ThisMatrix &, size_type)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn matrixutils.hh:429\n+_\bD_\bu_\bn_\be_\b:_\b:_\bM_\ba_\bt_\br_\bi_\bx_\bD_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b<_\b _\bM_\ba_\bt_\br_\bi_\bx_\b<_\b _\bF_\bi_\be_\bl_\bd_\bM_\ba_\bt_\br_\bi_\bx_\b<_\b _\bK_\b,_\b _\bn_\b,_\b _\bm_\b _\b>_\b,_\b _\bT_\bA_\b _\b>_\b _\b>_\b:_\b:_\br_\bo_\bw_\bd_\bi_\bm\n+static size_type rowdim(const ThisMatrix &, size_type)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn matrixutils.hh:424\n+_\bD_\bu_\bn_\be_\b:_\b:_\bM_\ba_\bt_\br_\bi_\bx_\bD_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b<_\b _\bM_\ba_\bt_\br_\bi_\bx_\b<_\b _\bF_\bi_\be_\bl_\bd_\bM_\ba_\bt_\br_\bi_\bx_\b<_\b _\bK_\b,_\b _\bn_\b,_\b _\bm_\b _\b>_\b,_\b _\bT_\bA_\b _\b>_\b _\b>_\b:_\b:_\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be\n+ThisMatrix::size_type size_type\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn matrixutils.hh:422\n+_\bD_\bu_\bn_\be_\b:_\b:_\bM_\ba_\bt_\br_\bi_\bx_\bD_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b<_\b _\bD_\bi_\ba_\bg_\bo_\bn_\ba_\bl_\bM_\ba_\bt_\br_\bi_\bx_\b<_\b _\bK_\b,_\b _\bn_\b _\b>_\b _\b>_\b:_\b:_\bc_\bo_\bl_\bd_\bi_\bm\n+static size_type coldim(const Matrix &, size_type)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn matrixutils.hh:456\n+_\bD_\bu_\bn_\be_\b:_\b:_\bM_\ba_\bt_\br_\bi_\bx_\bD_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b<_\b _\bD_\bi_\ba_\bg_\bo_\bn_\ba_\bl_\bM_\ba_\bt_\br_\bi_\bx_\b<_\b _\bK_\b,_\b _\bn_\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 matrixutils.hh:449\n+_\bD_\bu_\bn_\be_\b:_\b:_\bM_\ba_\bt_\br_\bi_\bx_\bD_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b<_\b _\bD_\bi_\ba_\bg_\bo_\bn_\ba_\bl_\bM_\ba_\bt_\br_\bi_\bx_\b<_\b _\bK_\b,_\b _\bn_\b _\b>_\b _\b>_\b:_\b:_\bc_\bo_\bl_\bd_\bi_\bm\n+static size_type coldim(const Matrix &)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn matrixutils.hh:466\n+_\bD_\bu_\bn_\be_\b:_\b:_\bM_\ba_\bt_\br_\bi_\bx_\bD_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b<_\b _\bD_\bi_\ba_\bg_\bo_\bn_\ba_\bl_\bM_\ba_\bt_\br_\bi_\bx_\b<_\b _\bK_\b,_\b _\bn_\b _\b>_\b _\b>_\b:_\b:_\br_\bo_\bw_\bd_\bi_\bm\n+static size_type rowdim(const Matrix &)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn matrixutils.hh:461\n+_\bD_\bu_\bn_\be_\b:_\b:_\bM_\ba_\bt_\br_\bi_\bx_\bD_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b<_\b _\bD_\bi_\ba_\bg_\bo_\bn_\ba_\bl_\bM_\ba_\bt_\br_\bi_\bx_\b<_\b _\bK_\b,_\b _\bn_\b _\b>_\b _\b>_\b:_\b:_\bM_\ba_\bt_\br_\bi_\bx\n+DiagonalMatrix< K, n > Matrix\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn matrixutils.hh:448\n+_\bD_\bu_\bn_\be_\b:_\b:_\bM_\ba_\bt_\br_\bi_\bx_\bD_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b<_\b _\bD_\bi_\ba_\bg_\bo_\bn_\ba_\bl_\bM_\ba_\bt_\br_\bi_\bx_\b<_\b _\bK_\b,_\b _\bn_\b _\b>_\b _\b>_\b:_\b:_\br_\bo_\bw_\bd_\bi_\bm\n+static size_type rowdim(const Matrix &, size_type)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn matrixutils.hh:451\n+_\bD_\bu_\bn_\be_\b:_\b:_\bM_\ba_\bt_\br_\bi_\bx_\bD_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\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:_\bc_\bo_\bl_\bd_\bi_\bm\n+static size_type coldim(const Matrix &)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn matrixutils.hh:493\n+_\bD_\bu_\bn_\be_\b:_\b:_\bM_\ba_\bt_\br_\bi_\bx_\bD_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\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_\bo_\bw_\bd_\bi_\bm\n+static size_type rowdim(const Matrix &, size_type)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn matrixutils.hh:478\n+_\bD_\bu_\bn_\be_\b:_\b:_\bM_\ba_\bt_\br_\bi_\bx_\bD_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\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:_\bc_\bo_\bl_\bd_\bi_\bm\n+static size_type coldim(const Matrix &, size_type)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn matrixutils.hh:483\n+_\bD_\bu_\bn_\be_\b:_\b:_\bM_\ba_\bt_\br_\bi_\bx_\bD_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\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:_\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 matrixutils.hh:476\n+_\bD_\bu_\bn_\be_\b:_\b:_\bM_\ba_\bt_\br_\bi_\bx_\bD_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\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:_\bM_\ba_\bt_\br_\bi_\bx\n+ScaledIdentityMatrix< K, n > Matrix\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn matrixutils.hh:475\n+_\bD_\bu_\bn_\be_\b:_\b:_\bM_\ba_\bt_\br_\bi_\bx_\bD_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\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_\bo_\bw_\bd_\bi_\bm\n+static size_type rowdim(const Matrix &)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn matrixutils.hh:488\n+_\bD_\bu_\bn_\be_\b:_\b:_\bI_\bs_\bM_\ba_\bt_\br_\bi_\bx\n+Test whether a type is an ISTL Matrix.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn matrixutils.hh:504\n+_\bD_\bu_\bn_\be_\b:_\b:_\bI_\bs_\bM_\ba_\bt_\br_\bi_\bx_\b:_\b:_\bv_\ba_\bl_\bu_\be\n+@ value\n+True if T is an ISTL matrix.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn matrixutils.hh:509\n+_\bD_\bu_\bn_\be_\b:_\b:_\bP_\bo_\bi_\bn_\bt_\be_\br_\bC_\bo_\bm_\bp_\ba_\br_\be\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn matrixutils.hh:538\n+_\bD_\bu_\bn_\be_\b:_\b:_\bP_\bo_\bi_\bn_\bt_\be_\br_\bC_\bo_\bm_\bp_\ba_\br_\be_\b:_\b:_\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b(_\b)\n+bool operator()(const T *l, const T *r)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn matrixutils.hh:539\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:_\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 ===============================================================================\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.html", "source2": "./usr/share/doc/libdune-istl-doc/doxygen/a00017.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n dune-istl: superlu.hh File Reference \n+dune-istl: supermatrix.hh File Reference \n \n
\n-\n-
Classes for using SuperLU with ISTL matrices. \n-More...
\n-
#include "superlufunctions.hh "\n-
#include "solvers.hh "\n-
#include "supermatrix.hh "\n-
#include <algorithm>\n-
#include <functional>\n-
#include "bcrsmatrix.hh "\n-
#include "bvector.hh "\n-
#include "istlexception.hh "\n+
#include "bcrsmatrix.hh "\n+
#include "bvector.hh "\n
#include <dune/common/fmatrix.hh>\n
#include <dune/common/fvector.hh>\n-
#include <dune/common/stdstreams.hh>\n-
#include <dune/istl/solvertype.hh >\n-
#include <dune/istl/solverfactory.hh >\n+
#include <dune/common/typetraits.hh>\n+
#include <limits>\n+
#include <dune/istl/bccsmatrixinitializer.hh >\n+
#include "superlufunctions.hh "\n
\n
Go to the source code of this file.
\n
\n namespace Dune
\n-
\n-
Classes for using SuperLU with ISTL matrices.
\n-
Author Markus Blatt \n-
\n+
\n-#include \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 \"_\bi_\bs_\bt_\bl_\be_\bx_\bc_\be_\bp_\bt_\bi_\bo_\bn_\b._\bh_\bh\"\n #include \n #include \n-#include \n-#include <_\bd_\bu_\bn_\be_\b/_\bi_\bs_\bt_\bl_\b/_\bs_\bo_\bl_\bv_\be_\br_\bt_\by_\bp_\be_\b._\bh_\bh>\n-#include <_\bd_\bu_\bn_\be_\b/_\bi_\bs_\bt_\bl_\b/_\bs_\bo_\bl_\bv_\be_\br_\bf_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\bh>\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 _\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_\bL_\bU_\bS_\bo_\bl_\bv_\be_\bC_\bh_\bo_\bo_\bs_\be_\br_\b<_\b _\bT_\b _\b>\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_\bL_\bU_\bD_\be_\bn_\bs_\be_\bM_\ba_\bt_\bC_\bh_\bo_\bo_\bs_\be_\br_\b<_\b _\bT_\b _\b>\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:_\bS_\bu_\bp_\be_\br_\bL_\bU_\bQ_\bu_\be_\br_\by_\bC_\bh_\bo_\bo_\bs_\be_\br_\b<_\b _\bT_\b _\b>\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:_\bQ_\bu_\be_\br_\by_\bS_\bp_\ba_\bc_\be_\bC_\bh_\bo_\bo_\bs_\be_\br_\b<_\b _\bT_\b _\b>\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- class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bS_\bu_\bp_\be_\br_\bL_\bU_\b<_\b _\bM_\b _\b>\n-\u00a0 SuperLu Solver. _\bM_\bo_\br_\be_\b._\b._\b.\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:_\bI_\bs_\bD_\bi_\br_\be_\bc_\bt_\bS_\bo_\bl_\bv_\be_\br_\b<_\b _\bS_\bu_\bp_\be_\br_\bL_\bU_\b<_\b _\bB_\bC_\bR_\bS_\bM_\ba_\bt_\br_\bi_\bx_\b<_\b _\bT_\b,_\b _\bA_\b _\b>_\b _\b>_\b _\b>\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:_\bS_\bt_\bo_\br_\be_\bs_\bC_\bo_\bl_\bu_\bm_\bn_\bC_\bo_\bm_\bp_\br_\be_\bs_\bs_\be_\bd_\b<_\b _\bS_\bu_\bp_\be_\br_\bL_\bU_\b<_\b _\bB_\bC_\bR_\bS_\bM_\ba_\bt_\br_\bi_\bx_\b<_\b _\bT_\b,_\b _\bA_\b _\b>_\b _\b>_\b _\b>\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:_\bS_\bu_\bp_\be_\br_\bL_\bU_\bC_\br_\be_\ba_\bt_\bo_\br\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_\bC_\br_\be_\ba_\bt_\bo_\br_\b:_\b:_\bi_\bs_\bV_\ba_\bl_\bi_\bd_\bB_\bl_\bo_\bc_\bk_\b<_\b _\bc_\bl_\ba_\bs_\bs_\b _\b>\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_\bL_\bU_\bC_\br_\be_\ba_\bt_\bo_\br_\b:_\b:_\bi_\bs_\bV_\ba_\bl_\bi_\bd_\bB_\bl_\bo_\bc_\bk_\b<_\b _\bD_\bu_\bn_\be_\b:_\b:_\bF_\bi_\be_\bl_\bd_\bV_\be_\bc_\bt_\bo_\br_\b<_\b _\bd_\bo_\bu_\bb_\bl_\be_\b,_\b _\bk_\b _\b>_\b _\b>\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-struct \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bS_\bu_\bp_\be_\br_\bL_\bU_\bC_\br_\be_\ba_\bt_\bo_\br_\b:_\b:_\bi_\bs_\bV_\ba_\bl_\bi_\bd_\bB_\bl_\bo_\bc_\bk_\b<_\b _\bD_\bu_\bn_\be_\b:_\b:_\bF_\bi_\be_\bl_\bd_\bV_\be_\bc_\bt_\bo_\br_\b<_\b _\bs_\bt_\bd_\b:_\b:_\bc_\bo_\bm_\bp_\bl_\be_\bx_\b<\n- _\bd_\bo_\bu_\bb_\bl_\be_\b _\b>_\b,_\b _\bk_\b _\b>_\b _\b>\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-struct \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bS_\bu_\bp_\be_\br_\bL_\bU_\bC_\br_\be_\ba_\bt_\bo_\br_\b:_\b:_\bi_\bs_\bV_\ba_\bl_\bi_\bd_\bB_\bl_\bo_\bc_\bk_\b<_\b _\bd_\bo_\bu_\bb_\bl_\be_\b _\b>\n-\u00a0\n-struct \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bS_\bu_\bp_\be_\br_\bL_\bU_\bC_\br_\be_\ba_\bt_\bo_\br_\b:_\b:_\bi_\bs_\bV_\ba_\bl_\bi_\bd_\bB_\bl_\bo_\bc_\bk_\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+ 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 \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-\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bD_\bU_\bN_\bE_\b__\bR_\bE_\bG_\bI_\bS_\bT_\bE_\bR_\b__\bD_\bI_\bR_\bE_\bC_\bT_\b__\bS_\bO_\bL_\bV_\bE_\bR (\"superlu\", _\bS_\bu_\bp_\be_\br_\bL_\bU_\bC_\br_\be_\ba_\bt_\bo_\br())\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-Classes for using SuperLU with ISTL matrices.\n- Author\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/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: superlu.hh Source File \n+dune-istl: supermatrix.hh Source File \n \n
Go to the documentation of this file. \n
\n
\n
\n-
5 #ifndef DUNE_ISTL_SUPERLU_HH \n-
6 #define DUNE_ISTL_SUPERLU_HH \n+
5 #ifndef DUNE_ISTL_SUPERMATRIX_HH \n+
6 #define DUNE_ISTL_SUPERMATRIX_HH \n
\n
\n
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
18 #include <dune/common/fmatrix.hh> \n-
19 #include <dune/common/fvector.hh> \n-
20 #include <dune/common/stdstreams.hh> \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-
37 template <
class M,
class T,
class TM,
class TD,
class TA>
\n-
38 class SeqOverlappingSchwarz;
\n-
\n-
40 template <
class T,
bool tag>
\n-
41 struct SeqOverlappingSchwarzAssemblerHelper;
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n+
\n+
\n+
\n+
\n+
\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-
\n-
\n-
\n-
59 #if __has_include("slu_sdefs.h") \n-
\n-
\n-
\n-
63 static void create(SuperMatrix *
mat ,
int n,
int m,
float *dat,
int n1,
\n-
64 Stype_t stype, Dtype_t dtype, Mtype_t mtype)
\n-
\n-
66 sCreate_Dense_Matrix(
mat , n, m, dat, n1, stype, dtype, mtype);
\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-
70 static void destroy(SuperMatrix*)
\n-
\n-
\n-
\n-
\n-
75 struct SuperLUSolveChooser<float>
\n-
\n-
77 static void solve(superlu_options_t *options, SuperMatrix *
mat ,
int *perm_c,
int *perm_r,
int *etree,
\n-
78 char *equed,
float *R,
float *C, SuperMatrix *L, SuperMatrix *U,
\n-
79 void *work,
int lwork, SuperMatrix *B, SuperMatrix *X,
\n-
80 float *rpg,
float *rcond,
float *ferr,
float *berr,
\n-
81 mem_usage_t *memusage, SuperLUStat_t *stat,
int *info)
\n-
\n-
\n-
84 sgssvx(options,
mat , perm_c, perm_r, etree, equed, R, C,
\n-
85 L, U, work, lwork, B, X, rpg, rcond, ferr, berr,
\n-
86 &gLU, memusage, stat, info);
\n-
\n-
\n-
\n-
\n-
91 struct QuerySpaceChooser<float>
\n-
\n-
93 static void querySpace(SuperMatrix* L, SuperMatrix* U, mem_usage_t* memusage)
\n-
\n-
95 sQuerySpace(L,U,memusage);
\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_ddefs.h") \n-
\n-
\n-
104 struct SuperLUDenseMatChooser<double>
\n-
\n-
106 static void create(SuperMatrix *
mat ,
int n,
int m,
double *dat,
int n1,
\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 dCreate_Dense_Matrix(
mat , n, m, dat, n1, stype, dtype, 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-
113 static void destroy(SuperMatrix * )
\n-
\n-
\n-
\n-
117 struct SuperLUSolveChooser<double>
\n-
\n-
119 static void solve(superlu_options_t *options, SuperMatrix *
mat ,
int *perm_c,
int *perm_r,
int *etree,
\n-
120 char *equed,
double *R,
double *C, SuperMatrix *L, SuperMatrix *U,
\n-
121 void *work,
int lwork, SuperMatrix *B, SuperMatrix *X,
\n-
122 double *rpg,
double *rcond,
double *ferr,
double *berr,
\n-
123 mem_usage_t *memusage, SuperLUStat_t *stat,
int *info)
\n-
\n-
\n-
126 dgssvx(options,
mat , perm_c, perm_r, etree, equed, R, C,
\n-
127 L, U, work, lwork, B, X, rpg, rcond, ferr, berr,
\n-
128 &gLU, memusage, stat, info);
\n-
\n-
\n-
\n-
\n-
133 struct QuerySpaceChooser<double>
\n-
\n-
135 static void querySpace(SuperMatrix* L, SuperMatrix* U, mem_usage_t* memusage)
\n-
\n-
137 dQuerySpace(L,U,memusage);
\n-
\n-
\n-
\n-
\n-
142 #if __has_include("slu_zdefs.h") \n-
\n-
144 struct SuperLUDenseMatChooser<
std ::complex<double> >
\n-
\n-
146 static void create(SuperMatrix *
mat ,
int n,
int m, std::complex<double> *dat,
int n1,
\n-
147 Stype_t stype, Dtype_t dtype, Mtype_t mtype)
\n-
\n-
149 zCreate_Dense_Matrix(
mat , n, m,
reinterpret_cast< doublecomplex*
> (dat), n1, stype, dtype, mtype);
\n-
\n-
\n-
\n-
153 static void destroy(SuperMatrix*)
\n-
\n-
\n-
\n-
\n-
158 struct SuperLUSolveChooser<
std ::complex<double> >
\n-
\n-
160 static void solve(superlu_options_t *options, SuperMatrix *
mat ,
int *perm_c,
int *perm_r,
int *etree,
\n-
161 char *equed,
double *R,
double *C, SuperMatrix *L, SuperMatrix *U,
\n-
162 void *work,
int lwork, SuperMatrix *B, SuperMatrix *X,
\n-
163 double *rpg,
double *rcond,
double *ferr,
double *berr,
\n-
164 mem_usage_t *memusage, SuperLUStat_t *stat,
int *info)
\n-
\n-
\n-
167 zgssvx(options,
mat , perm_c, perm_r, etree, equed, R, C,
\n-
168 L, U, work, lwork, B, X, rpg, rcond, ferr, berr,
\n-
169 &gLU, memusage, stat, info);
\n-
\n-
\n-
\n-
\n-
174 struct QuerySpaceChooser<
std ::complex<double> >
\n-
\n-
176 static void querySpace(SuperMatrix* L, SuperMatrix* U, mem_usage_t* memusage)
\n-
\n-
178 zQuerySpace(L,U,memusage);
\n-
\n-
\n-
\n-
\n-
183 #if __has_include("slu_cdefs.h") \n-
\n-
185 struct SuperLUDenseMatChooser<
std ::complex<float> >
\n-
\n-
187 static void create(SuperMatrix *
mat ,
int n,
int m, std::complex<float> *dat,
int n1,
\n-
188 Stype_t stype, Dtype_t dtype, Mtype_t mtype)
\n-
\n-
190 cCreate_Dense_Matrix(
mat , n, m,
reinterpret_cast< ::complex*
> (dat), n1, stype, dtype, mtype);
\n-
\n-
\n-
\n-
194 static void destroy(SuperMatrix* )
\n-
\n-
\n-
\n-
\n-
199 struct SuperLUSolveChooser<
std ::complex<float> >
\n-
\n-
201 static void solve(superlu_options_t *options, SuperMatrix *
mat ,
int *perm_c,
int *perm_r,
int *etree,
\n-
202 char *equed,
float *R,
float *C, SuperMatrix *L, SuperMatrix *U,
\n-
203 void *work,
int lwork, SuperMatrix *B, SuperMatrix *X,
\n-
204 float *rpg,
float *rcond,
float *ferr,
float *berr,
\n-
205 mem_usage_t *memusage, SuperLUStat_t *stat,
int *info)
\n-
\n-
\n-
208 cgssvx(options,
mat , perm_c, perm_r, etree, equed, R, C,
\n-
209 L, U, work, lwork, B, X, rpg, rcond, ferr, berr,
\n-
210 &gLU, memusage, stat, info);
\n-
\n-
\n-
\n-
\n-
215 struct QuerySpaceChooser<
std ::complex<float> >
\n-
\n-
217 static void querySpace(SuperMatrix* L, SuperMatrix* U, mem_usage_t* memusage)
\n-
\n-
219 cQuerySpace(L,U,memusage);
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
227 struct SuperLUVectorChooser
\n-
\n-
\n-
230 template <
typename T,
typename A,
int n,
int m>
\n-
231 struct SuperLUVectorChooser<BCRSMatrix<FieldMatrix<T,n,m>,A > >
\n-
\n-
234 using domain_type = BlockVector<
\n-
\n-
236 typename std::allocator_traits<A>::template rebind_alloc<FieldVector<T,m> > >;
\n-
238 using range_type = BlockVector<
\n-
\n-
240 typename std::allocator_traits<A>::template rebind_alloc<FieldVector<T,n> > >;
\n-
\n-
\n-
243 template <
typename T,
typename A>
\n-
244 struct SuperLUVectorChooser<BCRSMatrix<T,A> >
\n-
\n-
247 using domain_type = BlockVector<T, A>;
\n-
249 using range_type = BlockVector<T, A>;
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
269 typename Impl::SuperLUVectorChooser<M>::domain_type,
\n-
270 typename Impl::SuperLUVectorChooser<M>::range_type >
\n-
\n-
272 using T =
typename M::field_type;
\n-
\n-
\n-
\n-
\n-
\n-
282 using domain_type =
typename Impl::SuperLUVectorChooser<M>::domain_type;
\n-
284 using range_type =
typename Impl::SuperLUVectorChooser<M>::range_type;
\n-
\n-
\n-
\n-
\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-
307 bool reusevector=
true );
\n-
\n-
\n-
\n-
\n-
321 :
SuperLU (
mat , config.
get <bool>(
"verbose" , false), config.
get <bool>(
"reuseVector" , true))
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
350 void apply (T* x, T* b);
\n-
\n-
\n-
\n-
\n-
355 typename SuperLUMatrix::size_type
nnz ()
const \n-
\n-
357 return mat.nonzeroes();
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
371 const char *
name () {
return "SuperLU" ; }
\n-
\n-
373 template <
class Mat,
class X,
class TM,
class TD,
class T1>
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
383 SuperMatrix L, U, B, X;
\n-
384 int *perm_c, *perm_r, *etree;
\n-
\n-
\n-
387 superlu_options_t options;
\n-
\n-
\n-
\n-
391 bool first, verbose, reusevector;
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
411 Destroy_SuperNode_Matrix(&L);
\n-
412 Destroy_CompCol_Matrix(&U);
\n-
\n-
\n-
415 if (!first && reusevector) {
\n-
416 SUPERLU_FREE(B.Store);
\n-
417 SUPERLU_FREE(X.Store);
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
425 : work(0), lwork(0), first(true), verbose(verbose_),
\n-
426 reusevector(reusevector_)
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
433 : work(0), lwork(0),verbose(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-
466 mat .setMatrix(mat_,mrs);
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
475 perm_c =
new int [
mat .
M ()];
\n-
476 perm_r =
new int [
mat .
N ()];
\n-
477 etree =
new int [
mat .
M ()];
\n-
\n-
\n-
\n-
481 set_default_options(&options);
\n-
\n-
\n-
\n-
\n-
\n-
\n-
488 fakeFormat.lda=
mat .
N ();
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
498 mem_usage_t memusage;
\n-
\n-
\n-
\n-
\n-
503 &L, &U, work, lwork, &B, &X, &rpg, &rcond, &ferr,
\n-
504 &berr, &memusage, &stat, &info);
\n-
\n-
\n-
507 dinfo<<
"LU factorization: dgssvx() returns info " << info<<std::endl;
\n-
\n-
509 auto nSuperLUCol =
static_cast< SuperMatrix&
> (
mat ).ncol;
\n-
\n-
511 if ( info == 0 || info == nSuperLUCol+1 ) {
\n-
\n-
513 if ( options.PivotGrowth )
\n-
514 dinfo<<
"Recip. pivot growth = " <<rpg<<std::endl;
\n-
515 if ( options.ConditionNumber )
\n-
516 dinfo<<
"Recip. condition number = %e\\n" << rcond<<std::endl;
\n-
517 SCformat* Lstore = (SCformat *) L.Store;
\n-
518 NCformat* Ustore = (NCformat *) U.Store;
\n-
519 dinfo<<
"No of nonzeros in factor L = " << Lstore->nnz<<std::endl;
\n-
520 dinfo<<
"No of nonzeros in factor U = " << Ustore->nnz<<std::endl;
\n-
521 dinfo<<
"No of nonzeros in L+U = " << Lstore->nnz + Ustore->nnz - nSuperLUCol<<std::endl;
\n-
\n-
523 dinfo<<
"L\\\\U MB " <<memusage.for_lu/1e6<<
" \\ttotal MB needed " <<memusage.total_needed/1e6
\n-
\n-
525 std::cout<<stat.expansions<<std::endl;
\n-
\n-
527 }
else if ( info > 0 && lwork == -1 ) {
\n-
528 dinfo<<
"** Estimated memory: " << info - nSuperLUCol<<std::endl;
\n-
\n-
530 if ( options.PrintStat ) StatPrint(&stat);
\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-
558 options.Fact = FACTORED;
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
565 if (
mat .
N () != b.dim())
\n-
566 DUNE_THROW(
ISTLError ,
"Size of right-hand-side vector b does not match the number of matrix rows!" );
\n-
567 if (
mat .
M () != x.dim())
\n-
568 DUNE_THROW(
ISTLError ,
"Size of solution vector x does not match the number of matrix columns!" );
\n-
\n-
570 DUNE_THROW(
ISTLError ,
"Matrix of SuperLU is null!" );
\n-
\n-
572 SuperMatrix* mB = &B;
\n-
573 SuperMatrix* mX = &X;
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
581 ((DNformat*)B.Store)->nzval=&b[0];
\n-
582 ((DNformat*)X.Store)->nzval=&x[0];
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
592 mem_usage_t memusage;
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
602 options.IterRefine=SLU_DOUBLE;
\n-
\n-
\n-
605 &L, &U, work, lwork, mB, mX, &rpg, &rcond, &ferr, &berr,
\n-
606 &memusage, &stat, &info);
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
626 dinfo<<
"Triangular solve: dgssvx() returns info " << info<<std::endl;
\n-
\n-
628 auto nSuperLUCol =
static_cast< SuperMatrix&
> (
mat ).ncol;
\n-
\n-
630 if ( info == 0 || info == nSuperLUCol+1 ) {
\n-
\n-
632 if ( options.IterRefine ) {
\n-
633 std::cout<<
"Iterative Refinement: steps=" \n-
634 <<stat.RefineSteps<<
" FERR=" <<ferr<<
" BERR=" <<berr<<std::endl;
\n-
\n-
636 std::cout<<
" FERR=" <<ferr<<
" BERR=" <<berr<<std::endl;
\n-
637 }
else if ( info > 0 && lwork == -1 ) {
\n-
638 std::cout<<
"** Estimated memory: " << info - nSuperLUCol<<
" bytes" <<std::endl;
\n-
\n-
\n-
641 if ( options.PrintStat ) StatPrint(&stat);
\n-
\n-
\n-
\n-
645 SUPERLU_FREE(rB.Store);
\n-
646 SUPERLU_FREE(rX.Store);
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
655 DUNE_THROW(
ISTLError ,
"Matrix of SuperLU is null!" );
\n-
\n-
657 SuperMatrix* mB = &B;
\n-
658 SuperMatrix* mX = &X;
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
666 ((DNformat*) B.Store)->nzval=b;
\n-
667 ((DNformat*)X.Store)->nzval=x;
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
678 mem_usage_t memusage;
\n-
\n-
\n-
\n-
\n-
683 options.IterRefine=SLU_DOUBLE;
\n-
\n-
\n-
686 &L, &U, work, lwork, mB, mX, &rpg, &rcond, &ferr, &berr,
\n-
687 &memusage, &stat, &info);
\n-
\n-
\n-
690 dinfo<<
"Triangular solve: dgssvx() returns info " << info<<std::endl;
\n-
\n-
692 auto nSuperLUCol =
static_cast< SuperMatrix&
> (
mat ).ncol;
\n-
\n-
694 if ( info == 0 || info == nSuperLUCol+1 ) {
\n-
\n-
696 if ( options.IterRefine ) {
\n-
697 dinfo<<
"Iterative Refinement: steps=" \n-
698 <<stat.RefineSteps<<
" FERR=" <<ferr<<
" BERR=" <<berr<<std::endl;
\n-
\n-
700 dinfo<<
" FERR=" <<ferr<<
" BERR=" <<berr<<std::endl;
\n-
701 }
else if ( info > 0 && lwork == -1 ) {
\n-
702 dinfo<<
"** Estimated memory: " << info - nSuperLUCol<<
" bytes" <<std::endl;
\n-
\n-
704 if ( options.PrintStat ) StatPrint(&stat);
\n-
\n-
\n-
\n-
\n-
709 SUPERLU_FREE(rB.Store);
\n-
710 SUPERLU_FREE(rX.Store);
\n-
\n-
\n-
\n-
715 template <
typename T,
typename A>
\n-
\n-
\n-
721 template <
typename T,
typename A>
\n-
\n-
\n-
\n-
\n-
\n-
\n-
730 template <
int k>
struct isValidBlock <
Dune ::FieldVector<std::complex<double>,k>> : std::true_type{};
\n-
731 template <
typename TL,
typename M>
\n-
732 std::shared_ptr<Dune::InverseOperator<typename Dune::TypeListElement<1, TL>::type,
\n-
733 typename Dune::TypeListElement<2, TL>::type>>
\n-
\n-
\n-
735 std::enable_if_t<
isValidBlock <
typename Dune::TypeListElement<1, TL>::type::block_type>::value,
int > = 0)
const \n-
\n-
737 int verbose = config.get(
"verbose" , 0);
\n-
738 return std::make_shared<Dune::SuperLU<M>>(
mat ,verbose);
\n-
\n-
\n-
\n-
\n-
742 template <
typename TL,
typename M>
\n-
743 std::shared_ptr<Dune::InverseOperator<typename Dune::TypeListElement<1, TL>::type,
\n-
744 typename Dune::TypeListElement<2, TL>::type>>
\n-
\n-
\n-
746 std::enable_if_t<!
isValidBlock <
typename Dune::TypeListElement<1, TL>::type::block_type>::value,
int > = 0)
const \n-
\n-
\n-
749 "Unsupported Type in SuperLU (only double and std::complex<double> supported)" );
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
759 #undef FIRSTCOL_OF_SNODE \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-
This file implements a vector space as a tensor product of a given vector space. The number of compon...
\n-
\n-
Implementations of the inverse operator interface.
\n-
\n-
Templates characterizing the type of a solver.
\n-
Implementation of the BCRSMatrix class.
\n-
\n-
#define DUNE_REGISTER_DIRECT_SOLVER(name,...)
Definition solverregistry.hh:13
\n-
void setSubMatrix(const Matrix &mat, const S &rowIndexSet)
Definition superlu.hh:457
\n-
void apply(domain_type &x, range_type &b, InverseOperatorResult &res)
Apply inverse operator,.
Definition superlu.hh:563
\n-
void setVerbosity(bool v)
Definition superlu.hh:437
\n-
void free()
free allocated space.
Definition superlu.hh:403
\n-
~SuperLU()
Definition superlu.hh:396
\n-
SuperLU()
Empty default constructor.
Definition superlu.hh:432
\n-
void setMatrix(const Matrix &mat)
Initialize data from given matrix.
Definition superlu.hh:443
\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+
\n+
Implementation of the BCRSMatrix class.
\n+
\n
Matrix & mat
Definition matrixmatrix.hh:347
\n
\n
Definition allocator.hh:11
\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+
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-
derive error class from the base class in common
Definition istlexception.hh:19
\n+
A::size_type size_type
The type for the index access and the size.
Definition bcrsmatrix.hh:500
\n
Sequential overlapping Schwarz preconditioner.
Definition overlappingschwarz.hh:755
\n
Definition overlappingschwarz.hh:694
\n-
A generic dynamic dense matrix.
Definition matrix.hh:561
\n-
size_type M() const
Return the number of columns.
Definition matrix.hh:700
\n-
size_type N() const
Return the number of rows.
Definition matrix.hh:695
\n-
Statistics about the application of an inverse operator.
Definition solver.hh:48
\n-
int iterations
Number of iterations.
Definition solver.hh:67
\n-
bool converged
True if convergence criterion has been met.
Definition solver.hh:73
\n-
Abstract base class for all solvers.
Definition solver.hh:99
\n-
Category
Definition solvercategory.hh:23
\n-
@ sequential
Category for sequential solvers.
Definition solvercategory.hh:25
\n-
Definition solverregistry.hh:77
\n-
Definition solvertype.hh:16
\n-
@ value
Whether this is a direct solver.
Definition solvertype.hh:24
\n-
Definition solvertype.hh:30
\n-
@ value
whether the solver internally uses column compressed storage
Definition solvertype.hh:36
\n-
\n-
\n-
\n-
\n
SuperLu Solver.
Definition superlu.hh:271
\n-
SuperLUMatrix::size_type nnz() const
Definition superlu.hh:355
\n-
void apply(domain_type &x, range_type &b, double reduction, InverseOperatorResult &res)
apply inverse operator, with given convergence criteria.
Definition superlu.hh:342
\n-
typename Impl::SuperLUVectorChooser< M >::range_type range_type
The type of the range of the solver.
Definition superlu.hh:284
\n-
M matrix_type
Definition superlu.hh:276
\n-
SuperMatrixInitializer< Matrix > MatrixInitializer
Type of an associated initializer class.
Definition superlu.hh:280
\n-
M Matrix
The matrix type.
Definition superlu.hh:275
\n-
typename Impl::SuperLUVectorChooser< M >::domain_type domain_type
The type of the domain of the solver.
Definition superlu.hh:282
\n-
const char * name()
Definition superlu.hh:371
\n-
virtual SolverCategory::Category category() const
Category of the solver (see SolverCategory::Category)
Definition superlu.hh:287
\n-
Dune::SuperLUMatrix< Matrix > SuperLUMatrix
The corresponding SuperLU Matrix type.
Definition superlu.hh:278
\n-
SuperLU(const Matrix &mat, const ParameterTree &config)
Constructs the SuperLU solver.
Definition superlu.hh:320
\n-
Definition superlu.hh:727
\n-
std::shared_ptr< Dune::InverseOperator< typename Dune::TypeListElement< 1, TL >::type, typename Dune::TypeListElement< 2, TL >::type > > operator()(TL, const M &mat, const Dune::ParameterTree &config, std::enable_if_t< isValidBlock< typename Dune::TypeListElement< 1, TL >::type::block_type >::value, int >=0) const
Definition superlu.hh:734
\n-
Definition superlu.hh:728
\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
\n \n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,947 +1,461 @@\n dune-istl\u00a02.9.0\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bi_\bs_\bt_\bl\n-superlu.hh\n+supermatrix.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 (C) 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_SUPERLU_HH\n-6#define DUNE_ISTL_SUPERLU_HH\n+5#ifndef DUNE_ISTL_SUPERMATRIX_HH\n+6#define DUNE_ISTL_SUPERMATRIX_HH\n 7\n 8#if HAVE_SUPERLU\n 9\n-10#include \"_\bs_\bu_\bp_\be_\br_\bl_\bu_\bf_\bu_\bn_\bc_\bt_\bi_\bo_\bn_\bs_\b._\bh_\bh\"\n-11#include \"_\bs_\bo_\bl_\bv_\be_\br_\bs_\b._\bh_\bh\"\n-12#include \"_\bs_\bu_\bp_\be_\br_\bm_\ba_\bt_\br_\bi_\bx_\b._\bh_\bh\"\n-13#include
\n-14#include \n-15#include \"_\bb_\bc_\br_\bs_\bm_\ba_\bt_\br_\bi_\bx_\b._\bh_\bh\"\n-16#include \"_\bb_\bv_\be_\bc_\bt_\bo_\br_\b._\bh_\bh\"\n-17#include \"_\bi_\bs_\bt_\bl_\be_\bx_\bc_\be_\bp_\bt_\bi_\bo_\bn_\b._\bh_\bh\"\n-18#include \n-19#include \n-20#include \n-21#include <_\bd_\bu_\bn_\be_\b/_\bi_\bs_\bt_\bl_\b/_\bs_\bo_\bl_\bv_\be_\br_\bt_\by_\bp_\be_\b._\bh_\bh>\n-22#include <_\bd_\bu_\bn_\be_\b/_\bi_\bs_\bt_\bl_\b/_\bs_\bo_\bl_\bv_\be_\br_\bf_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\bh>\n+10#include \"_\bb_\bc_\br_\bs_\bm_\ba_\bt_\br_\bi_\bx_\b._\bh_\bh\"\n+11#include \"_\bb_\bv_\be_\bc_\bt_\bo_\br_\b._\bh_\bh\"\n+12#include \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+20\n+21namespace _\bD_\bu_\bn_\be\n+22{\n 23\n-24namespace _\bD_\bu_\bn_\be\n-25{\n-26\n-37 template\n-38 class SeqOverlappingSchwarz;\n-39\n-40 template\n-41 struct SeqOverlappingSchwarzAssemblerHelper;\n-42\n-43 template\n-_\b4_\b4 struct _\bS_\bu_\bp_\be_\br_\bL_\bU_\bS_\bo_\bl_\bv_\be_\bC_\bh_\bo_\bo_\bs_\be_\br\n-45 {};\n-46\n-47 template\n-_\b4_\b8 struct _\bS_\bu_\bp_\be_\br_\bL_\bU_\bD_\be_\bn_\bs_\be_\bM_\ba_\bt_\bC_\bh_\bo_\bo_\bs_\be_\br\n-49 {};\n-50\n-51 template\n-_\b5_\b2 struct _\bS_\bu_\bp_\be_\br_\bL_\bU_\bQ_\bu_\be_\br_\by_\bC_\bh_\bo_\bo_\bs_\be_\br\n-53 {};\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+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 template\n-_\b5_\b6 struct _\bQ_\bu_\be_\br_\by_\bS_\bp_\ba_\bc_\be_\bC_\bh_\bo_\bo_\bs_\be_\br\n-57 {};\n-58\n-59#if __has_include(\"slu_sdefs.h\")\n-60 template<>\n-61 struct _\bS_\bu_\bp_\be_\br_\bL_\bU_\bD_\be_\bn_\bs_\be_\bM_\ba_\bt_\bC_\bh_\bo_\bo_\bs_\be_\br\n+55#if __has_include(\"slu_ddefs.h\")\n+56 template<>\n+57 struct SuperMatrixCreateSparseChooser\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 static void create(SuperMatrix *_\bm_\ba_\bt, int n, int m, float *dat, int n1,\n-64 Stype_t stype, Dtype_t dtype, Mtype_t mtype)\n-65 {\n-66 sCreate_Dense_Matrix(_\bm_\ba_\bt, n, m, dat, n1, stype, dtype, mtype);\n+63 dCreate_CompCol_Matrix(_\bm_\ba_\bt, n, m, offset, values, rowindex, colindex,\n+64 stype, dtype, mtype);\n+65 }\n+66 };\n 67\n-68 }\n-69\n-70 static void destroy(SuperMatrix*)\n-71 {}\n-72\n-73 };\n-74 template<>\n-75 struct SuperLUSolveChooser\n-76 {\n-77 static void solve(superlu_options_t *options, SuperMatrix *_\bm_\ba_\bt, int *perm_c,\n-int *perm_r, int *etree,\n-78 char *equed, float *R, float *C, SuperMatrix *L, SuperMatrix *U,\n-79 void *work, int lwork, SuperMatrix *B, SuperMatrix *X,\n-80 float *rpg, float *rcond, float *ferr, float *berr,\n-81 mem_usage_t *memusage, SuperLUStat_t *stat, int *info)\n-82 {\n-83 GlobalLU_t gLU;\n-84 sgssvx(options, _\bm_\ba_\bt, perm_c, perm_r, etree, equed, R, C,\n-85 L, U, work, lwork, B, X, rpg, rcond, ferr, berr,\n-86 &gLU, memusage, stat, info);\n-87 }\n-88 };\n-89\n-90 template<>\n-91 struct QuerySpaceChooser\n-92 {\n-93 static void querySpace(SuperMatrix* L, SuperMatrix* U, mem_usage_t*\n-memusage)\n-94 {\n-95 sQuerySpace(L,U,memusage);\n-96 }\n-97 };\n-98\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_ddefs.h\")\n-102\n-103 template<>\n-104 struct SuperLUDenseMatChooser\n-105 {\n-106 static void create(SuperMatrix *_\bm_\ba_\bt, int n, int m, double *dat, int n1,\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 dCreate_Dense_Matrix(_\bm_\ba_\bt, n, m, dat, n1, stype, dtype, mtype);\n-110\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 static void destroy(SuperMatrix * /* mat */)\n-114 {}\n-115 };\n-116 template<>\n-117 struct SuperLUSolveChooser\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 static void solve(superlu_options_t *options, SuperMatrix *_\bm_\ba_\bt, int\n-*perm_c, int *perm_r, int *etree,\n-120 char *equed, double *R, double *C, SuperMatrix *L, SuperMatrix *U,\n-121 void *work, int lwork, SuperMatrix *B, SuperMatrix *X,\n-122 double *rpg, double *rcond, double *ferr, double *berr,\n-123 mem_usage_t *memusage, SuperLUStat_t *stat, int *info)\n-124 {\n-125 GlobalLU_t gLU;\n-126 dgssvx(options, _\bm_\ba_\bt, perm_c, perm_r, etree, equed, R, C,\n-127 L, U, work, lwork, B, X, rpg, rcond, ferr, berr,\n-128 &gLU, memusage, stat, info);\n-129 }\n-130 };\n-131\n-132 template<>\n-133 struct QuerySpaceChooser\n-134 {\n-135 static void querySpace(SuperMatrix* L, SuperMatrix* U, mem_usage_t*\n-memusage)\n-136 {\n-137 dQuerySpace(L,U,memusage);\n-138 }\n-139 };\n-140#endif\n-141\n-142#if __has_include(\"slu_zdefs.h\")\n-143 template<>\n-144 struct SuperLUDenseMatChooser<_\bs_\bt_\bd::complex >\n-145 {\n-146 static void create(SuperMatrix *_\bm_\ba_\bt, int n, int m, std::complex\n-*dat, int n1,\n-147 Stype_t stype, Dtype_t dtype, Mtype_t mtype)\n-148 {\n-149 zCreate_Dense_Matrix(_\bm_\ba_\bt, n, m, reinterpret_cast(dat), n1,\n-stype, dtype, mtype);\n-150\n-151 }\n-152\n-153 static void destroy(SuperMatrix*)\n-154 {}\n-155 };\n-156\n-157 template<>\n-158 struct SuperLUSolveChooser<_\bs_\bt_\bd::complex >\n-159 {\n-160 static void solve(superlu_options_t *options, SuperMatrix *_\bm_\ba_\bt, int\n-*perm_c, int *perm_r, int *etree,\n-161 char *equed, double *R, double *C, SuperMatrix *L, SuperMatrix *U,\n-162 void *work, int lwork, SuperMatrix *B, SuperMatrix *X,\n-163 double *rpg, double *rcond, double *ferr, double *berr,\n-164 mem_usage_t *memusage, SuperLUStat_t *stat, int *info)\n-165 {\n-166 GlobalLU_t gLU;\n-167 zgssvx(options, _\bm_\ba_\bt, perm_c, perm_r, etree, equed, R, C,\n-168 L, U, work, lwork, B, X, rpg, rcond, ferr, berr,\n-169 &gLU, memusage, stat, info);\n-170 }\n-171 };\n-172\n-173 template<>\n-174 struct QuerySpaceChooser<_\bs_\bt_\bd::complex >\n-175 {\n-176 static void querySpace(SuperMatrix* L, SuperMatrix* U, mem_usage_t*\n-memusage)\n-177 {\n-178 zQuerySpace(L,U,memusage);\n-179 }\n-180 };\n-181#endif\n-182\n-183#if __has_include(\"slu_cdefs.h\")\n-184 template<>\n-185 struct SuperLUDenseMatChooser<_\bs_\bt_\bd::complex >\n-186 {\n-187 static void create(SuperMatrix *_\bm_\ba_\bt, int n, int m, std::complex\n-*dat, int n1,\n-188 Stype_t stype, Dtype_t dtype, Mtype_t mtype)\n-189 {\n-190 cCreate_Dense_Matrix(_\bm_\ba_\bt, n, m, reinterpret_cast< ::complex*>(dat), n1,\n-stype, dtype, mtype);\n-191\n-192 }\n-193\n-194 static void destroy(SuperMatrix* /* mat */)\n-195 {}\n-196 };\n-197\n-198 template<>\n-199 struct SuperLUSolveChooser<_\bs_\bt_\bd::complex >\n-200 {\n-201 static void solve(superlu_options_t *options, SuperMatrix *_\bm_\ba_\bt, int\n-*perm_c, int *perm_r, int *etree,\n-202 char *equed, float *R, float *C, SuperMatrix *L, SuperMatrix *U,\n-203 void *work, int lwork, SuperMatrix *B, SuperMatrix *X,\n-204 float *rpg, float *rcond, float *ferr, float *berr,\n-205 mem_usage_t *memusage, SuperLUStat_t *stat, int *info)\n-206 {\n-207 GlobalLU_t gLU;\n-208 cgssvx(options, _\bm_\ba_\bt, perm_c, perm_r, etree, equed, R, C,\n-209 L, U, work, lwork, B, X, rpg, rcond, ferr, berr,\n-210 &gLU, memusage, stat, info);\n-211 }\n-212 };\n-213\n-214 template<>\n-215 struct QuerySpaceChooser<_\bs_\bt_\bd::complex >\n-216 {\n-217 static void querySpace(SuperMatrix* L, SuperMatrix* U, mem_usage_t*\n-memusage)\n-218 {\n-219 cQuerySpace(L,U,memusage);\n-220 }\n-221 };\n-222#endif\n-223\n-224 namespace Impl\n-225 {\n-226 template\n-227 struct SuperLUVectorChooser\n-228 {};\n-229\n-230 template\n-231 struct SuperLUVectorChooser,A > >\n-232 {\n-234 using domain_type = BlockVector<\n-235 FieldVector,\n-236 typename std::allocator_traits::template rebind_alloc >\n->;\n-238 using range_type = BlockVector<\n-239 FieldVector,\n-240 typename std::allocator_traits::template rebind_alloc >\n->;\n-241 };\n-242\n-243 template\n-244 struct SuperLUVectorChooser >\n-245 {\n-247 using domain_type = BlockVector;\n-249 using range_type = BlockVector;\n-250 };\n-251 }\n-252\n-266 template\n-_\b2_\b6_\b7 class _\bS_\bu_\bp_\be_\br_\bL_\bU\n-268 : public _\bI_\bn_\bv_\be_\br_\bs_\be_\bO_\bp_\be_\br_\ba_\bt_\bo_\br<\n-269 typename Impl::SuperLUVectorChooser::domain_type,\n-270 typename Impl::SuperLUVectorChooser::range_type >\n-271 {\n-272 using T = typename M::field_type;\n-273 public:\n-_\b2_\b7_\b5 using _\bM_\ba_\bt_\br_\bi_\bx = M;\n-_\b2_\b7_\b6 using _\bm_\ba_\bt_\br_\bi_\bx_\b__\bt_\by_\bp_\be = M;\n-_\b2_\b7_\b8 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-_\b2_\b8_\b0 typedef _\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> _\bM_\ba_\bt_\br_\bi_\bx_\bI_\bn_\bi_\bt_\bi_\ba_\bl_\bi_\bz_\be_\br;\n-_\b2_\b8_\b2 using _\bd_\bo_\bm_\ba_\bi_\bn_\b__\bt_\by_\bp_\be = typename Impl::SuperLUVectorChooser::domain_type;\n-_\b2_\b8_\b4 using _\br_\ba_\bn_\bg_\be_\b__\bt_\by_\bp_\be = typename Impl::SuperLUVectorChooser::range_type;\n-285\n-_\b2_\b8_\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-288 {\n-289 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_\b:_\b:_\bs_\be_\bq_\bu_\be_\bn_\bt_\bi_\ba_\bl;\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-306 explicit _\bS_\bu_\bp_\be_\br_\bL_\bU(const _\bM_\ba_\bt_\br_\bi_\bx& mat, bool verbose=false,\n-307 bool reusevector=true);\n-308\n-309\n-_\b3_\b2_\b0 _\bS_\bu_\bp_\be_\br_\bL_\bU(const _\bM_\ba_\bt_\br_\bi_\bx& mat, const ParameterTree& config)\n-321 : _\bS_\bu_\bp_\be_\br_\bL_\bU(_\bm_\ba_\bt, config._\bg_\be_\bt(\"verbose\", false), config._\bg_\be_\bt\n-(\"reuseVector\", true))\n-322 {}\n-323\n-330 _\bS_\bu_\bp_\be_\br_\bL_\bU();\n-331\n-332 _\b~_\bS_\bu_\bp_\be_\br_\bL_\bU();\n-333\n-337 void _\ba_\bp_\bp_\bl_\by(_\bd_\bo_\bm_\ba_\bi_\bn_\b__\bt_\by_\bp_\be& x, _\br_\ba_\bn_\bg_\be_\b__\bt_\by_\bp_\be& b, _\bI_\bn_\bv_\be_\br_\bs_\be_\bO_\bp_\be_\br_\ba_\bt_\bo_\br_\bR_\be_\bs_\bu_\bl_\bt& res);\n-338\n-_\b3_\b4_\b2 void _\ba_\bp_\bp_\bl_\by (_\bd_\bo_\bm_\ba_\bi_\bn_\b__\bt_\by_\bp_\be& x, _\br_\ba_\bn_\bg_\be_\b__\bt_\by_\bp_\be& b, [[maybe_unused]] double\n-reduction, _\bI_\bn_\bv_\be_\br_\bs_\be_\bO_\bp_\be_\br_\ba_\bt_\bo_\br_\bR_\be_\bs_\bu_\bl_\bt& res)\n-343 {\n-344 _\ba_\bp_\bp_\bl_\by(x,b,res);\n-345 }\n-346\n-350 void _\ba_\bp_\bp_\bl_\by(T* x, T* b);\n-351\n-353 void _\bs_\be_\bt_\bM_\ba_\bt_\br_\bi_\bx(const _\bM_\ba_\bt_\br_\bi_\bx& mat);\n-354\n-_\b3_\b5_\b5 typename SuperLUMatrix::size_type _\bn_\bn_\bz() const\n-356 {\n-357 return mat.nonzeroes();\n-358 }\n-359\n-360 template\n-361 void _\bs_\be_\bt_\bS_\bu_\bb_\bM_\ba_\bt_\br_\bi_\bx(const _\bM_\ba_\bt_\br_\bi_\bx& mat, const S& rowIndexSet);\n-362\n-363 void _\bs_\be_\bt_\bV_\be_\br_\bb_\bo_\bs_\bi_\bt_\by(bool v);\n-364\n-369 void _\bf_\br_\be_\be();\n-370\n-_\b3_\b7_\b1 const char* _\bn_\ba_\bm_\be() { return \"SuperLU\"; }\n-372 private:\n-373 template\n-_\b3_\b7_\b4 friend class _\bS_\be_\bq_\bO_\bv_\be_\br_\bl_\ba_\bp_\bp_\bi_\bn_\bg_\bS_\bc_\bh_\bw_\ba_\br_\bz;\n-375 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-376\n-377 _\bS_\bu_\bp_\be_\br_\bL_\bU_\bM_\ba_\bt_\br_\bi_\bx& getInternalMatrix() { return _\bm_\ba_\bt; }\n-378\n-380 void decompose();\n-381\n-382 _\bS_\bu_\bp_\be_\br_\bL_\bU_\bM_\ba_\bt_\br_\bi_\bx _\bm_\ba_\bt;\n-383 SuperMatrix L, U, B, X;\n-384 int *perm_c, *perm_r, *etree;\n-385 typename _\bG_\be_\bt_\bS_\bu_\bp_\be_\br_\bL_\bU_\bT_\by_\bp_\be_\b<_\bT_\b>_\b:_\b:_\bf_\bl_\bo_\ba_\bt_\b__\bt_\by_\bp_\be *R, *C;\n-386 T *bstore;\n-387 superlu_options_t options;\n-388 char equed;\n-389 void *work;\n-390 int lwork;\n-391 bool first, verbose, reusevector;\n-392 };\n-393\n-394 template\n-395 SuperLU\n-_\b3_\b9_\b6 ::~SuperLU()\n-397 {\n-398 if(_\bm_\ba_\bt._\bN()+_\bm_\ba_\bt._\bM()>0)\n-399 free();\n-400 }\n-401\n-402 template\n-_\b4_\b0_\b3 void _\bS_\bu_\bp_\be_\br_\bL_\bU_\b<_\bM_\b>_\b:_\b:_\bf_\br_\be_\be()\n-404 {\n-405 delete[] perm_c;\n-406 delete[] perm_r;\n-407 delete[] etree;\n-408 delete[] R;\n-409 delete[] C;\n-410 if(lwork>=0) {\n-411 Destroy_SuperNode_Matrix(&L);\n-412 Destroy_CompCol_Matrix(&U);\n-413 }\n-414 lwork=0;\n-415 if(!first && reusevector) {\n-416 SUPERLU_FREE(B.Store);\n-417 SUPERLU_FREE(X.Store);\n-418 }\n-419 _\bm_\ba_\bt.free();\n-420 }\n-421\n-422 template\n-423 _\bS_\bu_\bp_\be_\br_\bL_\bU_\b<_\bM_\b>\n-_\b4_\b2_\b4_\b _\b:_\b:_\bS_\bu_\bp_\be_\br_\bL_\bU(const _\bM_\ba_\bt_\br_\bi_\bx& mat_, bool verbose_, bool reusevector_)\n-425 : work(0), lwork(0), first(true), verbose(verbose_),\n-426 reusevector(reusevector_)\n-427 {\n-428 _\bs_\be_\bt_\bM_\ba_\bt_\br_\bi_\bx(mat_);\n-429\n-430 }\n-431 template\n-_\b4_\b3_\b2 _\bS_\bu_\bp_\be_\br_\bL_\bU_\b<_\bM_\b>_\b:_\b:_\bS_\bu_\bp_\be_\br_\bL_\bU()\n-433 : work(0), lwork(0),verbose(false),\n-434 reusevector(false)\n-435 {}\n-436 template\n-_\b4_\b3_\b7 void _\bS_\bu_\bp_\be_\br_\bL_\bU_\b<_\bM_\b>_\b:_\b:_\bs_\be_\bt_\bV_\be_\br_\bb_\bo_\bs_\bi_\bt_\by(bool v)\n-438 {\n-439 verbose=v;\n-440 }\n-441\n-442 template\n-_\b4_\b4_\b3 void _\bS_\bu_\bp_\be_\br_\bL_\bU_\b<_\bM_\b>_\b:_\b:_\bs_\be_\bt_\bM_\ba_\bt_\br_\bi_\bx(const _\bM_\ba_\bt_\br_\bi_\bx& mat_)\n-444 {\n-445 if(_\bm_\ba_\bt._\bN()+_\bm_\ba_\bt._\bM()>0) {\n-446 free();\n-447 }\n-448 lwork=0;\n-449 work=0;\n-450 //a=&mat_;\n-451 _\bm_\ba_\bt=mat_;\n-452 decompose();\n-453 }\n-454\n-455 template\n-456 template\n-_\b4_\b5_\b7 void _\bS_\bu_\bp_\be_\br_\bL_\bU_\b<_\bM_\b>_\b:_\b:_\bs_\be_\bt_\bS_\bu_\bb_\bM_\ba_\bt_\br_\bi_\bx(const _\bM_\ba_\bt_\br_\bi_\bx& mat_,\n-458 const S& mrs)\n-459 {\n-460 if(_\bm_\ba_\bt._\bN()+_\bm_\ba_\bt._\bM()>0) {\n-461 free();\n-462 }\n-463 lwork=0;\n-464 work=0;\n-465 //a=&mat_;\n-466 _\bm_\ba_\bt.setMatrix(mat_,mrs);\n-467 decompose();\n-468 }\n-469\n-470 template\n-471 void _\bS_\bu_\bp_\be_\br_\bL_\bU_\b<_\bM_\b>_\b:_\b:_\bd_\be_\bc_\bo_\bm_\bp_\bo_\bs_\be()\n-472 {\n-473\n-474 first = true;\n-475 perm_c = new int[_\bm_\ba_\bt._\bM()];\n-476 perm_r = new int[_\bm_\ba_\bt._\bN()];\n-477 etree = new int[_\bm_\ba_\bt._\bM()];\n-478 R = new typename _\bG_\be_\bt_\bS_\bu_\bp_\be_\br_\bL_\bU_\bT_\by_\bp_\be_\b<_\bT_\b>_\b:_\b:_\bf_\bl_\bo_\ba_\bt_\b__\bt_\by_\bp_\be[_\bm_\ba_\bt._\bN()];\n-479 C = new typename _\bG_\be_\bt_\bS_\bu_\bp_\be_\br_\bL_\bU_\bT_\by_\bp_\be_\b<_\bT_\b>_\b:_\b:_\bf_\bl_\bo_\ba_\bt_\b__\bt_\by_\bp_\be[_\bm_\ba_\bt._\bM()];\n-480\n-481 set_default_options(&options);\n-482 // Do the factorization\n-483 B.ncol=0;\n-484 B.Stype=SLU_DN;\n-485 B.Dtype=_\bG_\be_\bt_\bS_\bu_\bp_\be_\br_\bL_\bU_\bT_\by_\bp_\be_\b<_\bT_\b>_\b:_\b:_\bt_\by_\bp_\be;\n-486 B.Mtype= SLU_GE;\n-487 DNformat fakeFormat;\n-488 fakeFormat.lda=_\bm_\ba_\bt._\bN();\n-489 B.Store=&fakeFormat;\n-490 X.Stype=SLU_DN;\n-491 X.Dtype=_\bG_\be_\bt_\bS_\bu_\bp_\be_\br_\bL_\bU_\bT_\by_\bp_\be_\b<_\bT_\b>_\b:_\b:_\bt_\by_\bp_\be;\n-492 X.Mtype= SLU_GE;\n-493 X.ncol=0;\n-494 X.Store=&fakeFormat;\n-495\n-496 typename _\bG_\be_\bt_\bS_\bu_\bp_\be_\br_\bL_\bU_\bT_\by_\bp_\be_\b<_\bT_\b>_\b:_\b:_\bf_\bl_\bo_\ba_\bt_\b__\bt_\by_\bp_\be rpg, rcond, ferr=1e10, berr=1e10;\n-497 int info;\n-498 mem_usage_t memusage;\n-499 SuperLUStat_t stat;\n-500\n-501 StatInit(&stat);\n-502 _\bS_\bu_\bp_\be_\br_\bL_\bU_\bS_\bo_\bl_\bv_\be_\bC_\bh_\bo_\bo_\bs_\be_\br_\b<_\bT_\b>_\b:_\b:_\bs_\bo_\bl_\bv_\be(&options, &static_cast(_\bm_\ba_\bt),\n-perm_c, perm_r, etree, &equed, R, C,\n-503 &L, &U, work, lwork, &B, &X, &rpg, &rcond, &ferr,\n-504 &berr, &memusage, &stat, &info);\n-505\n-506 if(verbose) {\n-507 dinfo<<\"LU factorization: dgssvx() returns info \"<< info<(_\bm_\ba_\bt).ncol;\n-510\n-511 if ( info == 0 || info == nSuperLUCol+1 ) {\n-512\n-513 if ( options.PivotGrowth )\n-514 dinfo<<\"Recip. pivot growth = \"<nnz<nnz<nnz + Ustore->nnz -\n-nSuperLUCol<_\b:_\b:_\bq_\bu_\be_\br_\by_\bS_\bp_\ba_\bc_\be(&L, &U, &memusage);\n-523 dinfo<<\"L\\\\U MB \"< 0 && lwork == -1 ) { // Memory allocation failed\n-528 dinfo<<\"** Estimated memory: \"<< info - nSuperLUCol<colptr[i]; c < Ustore->colptr[i+1]; ++c)\n-540 //if(Ustore->rowind[c]==i)\n-541 std::cout<rowind[c]<<\"->\"<<((double*)Ustore->nzval)[c]<<\" \";\n-542 if(k==0){\n-543 //\n-544 k=-1;\n-545 }std::cout<colptr[i]; c < Ustore->colptr[i+1]; ++c)\n-551 //if(Ustore->rowind[c]==i)\n-552 std::cout<rowind[c]<<\"->\"<<((double*)Ustore->nzval)[c]<<\" \";\n-553 if(k==0){\n-554 //\n-555 k=-1;\n-556 }std::cout<\n-562 void SuperLU\n-_\b5_\b6_\b3 ::apply(_\bd_\bo_\bm_\ba_\bi_\bn_\b__\bt_\by_\bp_\be& x, _\br_\ba_\bn_\bg_\be_\b__\bt_\by_\bp_\be& b, _\bI_\bn_\bv_\be_\br_\bs_\be_\bO_\bp_\be_\br_\ba_\bt_\bo_\br_\bR_\be_\bs_\bu_\bl_\bt& res)\n-564 {\n-565 if (_\bm_\ba_\bt._\bN() != b.dim())\n-566 DUNE_THROW(_\bI_\bS_\bT_\bL_\bE_\br_\br_\bo_\br, \"Size of right-hand-side vector b does not match the\n-number of matrix rows!\");\n-567 if (_\bm_\ba_\bt._\bM() != x.dim())\n-568 DUNE_THROW(_\bI_\bS_\bT_\bL_\bE_\br_\br_\bo_\br, \"Size of solution vector x does not match the number\n-of matrix columns!\");\n-569 if (_\bm_\ba_\bt._\bM()+_\bm_\ba_\bt._\bN()==0)\n-570 DUNE_THROW(_\bI_\bS_\bT_\bL_\bE_\br_\br_\bo_\br, \"Matrix of SuperLU is null!\");\n-571\n-572 SuperMatrix* mB = &B;\n-573 SuperMatrix* mX = &X;\n-574 SuperMatrix rB, rX;\n-575 if (reusevector) {\n-576 if(first) {\n-577 _\bS_\bu_\bp_\be_\br_\bL_\bU_\bD_\be_\bn_\bs_\be_\bM_\ba_\bt_\bC_\bh_\bo_\bo_\bs_\be_\br_\b<_\bT_\b>_\b:_\b:_\bc_\br_\be_\ba_\bt_\be(&B, (int)_\bm_\ba_\bt._\bN(), 1, reinterpret_cast\n-(&b[0]), (int)_\bm_\ba_\bt._\bN(), SLU_DN, _\bG_\be_\bt_\bS_\bu_\bp_\be_\br_\bL_\bU_\bT_\by_\bp_\be_\b<_\bT_\b>_\b:_\b:_\bt_\by_\bp_\be, SLU_GE);\n-578 _\bS_\bu_\bp_\be_\br_\bL_\bU_\bD_\be_\bn_\bs_\be_\bM_\ba_\bt_\bC_\bh_\bo_\bo_\bs_\be_\br_\b<_\bT_\b>_\b:_\b:_\bc_\br_\be_\ba_\bt_\be(&X, (int)_\bm_\ba_\bt._\bN(), 1, reinterpret_cast\n-(&x[0]), (int)_\bm_\ba_\bt._\bN(), SLU_DN, _\bG_\be_\bt_\bS_\bu_\bp_\be_\br_\bL_\bU_\bT_\by_\bp_\be_\b<_\bT_\b>_\b:_\b:_\bt_\by_\bp_\be, SLU_GE);\n-579 first=false;\n-580 }else{\n-581 ((DNformat*)B.Store)->nzval=&b[0];\n-582 ((DNformat*)X.Store)->nzval=&x[0];\n-583 }\n-584 } else {\n-585 _\bS_\bu_\bp_\be_\br_\bL_\bU_\bD_\be_\bn_\bs_\be_\bM_\ba_\bt_\bC_\bh_\bo_\bo_\bs_\be_\br_\b<_\bT_\b>_\b:_\b:_\bc_\br_\be_\ba_\bt_\be(&rB, (int)_\bm_\ba_\bt._\bN(), 1,\n-reinterpret_cast(&b[0]), (int)_\bm_\ba_\bt._\bN(), SLU_DN, _\bG_\be_\bt_\bS_\bu_\bp_\be_\br_\bL_\bU_\bT_\by_\bp_\be_\b<_\bT_\b>_\b:_\b:_\bt_\by_\bp_\be,\n-SLU_GE);\n-586 _\bS_\bu_\bp_\be_\br_\bL_\bU_\bD_\be_\bn_\bs_\be_\bM_\ba_\bt_\bC_\bh_\bo_\bo_\bs_\be_\br_\b<_\bT_\b>_\b:_\b:_\bc_\br_\be_\ba_\bt_\be(&rX, (int)_\bm_\ba_\bt._\bN(), 1,\n-reinterpret_cast(&x[0]), (int)_\bm_\ba_\bt._\bN(), SLU_DN, _\bG_\be_\bt_\bS_\bu_\bp_\be_\br_\bL_\bU_\bT_\by_\bp_\be_\b<_\bT_\b>_\b:_\b:_\bt_\by_\bp_\be,\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-587 mB = &rB;\n-588 mX = &rX;\n-589 }\n-590 typename _\bG_\be_\bt_\bS_\bu_\bp_\be_\br_\bL_\bU_\bT_\by_\bp_\be_\b<_\bT_\b>_\b:_\b:_\bf_\bl_\bo_\ba_\bt_\b__\bt_\by_\bp_\be rpg, rcond, ferr=1e10, berr;\n-591 int info;\n-592 mem_usage_t memusage;\n-593 SuperLUStat_t stat;\n-594 /* Initialize the statistics variables. */\n-595 StatInit(&stat);\n-596 /*\n-597 range_type d=b;\n-598 a->usmv(-1, x, d);\n-599\n-600 double def0=d.two_norm();\n-601 */\n-602 options.IterRefine=SLU_DOUBLE;\n-603\n-604 _\bS_\bu_\bp_\be_\br_\bL_\bU_\bS_\bo_\bl_\bv_\be_\bC_\bh_\bo_\bo_\bs_\be_\br_\b<_\bT_\b>_\b:_\b:_\bs_\bo_\bl_\bv_\be(&options, &static_cast(_\bm_\ba_\bt),\n-perm_c, perm_r, etree, &equed, R, C,\n-605 &L, &U, work, lwork, mB, mX, &rpg, &rcond, &ferr, &berr,\n-606 &memusage, &stat, &info);\n-607\n-608 res._\bi_\bt_\be_\br_\ba_\bt_\bi_\bo_\bn_\bs=1;\n-609\n-610 /*\n-611 if(options.Equil==YES)\n-612 // undo scaling of right hand side\n-613 std::transform(reinterpret_cast(&b[0]),reinterpret_cast(&b\n-[0])+mat.M(),\n-614 C, reinterpret_cast(&d[0]), std::divides());\n-615 else\n-616 d=b;\n-617 a->usmv(-1, x, d);\n-618 res.reduction=d.two_norm()/def0;\n-619 res.conv_rate = res.reduction;\n-620 res.converged=(res.reduction<1e-10||d.two_norm()<1e-18);\n-621 */\n-622 res._\bc_\bo_\bn_\bv_\be_\br_\bg_\be_\bd=true;\n-623\n-624 if(verbose) {\n-625\n-626 dinfo<<\"Triangular solve: dgssvx() returns info \"<< info<(_\bm_\ba_\bt).ncol;\n-629\n-630 if ( info == 0 || info == nSuperLUCol+1 ) {\n-631\n-632 if ( options.IterRefine ) {\n-633 std::cout<<\"Iterative Refinement: steps=\"\n-634 < 0 && lwork == -1 ) { // Memory allocation failed\n-638 std::cout<<\"** Estimated memory: \"<< info - nSuperLUCol<<\" bytes\"<\n-651 void _\bS_\bu_\bp_\be_\br_\bL_\bU_\b<_\bM_\b>\n-_\b6_\b5_\b2_\b _\b:_\b:_\ba_\bp_\bp_\bl_\by(T* x, T* b)\n-653 {\n-654 if(_\bm_\ba_\bt._\bN()+_\bm_\ba_\bt._\bM()==0)\n-655 DUNE_THROW(_\bI_\bS_\bT_\bL_\bE_\br_\br_\bo_\br, \"Matrix of SuperLU is null!\");\n-656\n-657 SuperMatrix* mB = &B;\n-658 SuperMatrix* mX = &X;\n-659 SuperMatrix rB, rX;\n-660 if (reusevector) {\n-661 if(first) {\n-662 _\bS_\bu_\bp_\be_\br_\bL_\bU_\bD_\be_\bn_\bs_\be_\bM_\ba_\bt_\bC_\bh_\bo_\bo_\bs_\be_\br_\b<_\bT_\b>_\b:_\b:_\bc_\br_\be_\ba_\bt_\be(&B, _\bm_\ba_\bt._\bN(), 1, b, _\bm_\ba_\bt._\bN(), SLU_DN,\n-_\bG_\be_\bt_\bS_\bu_\bp_\be_\br_\bL_\bU_\bT_\by_\bp_\be_\b<_\bT_\b>_\b:_\b:_\bt_\by_\bp_\be, SLU_GE);\n-663 _\bS_\bu_\bp_\be_\br_\bL_\bU_\bD_\be_\bn_\bs_\be_\bM_\ba_\bt_\bC_\bh_\bo_\bo_\bs_\be_\br_\b<_\bT_\b>_\b:_\b:_\bc_\br_\be_\ba_\bt_\be(&X, _\bm_\ba_\bt._\bN(), 1, x, _\bm_\ba_\bt._\bN(), SLU_DN,\n-_\bG_\be_\bt_\bS_\bu_\bp_\be_\br_\bL_\bU_\bT_\by_\bp_\be_\b<_\bT_\b>_\b:_\b:_\bt_\by_\bp_\be, SLU_GE);\n-664 first=false;\n-665 }else{\n-666 ((DNformat*) B.Store)->nzval=b;\n-667 ((DNformat*)X.Store)->nzval=x;\n-668 }\n-669 } else {\n-670 _\bS_\bu_\bp_\be_\br_\bL_\bU_\bD_\be_\bn_\bs_\be_\bM_\ba_\bt_\bC_\bh_\bo_\bo_\bs_\be_\br_\b<_\bT_\b>_\b:_\b:_\bc_\br_\be_\ba_\bt_\be(&rB, _\bm_\ba_\bt._\bN(), 1, b, _\bm_\ba_\bt._\bN(), SLU_DN,\n-_\bG_\be_\bt_\bS_\bu_\bp_\be_\br_\bL_\bU_\bT_\by_\bp_\be_\b<_\bT_\b>_\b:_\b:_\bt_\by_\bp_\be, SLU_GE);\n-671 _\bS_\bu_\bp_\be_\br_\bL_\bU_\bD_\be_\bn_\bs_\be_\bM_\ba_\bt_\bC_\bh_\bo_\bo_\bs_\be_\br_\b<_\bT_\b>_\b:_\b:_\bc_\br_\be_\ba_\bt_\be(&rX, _\bm_\ba_\bt._\bN(), 1, x, _\bm_\ba_\bt._\bN(), SLU_DN,\n-_\bG_\be_\bt_\bS_\bu_\bp_\be_\br_\bL_\bU_\bT_\by_\bp_\be_\b<_\bT_\b>_\b:_\b:_\bt_\by_\bp_\be, SLU_GE);\n-672 mB = &rB;\n-673 mX = &rX;\n-674 }\n-675\n-676 typename _\bG_\be_\bt_\bS_\bu_\bp_\be_\br_\bL_\bU_\bT_\by_\bp_\be_\b<_\bT_\b>_\b:_\b:_\bf_\bl_\bo_\ba_\bt_\b__\bt_\by_\bp_\be rpg, rcond, ferr=1e10, berr;\n-677 int info;\n-678 mem_usage_t memusage;\n-679 SuperLUStat_t stat;\n-680 /* Initialize the statistics variables. */\n-681 StatInit(&stat);\n-682\n-683 options.IterRefine=SLU_DOUBLE;\n-684\n-685 _\bS_\bu_\bp_\be_\br_\bL_\bU_\bS_\bo_\bl_\bv_\be_\bC_\bh_\bo_\bo_\bs_\be_\br_\b<_\bT_\b>_\b:_\b:_\bs_\bo_\bl_\bv_\be(&options, &static_cast(_\bm_\ba_\bt),\n-perm_c, perm_r, etree, &equed, R, C,\n-686 &L, &U, work, lwork, mB, mX, &rpg, &rcond, &ferr, &berr,\n-687 &memusage, &stat, &info);\n-688\n-689 if(verbose) {\n-690 dinfo<<\"Triangular solve: dgssvx() returns info \"<< info<(_\bm_\ba_\bt).ncol;\n-693\n-694 if ( info == 0 || info == nSuperLUCol+1 ) { // Factorization has succeeded\n-695\n-696 if ( options.IterRefine ) {\n-697 dinfo<<\"Iterative Refinement: steps=\"\n-698 < 0 && lwork == -1 ) { // Memory allocation failed\n-702 dinfo<<\"** Estimated memory: \"<< info - nSuperLUCol<<\" bytes\"<\n-_\b7_\b1_\b6 struct _\bI_\bs_\bD_\bi_\br_\be_\bc_\bt_\bS_\bo_\bl_\bv_\be_\br<_\bS_\bu_\bp_\be_\br_\bL_\bU<_\bB_\bC_\bR_\bS_\bM_\ba_\bt_\br_\bi_\bx > >\n-717 {\n-_\b7_\b1_\b8 enum { _\bv_\ba_\bl_\bu_\be=true};\n-719 };\n-720\n-721 template\n-_\b7_\b2_\b2 struct _\bS_\bt_\bo_\br_\be_\bs_\bC_\bo_\bl_\bu_\bm_\bn_\bC_\bo_\bm_\bp_\br_\be_\bs_\bs_\be_\bd<_\bS_\bu_\bp_\be_\br_\bL_\bU<_\bB_\bC_\bR_\bS_\bM_\ba_\bt_\br_\bi_\bx > >\n-723 {\n-_\b7_\b2_\b4 enum { _\bv_\ba_\bl_\bu_\be = true };\n-725 };\n-726\n-_\b7_\b2_\b7 struct _\bS_\bu_\bp_\be_\br_\bL_\bU_\bC_\br_\be_\ba_\bt_\bo_\br {\n-_\b7_\b2_\b8 template struct _\bi_\bs_\bV_\ba_\bl_\bi_\bd_\bB_\bl_\bo_\bc_\bk : std::false_type{};\n-_\b7_\b2_\b9 template struct _\bi_\bs_\bV_\ba_\bl_\bi_\bd_\bB_\bl_\bo_\bc_\bk<_\bD_\bu_\bn_\be::FieldVector> : std::\n-true_type{};\n-_\b7_\b3_\b0 template struct _\bi_\bs_\bV_\ba_\bl_\bi_\bd_\bB_\bl_\bo_\bc_\bk<_\bD_\bu_\bn_\be::FieldVector,k>> : std::true_type{};\n-731 template\n-732 std::shared_ptr::type,\n-733 typename Dune::TypeListElement<2, TL>::type>>\n-_\b7_\b3_\b4 _\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b(_\b)_\b (TL /*tl*/, const M& _\bm_\ba_\bt, const Dune::ParameterTree& config,\n-735 std::enable_if_t<_\bi_\bs_\bV_\ba_\bl_\bi_\bd_\bB_\bl_\bo_\bc_\bk::type::\n-block_type>::value,int> = 0) const\n-736 {\n-737 int verbose = config.get(\"verbose\", 0);\n-738 return std::make_shared>(_\bm_\ba_\bt,verbose);\n-739 }\n-740\n-741 // second version with SFINAE to validate the template parameters of\n-SuperLU\n-742 template\n-743 std::shared_ptr::type,\n-744 typename Dune::TypeListElement<2, TL>::type>>\n-_\b7_\b4_\b5 _\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b(_\b)_\b (TL /*tl*/, const M& /*mat*/, const Dune::ParameterTree& /\n-*config*/,\n-746 std::enable_if_t::\n-type::block_type>::value,int> = 0) const\n-747 {\n-748 DUNE_THROW(_\bU_\bn_\bs_\bu_\bp_\bp_\bo_\br_\bt_\be_\bd_\bT_\by_\bp_\be,\n-749 \"Unsupported Type in SuperLU (only double and std::complex\n-supported)\");\n-750 }\n-751 };\n-_\b7_\b5_\b2 template<> struct _\bS_\bu_\bp_\be_\br_\bL_\bU_\bC_\br_\be_\ba_\bt_\bo_\br_\b:_\b:_\bi_\bs_\bV_\ba_\bl_\bi_\bd_\bB_\bl_\bo_\bc_\bk : std::true_type{};\n-_\b7_\b5_\b3 template<> struct _\bS_\bu_\bp_\be_\br_\bL_\bU_\bC_\br_\be_\ba_\bt_\bo_\br_\b:_\b:_\bi_\bs_\bV_\ba_\bl_\bi_\bd_\bB_\bl_\bo_\bc_\bk<_\bs_\bt_\bd::complex> :\n-std::true_type{};\n-754\n-_\b7_\b5_\b5 _\bD_\bU_\bN_\bE_\b__\bR_\bE_\bG_\bI_\bS_\bT_\bE_\bR_\b__\bD_\bI_\bR_\bE_\bC_\bT_\b__\bS_\bO_\bL_\bV_\bE_\bR(\"superlu\", _\bS_\bu_\bp_\be_\br_\bL_\bU_\bC_\br_\be_\ba_\bt_\bo_\br());\n-756} // end namespace DUNE\n-757\n-758// undefine macros from SuperLU's slu_util.h\n-759#undef FIRSTCOL_OF_SNODE\n-760#undef NO_MARKER\n-761#undef NUM_TEMPV\n-762#undef USER_ABORT\n-763#undef USER_MALLOC\n-764#undef SUPERLU_MALLOC\n-765#undef USER_FREE\n-766#undef SUPERLU_FREE\n-767#undef CHECK_MALLOC\n-768#undef SUPERLU_MAX\n-769#undef SUPERLU_MIN\n-770#undef L_SUB_START\n-771#undef L_SUB\n-772#undef L_NZ_START\n-773#undef L_FST_SUPC\n-774#undef U_NZ_START\n-775#undef U_SUB\n-776#undef TRUE\n-777#undef FALSE\n-778#undef EMPTY\n-779#undef NODROP\n-780#undef DROP_BASIC\n-781#undef DROP_PROWS\n-782#undef DROP_COLUMN\n-783#undef DROP_AREA\n-784#undef DROP_SECONDARY\n-785#undef DROP_DYNAMIC\n-786#undef DROP_INTERP\n-787#undef MILU_ALPHA\n-788\n-789#endif // HAVE_SUPERLU\n-790#endif // DUNE_SUPERLU_HH\n-_\bs_\bu_\bp_\be_\br_\bl_\bu_\bf_\bu_\bn_\bc_\bt_\bi_\bo_\bn_\bs_\b._\bh_\bh\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-_\bs_\bo_\bl_\bv_\be_\br_\bf_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\bh\n-_\bs_\bo_\bl_\bv_\be_\br_\bs_\b._\bh_\bh\n-Implementations of the inverse operator interface.\n-_\bi_\bs_\bt_\bl_\be_\bx_\bc_\be_\bp_\bt_\bi_\bo_\bn_\b._\bh_\bh\n-_\bs_\bo_\bl_\bv_\be_\br_\bt_\by_\bp_\be_\b._\bh_\bh\n-Templates characterizing the type of a solver.\n+_\bs_\bu_\bp_\be_\br_\bl_\bu_\bf_\bu_\bn_\bc_\bt_\bi_\bo_\bn_\bs_\b._\bh_\bh\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_\bm_\ba_\bt_\br_\bi_\bx_\b._\bh_\bh\n-_\bD_\bU_\bN_\bE_\b__\bR_\bE_\bG_\bI_\bS_\bT_\bE_\bR_\b__\bD_\bI_\bR_\bE_\bC_\bT_\b__\bS_\bO_\bL_\bV_\bE_\bR\n-#define DUNE_REGISTER_DIRECT_SOLVER(name,...)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn solverregistry.hh:13\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bu_\bp_\be_\br_\bL_\bU_\b:_\b:_\bs_\be_\bt_\bS_\bu_\bb_\bM_\ba_\bt_\br_\bi_\bx\n-void setSubMatrix(const Matrix &mat, const S &rowIndexSet)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn superlu.hh:457\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bu_\bp_\be_\br_\bL_\bU_\b:_\b:_\ba_\bp_\bp_\bl_\by\n-void apply(domain_type &x, range_type &b, InverseOperatorResult &res)\n-Apply inverse operator,.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn superlu.hh:563\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bu_\bp_\be_\br_\bL_\bU_\b:_\b:_\bs_\be_\bt_\bV_\be_\br_\bb_\bo_\bs_\bi_\bt_\by\n-void setVerbosity(bool v)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn superlu.hh:437\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bu_\bp_\be_\br_\bL_\bU_\b:_\b:_\bf_\br_\be_\be\n-void free()\n-free allocated space.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn superlu.hh:403\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bu_\bp_\be_\br_\bL_\bU_\b:_\b:_\b~_\bS_\bu_\bp_\be_\br_\bL_\bU\n-~SuperLU()\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn superlu.hh:396\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bu_\bp_\be_\br_\bL_\bU_\b:_\b:_\bS_\bu_\bp_\be_\br_\bL_\bU\n-SuperLU()\n-Empty default constructor.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn superlu.hh:432\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bu_\bp_\be_\br_\bL_\bU_\b:_\b:_\bs_\be_\bt_\bM_\ba_\bt_\br_\bi_\bx\n-void setMatrix(const Matrix &mat)\n-Initialize data from given matrix.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn superlu.hh:443\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 _\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:_\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:_\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:_\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:_\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:500\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:_\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:_\bM\n-size_type M() const\n-Return the number of columns.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn matrix.hh:700\n-_\bD_\bu_\bn_\be_\b:_\b:_\bM_\ba_\bt_\br_\bi_\bx_\b:_\b:_\bN\n-size_type N() const\n-Return the number of rows.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn matrix.hh:695\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:48\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_\b:_\b:_\bi_\bt_\be_\br_\ba_\bt_\bi_\bo_\bn_\bs\n-int iterations\n-Number of iterations.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn solver.hh:67\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_\b:_\b:_\bc_\bo_\bn_\bv_\be_\br_\bg_\be_\bd\n-bool converged\n-True if convergence criterion has been met.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn solver.hh:73\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:99\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:_\bU_\bn_\bs_\bu_\bp_\bp_\bo_\br_\bt_\be_\bd_\bT_\by_\bp_\be\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn solverregistry.hh:77\n-_\bD_\bu_\bn_\be_\b:_\b:_\bI_\bs_\bD_\bi_\br_\be_\bc_\bt_\bS_\bo_\bl_\bv_\be_\br\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn solvertype.hh:16\n-_\bD_\bu_\bn_\be_\b:_\b:_\bI_\bs_\bD_\bi_\br_\be_\bc_\bt_\bS_\bo_\bl_\bv_\be_\br_\b:_\b:_\bv_\ba_\bl_\bu_\be\n-@ value\n-Whether this is a direct solver.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn solvertype.hh:24\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bt_\bo_\br_\be_\bs_\bC_\bo_\bl_\bu_\bm_\bn_\bC_\bo_\bm_\bp_\br_\be_\bs_\bs_\be_\bd\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn solvertype.hh:30\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bt_\bo_\br_\be_\bs_\bC_\bo_\bl_\bu_\bm_\bn_\bC_\bo_\bm_\bp_\br_\be_\bs_\bs_\be_\bd_\b:_\b:_\bv_\ba_\bl_\bu_\be\n-@ value\n-whether the solver internally uses column compressed storage\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn solvertype.hh:36\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bu_\bp_\be_\br_\bL_\bU_\bS_\bo_\bl_\bv_\be_\bC_\bh_\bo_\bo_\bs_\be_\br\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn superlu.hh:45\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bu_\bp_\be_\br_\bL_\bU_\bD_\be_\bn_\bs_\be_\bM_\ba_\bt_\bC_\bh_\bo_\bo_\bs_\be_\br\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn superlu.hh:49\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bu_\bp_\be_\br_\bL_\bU_\bQ_\bu_\be_\br_\by_\bC_\bh_\bo_\bo_\bs_\be_\br\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn superlu.hh:53\n-_\bD_\bu_\bn_\be_\b:_\b:_\bQ_\bu_\be_\br_\by_\bS_\bp_\ba_\bc_\be_\bC_\bh_\bo_\bo_\bs_\be_\br\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn superlu.hh:57\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_\bL_\bU_\b:_\b:_\bn_\bn_\bz\n-SuperLUMatrix::size_type nnz() const\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn superlu.hh:355\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bu_\bp_\be_\br_\bL_\bU_\b:_\b:_\ba_\bp_\bp_\bl_\by\n-void apply(domain_type &x, range_type &b, double reduction,\n-InverseOperatorResult &res)\n-apply inverse operator, with given convergence criteria.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn superlu.hh:342\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bu_\bp_\be_\br_\bL_\bU_\b:_\b:_\br_\ba_\bn_\bg_\be_\b__\bt_\by_\bp_\be\n-typename Impl::SuperLUVectorChooser< M >::range_type range_type\n-The type of the range of the solver.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn superlu.hh:284\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bu_\bp_\be_\br_\bL_\bU_\b:_\b:_\bm_\ba_\bt_\br_\bi_\bx_\b__\bt_\by_\bp_\be\n-M matrix_type\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn superlu.hh:276\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bu_\bp_\be_\br_\bL_\bU_\b:_\b:_\bM_\ba_\bt_\br_\bi_\bx_\bI_\bn_\bi_\bt_\bi_\ba_\bl_\bi_\bz_\be_\br\n-SuperMatrixInitializer< Matrix > MatrixInitializer\n-Type of an associated initializer class.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn superlu.hh:280\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bu_\bp_\be_\br_\bL_\bU_\b:_\b:_\bM_\ba_\bt_\br_\bi_\bx\n-M Matrix\n-The matrix type.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn superlu.hh:275\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bu_\bp_\be_\br_\bL_\bU_\b:_\b:_\bd_\bo_\bm_\ba_\bi_\bn_\b__\bt_\by_\bp_\be\n-typename Impl::SuperLUVectorChooser< M >::domain_type domain_type\n-The type of the domain of the solver.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn superlu.hh:282\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bu_\bp_\be_\br_\bL_\bU_\b:_\b:_\bn_\ba_\bm_\be\n-const char * name()\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn superlu.hh:371\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bu_\bp_\be_\br_\bL_\bU_\b:_\b:_\bc_\ba_\bt_\be_\bg_\bo_\br_\by\n-virtual SolverCategory::Category category() const\n-Category of the solver (see SolverCategory::Category)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn superlu.hh:287\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bu_\bp_\be_\br_\bL_\bU_\b:_\b:_\bS_\bu_\bp_\be_\br_\bL_\bU_\bM_\ba_\bt_\br_\bi_\bx\n-Dune::SuperLUMatrix< Matrix > SuperLUMatrix\n-The corresponding SuperLU Matrix type.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn superlu.hh:278\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bu_\bp_\be_\br_\bL_\bU_\b:_\b:_\bS_\bu_\bp_\be_\br_\bL_\bU\n-SuperLU(const Matrix &mat, const ParameterTree &config)\n-Constructs the SuperLU solver.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn superlu.hh:320\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bu_\bp_\be_\br_\bL_\bU_\bC_\br_\be_\ba_\bt_\bo_\br\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn superlu.hh:727\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bu_\bp_\be_\br_\bL_\bU_\bC_\br_\be_\ba_\bt_\bo_\br_\b:_\b:_\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b(_\b)\n-std::shared_ptr< Dune::InverseOperator< typename Dune::TypeListElement< 1, TL\n->::type, typename Dune::TypeListElement< 2, TL >::type > > operator()(TL, const\n-M &mat, const Dune::ParameterTree &config, std::enable_if_t< isValidBlock<\n-typename Dune::TypeListElement< 1, TL >::type::block_type >::value, int >=0)\n-const\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn superlu.hh:734\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bu_\bp_\be_\br_\bL_\bU_\bC_\br_\be_\ba_\bt_\bo_\br_\b:_\b:_\bi_\bs_\bV_\ba_\bl_\bi_\bd_\bB_\bl_\bo_\bc_\bk\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn superlu.hh:728\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 ===============================================================================\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: solver.hh File Reference \n+dune-istl: bvector.hh File Reference \n \n \n-
Define general, extensible interface for inverse operators. \n+
This file implements a vector space as a tensor product of a given vector space. The number of components can be given at run-time. \n More...
\n-
#include <iomanip>\n-
#include <ostream>\n-
#include <string>\n-
#include <functional>\n-
#include <dune/common/exceptions.hh>\n-
#include <dune/common/shared_ptr.hh>\n-
#include <dune/common/simd/io.hh>\n-
#include <dune/common/simd/simd.hh>\n-
#include <dune/common/parametertree.hh>\n-
#include <dune/common/timer.hh>\n-
#include "solvertype.hh "\n-
#include "preconditioner.hh "\n-
#include "operators.hh "\n-
#include "scalarproducts.hh "\n+
#include <algorithm>\n+
#include <cmath>\n+
#include <complex>\n+
#include <initializer_list>\n+
#include <limits>\n+
#include <memory>\n+
#include <utility>\n+
#include <vector>\n+
#include <dune/common/dotproduct.hh>\n+
#include <dune/common/ftraits.hh>\n+
#include <dune/common/fmatrix.hh>\n+
#include <dune/common/fvector.hh>\n+
#include <dune/common/promotiontraits.hh>\n+
#include <dune/common/typetraits.hh>\n+
#include <dune/common/scalarvectorview.hh>\n+
#include <dune/istl/blocklevel.hh >\n+
#include "basearray.hh "\n+
#include "istlexception.hh "\n
\n
Go to the source code of this file.
\n
\n struct Dune::InverseOperatorResult Statistics about the application of an inverse operator. More... class Dune::BlockVector< B, A > A vector of blocks with memory management. More... class Dune::InverseOperator< X, Y > Abstract base class for all solvers. More... class Dune::IterativeSolver< X, Y > Base class for all implementations of iterative solvers. More... class Dune::IterativeSolver< X, Y >::Iteration< CountType > Class for controlling iterative methods. More... class Dune::SolverHelper< ISTLLinearSolver, BCRSMatrix > Helper class for notifying a DUNE-ISTL linear solver about a change of the iteration matrix object in a unified way, i.e. independent from the solver's type (direct/iterative). More... struct Dune::SolverHelper< ISTLLinearSolver, BCRSMatrix >::Implementation< is_direct_solver, Dummy > Implementation that works together with iterative ISTL solvers, e.g. Dune::CGSolver or Dune::BiCGSTABSolver . More... struct Dune::SolverHelper< ISTLLinearSolver, BCRSMatrix >::Implementation< true, Dummy > Implementation that works together with direct ISTL solvers, e.g. Dune::SuperLU or Dune::UMFPack . More... struct Dune::FieldTraits< BlockVector< B, A > >
\n namespace Dune
\n
\n-
Define general, extensible interface for inverse operators.
\n-
Implementation here covers only inversion of linear operators, but the implementation might be used for nonlinear operators as well.
\n+
This file implements a vector space as a tensor product of a given vector space. The number of components can be given at run-time.
\n
\n \n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,62 +1,49 @@\n dune-istl\u00a02.9.0\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-solver.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\n-Define general, extensible interface for inverse operators. _\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 \n-#include \n-#include \"_\bs_\bo_\bl_\bv_\be_\br_\bt_\by_\bp_\be_\b._\bh_\bh\"\n-#include \"_\bp_\br_\be_\bc_\bo_\bn_\bd_\bi_\bt_\bi_\bo_\bn_\be_\br_\b._\bh_\bh\"\n-#include \"_\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\bs_\b._\bh_\bh\"\n-#include \"_\bs_\bc_\ba_\bl_\ba_\br_\bp_\br_\bo_\bd_\bu_\bc_\bt_\bs_\b._\bh_\bh\"\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+bvector.hh File Reference\n+This file implements a vector space as a tensor product of a given vector\n+space. The number of components can be given at run-time. _\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 \n+#include \n+#include \n+#include \n+#include \n+#include \n+#include \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+#include \"_\bb_\ba_\bs_\be_\ba_\br_\br_\ba_\by_\b._\bh_\bh\"\n+#include \"_\bi_\bs_\bt_\bl_\be_\bx_\bc_\be_\bp_\bt_\bi_\bo_\bn_\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:_\bI_\bn_\bv_\be_\br_\bs_\be_\bO_\bp_\be_\br_\ba_\bt_\bo_\br_\bR_\be_\bs_\bu_\bl_\bt\n-\u00a0 Statistics about the application of an inverse operator. _\bM_\bo_\br_\be_\b._\b._\b.\n+ class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\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 memory management. _\bM_\bo_\br_\be_\b._\b._\b.\n \u00a0\n- class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bI_\bn_\bv_\be_\br_\bs_\be_\bO_\bp_\be_\br_\ba_\bt_\bo_\br_\b<_\b _\bX_\b,_\b _\bY_\b _\b>\n-\u00a0 Abstract base class for all solvers. _\bM_\bo_\br_\be_\b._\b._\b.\n-\u00a0\n- class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bI_\bt_\be_\br_\ba_\bt_\bi_\bv_\be_\bS_\bo_\bl_\bv_\be_\br_\b<_\b _\bX_\b,_\b _\bY_\b _\b>\n-\u00a0 Base class for all implementations of iterative solvers. _\bM_\bo_\br_\be_\b._\b._\b.\n-\u00a0\n- class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bI_\bt_\be_\br_\ba_\bt_\bi_\bv_\be_\bS_\bo_\bl_\bv_\be_\br_\b<_\b _\bX_\b,_\b _\bY_\b _\b>_\b:_\b:_\bI_\bt_\be_\br_\ba_\bt_\bi_\bo_\bn_\b<_\b _\bC_\bo_\bu_\bn_\bt_\bT_\by_\bp_\be_\b _\b>\n-\u00a0 Class for controlling iterative methods. _\bM_\bo_\br_\be_\b._\b._\b.\n-\u00a0\n- class \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bS_\bo_\bl_\bv_\be_\br_\bH_\be_\bl_\bp_\be_\br_\b<_\b _\bI_\bS_\bT_\bL_\bL_\bi_\bn_\be_\ba_\br_\bS_\bo_\bl_\bv_\be_\br_\b,_\b _\bB_\bC_\bR_\bS_\bM_\ba_\bt_\br_\bi_\bx_\b _\b>\n- Helper class for notifying a DUNE-ISTL linear solver about a change of\n-\u00a0 the iteration matrix object in a unified way, i.e. independent from\n- the solver's type (direct/iterative). _\bM_\bo_\br_\be_\b._\b._\b.\n-\u00a0\n-struct \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bS_\bo_\bl_\bv_\be_\br_\bH_\be_\bl_\bp_\be_\br_\b<_\b _\bI_\bS_\bT_\bL_\bL_\bi_\bn_\be_\ba_\br_\bS_\bo_\bl_\bv_\be_\br_\b,_\b _\bB_\bC_\bR_\bS_\bM_\ba_\bt_\br_\bi_\bx_\b _\b>_\b:_\b:_\bI_\bm_\bp_\bl_\be_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b<\n- _\bi_\bs_\b__\bd_\bi_\br_\be_\bc_\bt_\b__\bs_\bo_\bl_\bv_\be_\br_\b,_\b _\bD_\bu_\bm_\bm_\by_\b _\b>\n-\u00a0 _\bI_\bm_\bp_\bl_\be_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn that works together with iterative _\bI_\bS_\bT_\bL solvers, e.g.\n- _\bD_\bu_\bn_\be_\b:_\b:_\bC_\bG_\bS_\bo_\bl_\bv_\be_\br or _\bD_\bu_\bn_\be_\b:_\b:_\bB_\bi_\bC_\bG_\bS_\bT_\bA_\bB_\bS_\bo_\bl_\bv_\be_\br. _\bM_\bo_\br_\be_\b._\b._\b.\n-\u00a0\n-struct \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bS_\bo_\bl_\bv_\be_\br_\bH_\be_\bl_\bp_\be_\br_\b<_\b _\bI_\bS_\bT_\bL_\bL_\bi_\bn_\be_\ba_\br_\bS_\bo_\bl_\bv_\be_\br_\b,_\b _\bB_\bC_\bR_\bS_\bM_\ba_\bt_\br_\bi_\bx_\b _\b>_\b:_\b:_\bI_\bm_\bp_\bl_\be_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b<\n- _\bt_\br_\bu_\be_\b,_\b _\bD_\bu_\bm_\bm_\by_\b _\b>\n-\u00a0 _\bI_\bm_\bp_\bl_\be_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn that works together with direct _\bI_\bS_\bT_\bL solvers, e.g.\n- _\bD_\bu_\bn_\be_\b:_\b:_\bS_\bu_\bp_\be_\br_\bL_\bU or _\bD_\bu_\bn_\be_\b:_\b:_\bU_\bM_\bF_\bP_\ba_\bc_\bk. _\bM_\bo_\br_\be_\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_\bl_\bo_\bc_\bk_\bV_\be_\bc_\bt_\bo_\br_\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+F\bFu\bun\bnc\bct\bti\bio\bon\bns\bs\n+template\n+std::ostream &\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b<_\b< (std::ostream &s, const _\bB_\bl_\bo_\bc_\bk_\bV_\be_\bc_\bt_\bo_\br< K, A >\n+ &v)\n+\u00a0 Send _\bB_\bl_\bo_\bc_\bk_\bV_\be_\bc_\bt_\bo_\br to an output stream.\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, extensible interface for inverse operators.\n-Implementation here covers only inversion of linear operators, but the\n-implementation might be used for nonlinear operators as well.\n+This file implements a vector space as a tensor product of a given vector\n+space. The number of components can be given at run-time.\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: solver.hh Source File \n+dune-istl: bvector.hh Source File \n \n \n
\n
Go to the documentation of this file. \n
\n
\n
\n
\n-
6 #ifndef DUNE_ISTL_SOLVER_HH \n-
7 #define DUNE_ISTL_SOLVER_HH \n+
6 #ifndef DUNE_ISTL_BVECTOR_HH \n+
7 #define DUNE_ISTL_BVECTOR_HH \n
\n-
\n-
\n-
\n-
\n-
\n-
14 #include <dune/common/exceptions.hh> \n-
15 #include <dune/common/shared_ptr.hh> \n-
16 #include <dune/common/simd/io.hh> \n-
17 #include <dune/common/simd/simd.hh> \n-
18 #include <dune/common/parametertree.hh> \n-
19 #include <dune/common/timer.hh> \n-
\n-
\n-
\n-
\n-
\n+
\n+
\n+
\n+
12 #include <initializer_list> \n+
\n+
\n+
\n+
\n+
\n+
18 #include <dune/common/dotproduct.hh> \n+
19 #include <dune/common/ftraits.hh> \n+
20 #include <dune/common/fmatrix.hh> \n+
21 #include <dune/common/fvector.hh> \n+
22 #include <dune/common/promotiontraits.hh> \n+
23 #include <dune/common/typetraits.hh> \n+
24 #include <dune/common/scalarvectorview.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-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
98 template <
class X,
class Y>
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
111 typedef typename FieldTraits<field_type>::real_type
real_type ;
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
147 #ifdef DUNE_ISTL_SUPPORT_OLD_CATEGORY_INTERFACE \n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
48 template <
class B,
bool isNumber>
\n+
\n+
\n+
\n+
52 class BlockTraitsImp<B,true>
\n+
\n+
\n+
\n+
\n+
\n+
\n+
59 class BlockTraitsImp<B,false>
\n+
\n+
\n+
62 using field_type =
typename B::field_type;
\n+
\n+
\n+
\n+
68 using BlockTraits = BlockTraitsImp<B,IsNumber<B>::value>;
\n+
\n+
83 template <
class B,
class A=std::allocator<B> >
\n+
84 class block_vector_unmanaged :
public base_array_unmanaged<B,A>
\n+
\n+
\n+
\n+
\n+
89 using field_type =
typename Imp::BlockTraits<B>::field_type;
\n+
\n+
\n+
\n+
95 typedef A allocator_type;
\n+
\n+
98 typedef typename A::size_type size_type;
\n+
\n+
101 typedef typename base_array_unmanaged<B,A>::iterator Iterator;
\n+
\n+
104 typedef typename base_array_unmanaged<B,A>::const_iterator ConstIterator;
\n+
\n+
107 typedef B value_type;
\n+
\n+
110 typedef B& reference;
\n+
\n+
113 typedef const B& const_reference;
\n+
\n+
\n+
\n+
118 block_vector_unmanaged& operator= (
const field_type& k)
\n+
\n+
120 for (size_type i=0; i<this->n; i++)
\n+
\n+
\n+
\n+
\n+
\n+
127 block_vector_unmanaged& operator+= (
const block_vector_unmanaged& y)
\n+
\n+
129 #ifdef DUNE_ISTL_WITH_CHECKING \n+
130 if (this->n!=y.N()) DUNE_THROW(ISTLError,
"vector size mismatch" );
\n+
\n+
132 for (size_type i=0; i<this->n; ++i) (*
this )[i] += y[i];
\n+
\n+
\n+
\n+
137 block_vector_unmanaged& operator-= (
const block_vector_unmanaged& y)
\n+
\n+
139 #ifdef DUNE_ISTL_WITH_CHECKING \n+
140 if (this->n!=y.N()) DUNE_THROW(ISTLError,
"vector size mismatch" );
\n+
\n+
142 for (size_type i=0; i<this->n; ++i) (*
this )[i] -= y[i];
\n+
\n+
\n+
\n+
147 block_vector_unmanaged& operator*= (
const field_type& k)
\n
\n-
149 DUNE_THROW(Dune::Exception,
"It is necessary to implement the category method in a derived classes, in the future this method will pure virtual." );
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
167 s << std::setw(
normSpacing ) <<
"Rate" << std::endl;
\n-
\n-
\n-
\n-
171 template <
typename CountType,
typename DataType>
\n-
\n-
\n-
173 const CountType& iter,
\n-
174 const DataType& norm,
\n-
175 const DataType& norm_old)
const \n-
\n-
177 const DataType rate = norm/norm_old;
\n-
\n-
179 s << std::setw(
normSpacing ) << Simd::io(norm) <<
" " ;
\n-
180 s << std::setw(
normSpacing ) << Simd::io(rate) << std::endl;
\n-
\n-
\n-
\n-
184 template <
typename CountType,
typename DataType>
\n-
\n-
\n-
186 const CountType& iter,
\n-
187 const DataType& norm)
const \n-
\n-
\n-
190 s << std::setw(
normSpacing ) << Simd::io(norm) << std::endl;
\n-
\n-
\n-
\n-
\n+
149 for (size_type i=0; i<this->n; ++i) (*
this )[i] *= k;
\n+
\n+
\n+
\n+
154 block_vector_unmanaged& operator/= (
const field_type& k)
\n+
\n+
156 for (size_type i=0; i<this->n; ++i) (*
this )[i] /= k;
\n+
\n+
\n+
\n+
161 block_vector_unmanaged& axpy (
const field_type& a,
const block_vector_unmanaged& y)
\n+
\n+
163 #ifdef DUNE_ISTL_WITH_CHECKING \n+
164 if (this->n!=y.N()) DUNE_THROW(ISTLError,
"vector size mismatch" );
\n+
\n+
166 for (size_type i=0; i<this->n; ++i)
\n+
167 Impl::asVector((*
this )[i]).axpy(a,Impl::asVector(y[i]));
\n+
\n+
\n+
\n+
\n+
\n+
180 template <
class OtherB,
class OtherA>
\n+
181 auto operator* (
const block_vector_unmanaged<OtherB,OtherA>& y)
const \n+
\n+
183 typedef typename PromotionTraits<field_type,typename BlockTraits<OtherB>::field_type>::PromotedType PromotedType;
\n+
\n+
185 #ifdef DUNE_ISTL_WITH_CHECKING \n+
186 if (this->n!=y.N()) DUNE_THROW(ISTLError,
"vector size mismatch" );
\n+
\n+
188 for (size_type i=0; i<this->n; ++i) {
\n+
189 sum += PromotedType(((*
this )[i])*y[i]);
\n+
\n+
\n+
\n
\n-
202 template <
class X,
class Y>
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
231 _op (stackobject_to_shared_ptr(op)),
\n-
232 _prec (stackobject_to_shared_ptr(prec)),
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
264 _op (stackobject_to_shared_ptr(op)),
\n-
265 _prec (stackobject_to_shared_ptr(prec)),
\n-
266 _sp (stackobject_to_shared_ptr(sp)),
\n-
\n-
\n-
\n-
270 DUNE_THROW(
InvalidSolverCategory ,
"LinearOperator and Preconditioner must have the same SolverCategory!" );
\n-
\n-
272 DUNE_THROW(
InvalidSolverCategory ,
"LinearOperator and ScalarProduct must have the same SolverCategory!" );
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
293 configuration.
get <int>(
"maxit" ),
\n-
294 configuration.
get <int>(
"verbose" ))
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
316 configuration.
get <int>(
"maxit" ),
\n-
317 configuration.
get <int>(
"verbose" ))
\n-
\n-
\n+
201 template <
class OtherB,
class OtherA>
\n+
202 auto dot(
const block_vector_unmanaged<OtherB,OtherA>& y)
const \n+
\n+
204 typedef typename PromotionTraits<field_type,typename BlockTraits<OtherB>::field_type>::PromotedType PromotedType;
\n+
\n+
206 #ifdef DUNE_ISTL_WITH_CHECKING \n+
207 if (this->n!=y.N()) DUNE_THROW(ISTLError,
"vector size mismatch" );
\n+
\n+
\n+
210 for (size_type i=0; i<this->n; ++i)
\n+
211 sum += Impl::asVector((*
this )[i]).dot(Impl::asVector(y[i]));
\n+
\n+
\n+
\n+
\n+
\n+
\n+
219 typename FieldTraits<field_type>::real_type one_norm ()
const \n+
\n+
221 typename FieldTraits<field_type>::real_type sum=0;
\n+
222 for (size_type i=0; i<this->n; ++i)
\n+
223 sum += Impl::asVector((*
this )[i]).one_norm();
\n+
\n+
\n+
\n+
228 typename FieldTraits<field_type>::real_type one_norm_real ()
const \n+
\n+
230 typename FieldTraits<field_type>::real_type sum=0;
\n+
231 for (size_type i=0; i<this->n; ++i)
\n+
232 sum += Impl::asVector((*
this )[i]).one_norm_real();
\n+
\n+
\n+
\n+
237 typename FieldTraits<field_type>::real_type two_norm ()
const \n+
\n+
\n+
240 return sqrt(two_norm2());
\n+
\n+
\n+
244 typename FieldTraits<field_type>::real_type two_norm2 ()
const \n+
\n+
246 typename FieldTraits<field_type>::real_type sum=0;
\n+
247 for (size_type i=0; i<this->n; ++i)
\n+
248 sum += Impl::asVector((*
this )[i]).two_norm2();
\n+
\n+
\n+
\n+
253 template <
typename ft = field_type,
\n+
254 typename std::enable_if<!HasNaN<ft>::value,
int >::type = 0>
\n+
255 typename FieldTraits<ft>::real_type infinity_norm()
const {
\n+
256 using real_type =
typename FieldTraits<ft>::real_type;
\n+
\n+
\n+
\n+
260 for (
auto const &xi : *this) {
\n+
261 real_type
const a = Impl::asVector(xi).infinity_norm();
\n+
\n+
\n+
\n+
\n+
\n+
268 template <
typename ft = field_type,
\n+
269 typename std::enable_if<!HasNaN<ft>::value,
int >::type = 0>
\n+
270 typename FieldTraits<ft>::real_type infinity_norm_real()
const {
\n+
271 using real_type =
typename FieldTraits<ft>::real_type;
\n+
\n+
\n+
\n+
275 for (
auto const &xi : *this) {
\n+
276 real_type
const a = Impl::asVector(xi).infinity_norm_real();
\n+
\n+
\n+
\n+
\n+
\n+
283 template <
typename ft = field_type,
\n+
284 typename std::enable_if<HasNaN<ft>::value,
int >::type = 0>
\n+
285 typename FieldTraits<ft>::real_type infinity_norm()
const {
\n+
286 using real_type =
typename FieldTraits<ft>::real_type;
\n+
\n+
\n+
\n+
\n+
\n+
\n+
293 for (
auto const &xi : *this) {
\n+
294 real_type
const a = Impl::asVector(xi).infinity_norm();
\n+
\n+
\n+
\n+
298 return norm * (isNaN / isNaN);
\n+
\n+
\n+
302 template <
typename ft = field_type,
\n+
303 typename std::enable_if<HasNaN<ft>::value,
int >::type = 0>
\n+
304 typename FieldTraits<ft>::real_type infinity_norm_real()
const {
\n+
305 using real_type =
typename FieldTraits<ft>::real_type;
\n+
\n+
\n+
\n+
\n+
\n+
311 for (
auto const &xi : *this) {
\n+
312 real_type
const a = Impl::asVector(xi).infinity_norm_real();
\n+
\n+
\n+
\n+
\n+
317 return norm * (isNaN / isNaN);
\n+
\n
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
351 DUNE_THROW(
InvalidSolverCategory ,
"LinearOperator and Preconditioner must have the same SolverCategory!" );
\n-
\n-
353 DUNE_THROW(
InvalidSolverCategory ,
"LinearOperator and ScalarProduct must have the same SolverCategory!" );
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
378 this->
apply (x,b,res);
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
389 std::string
name = className(*
this );
\n-
390 return name .substr(0,
name .find(
"<" ));
\n-
\n-
\n-
\n-
410 template <
class CountType =
unsigned int >
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
421 std::cout <<
"=== " << parent.
name () << std::endl;
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
437 other._valid =
false ;
\n-
\n-
\n-
\n-
\n-
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
329 size_type dim ()
const \n+
\n+
\n+
\n+
333 for (size_type i=0; i<this->n; i++)
\n+
334 d += Impl::asVector((*
this )[i]).dim();
\n+
\n+
\n+
\n+
\n+
\n+
341 block_vector_unmanaged () : base_array_unmanaged<B,A>()
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
355 ScopeGuard(F cleanupFunc) : cleanupFunc_(
std ::move(cleanupFunc)) {}
\n+
356 ScopeGuard(
const ScopeGuard &) =
delete ;
\n+
357 ScopeGuard(ScopeGuard &&) =
delete ;
\n+
358 ScopeGuard &operator=(ScopeGuard) =
delete ;
\n+
359 ~ScopeGuard() { cleanupFunc_(); }
\n+
\n+
\n+
\n+
\n+
373 ScopeGuard<F> makeScopeGuard(F cleanupFunc)
\n+
\n+
375 return { std::move(cleanupFunc) };
\n+
\n+
\n+
\n+
393 template <
class B,
class A=std::allocator<B> >
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
413 [[deprecated(
"Use free function blockLevel(). Will be removed after 2.8." )]]
\n+
414 static constexpr unsigned int blocklevel = blockLevel<B>()+1;
\n+
\n+
417 typedef typename Imp::block_vector_unmanaged<B,A>::Iterator
Iterator ;
\n+
\n+
420 typedef typename Imp::block_vector_unmanaged<B,A>::ConstIterator
ConstIterator ;
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n
\n-
\n-
456 if (!Simd::allTrue(isFinite(def)))
\n-
\n-
\n-
459 std::cout <<
"=== " <<
_parent .
name () <<
": abort due to infinite or NaN defect" \n-
\n-
\n-
\n-
463 <<
" is infinite or NaN" );
\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-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
504 std::shared_ptr<const LinearOperator<X,Y>>
_op ;
\n-
505 std::shared_ptr<Preconditioner<X,Y>>
_prec ;
\n-
506 std::shared_ptr<const ScalarProduct<X>>
_sp ;
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
520 template <
typename ISTLLinearSolver,
typename BCRSMatrix>
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
527 static const bool is_direct_solver
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
538 template <
bool is_direct_solver,
typename Dummy =
void >
\n-
\n-
\n-
550 template <
typename Dummy>
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
556 solver.setMatrix(matrix);
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
Templates characterizing the type of a solver.
\n-
Define general, extensible interface for operators. The available implementation wraps a matrix.
\n-
Define base class for scalar product and norm.
\n-
\n+
\n+
\n+
457 static_assert (std::numeric_limits<S>::is_integer,
\n+
458 "capacity must be an unsigned integral type (be aware, that this constructor does not set the default value!)" );
\n+
\n+
460 storage_.reserve(_capacity);
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
477 [[maybe_unused]]
const auto &guard =
\n+
478 Imp::makeScopeGuard([
this ]{ syncBaseArray(); });
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
490 return storage_.capacity();
\n+
\n+
\n+
\n+
\n+
\n+
\n+
505 [[maybe_unused]]
const auto &guard =
\n+
506 Imp::makeScopeGuard([
this ]{ syncBaseArray(); });
\n+
507 storage_.resize(size);
\n+
\n+
\n+
\n+
\n+
\n+
512 noexcept (
noexcept (std::declval<BlockVector>().storage_ = a.storage_))
\n+
\n+
514 storage_ = a.storage_;
\n+
\n+
\n+
\n+
\n+
\n+
\n+
520 noexcept (
noexcept (std::declval<BlockVector>().swap(a)))
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
527 noexcept (
noexcept (std::declval<BlockVector>().storage_ = a.storage_))
\n+
\n+
529 [[maybe_unused]]
const auto &guard =
\n+
530 Imp::makeScopeGuard([
this ]{ syncBaseArray(); });
\n+
531 storage_ = a.storage_;
\n+
\n+
\n+
\n+
\n+
\n+
\n+
537 noexcept (
noexcept (std::declval<BlockVector>().swap(a)))
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
546 std::declval<BlockVector&>().storage_.swap(other.storage_)))
\n+
\n+
548 [[maybe_unused]]
const auto &guard = Imp::makeScopeGuard([&]{
\n+
\n+
550 other.syncBaseArray();
\n+
\n+
552 storage_.swap(other.storage_);
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
559 (
static_cast< Imp::block_vector_unmanaged<B,A>&
> (*this)) = k;
\n+
\n+
\n+
\n+
\n+
\n+
564 void syncBaseArray() noexcept
\n+
\n+
566 this->p = storage_.data();
\n+
567 this->n = storage_.size();
\n+
\n+
\n+
570 std::vector<B, A> storage_;
\n+
\n+
\n+
\n+
578 template <
class B,
class A>
\n+
\n+
589 template <
class K,
class A>
\n+
\n+
\n+
\n+
\n+
\n+
594 for (size_type i=0; i<v.size(); i++)
\n+
595 s << v[i] << std::endl;
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
622 template <
class B,
class A>
\n+
\n+
624 template <
class B,
class A=std::allocator<B> >
\n+
\n+
626 class BlockVectorWindow :
public Imp::block_vector_unmanaged<B,A>
\n+
\n+
\n+
\n+
\n+
\n+
633 using field_type =
typename Imp::BlockTraits<B>::field_type;
\n+
\n+
636 typedef B block_type;
\n+
\n+
639 typedef A allocator_type;
\n+
\n+
642 typedef typename A::size_type size_type;
\n+
\n+
645 [[deprecated(
"Use free function blockLevel(). Will be removed after 2.8." )]]
\n+
646 static constexpr unsigned int blocklevel = blockLevel<B>()+1;
\n+
\n+
649 typedef typename Imp::block_vector_unmanaged<B,A>::Iterator Iterator;
\n+
\n+
652 typedef typename Imp::block_vector_unmanaged<B,A>::ConstIterator ConstIterator;
\n+
\n+
\n+
\n+
657 BlockVectorWindow () : Imp::block_vector_unmanaged<B,A>()
\n+
\n+
\n+
661 BlockVectorWindow (B* _p, size_type _n)
\n+
\n+
\n+
\n+
\n+
\n+
668 BlockVectorWindow (
const BlockVectorWindow& a)
\n+
\n+
\n+
\n+
\n+
\n+
675 BlockVectorWindow& operator= (
const BlockVectorWindow& a)
\n+
\n+
\n+
678 #ifdef DUNE_ISTL_WITH_CHECKING \n+
679 if (this->n!=a.N()) DUNE_THROW(ISTLError,
"vector size mismatch" );
\n+
\n+
\n+
\n+
\n+
\n+
685 for (size_type i=0; i<this->n; i++) this->p[i]=a.p[i];
\n+
\n+
\n+
\n+
\n+
691 BlockVectorWindow& operator= (
const field_type& k)
\n+
\n+
693 (
static_cast< Imp::block_vector_unmanaged<B,A>&
> (*this)) = k;
\n+
\n+
\n+
\n+
698 operator BlockVector<B, A>()
const {
\n+
699 auto bv = BlockVector<B, A>(this->n);
\n+
\n+
701 std::copy(this->begin(), this->end(), bv.begin());
\n+
\n+
\n+
\n+
\n+
\n+
\n+
709 void set (size_type _n, B* _p)
\n+
\n+
\n+
\n+
\n+
\n+
716 void setsize (size_type _n)
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
734 size_type getsize ()
const \n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
752 template <
class B,
class A=std::allocator<B> >
\n+
753 class compressed_block_vector_unmanaged :
public compressed_base_array_unmanaged<B,A>
\n+
\n+
\n+
\n+
\n+
\n+
760 using field_type =
typename Imp::BlockTraits<B>::field_type;
\n+
\n+
763 typedef B block_type;
\n+
\n+
766 typedef A allocator_type;
\n+
\n+
769 typedef typename compressed_base_array_unmanaged<B,A>::iterator Iterator;
\n+
\n+
772 typedef typename compressed_base_array_unmanaged<B,A>::const_iterator ConstIterator;
\n+
\n+
775 typedef typename A::size_type size_type;
\n+
\n+
\n+
\n+
779 compressed_block_vector_unmanaged& operator= (
const field_type& k)
\n+
\n+
781 for (size_type i=0; i<this->n; i++)
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
791 compressed_block_vector_unmanaged& operator+= (
const V& y)
\n+
\n+
793 #ifdef DUNE_ISTL_WITH_CHECKING \n+
794 if (!includesindexset(y)) DUNE_THROW(ISTLError,
"index set mismatch" );
\n+
\n+
796 for (size_type i=0; i<y.n; ++i) this->
operator [](y.j[i]) += y.p[i];
\n+
\n+
\n+
\n+
\n+
802 compressed_block_vector_unmanaged& operator-= (
const V& y)
\n+
\n+
804 #ifdef DUNE_ISTL_WITH_CHECKING \n+
805 if (!includesindexset(y)) DUNE_THROW(ISTLError,
"index set mismatch" );
\n+
\n+
807 for (size_type i=0; i<y.n; ++i) this->
operator [](y.j[i]) -= y.p[i];
\n+
\n+
\n+
\n+
\n+
813 compressed_block_vector_unmanaged& axpy (
const field_type& a,
const V& y)
\n+
\n+
815 #ifdef DUNE_ISTL_WITH_CHECKING \n+
816 if (!includesindexset(y)) DUNE_THROW(ISTLError,
"index set mismatch" );
\n+
\n+
818 for (size_type i=0; i<y.n; ++i)
\n+
819 Impl::asVector((*
this )[y.j[i]]).axpy(a,Impl::asVector(y.p[i]));
\n+
\n+
\n+
\n+
824 compressed_block_vector_unmanaged& operator*= (
const field_type& k)
\n+
\n+
826 for (size_type i=0; i<this->n; ++i) (this->p)[i] *= k;
\n+
\n+
\n+
\n+
831 compressed_block_vector_unmanaged& operator/= (
const field_type& k)
\n+
\n+
833 for (size_type i=0; i<this->n; ++i) (this->p)[i] /= k;
\n+
\n+
\n+
\n+
\n+
\n+
\n+
841 field_type operator* (
const compressed_block_vector_unmanaged& y)
const \n+
\n+
843 #ifdef DUNE_ISTL_WITH_CHECKING \n+
844 if (!includesindexset(y) || !y.includesindexset(*
this ) )
\n+
845 DUNE_THROW(ISTLError,
"index set mismatch" );
\n+
\n+
\n+
848 for (size_type i=0; i<this->n; ++i)
\n+
849 sum += (this->p)[i] * y[(this->j)[i]];
\n+
\n+
\n+
\n+
\n+
\n+
\n+
857 typename FieldTraits<field_type>::real_type one_norm ()
const \n+
\n+
859 typename FieldTraits<field_type>::real_type sum=0;
\n+
860 for (size_type i=0; i<this->n; ++i) sum += (this->p)[i].one_norm();
\n+
\n+
\n+
\n+
865 typename FieldTraits<field_type>::real_type one_norm_real ()
const \n+
\n+
867 typename FieldTraits<field_type>::real_type sum=0;
\n+
868 for (size_type i=0; i<this->n; ++i) sum += (this->p)[i].one_norm_real();
\n+
\n+
\n+
\n+
873 typename FieldTraits<field_type>::real_type two_norm ()
const \n+
\n+
\n+
876 typename FieldTraits<field_type>::real_type sum=0;
\n+
877 for (size_type i=0; i<this->n; ++i) sum += (this->p)[i].two_norm2();
\n+
\n+
\n+
\n+
882 typename FieldTraits<field_type>::real_type two_norm2 ()
const \n+
\n+
884 typename FieldTraits<field_type>::real_type sum=0;
\n+
885 for (size_type i=0; i<this->n; ++i) sum += (this->p)[i].two_norm2();
\n+
\n+
\n+
\n+
890 template <
typename ft = field_type,
\n+
891 typename std::enable_if<!HasNaN<ft>::value,
int >::type = 0>
\n+
892 typename FieldTraits<ft>::real_type infinity_norm()
const {
\n+
893 using real_type =
typename FieldTraits<ft>::real_type;
\n+
\n+
\n+
\n+
897 for (
auto const &x : *this) {
\n+
898 real_type
const a = x.infinity_norm();
\n+
\n+
\n+
\n+
\n+
\n+
905 template <
typename ft = field_type,
\n+
906 typename std::enable_if<!HasNaN<ft>::value,
int >::type = 0>
\n+
907 typename FieldTraits<ft>::real_type infinity_norm_real()
const {
\n+
908 using real_type =
typename FieldTraits<ft>::real_type;
\n+
\n+
\n+
\n+
912 for (
auto const &x : *this) {
\n+
913 real_type
const a = x.infinity_norm_real();
\n+
\n+
\n+
\n+
\n+
\n+
920 template <
typename ft = field_type,
\n+
921 typename std::enable_if<HasNaN<ft>::value,
int >::type = 0>
\n+
922 typename FieldTraits<ft>::real_type infinity_norm()
const {
\n+
923 using real_type =
typename FieldTraits<ft>::real_type;
\n+
\n+
\n+
\n+
\n+
928 for (
auto const &x : *this) {
\n+
929 real_type
const a = x.infinity_norm();
\n+
\n+
\n+
\n+
933 return norm * (isNaN / isNaN);
\n+
\n+
\n+
937 template <
typename ft = field_type,
\n+
938 typename std::enable_if<HasNaN<ft>::value,
int >::type = 0>
\n+
939 typename FieldTraits<ft>::real_type infinity_norm_real()
const {
\n+
940 using real_type =
typename FieldTraits<ft>::real_type;
\n+
\n+
\n+
\n+
\n+
945 for (
auto const &x : *this) {
\n+
946 real_type
const a = x.infinity_norm_real();
\n+
\n+
\n+
\n+
950 return norm * (isNaN / isNaN);
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
962 size_type dim ()
const \n+
\n+
\n+
965 for (size_type i=0; i<this->n; i++)
\n+
966 d += (this->p)[i].dim();
\n+
\n+
\n+
\n+
\n+
972 compressed_block_vector_unmanaged () : compressed_base_array_unmanaged<B,A>()
\n+
\n+
\n+
\n+
977 bool includesindexset (
const V& y)
\n+
\n+
979 typename V::ConstIterator e=this->end();
\n+
980 for (size_type i=0; i<y.n; i++)
\n+
981 if (this->find(y.j[i])==e)
\n+
\n+
\n+
\n+
\n+
\n+
\n+
1006 template <
class B,
class A=std::allocator<B> >
\n+
1007 class CompressedBlockVectorWindow :
public compressed_block_vector_unmanaged<B,A>
\n+
\n+
\n+
\n+
\n+
\n+
1014 using field_type =
typename Imp::BlockTraits<B>::field_type;
\n+
\n+
1017 typedef B block_type;
\n+
\n+
1020 typedef A allocator_type;
\n+
\n+
1023 typedef typename A::size_type size_type;
\n+
\n+
1026 [[deprecated(
"Use free function blockLevel(). Will be removed after 2.8." )]]
\n+
1027 static constexpr unsigned int blocklevel = blockLevel<B>()+1;
\n+
\n+
1030 typedef typename compressed_block_vector_unmanaged<B,A>::Iterator Iterator;
\n+
\n+
1033 typedef typename compressed_block_vector_unmanaged<B,A>::ConstIterator ConstIterator;
\n+
\n+
\n+
\n+
1038 CompressedBlockVectorWindow () : compressed_block_vector_unmanaged<B,A>()
\n+
\n+
\n+
1042 CompressedBlockVectorWindow (B* _p, size_type* _j, size_type _n)
\n+
\n+
\n+
\n+
\n+
\n+
\n+
1050 CompressedBlockVectorWindow (
const CompressedBlockVectorWindow& a)
\n+
\n+
\n+
\n+
\n+
\n+
\n+
1058 CompressedBlockVectorWindow& operator= (
const CompressedBlockVectorWindow& a)
\n+
\n+
\n+
1061 #ifdef DUNE_ISTL_WITH_CHECKING \n+
1062 if (this->n!=a.N()) DUNE_THROW(ISTLError,
"vector size mismatch" );
\n+
\n+
\n+
\n+
\n+
\n+
1068 for (size_type i=0; i<this->n; i++) this->p[i]=a.p[i];
\n+
1069 for (size_type i=0; i<this->n; i++) this->j[i]=a.j[i];
\n+
\n+
\n+
\n+
\n+
1075 CompressedBlockVectorWindow& operator= (
const field_type& k)
\n+
\n+
1077 (
static_cast< compressed_block_vector_unmanaged<B,A>&
> (*this)) = k;
\n+
\n+
\n+
\n+
\n+
\n+
\n+
1085 void set (size_type _n, B* _p, size_type* _j)
\n+
\n+
\n+
\n+
\n+
\n+
\n+
1093 void setsize (size_type _n)
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
1105 void setindexptr (size_type* _j)
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
1117 size_type* getindexptr ()
\n+
\n+
\n+
\n+
\n+
1123 const B* getptr ()
const \n+
\n+
\n+
\n+
\n+
1129 const size_type* getindexptr ()
const \n+
\n+
\n+
\n+
1134 size_type getsize ()
const \n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
1144 template <
typename B,
typename A>
\n+
1145 struct AutonomousValueType<Imp::BlockVectorWindow<B,A>>
\n+
\n+
1147 using type = BlockVector<B, A>;
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
Helper functions for determining the vector/matrix block level.
\n+
Implements several basic array containers.
\n
\n
Definition allocator.hh:11
\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-
A sparse block matrix with compressed row storage.
Definition bcrsmatrix.hh:466
\n-
Thrown when a solver aborts due to some problem.
Definition istlexception.hh:46
\n-
A linear operator.
Definition operators.hh:67
\n-
Base class for matrix free definition of preconditioners.
Definition preconditioner.hh:32
\n-
Base class for scalar product and norm computation.
Definition scalarproducts.hh:52
\n-
Default implementation for the scalar case.
Definition scalarproducts.hh:168
\n-
Statistics about the application of an inverse operator.
Definition solver.hh:48
\n-
InverseOperatorResult()
Default constructor.
Definition solver.hh:50
\n-
double condition_estimate
Estimate of condition number.
Definition solver.hh:79
\n-
double elapsed
Elapsed time in seconds.
Definition solver.hh:82
\n-
int iterations
Number of iterations.
Definition solver.hh:67
\n-
double reduction
Reduction achieved: .
Definition solver.hh:70
\n-
void clear()
Resets all data.
Definition solver.hh:56
\n-
double conv_rate
Convergence rate (average reduction per step)
Definition solver.hh:76
\n-
bool converged
True if convergence criterion has been met.
Definition solver.hh:73
\n-
Abstract base class for all solvers.
Definition solver.hh:99
\n-
void printHeader(std::ostream &s) const
helper function for printing header of solver output
Definition solver.hh:163
\n-
virtual ~InverseOperator()
Destructor.
Definition solver.hh:156
\n-
void printOutput(std::ostream &s, const CountType &iter, const DataType &norm) const
helper function for printing solver output
Definition solver.hh:185
\n-
void printOutput(std::ostream &s, const CountType &iter, const DataType &norm, const DataType &norm_old) const
helper function for printing solver output
Definition solver.hh:172
\n-
virtual void apply(X &x, Y &b, double reduction, InverseOperatorResult &res)=0
apply inverse operator, with given convergence criteria.
\n-
Simd::Scalar< real_type > scalar_real_type
scalar type underlying the field_type
Definition solver.hh:114
\n-
Y range_type
Type of the range of the operator to be inverted.
Definition solver.hh:105
\n-
@ normSpacing
Definition solver.hh:160
\n-
@ iterationSpacing
Definition solver.hh:160
\n-
X domain_type
Type of the domain of the operator to be inverted.
Definition solver.hh:102
\n-
virtual void apply(X &x, Y &b, InverseOperatorResult &res)=0
Apply inverse operator,.
\n-
X::field_type field_type
The field type of the operator.
Definition solver.hh:108
\n-
FieldTraits< field_type >::real_type real_type
The real type of the field type (is the same if using real numbers, but differs for std::complex)
Definition solver.hh:111
\n-
virtual SolverCategory::Category category() const =0
Category of the solver (see SolverCategory::Category)
\n-
Base class for all implementations of iterative solvers.
Definition solver.hh:203
\n-
IterativeSolver(std::shared_ptr< const LinearOperator< X, Y > > op, std::shared_ptr< const ScalarProduct< X > > sp, std::shared_ptr< Preconditioner< X, X > > prec, const ParameterTree &configuration)
Constructor.
Definition solver.hh:313
\n-
IterativeSolver(std::shared_ptr< const LinearOperator< X, Y > > op, std::shared_ptr< Preconditioner< X, X > > prec, const ParameterTree &configuration)
Constructor.
Definition solver.hh:290
\n-
virtual void apply(X &x, X &b, double reduction, InverseOperatorResult &res)
Apply inverse operator with given reduction factor.
Definition solver.hh:374
\n-
std::shared_ptr< const ScalarProduct< X > > _sp
Definition solver.hh:506
\n-
IterativeSolver(std::shared_ptr< const LinearOperator< X, Y > > op, std::shared_ptr< const ScalarProduct< X > > sp, std::shared_ptr< Preconditioner< X, Y > > prec, scalar_real_type reduction, int maxit, int verbose)
General constructor to initialize an iterative solver.
Definition solver.hh:340
\n-
std::string name() const
Definition solver.hh:388
\n-
IterativeSolver(const LinearOperator< X, Y > &op, Preconditioner< X, Y > &prec, scalar_real_type reduction, int maxit, int verbose)
General constructor to initialize an iterative solver.
Definition solver.hh:230
\n-
std::shared_ptr< const LinearOperator< X, Y > > _op
Definition solver.hh:504
\n-
int _maxit
Definition solver.hh:508
\n-
int _verbose
Definition solver.hh:509
\n-
scalar_real_type _reduction
Definition solver.hh:507
\n-
IterativeSolver(const LinearOperator< X, Y > &op, const ScalarProduct< X > &sp, Preconditioner< X, Y > &prec, scalar_real_type reduction, int maxit, int verbose)
General constructor to initialize an iterative solver.
Definition solver.hh:262
\n-
SolverCategory::Category _category
Definition solver.hh:510
\n-
std::shared_ptr< Preconditioner< X, Y > > _prec
Definition solver.hh:505
\n-
virtual SolverCategory::Category category() const
Category of the solver (see SolverCategory::Category)
Definition solver.hh:383
\n-
Class for controlling iterative methods.
Definition solver.hh:411
\n-
Iteration(const IterativeSolver &parent, InverseOperatorResult &res)
Definition solver.hh:413
\n-
Iteration(Iteration &&other)
Definition solver.hh:428
\n-
InverseOperatorResult & _res
Definition solver.hh:498
\n-
const IterativeSolver & _parent
Definition solver.hh:499
\n-
Timer _watch
Definition solver.hh:497
\n-
Iteration(const Iteration &)=delete
\n-
CountType _i
Definition solver.hh:496
\n-
real_type _def0
Definition solver.hh:495
\n-
bool step(CountType i, real_type def)
registers the iteration step, checks for invalid defect norm and convergence.
Definition solver.hh:455
\n-
void finalize()
Definition solver.hh:480
\n-
real_type _def
Definition solver.hh:495
\n-
~Iteration()
Definition solver.hh:440
\n-
bool _valid
Definition solver.hh:500
\n-
Helper class for notifying a DUNE-ISTL linear solver about a change of the iteration matrix object in...
Definition solver.hh:522
\n-
static void setMatrix(ISTLLinearSolver &solver, const BCRSMatrix &matrix)
Definition solver.hh:524
\n-
Implementation that works together with iterative ISTL solvers, e.g. Dune::CGSolver or Dune::BiCGSTAB...
Definition solver.hh:540
\n-
static void setMatrix(ISTLLinearSolver &, const BCRSMatrix &)
Definition solver.hh:541
\n-
static void setMatrix(ISTLLinearSolver &solver, const BCRSMatrix &matrix)
Definition solver.hh:553
\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-
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-
Definition solvertype.hh:16
\n+
std::ostream & operator<<(std::ostream &s, const BlockVector< K, A > &v)
Send BlockVector to an output stream.
Definition bvector.hh:590
\n+
A vector of blocks with memory management.
Definition bvector.hh:395
\n+
BlockVector()
makes empty vector
Definition bvector.hh:425
\n+
void reserve(size_type capacity)
Reserve space.
Definition bvector.hh:475
\n+
BlockVector(BlockVector &&a) noexcept(noexcept(std::declval< BlockVector >().swap(a)))
move constructor
Definition bvector.hh:519
\n+
BlockVector(size_type _n)
make vector with _n components
Definition bvector.hh:431
\n+
void resize(size_type size)
Resize the vector.
Definition bvector.hh:503
\n+
Imp::block_vector_unmanaged< B, A >::Iterator Iterator
make iterators available as types
Definition bvector.hh:417
\n+
static constexpr unsigned int blocklevel
increment block level counter
Definition bvector.hh:414
\n+
BlockVector(const BlockVector &a) noexcept(noexcept(std::declval< BlockVector >().storage_=a.storage_))
copy constructor
Definition bvector.hh:511
\n+
A allocator_type
export the allocator type
Definition bvector.hh:407
\n+
BlockVector & operator=(const BlockVector &a) noexcept(noexcept(std::declval< BlockVector >().storage_=a.storage_))
assignment
Definition bvector.hh:526
\n+
typename Imp::BlockTraits< B >::field_type field_type
export the type representing the field
Definition bvector.hh:401
\n+
A::size_type size_type
The type for the index access.
Definition bvector.hh:410
\n+
BlockVector(std::initializer_list< B > const &l)
Construct from a std::initializer_list.
Definition bvector.hh:437
\n+
size_type capacity() const
Get the capacity of the vector.
Definition bvector.hh:488
\n+
BlockVector(size_type _n, S _capacity)
Make vector with _n components but preallocating capacity components.
Definition bvector.hh:455
\n+
B block_type
export the type representing the components
Definition bvector.hh:404
\n+
void swap(BlockVector &other) noexcept(noexcept(std::declval< BlockVector & >().storage_.swap(other.storage_)))
swap operation
Definition bvector.hh:544
\n+
Imp::block_vector_unmanaged< B, A >::ConstIterator ConstIterator
make iterators available as types
Definition bvector.hh:420
\n+
FieldTraits< B >::real_type real_type
Definition bvector.hh:582
\n+
FieldTraits< B >::field_type field_type
Definition bvector.hh:581
\n
\n-10#include \n-11#include \n-12#include \n-13\n-14#include \n-15#include \n-16#include \n-17#include \n-18#include \n-19#include \n-20\n-21#include \"_\bs_\bo_\bl_\bv_\be_\br_\bt_\by_\bp_\be_\b._\bh_\bh\"\n-22#include \"_\bp_\br_\be_\bc_\bo_\bn_\bd_\bi_\bt_\bi_\bo_\bn_\be_\br_\b._\bh_\bh\"\n-23#include \"_\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\bs_\b._\bh_\bh\"\n-24#include \"_\bs_\bc_\ba_\bl_\ba_\br_\bp_\br_\bo_\bd_\bu_\bc_\bt_\bs_\b._\bh_\bh\"\n+9#include \n+10#include \n+11#include \n+12#include \n+13#include \n+14#include \n+15#include \n+16#include \n+17\n+18#include \n+19#include \n+20#include \n+21#include \n+22#include \n+23#include \n+24#include \n 25\n-26namespace _\bD_\bu_\bn_\be\n-27{\n-_\b4_\b7 struct _\bI_\bn_\bv_\be_\br_\bs_\be_\bO_\bp_\be_\br_\ba_\bt_\bo_\br_\bR_\be_\bs_\bu_\bl_\bt\n-48 {\n-_\b5_\b0 _\bI_\bn_\bv_\be_\br_\bs_\be_\bO_\bp_\be_\br_\ba_\bt_\bo_\br_\bR_\be_\bs_\bu_\bl_\bt ()\n-51 {\n-52 _\bc_\bl_\be_\ba_\br();\n-53 }\n-54\n-_\b5_\b6 void _\bc_\bl_\be_\ba_\br ()\n-57 {\n-58 _\bi_\bt_\be_\br_\ba_\bt_\bi_\bo_\bn_\bs = 0;\n-59 _\br_\be_\bd_\bu_\bc_\bt_\bi_\bo_\bn = 0;\n-60 _\bc_\bo_\bn_\bv_\be_\br_\bg_\be_\bd = false;\n-61 _\bc_\bo_\bn_\bv_\b__\br_\ba_\bt_\be = 1;\n-62 _\be_\bl_\ba_\bp_\bs_\be_\bd = 0;\n-63 _\bc_\bo_\bn_\bd_\bi_\bt_\bi_\bo_\bn_\b__\be_\bs_\bt_\bi_\bm_\ba_\bt_\be = -1;\n-64 }\n-65\n-_\b6_\b7 int _\bi_\bt_\be_\br_\ba_\bt_\bi_\bo_\bn_\bs;\n-68\n-_\b7_\b0 double _\br_\be_\bd_\bu_\bc_\bt_\bi_\bo_\bn;\n-71\n-_\b7_\b3 bool _\bc_\bo_\bn_\bv_\be_\br_\bg_\be_\bd;\n-74\n-_\b7_\b6 double _\bc_\bo_\bn_\bv_\b__\br_\ba_\bt_\be;\n-77\n-_\b7_\b9 double _\bc_\bo_\bn_\bd_\bi_\bt_\bi_\bo_\bn_\b__\be_\bs_\bt_\bi_\bm_\ba_\bt_\be = -1;\n-80\n-_\b8_\b2 double _\be_\bl_\ba_\bp_\bs_\be_\bd;\n-83 };\n-84\n-85\n-86 //=====================================================================\n-98 template\n-_\b9_\b9 class _\bI_\bn_\bv_\be_\br_\bs_\be_\bO_\bp_\be_\br_\ba_\bt_\bo_\br {\n-100 public:\n-_\b1_\b0_\b2 typedef X _\bd_\bo_\bm_\ba_\bi_\bn_\b__\bt_\by_\bp_\be;\n-103\n-_\b1_\b0_\b5 typedef Y _\br_\ba_\bn_\bg_\be_\b__\bt_\by_\bp_\be;\n-106\n-_\b1_\b0_\b8 typedef typename X::field_type _\bf_\bi_\be_\bl_\bd_\b__\bt_\by_\bp_\be;\n-109\n-_\b1_\b1_\b1 typedef typename FieldTraits::real_type _\br_\be_\ba_\bl_\b__\bt_\by_\bp_\be;\n-112\n-_\b1_\b1_\b4 typedef Simd::Scalar _\bs_\bc_\ba_\bl_\ba_\br_\b__\br_\be_\ba_\bl_\b__\bt_\by_\bp_\be;\n-115\n-_\b1_\b2_\b8 virtual void _\ba_\bp_\bp_\bl_\by (X& x, Y& b, _\bI_\bn_\bv_\be_\br_\bs_\be_\bO_\bp_\be_\br_\ba_\bt_\bo_\br_\bR_\be_\bs_\bu_\bl_\bt& res) = 0;\n-129\n-_\b1_\b4_\b3 virtual void _\ba_\bp_\bp_\bl_\by (X& x, Y& b, double reduction, _\bI_\bn_\bv_\be_\br_\bs_\be_\bO_\bp_\be_\br_\ba_\bt_\bo_\br_\bR_\be_\bs_\bu_\bl_\bt&\n-res) = 0;\n-144\n-_\b1_\b4_\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-147#ifdef DUNE_ISTL_SUPPORT_OLD_CATEGORY_INTERFACE\n+26#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+27\n+28#include \"_\bb_\ba_\bs_\be_\ba_\br_\br_\ba_\by_\b._\bh_\bh\"\n+29#include \"_\bi_\bs_\bt_\bl_\be_\bx_\bc_\be_\bp_\bt_\bi_\bo_\bn_\b._\bh_\bh\"\n+30\n+38namespace _\bD_\bu_\bn_\be {\n+39\n+41namespace Imp {\n+42\n+48 template \n+49 class BlockTraitsImp;\n+50\n+51 template \n+52 class BlockTraitsImp\n+53 {\n+54 public:\n+55 using field_type = B;\n+56 };\n+57\n+58 template \n+59 class BlockTraitsImp\n+60 {\n+61 public:\n+62 using field_type = typename B::field_type;\n+63 };\n+64\n+67 template \n+68 using BlockTraits = BlockTraitsImp::value>;\n+69\n+83 template >\n+84 class block_vector_unmanaged : public base_array_unmanaged\n+85 {\n+86 public:\n+87\n+88 //===== type definitions and constants\n+89 using field_type = typename Imp::BlockTraits::field_type;\n+90\n+92 typedef B block_type;\n+93\n+95 typedef A allocator_type;\n+96\n+98 typedef typename A::size_type size_type;\n+99\n+101 typedef typename base_array_unmanaged::iterator Iterator;\n+102\n+104 typedef typename base_array_unmanaged::const_iterator ConstIterator;\n+105\n+107 typedef B value_type;\n+108\n+110 typedef B& reference;\n+111\n+113 typedef const B& const_reference;\n+114\n+115 //===== assignment from scalar\n+117\n+118 block_vector_unmanaged& operator= (const field_type& k)\n+119 {\n+120 for (size_type i=0; in; i++)\n+121 (*this)[i] = k;\n+122 return *this;\n+123 }\n+124\n+125 //===== vector space arithmetic\n+127 block_vector_unmanaged& operator+= (const block_vector_unmanaged& y)\n+128 {\n+129#ifdef DUNE_ISTL_WITH_CHECKING\n+130 if (this->n!=y.N()) DUNE_THROW(ISTLError,\"vector size mismatch\");\n+131#endif\n+132 for (size_type i=0; in; ++i) (*this)[i] += y[i];\n+133 return *this;\n+134 }\n+135\n+137 block_vector_unmanaged& operator-= (const block_vector_unmanaged& y)\n+138 {\n+139#ifdef DUNE_ISTL_WITH_CHECKING\n+140 if (this->n!=y.N()) DUNE_THROW(ISTLError,\"vector size mismatch\");\n+141#endif\n+142 for (size_type i=0; in; ++i) (*this)[i] -= y[i];\n+143 return *this;\n+144 }\n+145\n+147 block_vector_unmanaged& operator*= (const field_type& k)\n 148 {\n-149 DUNE_THROW(Dune::Exception,\"It is necessary to implement the category\n-method in a derived classes, in the future this method will pure virtual.\");\n-150 }\n-151#else\n-152 = 0;\n-153#endif\n-154\n-_\b1_\b5_\b6 virtual _\b~_\bI_\bn_\bv_\be_\br_\bs_\be_\bO_\bp_\be_\br_\ba_\bt_\bo_\br () {}\n-157\n-158 protected:\n-159 // spacing values\n-_\b1_\b6_\b0 enum { _\bi_\bt_\be_\br_\ba_\bt_\bi_\bo_\bn_\bS_\bp_\ba_\bc_\bi_\bn_\bg = 5 , _\bn_\bo_\br_\bm_\bS_\bp_\ba_\bc_\bi_\bn_\bg = 16 };\n-161\n-_\b1_\b6_\b3 void _\bp_\br_\bi_\bn_\bt_\bH_\be_\ba_\bd_\be_\br(std::ostream& s) const\n-164 {\n-165 s << std::setw(_\bi_\bt_\be_\br_\ba_\bt_\bi_\bo_\bn_\bS_\bp_\ba_\bc_\bi_\bn_\bg) << \" Iter\";\n-166 s << std::setw(_\bn_\bo_\br_\bm_\bS_\bp_\ba_\bc_\bi_\bn_\bg) << \"Defect\";\n-167 s << std::setw(_\bn_\bo_\br_\bm_\bS_\bp_\ba_\bc_\bi_\bn_\bg) << \"Rate\" << std::endl;\n-168 }\n-169\n-171 template \n-_\b1_\b7_\b2 void _\bp_\br_\bi_\bn_\bt_\bO_\bu_\bt_\bp_\bu_\bt(std::ostream& s,\n-173 const CountType& iter,\n-174 const DataType& norm,\n-175 const DataType& norm_old) const\n-176 {\n-177 const DataType rate = norm/norm_old;\n-178 s << std::setw(_\bi_\bt_\be_\br_\ba_\bt_\bi_\bo_\bn_\bS_\bp_\ba_\bc_\bi_\bn_\bg) << iter << \" \";\n-179 s << std::setw(_\bn_\bo_\br_\bm_\bS_\bp_\ba_\bc_\bi_\bn_\bg) << Simd::io(norm) << \" \";\n-180 s << std::setw(_\bn_\bo_\br_\bm_\bS_\bp_\ba_\bc_\bi_\bn_\bg) << Simd::io(rate) << std::endl;\n-181 }\n-182\n-184 template \n-_\b1_\b8_\b5 void _\bp_\br_\bi_\bn_\bt_\bO_\bu_\bt_\bp_\bu_\bt(std::ostream& s,\n-186 const CountType& iter,\n-187 const DataType& norm) const\n-188 {\n-189 s << std::setw(_\bi_\bt_\be_\br_\ba_\bt_\bi_\bo_\bn_\bS_\bp_\ba_\bc_\bi_\bn_\bg) << iter << \" \";\n-190 s << std::setw(_\bn_\bo_\br_\bm_\bS_\bp_\ba_\bc_\bi_\bn_\bg) << Simd::io(norm) << std::endl;\n-191 }\n-192 };\n+149 for (size_type i=0; in; ++i) (*this)[i] *= k;\n+150 return *this;\n+151 }\n+152\n+154 block_vector_unmanaged& operator/= (const field_type& k)\n+155 {\n+156 for (size_type i=0; in; ++i) (*this)[i] /= k;\n+157 return *this;\n+158 }\n+159\n+161 block_vector_unmanaged& axpy (const field_type& a, const\n+block_vector_unmanaged& y)\n+162 {\n+163#ifdef DUNE_ISTL_WITH_CHECKING\n+164 if (this->n!=y.N()) DUNE_THROW(ISTLError,\"vector size mismatch\");\n+165#endif\n+166 for (size_type i=0; in; ++i)\n+167 Impl::asVector((*this)[i]).axpy(a,Impl::asVector(y[i]));\n+168\n+169 return *this;\n+170 }\n+171\n+172\n+180 template\n+181 auto operator* (const block_vector_unmanaged& y) const\n+182 {\n+183 typedef typename PromotionTraits::\n+field_type>::PromotedType PromotedType;\n+184 PromotedType sum(0);\n+185#ifdef DUNE_ISTL_WITH_CHECKING\n+186 if (this->n!=y.N()) DUNE_THROW(ISTLError,\"vector size mismatch\");\n+187#endif\n+188 for (size_type i=0; in; ++i) {\n+189 sum += PromotedType(((*this)[i])*y[i]);\n+190 }\n+191 return sum;\n+192 }\n 193\n-202 template\n-_\b2_\b0_\b3 class _\bI_\bt_\be_\br_\ba_\bt_\bi_\bv_\be_\bS_\bo_\bl_\bv_\be_\br : public _\bI_\bn_\bv_\be_\br_\bs_\be_\bO_\bp_\be_\br_\ba_\bt_\bo_\br{\n-204 public:\n-205 using typename _\bI_\bn_\bv_\be_\br_\bs_\be_\bO_\bp_\be_\br_\ba_\bt_\bo_\br_\b<_\bX_\b,_\bY_\b>_\b:_\b:_\bd_\bo_\bm_\ba_\bi_\bn_\b__\bt_\by_\bp_\be;\n-206 using typename _\bI_\bn_\bv_\be_\br_\bs_\be_\bO_\bp_\be_\br_\ba_\bt_\bo_\br_\b<_\bX_\b,_\bY_\b>_\b:_\b:_\br_\ba_\bn_\bg_\be_\b__\bt_\by_\bp_\be;\n-207 using typename _\bI_\bn_\bv_\be_\br_\bs_\be_\bO_\bp_\be_\br_\ba_\bt_\bo_\br_\b<_\bX_\b,_\bY_\b>_\b:_\b:_\bf_\bi_\be_\bl_\bd_\b__\bt_\by_\bp_\be;\n-208 using typename _\bI_\bn_\bv_\be_\br_\bs_\be_\bO_\bp_\be_\br_\ba_\bt_\bo_\br_\b<_\bX_\b,_\bY_\b>_\b:_\b:_\br_\be_\ba_\bl_\b__\bt_\by_\bp_\be;\n-209 using typename _\bI_\bn_\bv_\be_\br_\bs_\be_\bO_\bp_\be_\br_\ba_\bt_\bo_\br_\b<_\bX_\b,_\bY_\b>_\b:_\b:_\bs_\bc_\ba_\bl_\ba_\br_\b__\br_\be_\ba_\bl_\b__\bt_\by_\bp_\be;\n-210\n-_\b2_\b3_\b0 _\bI_\bt_\be_\br_\ba_\bt_\bi_\bv_\be_\bS_\bo_\bl_\bv_\be_\br (const _\bL_\bi_\bn_\be_\ba_\br_\bO_\bp_\be_\br_\ba_\bt_\bo_\br_\b<_\bX_\b,_\bY_\b>& op, _\bP_\br_\be_\bc_\bo_\bn_\bd_\bi_\bt_\bi_\bo_\bn_\be_\br_\b<_\bX_\b,_\bY_\b>& prec,\n-_\bs_\bc_\ba_\bl_\ba_\br_\b__\br_\be_\ba_\bl_\b__\bt_\by_\bp_\be reduction, int maxit, int verbose) :\n-231 _\b__\bo_\bp(stackobject_to_shared_ptr(op)),\n-232 _\b__\bp_\br_\be_\bc(stackobject_to_shared_ptr(prec)),\n-233 _\b__\bs_\bp(new _\bS_\be_\bq_\bS_\bc_\ba_\bl_\ba_\br_\bP_\br_\bo_\bd_\bu_\bc_\bt),\n-234 _\b__\br_\be_\bd_\bu_\bc_\bt_\bi_\bo_\bn(reduction), _\b__\bm_\ba_\bx_\bi_\bt(maxit), _\b__\bv_\be_\br_\bb_\bo_\bs_\be(verbose), _\b__\bc_\ba_\bt_\be_\bg_\bo_\br_\by\n-(_\bS_\bo_\bl_\bv_\be_\br_\bC_\ba_\bt_\be_\bg_\bo_\br_\by::sequential)\n-235 {\n-236 if(_\bS_\bo_\bl_\bv_\be_\br_\bC_\ba_\bt_\be_\bg_\bo_\br_\by_\b:_\b:_\bc_\ba_\bt_\be_\bg_\bo_\br_\by(op) != _\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 DUNE_THROW(_\bI_\bn_\bv_\ba_\bl_\bi_\bd_\bS_\bo_\bl_\bv_\be_\br_\bC_\ba_\bt_\be_\bg_\bo_\br_\by, \"LinearOperator has to be sequential!\");\n-238 if(_\bS_\bo_\bl_\bv_\be_\br_\bC_\ba_\bt_\be_\bg_\bo_\br_\by_\b:_\b:_\bc_\ba_\bt_\be_\bg_\bo_\br_\by(prec) != _\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-239 DUNE_THROW(_\bI_\bn_\bv_\ba_\bl_\bi_\bd_\bS_\bo_\bl_\bv_\be_\br_\bC_\ba_\bt_\be_\bg_\bo_\br_\by, \"Preconditioner has to be sequential!\");\n-240 }\n-241\n-_\b2_\b6_\b2 _\bI_\bt_\be_\br_\ba_\bt_\bi_\bv_\be_\bS_\bo_\bl_\bv_\be_\br (const _\bL_\bi_\bn_\be_\ba_\br_\bO_\bp_\be_\br_\ba_\bt_\bo_\br_\b<_\bX_\b,_\bY_\b>& op, const _\bS_\bc_\ba_\bl_\ba_\br_\bP_\br_\bo_\bd_\bu_\bc_\bt_\b<_\bX_\b>& sp,\n-_\bP_\br_\be_\bc_\bo_\bn_\bd_\bi_\bt_\bi_\bo_\bn_\be_\br_\b<_\bX_\b,_\bY_\b>& prec,\n-263 _\bs_\bc_\ba_\bl_\ba_\br_\b__\br_\be_\ba_\bl_\b__\bt_\by_\bp_\be reduction, int maxit, int verbose) :\n-264 _\b__\bo_\bp(stackobject_to_shared_ptr(op)),\n-265 _\b__\bp_\br_\be_\bc(stackobject_to_shared_ptr(prec)),\n-266 _\b__\bs_\bp(stackobject_to_shared_ptr(sp)),\n-267 _\b__\br_\be_\bd_\bu_\bc_\bt_\bi_\bo_\bn(reduction), _\b__\bm_\ba_\bx_\bi_\bt(maxit), _\b__\bv_\be_\br_\bb_\bo_\bs_\be(verbose), _\b__\bc_\ba_\bt_\be_\bg_\bo_\br_\by\n-(_\bS_\bo_\bl_\bv_\be_\br_\bC_\ba_\bt_\be_\bg_\bo_\br_\by::_\bc_\ba_\bt_\be_\bg_\bo_\br_\by(op))\n-268 {\n-269 if(_\bS_\bo_\bl_\bv_\be_\br_\bC_\ba_\bt_\be_\bg_\bo_\br_\by_\b:_\b:_\bc_\ba_\bt_\be_\bg_\bo_\br_\by(op) != _\bS_\bo_\bl_\bv_\be_\br_\bC_\ba_\bt_\be_\bg_\bo_\br_\by_\b:_\b:_\bc_\ba_\bt_\be_\bg_\bo_\br_\by(prec))\n-270 DUNE_THROW(_\bI_\bn_\bv_\ba_\bl_\bi_\bd_\bS_\bo_\bl_\bv_\be_\br_\bC_\ba_\bt_\be_\bg_\bo_\br_\by, \"LinearOperator and Preconditioner must\n-have the same SolverCategory!\");\n-271 if(_\bS_\bo_\bl_\bv_\be_\br_\bC_\ba_\bt_\be_\bg_\bo_\br_\by_\b:_\b:_\bc_\ba_\bt_\be_\bg_\bo_\br_\by(op) != _\bS_\bo_\bl_\bv_\be_\br_\bC_\ba_\bt_\be_\bg_\bo_\br_\by_\b:_\b:_\bc_\ba_\bt_\be_\bg_\bo_\br_\by(sp))\n-272 DUNE_THROW(_\bI_\bn_\bv_\ba_\bl_\bi_\bd_\bS_\bo_\bl_\bv_\be_\br_\bC_\ba_\bt_\be_\bg_\bo_\br_\by, \"LinearOperator and ScalarProduct must\n-have the same SolverCategory!\");\n-273 }\n-274\n-_\b2_\b9_\b0 _\bI_\bt_\be_\br_\ba_\bt_\bi_\bv_\be_\bS_\bo_\bl_\bv_\be_\br (std::shared_ptr > op, std::\n-shared_ptr<_\bP_\br_\be_\bc_\bo_\bn_\bd_\bi_\bt_\bi_\bo_\bn_\be_\br_\b<_\bX_\b,_\bX_\b> > prec, const ParameterTree& configuration) :\n-291 _\bI_\bt_\be_\br_\ba_\bt_\bi_\bv_\be_\bS_\bo_\bl_\bv_\be_\br(op,_\bs_\bt_\bd::make_shared<_\bS_\be_\bq_\bS_\bc_\ba_\bl_\ba_\br_\bP_\br_\bo_\bd_\bu_\bc_\bt>(),prec,\n-292 configuration._\bg_\be_\bt<_\br_\be_\ba_\bl_\b__\bt_\by_\bp_\be>(\"reduction\"),\n-293 configuration._\bg_\be_\bt(\"maxit\"),\n-294 configuration._\bg_\be_\bt(\"verbose\"))\n-295 {}\n-296\n-_\b3_\b1_\b3 _\bI_\bt_\be_\br_\ba_\bt_\bi_\bv_\be_\bS_\bo_\bl_\bv_\be_\br (std::shared_ptr > op, std::\n-shared_ptr > sp, std::shared_ptr<_\bP_\br_\be_\bc_\bo_\bn_\bd_\bi_\bt_\bi_\bo_\bn_\be_\br_\b<_\bX_\b,_\bX_\b> >\n-prec, const ParameterTree& configuration) :\n-314 _\bI_\bt_\be_\br_\ba_\bt_\bi_\bv_\be_\bS_\bo_\bl_\bv_\be_\br(op,sp,prec,\n-315 configuration._\bg_\be_\bt<_\bs_\bc_\ba_\bl_\ba_\br_\b__\br_\be_\ba_\bl_\b__\bt_\by_\bp_\be>(\"reduction\"),\n-316 configuration._\bg_\be_\bt(\"maxit\"),\n-317 configuration._\bg_\be_\bt(\"verbose\"))\n-318 {}\n+201 template\n+202 auto dot(const block_vector_unmanaged& y) const\n+203 {\n+204 typedef typename PromotionTraits::\n+field_type>::PromotedType PromotedType;\n+205 PromotedType sum(0);\n+206#ifdef DUNE_ISTL_WITH_CHECKING\n+207 if (this->n!=y.N()) DUNE_THROW(ISTLError,\"vector size mismatch\");\n+208#endif\n+209\n+210 for (size_type i=0; in; ++i)\n+211 sum += Impl::asVector((*this)[i]).dot(Impl::asVector(y[i]));\n+212\n+213 return sum;\n+214 }\n+215\n+216 //===== norms\n+217\n+219 typename FieldTraits::real_type one_norm () const\n+220 {\n+221 typename FieldTraits::real_type sum=0;\n+222 for (size_type i=0; in; ++i)\n+223 sum += Impl::asVector((*this)[i]).one_norm();\n+224 return sum;\n+225 }\n+226\n+228 typename FieldTraits::real_type one_norm_real () const\n+229 {\n+230 typename FieldTraits::real_type sum=0;\n+231 for (size_type i=0; in; ++i)\n+232 sum += Impl::asVector((*this)[i]).one_norm_real();\n+233 return sum;\n+234 }\n+235\n+237 typename FieldTraits::real_type two_norm () const\n+238 {\n+239 using std::sqrt;\n+240 return sqrt(two_norm2());\n+241 }\n+242\n+244 typename FieldTraits::real_type two_norm2 () const\n+245 {\n+246 typename FieldTraits::real_type sum=0;\n+247 for (size_type i=0; in; ++i)\n+248 sum += Impl::asVector((*this)[i]).two_norm2();\n+249 return sum;\n+250 }\n+251\n+253 template ::value, int>::type = 0>\n+255 typename FieldTraits::real_type infinity_norm() const {\n+256 using real_type = typename FieldTraits::real_type;\n+257 using std::max;\n+258\n+259 real_type norm = 0;\n+260 for (auto const &xi : *this) {\n+261 real_type const a = Impl::asVector(xi).infinity_norm();\n+262 norm = max(a, norm);\n+263 }\n+264 return norm;\n+265 }\n+266\n+268 template ::value, int>::type = 0>\n+270 typename FieldTraits::real_type infinity_norm_real() const {\n+271 using real_type = typename FieldTraits::real_type;\n+272 using std::max;\n+273\n+274 real_type norm = 0;\n+275 for (auto const &xi : *this) {\n+276 real_type const a = Impl::asVector(xi).infinity_norm_real();\n+277 norm = max(a, norm);\n+278 }\n+279 return norm;\n+280 }\n+281\n+283 template ::value, int>::type = 0>\n+285 typename FieldTraits::real_type infinity_norm() const {\n+286 using real_type = typename FieldTraits::real_type;\n+287 using std::max;\n+288 using std::abs;\n+289\n+290 real_type norm = 0;\n+291 real_type isNaN = 1;\n+292\n+293 for (auto const &xi : *this) {\n+294 real_type const a = Impl::asVector(xi).infinity_norm();\n+295 norm = max(a, norm);\n+296 isNaN += a;\n+297 }\n+298 return norm * (isNaN / isNaN);\n+299 }\n+300\n+302 template ::value, int>::type = 0>\n+304 typename FieldTraits::real_type infinity_norm_real() const {\n+305 using real_type = typename FieldTraits::real_type;\n+306 using std::max;\n+307\n+308 real_type norm = 0;\n+309 real_type isNaN = 1;\n+310\n+311 for (auto const &xi : *this) {\n+312 real_type const a = Impl::asVector(xi).infinity_norm_real();\n+313 norm = max(a, norm);\n+314 isNaN += a;\n+315 }\n+316\n+317 return norm * (isNaN / isNaN);\n+318 }\n 319\n-_\b3_\b4_\b0 _\bI_\bt_\be_\br_\ba_\bt_\bi_\bv_\be_\bS_\bo_\bl_\bv_\be_\br (std::shared_ptr> op,\n-341 std::shared_ptr> sp,\n-342 std::shared_ptr<_\bP_\br_\be_\bc_\bo_\bn_\bd_\bi_\bt_\bi_\bo_\bn_\be_\br_\b<_\bX_\b,_\bY_\b>> prec,\n-343 _\bs_\bc_\ba_\bl_\ba_\br_\b__\br_\be_\ba_\bl_\b__\bt_\by_\bp_\be reduction, int maxit, int verbose) :\n-344 _\b__\bo_\bp(op),\n-345 _\b__\bp_\br_\be_\bc(prec),\n-346 _\b__\bs_\bp(sp),\n-347 _\b__\br_\be_\bd_\bu_\bc_\bt_\bi_\bo_\bn(reduction), _\b__\bm_\ba_\bx_\bi_\bt(maxit), _\b__\bv_\be_\br_\bb_\bo_\bs_\be(verbose),\n-348 _\b__\bc_\ba_\bt_\be_\bg_\bo_\br_\by(_\bS_\bo_\bl_\bv_\be_\br_\bC_\ba_\bt_\be_\bg_\bo_\br_\by::_\bc_\ba_\bt_\be_\bg_\bo_\br_\by(*op))\n-349 {\n-350 if(_\bS_\bo_\bl_\bv_\be_\br_\bC_\ba_\bt_\be_\bg_\bo_\br_\by_\b:_\b:_\bc_\ba_\bt_\be_\bg_\bo_\br_\by(*op) != _\bS_\bo_\bl_\bv_\be_\br_\bC_\ba_\bt_\be_\bg_\bo_\br_\by_\b:_\b:_\bc_\ba_\bt_\be_\bg_\bo_\br_\by(*prec))\n-351 DUNE_THROW(_\bI_\bn_\bv_\ba_\bl_\bi_\bd_\bS_\bo_\bl_\bv_\be_\br_\bC_\ba_\bt_\be_\bg_\bo_\br_\by, \"LinearOperator and Preconditioner must\n-have the same SolverCategory!\");\n-352 if(_\bS_\bo_\bl_\bv_\be_\br_\bC_\ba_\bt_\be_\bg_\bo_\br_\by_\b:_\b:_\bc_\ba_\bt_\be_\bg_\bo_\br_\by(*op) != _\bS_\bo_\bl_\bv_\be_\br_\bC_\ba_\bt_\be_\bg_\bo_\br_\by_\b:_\b:_\bc_\ba_\bt_\be_\bg_\bo_\br_\by(*sp))\n-353 DUNE_THROW(_\bI_\bn_\bv_\ba_\bl_\bi_\bd_\bS_\bo_\bl_\bv_\be_\br_\bC_\ba_\bt_\be_\bg_\bo_\br_\by, \"LinearOperator and ScalarProduct must\n-have the same SolverCategory!\");\n-354 }\n-355\n-356 // #warning actually we want to have this as the default and just implement\n-the second one\n-357 // //! \\copydoc InverseOperator::apply(X&,Y&,InverseOperatorResult&)\n-358 // virtual void apply (X& x, Y& b, InverseOperatorResult& res)\n-359 // {\n-360 // apply(x,b,_reduction,res);\n-361 // }\n-362\n-363#ifndef DOXYGEN\n-364 // make sure the three-argument apply from the base class does not get\n-shadowed\n-365 // by the redefined four-argument version below\n-366 using _\bI_\bn_\bv_\be_\br_\bs_\be_\bO_\bp_\be_\br_\ba_\bt_\bo_\br_\b:_\b:_\ba_\bp_\bp_\bl_\by;\n-367#endif\n-368\n-_\b3_\b7_\b4 virtual void _\ba_\bp_\bp_\bl_\by (X& x, X& b, double reduction, _\bI_\bn_\bv_\be_\br_\bs_\be_\bO_\bp_\be_\br_\ba_\bt_\bo_\br_\bR_\be_\bs_\bu_\bl_\bt&\n-res)\n-375 {\n-376 _\bs_\bc_\ba_\bl_\ba_\br_\b__\br_\be_\ba_\bl_\b__\bt_\by_\bp_\be saved_reduction = _\b__\br_\be_\bd_\bu_\bc_\bt_\bi_\bo_\bn;\n-377 _\b__\br_\be_\bd_\bu_\bc_\bt_\bi_\bo_\bn = reduction;\n-378 this->_\ba_\bp_\bp_\bl_\by(x,b,res);\n-379 _\b__\br_\be_\bd_\bu_\bc_\bt_\bi_\bo_\bn = saved_reduction;\n-380 }\n-381\n-_\b3_\b8_\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-384 {\n-385 return _\b__\bc_\ba_\bt_\be_\bg_\bo_\br_\by;\n-386 }\n-387\n-_\b3_\b8_\b8 std::string _\bn_\ba_\bm_\be() const{\n-389 std::string _\bn_\ba_\bm_\be = className(*this);\n-390 return _\bn_\ba_\bm_\be.substr(0, _\bn_\ba_\bm_\be.find(\"<\"));\n-391 }\n-392\n-410 template\n-_\b4_\b1_\b1 class _\bI_\bt_\be_\br_\ba_\bt_\bi_\bo_\bn {\n-412 public:\n-_\b4_\b1_\b3 _\bI_\bt_\be_\br_\ba_\bt_\bi_\bo_\bn(const _\bI_\bt_\be_\br_\ba_\bt_\bi_\bv_\be_\bS_\bo_\bl_\bv_\be_\br& parent, _\bI_\bn_\bv_\be_\br_\bs_\be_\bO_\bp_\be_\br_\ba_\bt_\bo_\br_\bR_\be_\bs_\bu_\bl_\bt& res)\n-414 : _\b__\bi(0)\n-415 , _\b__\br_\be_\bs(res)\n-416 , _\b__\bp_\ba_\br_\be_\bn_\bt(parent)\n-417 , _\b__\bv_\ba_\bl_\bi_\bd(true)\n-418 {\n-419 res._\bc_\bl_\be_\ba_\br();\n-420 if(_\b__\bp_\ba_\br_\be_\bn_\bt._\b__\bv_\be_\br_\bb_\bo_\bs_\be>0){\n-421 std::cout << \"=== \" << parent._\bn_\ba_\bm_\be() << std::endl;\n-422 if(_\b__\bp_\ba_\br_\be_\bn_\bt._\b__\bv_\be_\br_\bb_\bo_\bs_\be > 1)\n-423 _\b__\bp_\ba_\br_\be_\bn_\bt._\bp_\br_\bi_\bn_\bt_\bH_\be_\ba_\bd_\be_\br(std::cout);\n-424 }\n-425 }\n-426\n-_\b4_\b2_\b7 _\bI_\bt_\be_\br_\ba_\bt_\bi_\bo_\bn(const _\bI_\bt_\be_\br_\ba_\bt_\bi_\bo_\bn&) = delete;\n-_\b4_\b2_\b8 _\bI_\bt_\be_\br_\ba_\bt_\bi_\bo_\bn(_\bI_\bt_\be_\br_\ba_\bt_\bi_\bo_\bn&& other)\n-429 : _\b__\bd_\be_\bf_\b0(other._\b__\bd_\be_\bf_\b0)\n-430 , _\b__\bd_\be_\bf(other._\b__\bd_\be_\bf)\n-431 , _\b__\bi(other._\b__\bi)\n-432 , _\b__\bw_\ba_\bt_\bc_\bh(other._\b__\bw_\ba_\bt_\bc_\bh)\n-433 , _\b__\br_\be_\bs(other._\b__\br_\be_\bs)\n-434 , _\b__\bp_\ba_\br_\be_\bn_\bt(other._\b__\bp_\ba_\br_\be_\bn_\bt)\n-435 , _\b__\bv_\ba_\bl_\bi_\bd(other._\b__\bv_\ba_\bl_\bi_\bd)\n-436 {\n-437 other._valid = false;\n-438 }\n-439\n-_\b4_\b4_\b0 _\b~_\bI_\bt_\be_\br_\ba_\bt_\bi_\bo_\bn(){\n-441 if(_\b__\bv_\ba_\bl_\bi_\bd)\n-442 _\bf_\bi_\bn_\ba_\bl_\bi_\bz_\be();\n-443 }\n-444\n-_\b4_\b5_\b5 bool _\bs_\bt_\be_\bp(CountType i, _\br_\be_\ba_\bl_\b__\bt_\by_\bp_\be def){\n-456 if (!Simd::allTrue(isFinite(def))) // check for inf or NaN\n-457 {\n-458 if (_\b__\bp_\ba_\br_\be_\bn_\bt._\b__\bv_\be_\br_\bb_\bo_\bs_\be>0)\n-459 std::cout << \"=== \" << _\b__\bp_\ba_\br_\be_\bn_\bt._\bn_\ba_\bm_\be() << \": abort due to infinite or NaN\n-defect\"\n-460 << std::endl;\n-461 DUNE_THROW(_\bS_\bo_\bl_\bv_\be_\br_\bA_\bb_\bo_\br_\bt,\n-462 _\b__\bp_\ba_\br_\be_\bn_\bt._\bn_\ba_\bm_\be() << \": defect=\" << Simd::io(def)\n-463 << \" is infinite or NaN\");\n-464 }\n-465 if(i == 0)\n-466 _\b__\bd_\be_\bf_\b0 = def;\n-467 if(_\b__\bp_\ba_\br_\be_\bn_\bt._\b__\bv_\be_\br_\bb_\bo_\bs_\be > 1){\n-468 if(i!=0)\n-469 _\b__\bp_\ba_\br_\be_\bn_\bt._\bp_\br_\bi_\bn_\bt_\bO_\bu_\bt_\bp_\bu_\bt(std::cout,i,def,_\b__\bd_\be_\bf);\n-470 else\n-471 _\b__\bp_\ba_\br_\be_\bn_\bt._\bp_\br_\bi_\bn_\bt_\bO_\bu_\bt_\bp_\bu_\bt(std::cout,i,def);\n-472 }\n-473 _\b__\bd_\be_\bf = def;\n-474 _\b__\bi = i;\n-475 _\b__\br_\be_\bs._\bc_\bo_\bn_\bv_\be_\br_\bg_\be_\bd = (Simd::allTrue(def<_\b__\bd_\be_\bf_\b0*_\b__\bp_\ba_\br_\be_\bn_\bt._\b__\br_\be_\bd_\bu_\bc_\bt_\bi_\bo_\bn ||\n-def<_\br_\be_\ba_\bl_\b__\bt_\by_\bp_\be(1E-30))); // convergence check\n-476 return _\b__\br_\be_\bs._\bc_\bo_\bn_\bv_\be_\br_\bg_\be_\bd;\n-477 }\n-478\n-479 protected:\n-_\b4_\b8_\b0 void _\bf_\bi_\bn_\ba_\bl_\bi_\bz_\be(){\n-481 _\b__\br_\be_\bs._\bc_\bo_\bn_\bv_\be_\br_\bg_\be_\bd = (Simd::allTrue(_\b__\bd_\be_\bf<_\b__\bd_\be_\bf_\b0*_\b__\bp_\ba_\br_\be_\bn_\bt._\b__\br_\be_\bd_\bu_\bc_\bt_\bi_\bo_\bn ||\n-_\b__\bd_\be_\bf<_\br_\be_\ba_\bl_\b__\bt_\by_\bp_\be(1E-30)));\n-482 _\b__\br_\be_\bs._\bi_\bt_\be_\br_\ba_\bt_\bi_\bo_\bn_\bs = _\b__\bi;\n-483 _\b__\br_\be_\bs._\br_\be_\bd_\bu_\bc_\bt_\bi_\bo_\bn = static_cast(Simd::max(_\b__\bd_\be_\bf/_\b__\bd_\be_\bf_\b0));\n-484 _\b__\br_\be_\bs._\bc_\bo_\bn_\bv_\b__\br_\ba_\bt_\be = pow(_\b__\br_\be_\bs._\br_\be_\bd_\bu_\bc_\bt_\bi_\bo_\bn,1.0/_\b__\bi);\n-485 _\b__\br_\be_\bs._\be_\bl_\ba_\bp_\bs_\be_\bd = _\b__\bw_\ba_\bt_\bc_\bh.elapsed();\n-486 if (_\b__\bp_\ba_\br_\be_\bn_\bt._\b__\bv_\be_\br_\bb_\bo_\bs_\be>0) // final print\n-487 {\n-488 std::cout << \"=== rate=\" << _\b__\br_\be_\bs._\bc_\bo_\bn_\bv_\b__\br_\ba_\bt_\be\n-489 << \", T=\" << _\b__\br_\be_\bs._\be_\bl_\ba_\bp_\bs_\be_\bd\n-490 << \", TIT=\" << _\b__\br_\be_\bs._\be_\bl_\ba_\bp_\bs_\be_\bd/_\b__\br_\be_\bs._\bi_\bt_\be_\br_\ba_\bt_\bi_\bo_\bn_\bs\n-491 << \", IT=\" << _\b__\br_\be_\bs._\bi_\bt_\be_\br_\ba_\bt_\bi_\bo_\bn_\bs << std::endl;\n-492 }\n-493 }\n-494\n-_\b4_\b9_\b5 _\br_\be_\ba_\bl_\b__\bt_\by_\bp_\be _\b__\bd_\be_\bf_\b0 = 0.0, _\b__\bd_\be_\bf = 0.0;\n-_\b4_\b9_\b6 CountType _\b__\bi;\n-_\b4_\b9_\b7 Timer _\b__\bw_\ba_\bt_\bc_\bh;\n-_\b4_\b9_\b8 _\bI_\bn_\bv_\be_\br_\bs_\be_\bO_\bp_\be_\br_\ba_\bt_\bo_\br_\bR_\be_\bs_\bu_\bl_\bt& _\b__\br_\be_\bs;\n-_\b4_\b9_\b9 const _\bI_\bt_\be_\br_\ba_\bt_\bi_\bv_\be_\bS_\bo_\bl_\bv_\be_\br& _\b__\bp_\ba_\br_\be_\bn_\bt;\n-_\b5_\b0_\b0 bool _\b__\bv_\ba_\bl_\bi_\bd;\n-501 };\n-502\n-503 protected:\n-_\b5_\b0_\b4 std::shared_ptr> _\b__\bo_\bp;\n-_\b5_\b0_\b5 std::shared_ptr> _\b__\bp_\br_\be_\bc;\n-_\b5_\b0_\b6 std::shared_ptr> _\b__\bs_\bp;\n-_\b5_\b0_\b7 _\bs_\bc_\ba_\bl_\ba_\br_\b__\br_\be_\ba_\bl_\b__\bt_\by_\bp_\be _\b__\br_\be_\bd_\bu_\bc_\bt_\bi_\bo_\bn;\n-_\b5_\b0_\b8 int _\b__\bm_\ba_\bx_\bi_\bt;\n-_\b5_\b0_\b9 int _\b__\bv_\be_\br_\bb_\bo_\bs_\be;\n-_\b5_\b1_\b0 _\bS_\bo_\bl_\bv_\be_\br_\bC_\ba_\bt_\be_\bg_\bo_\br_\by_\b:_\b:_\bC_\ba_\bt_\be_\bg_\bo_\br_\by _\b__\bc_\ba_\bt_\be_\bg_\bo_\br_\by;\n-511 };\n-512\n-520 template \n-_\b5_\b2_\b1 class _\bS_\bo_\bl_\bv_\be_\br_\bH_\be_\bl_\bp_\be_\br\n-522 {\n-523 public:\n-_\b5_\b2_\b4 static void _\bs_\be_\bt_\bM_\ba_\bt_\br_\bi_\bx (ISTLLinearSolver& solver,\n-525 const _\bB_\bC_\bR_\bS_\bM_\ba_\bt_\br_\bi_\bx& matrix)\n-526 {\n-527 static const bool is_direct_solver\n-528 = _\bD_\bu_\bn_\be_\b:_\b:_\bI_\bs_\bD_\bi_\br_\be_\bc_\bt_\bS_\bo_\bl_\bv_\be_\br_\b<_\bI_\bS_\bT_\bL_\bL_\bi_\bn_\be_\ba_\br_\bS_\bo_\bl_\bv_\be_\br_\b>_\b:_\b:_\bv_\ba_\bl_\bu_\be;\n-529 _\bS_\bo_\bl_\bv_\be_\br_\bH_\be_\bl_\bp_\be_\br_\b<_\bI_\bS_\bT_\bL_\bL_\bi_\bn_\be_\ba_\br_\bS_\bo_\bl_\bv_\be_\br_\b,_\bB_\bC_\bR_\bS_\bM_\ba_\bt_\br_\bi_\bx_\b>_\b:_\b:\n-530_\b _\bI_\bm_\bp_\bl_\be_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b<_\bi_\bs_\b__\bd_\bi_\br_\be_\bc_\bt_\b__\bs_\bo_\bl_\bv_\be_\br_\b>_\b:_\b:_\bs_\be_\bt_\bM_\ba_\bt_\br_\bi_\bx(solver,matrix);\n-531 }\n-532\n-533 protected:\n-538 template \n-_\b5_\b3_\b9 struct _\bI_\bm_\bp_\bl_\be_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn\n-540 {\n-_\b5_\b4_\b1 static void _\bs_\be_\bt_\bM_\ba_\bt_\br_\bi_\bx (ISTLLinearSolver&,\n-542 const _\bB_\bC_\bR_\bS_\bM_\ba_\bt_\br_\bi_\bx&)\n-543 {}\n-544 };\n-545\n-550 template \n-_\b5_\b5_\b1 struct _\bI_\bm_\bp_\bl_\be_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn\n-552 {\n-_\b5_\b5_\b3 static void _\bs_\be_\bt_\bM_\ba_\bt_\br_\bi_\bx (ISTLLinearSolver& solver,\n-554 const _\bB_\bC_\bR_\bS_\bM_\ba_\bt_\br_\bi_\bx& matrix)\n-555 {\n-556 solver.setMatrix(matrix);\n-557 }\n-558 };\n-559 };\n-560\n-564}\n-565\n-566#endif\n-_\bs_\bo_\bl_\bv_\be_\br_\bt_\by_\bp_\be_\b._\bh_\bh\n-Templates characterizing the type of a solver.\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-_\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_\b._\bh_\bh\n+320 //===== sizes\n+321\n+323 size_type N () const\n+324 {\n+325 return this->n;\n+326 }\n+327\n+329 size_type dim () const\n+330 {\n+331 size_type d=0;\n+332\n+333 for (size_type i=0; in; i++)\n+334 d += Impl::asVector((*this)[i]).dim();\n+335\n+336 return d;\n+337 }\n+338\n+339 protected:\n+341 block_vector_unmanaged () : base_array_unmanaged()\n+342 { }\n+343 };\n+344\n+346\n+351 template\n+352 class ScopeGuard {\n+353 F cleanupFunc_;\n+354 public:\n+355 ScopeGuard(F cleanupFunc) : cleanupFunc_(_\bs_\bt_\bd::move(cleanupFunc)) {}\n+356 ScopeGuard(const ScopeGuard &) = delete;\n+357 ScopeGuard(ScopeGuard &&) = delete;\n+358 ScopeGuard &operator=(ScopeGuard) = delete;\n+359 ~ScopeGuard() { cleanupFunc_(); }\n+360 };\n+361\n+363\n+372 template\n+373 ScopeGuard makeScopeGuard(F cleanupFunc)\n+374 {\n+375 return { std::move(cleanupFunc) };\n+376 }\n+377\n+378} // end namespace Imp\n+393 template >\n+_\b3_\b9_\b4 class _\bB_\bl_\bo_\bc_\bk_\bV_\be_\bc_\bt_\bo_\br : public Imp::block_vector_unmanaged\n+395 {\n+396 public:\n+397\n+398 //===== type definitions and constants\n+399\n+_\b4_\b0_\b1 using _\bf_\bi_\be_\bl_\bd_\b__\bt_\by_\bp_\be = typename Imp::BlockTraits::field_type;\n+402\n+_\b4_\b0_\b4 typedef B _\bb_\bl_\bo_\bc_\bk_\b__\bt_\by_\bp_\be;\n+405\n+_\b4_\b0_\b7 typedef A _\ba_\bl_\bl_\bo_\bc_\ba_\bt_\bo_\br_\b__\bt_\by_\bp_\be;\n+408\n+_\b4_\b1_\b0 typedef typename A::size_type _\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be;\n+411\n+413 [[deprecated(\"Use free function blockLevel(). Will be removed after\n+2.8.\")]]\n+_\b4_\b1_\b4 static constexpr unsigned int _\bb_\bl_\bo_\bc_\bk_\bl_\be_\bv_\be_\bl = blockLevel()+1;\n+415\n+_\b4_\b1_\b7 typedef typename Imp::block_vector_unmanaged::Iterator _\bI_\bt_\be_\br_\ba_\bt_\bo_\br;\n+418\n+_\b4_\b2_\b0 typedef typename Imp::block_vector_unmanaged::ConstIterator\n+_\bC_\bo_\bn_\bs_\bt_\bI_\bt_\be_\br_\ba_\bt_\bo_\br;\n+421\n+422 //===== constructors and such\n+423\n+_\b4_\b2_\b5 _\bB_\bl_\bo_\bc_\bk_\bV_\be_\bc_\bt_\bo_\br ()\n+426 {\n+427 syncBaseArray();\n+428 }\n+429\n+_\b4_\b3_\b1 explicit _\bB_\bl_\bo_\bc_\bk_\bV_\be_\bc_\bt_\bo_\br (_\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be _n) : storage_(_n)\n+432 {\n+433 syncBaseArray();\n+434 }\n+435\n+_\b4_\b3_\b7 _\bB_\bl_\bo_\bc_\bk_\bV_\be_\bc_\bt_\bo_\br (std::initializer_list const &l) : storage_(l)\n+438 {\n+439 syncBaseArray();\n+440 }\n+441\n+442\n+454 template\n+_\b4_\b5_\b5 _\bB_\bl_\bo_\bc_\bk_\bV_\be_\bc_\bt_\bo_\br (_\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be _n, S _capacity)\n+456 {\n+457 static_assert(std::numeric_limits::is_integer,\n+458 \"capacity must be an unsigned integral type (be aware, that this\n+constructor does not set the default value!)\" );\n+459 if((_\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be)_capacity > _n)\n+460 storage_.reserve(_capacity);\n+461 storage_.resize(_n);\n+462 syncBaseArray();\n+463 }\n+464\n+465\n+_\b4_\b7_\b5 void _\br_\be_\bs_\be_\br_\bv_\be(_\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be _\bc_\ba_\bp_\ba_\bc_\bi_\bt_\by)\n+476 {\n+477 [[maybe_unused]] const auto &guard =\n+478 Imp::makeScopeGuard([this]{ syncBaseArray(); });\n+479 storage_.reserve(_\bc_\ba_\bp_\ba_\bc_\bi_\bt_\by);\n+480 }\n+481\n+_\b4_\b8_\b8 _\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be _\bc_\ba_\bp_\ba_\bc_\bi_\bt_\by() const\n+489 {\n+490 return storage_.capacity();\n+491 }\n+492\n+_\b5_\b0_\b3 void _\br_\be_\bs_\bi_\bz_\be(_\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be size)\n+504 {\n+505 [[maybe_unused]] const auto &guard =\n+506 Imp::makeScopeGuard([this]{ syncBaseArray(); });\n+507 storage_.resize(size);\n+508 }\n+509\n+_\b5_\b1_\b1 _\bB_\bl_\bo_\bc_\bk_\bV_\be_\bc_\bt_\bo_\br(const _\bB_\bl_\bo_\bc_\bk_\bV_\be_\bc_\bt_\bo_\br &a)\n+512 noexcept(noexcept(std::declval().storage_ = a.storage_))\n+513 {\n+514 storage_ = a.storage_;\n+515 syncBaseArray();\n+516 }\n+517\n+_\b5_\b1_\b9 _\bB_\bl_\bo_\bc_\bk_\bV_\be_\bc_\bt_\bo_\br(_\bB_\bl_\bo_\bc_\bk_\bV_\be_\bc_\bt_\bo_\br &&a)\n+520 noexcept(noexcept(std::declval().swap(a)))\n+521 {\n+522 _\bs_\bw_\ba_\bp(a);\n+523 }\n+524\n+_\b5_\b2_\b6 _\bB_\bl_\bo_\bc_\bk_\bV_\be_\bc_\bt_\bo_\br& _\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b=_\b (const _\bB_\bl_\bo_\bc_\bk_\bV_\be_\bc_\bt_\bo_\br& a)\n+527 noexcept(noexcept(std::declval().storage_ = a.storage_))\n+528 {\n+529 [[maybe_unused]] const auto &guard =\n+530 Imp::makeScopeGuard([this]{ syncBaseArray(); });\n+531 storage_ = a.storage_;\n+532 return *this;\n+533 }\n+534\n+_\b5_\b3_\b6 _\bB_\bl_\bo_\bc_\bk_\bV_\be_\bc_\bt_\bo_\br& _\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b=_\b (_\bB_\bl_\bo_\bc_\bk_\bV_\be_\bc_\bt_\bo_\br&& a)\n+537 noexcept(noexcept(std::declval().swap(a)))\n+538 {\n+539 _\bs_\bw_\ba_\bp(a);\n+540 return *this;\n+541 }\n+542\n+_\b5_\b4_\b4 void _\bs_\bw_\ba_\bp(_\bB_\bl_\bo_\bc_\bk_\bV_\be_\bc_\bt_\bo_\br &other)\n+545 noexcept(noexcept(\n+546 std::declval().storage_.swap(other.storage_)))\n+547 {\n+548 [[maybe_unused]] const auto &guard = Imp::makeScopeGuard([&]{\n+549 syncBaseArray();\n+550 other.syncBaseArray();\n+551 });\n+552 storage_.swap(other.storage_);\n+553 }\n+554\n+_\b5_\b5_\b6 _\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+557 {\n+558 // forward to operator= in base class\n+559 (static_cast&>(*this)) = k;\n+560 return *this;\n+561 }\n+562\n+563 private:\n+564 void syncBaseArray() noexcept\n+565 {\n+566 this->p = storage_.data();\n+567 this->n = storage_.size();\n+568 }\n+569\n+570 std::vector storage_;\n+571 };\n+572\n+578 template\n+_\b5_\b7_\b9 struct FieldTraits< _\bB_\bl_\bo_\bc_\bk_\bV_\be_\bc_\bt_\bo_\br >\n+580 {\n+_\b5_\b8_\b1 typedef typename FieldTraits::field_type _\bf_\bi_\be_\bl_\bd_\b__\bt_\by_\bp_\be;\n+_\b5_\b8_\b2 typedef typename FieldTraits::real_type _\br_\be_\ba_\bl_\b__\bt_\by_\bp_\be;\n+583 };\n+589 template\n+_\b5_\b9_\b0 std::ostream& _\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b<_\b<_\b (std::ostream& s, const _\bB_\bl_\bo_\bc_\bk_\bV_\be_\bc_\bt_\bo_\br_\b<_\bK_\b,_\b _\bA_\b>& v)\n+591 {\n+592 typedef typename _\bB_\bl_\bo_\bc_\bk_\bV_\be_\bc_\bt_\bo_\br_\b<_\bK_\b,_\b _\bA_\b>_\b:_\b:_\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be size_type;\n+593\n+594 for (size_type i=0; i\n+623#else\n+624 template >\n+625#endif\n+626 class BlockVectorWindow : public Imp::block_vector_unmanaged\n+627 {\n+628 public:\n+629\n+630 //===== type definitions and constants\n+631\n+633 using field_type = typename Imp::BlockTraits::field_type;\n+634\n+636 typedef B block_type;\n+637\n+639 typedef A allocator_type;\n+640\n+642 typedef typename A::size_type size_type;\n+643\n+645 [[deprecated(\"Use free function blockLevel(). Will be removed after\n+2.8.\")]]\n+646 static constexpr unsigned int blocklevel = blockLevel()+1;\n+647\n+649 typedef typename Imp::block_vector_unmanaged::Iterator Iterator;\n+650\n+652 typedef typename Imp::block_vector_unmanaged::ConstIterator\n+ConstIterator;\n+653\n+654\n+655 //===== constructors and such\n+657 BlockVectorWindow () : Imp::block_vector_unmanaged()\n+658 { }\n+659\n+661 BlockVectorWindow (B* _p, size_type _n)\n+662 {\n+663 this->n = _n;\n+664 this->p = _p;\n+665 }\n+666\n+668 BlockVectorWindow (const BlockVectorWindow& a)\n+669 {\n+670 this->n = a.n;\n+671 this->p = a.p;\n+672 }\n+673\n+675 BlockVectorWindow& operator= (const BlockVectorWindow& a)\n+676 {\n+677 // check correct size\n+678#ifdef DUNE_ISTL_WITH_CHECKING\n+679 if (this->n!=a.N()) DUNE_THROW(ISTLError,\"vector size mismatch\");\n+680#endif\n+681\n+682 if (&a!=this) // check if this and a are different objects\n+683 {\n+684 // copy data\n+685 for (size_type i=0; in; i++) this->p[i]=a.p[i];\n+686 }\n+687 return *this;\n+688 }\n+689\n+691 BlockVectorWindow& operator= (const field_type& k)\n+692 {\n+693 (static_cast&>(*this)) = k;\n+694 return *this;\n+695 }\n+696\n+698 operator BlockVector() const {\n+699 auto bv = BlockVector(this->n);\n+700\n+701 std::copy(this->begin(), this->end(), bv.begin());\n+702\n+703 return bv;\n+704 }\n+705\n+706 //===== window manipulation methods\n+707\n+709 void set (size_type _n, B* _p)\n+710 {\n+711 this->n = _n;\n+712 this->p = _p;\n+713 }\n+714\n+716 void setsize (size_type _n)\n+717 {\n+718 this->n = _n;\n+719 }\n+720\n+722 void setptr (B* _p)\n+723 {\n+724 this->p = _p;\n+725 }\n+726\n+728 B* getptr ()\n+729 {\n+730 return this->p;\n+731 }\n+732\n+734 size_type getsize () const\n+735 {\n+736 return this->n;\n+737 }\n+738 };\n+739\n+740\n+741\n+752 template >\n+753 class compressed_block_vector_unmanaged : public\n+compressed_base_array_unmanaged\n+754 {\n+755 public:\n+756\n+757 //===== type definitions and constants\n+758\n+760 using field_type = typename Imp::BlockTraits::field_type;\n+761\n+763 typedef B block_type;\n+764\n+766 typedef A allocator_type;\n+767\n+769 typedef typename compressed_base_array_unmanaged::iterator Iterator;\n+770\n+772 typedef typename compressed_base_array_unmanaged::const_iterator\n+ConstIterator;\n+773\n+775 typedef typename A::size_type size_type;\n+776\n+777 //===== assignment from scalar\n+778\n+779 compressed_block_vector_unmanaged& operator= (const field_type& k)\n+780 {\n+781 for (size_type i=0; in; i++)\n+782 (this->p)[i] = k;\n+783 return *this;\n+784 }\n+785\n+786\n+787 //===== vector space arithmetic\n+788\n+790 template\n+791 compressed_block_vector_unmanaged& operator+= (const V& y)\n+792 {\n+793#ifdef DUNE_ISTL_WITH_CHECKING\n+794 if (!includesindexset(y)) DUNE_THROW(ISTLError,\"index set mismatch\");\n+795#endif\n+796 for (size_type i=0; ioperator[](y.j[i]) += y.p[i];\n+797 return *this;\n+798 }\n+799\n+801 template\n+802 compressed_block_vector_unmanaged& operator-= (const V& y)\n+803 {\n+804#ifdef DUNE_ISTL_WITH_CHECKING\n+805 if (!includesindexset(y)) DUNE_THROW(ISTLError,\"index set mismatch\");\n+806#endif\n+807 for (size_type i=0; ioperator[](y.j[i]) -= y.p[i];\n+808 return *this;\n+809 }\n+810\n+812 template\n+813 compressed_block_vector_unmanaged& axpy (const field_type& a, const V& y)\n+814 {\n+815#ifdef DUNE_ISTL_WITH_CHECKING\n+816 if (!includesindexset(y)) DUNE_THROW(ISTLError,\"index set mismatch\");\n+817#endif\n+818 for (size_type i=0; in; ++i) (this->p)[i] *= k;\n+827 return *this;\n+828 }\n+829\n+831 compressed_block_vector_unmanaged& operator/= (const field_type& k)\n+832 {\n+833 for (size_type i=0; in; ++i) (this->p)[i] /= k;\n+834 return *this;\n+835 }\n+836\n+837\n+838 //===== Euclidean scalar product\n+839\n+841 field_type operator* (const compressed_block_vector_unmanaged& y) const\n+842 {\n+843#ifdef DUNE_ISTL_WITH_CHECKING\n+844 if (!includesindexset(y) || !y.includesindexset(*this) )\n+845 DUNE_THROW(ISTLError,\"index set mismatch\");\n+846#endif\n+847 field_type sum=0;\n+848 for (size_type i=0; in; ++i)\n+849 sum += (this->p)[i] * y[(this->j)[i]];\n+850 return sum;\n+851 }\n+852\n+853\n+854 //===== norms\n+855\n+857 typename FieldTraits::real_type one_norm () const\n+858 {\n+859 typename FieldTraits::real_type sum=0;\n+860 for (size_type i=0; in; ++i) sum += (this->p)[i].one_norm();\n+861 return sum;\n+862 }\n+863\n+865 typename FieldTraits::real_type one_norm_real () const\n+866 {\n+867 typename FieldTraits::real_type sum=0;\n+868 for (size_type i=0; in; ++i) sum += (this->p)[i].one_norm_real();\n+869 return sum;\n+870 }\n+871\n+873 typename FieldTraits::real_type two_norm () const\n+874 {\n+875 using std::sqrt;\n+876 typename FieldTraits::real_type sum=0;\n+877 for (size_type i=0; in; ++i) sum += (this->p)[i].two_norm2();\n+878 return sqrt(sum);\n+879 }\n+880\n+882 typename FieldTraits::real_type two_norm2 () const\n+883 {\n+884 typename FieldTraits::real_type sum=0;\n+885 for (size_type i=0; in; ++i) sum += (this->p)[i].two_norm2();\n+886 return sum;\n+887 }\n+888\n+890 template ::value, int>::type = 0>\n+892 typename FieldTraits::real_type infinity_norm() const {\n+893 using real_type = typename FieldTraits::real_type;\n+894 using std::max;\n+895\n+896 real_type norm = 0;\n+897 for (auto const &x : *this) {\n+898 real_type const a = x.infinity_norm();\n+899 norm = max(a, norm);\n+900 }\n+901 return norm;\n+902 }\n+903\n+905 template ::value, int>::type = 0>\n+907 typename FieldTraits::real_type infinity_norm_real() const {\n+908 using real_type = typename FieldTraits::real_type;\n+909 using std::max;\n+910\n+911 real_type norm = 0;\n+912 for (auto const &x : *this) {\n+913 real_type const a = x.infinity_norm_real();\n+914 norm = max(a, norm);\n+915 }\n+916 return norm;\n+917 }\n+918\n+920 template ::value, int>::type = 0>\n+922 typename FieldTraits::real_type infinity_norm() const {\n+923 using real_type = typename FieldTraits::real_type;\n+924 using std::max;\n+925\n+926 real_type norm = 0;\n+927 real_type isNaN = 1;\n+928 for (auto const &x : *this) {\n+929 real_type const a = x.infinity_norm();\n+930 norm = max(a, norm);\n+931 isNaN += a;\n+932 }\n+933 return norm * (isNaN / isNaN);\n+934 }\n+935\n+937 template ::value, int>::type = 0>\n+939 typename FieldTraits::real_type infinity_norm_real() const {\n+940 using real_type = typename FieldTraits::real_type;\n+941 using std::max;\n+942\n+943 real_type norm = 0;\n+944 real_type isNaN = 1;\n+945 for (auto const &x : *this) {\n+946 real_type const a = x.infinity_norm_real();\n+947 norm = max(a, norm);\n+948 isNaN += a;\n+949 }\n+950 return norm * (isNaN / isNaN);\n+951 }\n+952\n+953 //===== sizes\n+954\n+956 size_type N () const\n+957 {\n+958 return this->n;\n+959 }\n+960\n+962 size_type dim () const\n+963 {\n+964 size_type d=0;\n+965 for (size_type i=0; in; i++)\n+966 d += (this->p)[i].dim();\n+967 return d;\n+968 }\n+969\n+970 protected:\n+972 compressed_block_vector_unmanaged () : compressed_base_array_unmanaged\n+()\n+973 { }\n+974\n+976 template\n+977 bool includesindexset (const V& y)\n+978 {\n+979 typename V::ConstIterator e=this->end();\n+980 for (size_type i=0; ifind(y.j[i])==e)\n+982 return false;\n+983 return true;\n+984 }\n+985 };\n+986\n+987\n+1006 template >\n+1007 class CompressedBlockVectorWindow : public\n+compressed_block_vector_unmanaged\n+1008 {\n+1009 public:\n+1010\n+1011 //===== type definitions and constants\n+1012\n+1014 using field_type = typename Imp::BlockTraits::field_type;\n+1015\n+1017 typedef B block_type;\n+1018\n+1020 typedef A allocator_type;\n+1021\n+1023 typedef typename A::size_type size_type;\n+1024\n+1026 [[deprecated(\"Use free function blockLevel(). Will be removed after\n+2.8.\")]]\n+1027 static constexpr unsigned int blocklevel = blockLevel()+1;\n+1028\n+1030 typedef typename compressed_block_vector_unmanaged::Iterator\n+Iterator;\n+1031\n+1033 typedef typename compressed_block_vector_unmanaged::ConstIterator\n+ConstIterator;\n+1034\n+1035\n+1036 //===== constructors and such\n+1038 CompressedBlockVectorWindow () : compressed_block_vector_unmanaged()\n+1039 { }\n+1040\n+1042 CompressedBlockVectorWindow (B* _p, size_type* _j, size_type _n)\n+1043 {\n+1044 this->n = _n;\n+1045 this->p = _p;\n+1046 this->j = _j;\n+1047 }\n+1048\n+1050 CompressedBlockVectorWindow (const CompressedBlockVectorWindow& a)\n+1051 {\n+1052 this->n = a.n;\n+1053 this->p = a.p;\n+1054 this->j = a.j;\n+1055 }\n+1056\n+1058 CompressedBlockVectorWindow& operator= (const CompressedBlockVectorWindow&\n+a)\n+1059 {\n+1060 // check correct size\n+1061#ifdef DUNE_ISTL_WITH_CHECKING\n+1062 if (this->n!=a.N()) DUNE_THROW(ISTLError,\"vector size mismatch\");\n+1063#endif\n+1064\n+1065 if (&a!=this) // check if this and a are different objects\n+1066 {\n+1067 // copy data\n+1068 for (size_type i=0; in; i++) this->p[i]=a.p[i];\n+1069 for (size_type i=0; in; i++) this->j[i]=a.j[i];\n+1070 }\n+1071 return *this;\n+1072 }\n+1073\n+1075 CompressedBlockVectorWindow& operator= (const field_type& k)\n+1076 {\n+1077 (static_cast&>(*this)) = k;\n+1078 return *this;\n+1079 }\n+1080\n+1081\n+1082 //===== window manipulation methods\n+1083\n+1085 void set (size_type _n, B* _p, size_type* _j)\n+1086 {\n+1087 this->n = _n;\n+1088 this->p = _p;\n+1089 this->j = _j;\n+1090 }\n+1091\n+1093 void setsize (size_type _n)\n+1094 {\n+1095 this->n = _n;\n+1096 }\n+1097\n+1099 void setptr (B* _p)\n+1100 {\n+1101 this->p = _p;\n+1102 }\n+1103\n+1105 void setindexptr (size_type* _j)\n+1106 {\n+1107 this->j = _j;\n+1108 }\n+1109\n+1111 B* getptr ()\n+1112 {\n+1113 return this->p;\n+1114 }\n+1115\n+1117 size_type* getindexptr ()\n+1118 {\n+1119 return this->j;\n+1120 }\n+1121\n+1123 const B* getptr () const\n+1124 {\n+1125 return this->p;\n+1126 }\n+1127\n+1129 const size_type* getindexptr () const\n+1130 {\n+1131 return this->j;\n+1132 }\n+1134 size_type getsize () const\n+1135 {\n+1136 return this->n;\n+1137 }\n+1138 };\n+1139\n+1140} // end namespace 'Imp'\n+1141\n+1142\n+1144 template\n+1145 struct AutonomousValueType>\n+1146 {\n+1147 using type = BlockVector;\n+1148 };\n+1149\n+1150\n+1151} // end namespace 'Dune'\n+1152\n+1153#endif\n+_\bi_\bs_\bt_\bl_\be_\bx_\bc_\be_\bp_\bt_\bi_\bo_\bn_\b._\bh_\bh\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+_\bb_\ba_\bs_\be_\ba_\br_\br_\ba_\by_\b._\bh_\bh\n+Implements several basic array containers.\n _\bs_\bt_\bd\n STL namespace.\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:_\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_\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:_\bS_\bo_\bl_\bv_\be_\br_\bA_\bb_\bo_\br_\bt\n-Thrown when a solver aborts due to some problem.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn istlexception.hh:46\n-_\bD_\bu_\bn_\be_\b:_\b:_\bL_\bi_\bn_\be_\ba_\br_\bO_\bp_\be_\br_\ba_\bt_\bo_\br\n-A linear operator.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn operators.hh:67\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:32\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bc_\ba_\bl_\ba_\br_\bP_\br_\bo_\bd_\bu_\bc_\bt\n-Base class for scalar product and norm computation.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn scalarproducts.hh:52\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\be_\bq_\bS_\bc_\ba_\bl_\ba_\br_\bP_\br_\bo_\bd_\bu_\bc_\bt\n-Default implementation for the scalar case.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn scalarproducts.hh:168\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:48\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_\b:_\b:_\bI_\bn_\bv_\be_\br_\bs_\be_\bO_\bp_\be_\br_\ba_\bt_\bo_\br_\bR_\be_\bs_\bu_\bl_\bt\n-InverseOperatorResult()\n-Default constructor.\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_\bR_\be_\bs_\bu_\bl_\bt_\b:_\b:_\bc_\bo_\bn_\bd_\bi_\bt_\bi_\bo_\bn_\b__\be_\bs_\bt_\bi_\bm_\ba_\bt_\be\n-double condition_estimate\n-Estimate of condition number.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn solver.hh:79\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_\b:_\b:_\be_\bl_\ba_\bp_\bs_\be_\bd\n-double elapsed\n-Elapsed time in seconds.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn solver.hh:82\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_\b:_\b:_\bi_\bt_\be_\br_\ba_\bt_\bi_\bo_\bn_\bs\n-int iterations\n-Number of iterations.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn solver.hh:67\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_\b:_\b:_\br_\be_\bd_\bu_\bc_\bt_\bi_\bo_\bn\n-double reduction\n-Reduction achieved: .\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn solver.hh:70\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_\b:_\b:_\bc_\bl_\be_\ba_\br\n-void clear()\n-Resets all data.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn solver.hh:56\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_\b:_\b:_\bc_\bo_\bn_\bv_\b__\br_\ba_\bt_\be\n-double conv_rate\n-Convergence rate (average reduction per step)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn solver.hh:76\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_\b:_\b:_\bc_\bo_\bn_\bv_\be_\br_\bg_\be_\bd\n-bool converged\n-True if convergence criterion has been met.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn solver.hh:73\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:99\n-_\bD_\bu_\bn_\be_\b:_\b:_\bI_\bn_\bv_\be_\br_\bs_\be_\bO_\bp_\be_\br_\ba_\bt_\bo_\br_\b:_\b:_\bp_\br_\bi_\bn_\bt_\bH_\be_\ba_\bd_\be_\br\n-void printHeader(std::ostream &s) const\n-helper function for printing header of solver output\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn solver.hh:163\n-_\bD_\bu_\bn_\be_\b:_\b:_\bI_\bn_\bv_\be_\br_\bs_\be_\bO_\bp_\be_\br_\ba_\bt_\bo_\br_\b:_\b:_\b~_\bI_\bn_\bv_\be_\br_\bs_\be_\bO_\bp_\be_\br_\ba_\bt_\bo_\br\n-virtual ~InverseOperator()\n-Destructor.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn solver.hh:156\n-_\bD_\bu_\bn_\be_\b:_\b:_\bI_\bn_\bv_\be_\br_\bs_\be_\bO_\bp_\be_\br_\ba_\bt_\bo_\br_\b:_\b:_\bp_\br_\bi_\bn_\bt_\bO_\bu_\bt_\bp_\bu_\bt\n-void printOutput(std::ostream &s, const CountType &iter, const DataType &norm)\n-const\n-helper function for printing solver output\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn solver.hh:185\n-_\bD_\bu_\bn_\be_\b:_\b:_\bI_\bn_\bv_\be_\br_\bs_\be_\bO_\bp_\be_\br_\ba_\bt_\bo_\br_\b:_\b:_\bp_\br_\bi_\bn_\bt_\bO_\bu_\bt_\bp_\bu_\bt\n-void printOutput(std::ostream &s, const CountType &iter, const DataType &norm,\n-const DataType &norm_old) const\n-helper function for printing solver output\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn solver.hh:172\n-_\bD_\bu_\bn_\be_\b:_\b:_\bI_\bn_\bv_\be_\br_\bs_\be_\bO_\bp_\be_\br_\ba_\bt_\bo_\br_\b:_\b:_\ba_\bp_\bp_\bl_\by\n-virtual void apply(X &x, Y &b, double reduction, InverseOperatorResult &res)=0\n-apply inverse operator, with given convergence criteria.\n-_\bD_\bu_\bn_\be_\b:_\b:_\bI_\bn_\bv_\be_\br_\bs_\be_\bO_\bp_\be_\br_\ba_\bt_\bo_\br_\b:_\b:_\bs_\bc_\ba_\bl_\ba_\br_\b__\br_\be_\ba_\bl_\b__\bt_\by_\bp_\be\n-Simd::Scalar< real_type > scalar_real_type\n-scalar type underlying the field_type\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn solver.hh:114\n-_\bD_\bu_\bn_\be_\b:_\b:_\bI_\bn_\bv_\be_\br_\bs_\be_\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-Type of the range of the operator to be inverted.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn solver.hh:105\n-_\bD_\bu_\bn_\be_\b:_\b:_\bI_\bn_\bv_\be_\br_\bs_\be_\bO_\bp_\be_\br_\ba_\bt_\bo_\br_\b:_\b:_\bn_\bo_\br_\bm_\bS_\bp_\ba_\bc_\bi_\bn_\bg\n-@ normSpacing\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn solver.hh:160\n-_\bD_\bu_\bn_\be_\b:_\b:_\bI_\bn_\bv_\be_\br_\bs_\be_\bO_\bp_\be_\br_\ba_\bt_\bo_\br_\b:_\b:_\bi_\bt_\be_\br_\ba_\bt_\bi_\bo_\bn_\bS_\bp_\ba_\bc_\bi_\bn_\bg\n-@ iterationSpacing\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn solver.hh:160\n-_\bD_\bu_\bn_\be_\b:_\b:_\bI_\bn_\bv_\be_\br_\bs_\be_\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-Type of the domain of the operator to be inverted.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn solver.hh:102\n-_\bD_\bu_\bn_\be_\b:_\b:_\bI_\bn_\bv_\be_\br_\bs_\be_\bO_\bp_\be_\br_\ba_\bt_\bo_\br_\b:_\b:_\ba_\bp_\bp_\bl_\by\n-virtual void apply(X &x, Y &b, InverseOperatorResult &res)=0\n-Apply inverse operator,.\n-_\bD_\bu_\bn_\be_\b:_\b:_\bI_\bn_\bv_\be_\br_\bs_\be_\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 operator.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn solver.hh:108\n-_\bD_\bu_\bn_\be_\b:_\b:_\bI_\bn_\bv_\be_\br_\bs_\be_\bO_\bp_\be_\br_\ba_\bt_\bo_\br_\b:_\b:_\br_\be_\ba_\bl_\b__\bt_\by_\bp_\be\n-FieldTraits< field_type >::real_type real_type\n-The real type of the field type (is the same if using real numbers, but differs\n-for std::complex)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn solver.hh:111\n-_\bD_\bu_\bn_\be_\b:_\b:_\bI_\bn_\bv_\be_\br_\bs_\be_\bO_\bp_\be_\br_\ba_\bt_\bo_\br_\b:_\b:_\bc_\ba_\bt_\be_\bg_\bo_\br_\by\n-virtual SolverCategory::Category category() const =0\n-Category of the solver (see SolverCategory::Category)\n-_\bD_\bu_\bn_\be_\b:_\b:_\bI_\bt_\be_\br_\ba_\bt_\bi_\bv_\be_\bS_\bo_\bl_\bv_\be_\br\n-Base class for all implementations of iterative solvers.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn solver.hh:203\n-_\bD_\bu_\bn_\be_\b:_\b:_\bI_\bt_\be_\br_\ba_\bt_\bi_\bv_\be_\bS_\bo_\bl_\bv_\be_\br_\b:_\b:_\bI_\bt_\be_\br_\ba_\bt_\bi_\bv_\be_\bS_\bo_\bl_\bv_\be_\br\n-IterativeSolver(std::shared_ptr< const LinearOperator< X, Y > > op, std::\n-shared_ptr< const ScalarProduct< X > > sp, std::shared_ptr< Preconditioner< X,\n-X > > prec, const ParameterTree &configuration)\n-Constructor.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn solver.hh:313\n-_\bD_\bu_\bn_\be_\b:_\b:_\bI_\bt_\be_\br_\ba_\bt_\bi_\bv_\be_\bS_\bo_\bl_\bv_\be_\br_\b:_\b:_\bI_\bt_\be_\br_\ba_\bt_\bi_\bv_\be_\bS_\bo_\bl_\bv_\be_\br\n-IterativeSolver(std::shared_ptr< const LinearOperator< X, Y > > op, std::\n-shared_ptr< Preconditioner< X, X > > prec, const ParameterTree &configuration)\n-Constructor.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn solver.hh:290\n-_\bD_\bu_\bn_\be_\b:_\b:_\bI_\bt_\be_\br_\ba_\bt_\bi_\bv_\be_\bS_\bo_\bl_\bv_\be_\br_\b:_\b:_\ba_\bp_\bp_\bl_\by\n-virtual void apply(X &x, X &b, double reduction, InverseOperatorResult &res)\n-Apply inverse operator with given reduction factor.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn solver.hh:374\n-_\bD_\bu_\bn_\be_\b:_\b:_\bI_\bt_\be_\br_\ba_\bt_\bi_\bv_\be_\bS_\bo_\bl_\bv_\be_\br_\b:_\b:_\b__\bs_\bp\n-std::shared_ptr< const ScalarProduct< X > > _sp\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn solver.hh:506\n-_\bD_\bu_\bn_\be_\b:_\b:_\bI_\bt_\be_\br_\ba_\bt_\bi_\bv_\be_\bS_\bo_\bl_\bv_\be_\br_\b:_\b:_\bI_\bt_\be_\br_\ba_\bt_\bi_\bv_\be_\bS_\bo_\bl_\bv_\be_\br\n-IterativeSolver(std::shared_ptr< const LinearOperator< X, Y > > op, std::\n-shared_ptr< const ScalarProduct< X > > sp, std::shared_ptr< Preconditioner< X,\n-Y > > prec, scalar_real_type reduction, int maxit, int verbose)\n-General constructor to initialize an iterative solver.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn solver.hh:340\n-_\bD_\bu_\bn_\be_\b:_\b:_\bI_\bt_\be_\br_\ba_\bt_\bi_\bv_\be_\bS_\bo_\bl_\bv_\be_\br_\b:_\b:_\bn_\ba_\bm_\be\n-std::string name() const\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn solver.hh:388\n-_\bD_\bu_\bn_\be_\b:_\b:_\bI_\bt_\be_\br_\ba_\bt_\bi_\bv_\be_\bS_\bo_\bl_\bv_\be_\br_\b:_\b:_\bI_\bt_\be_\br_\ba_\bt_\bi_\bv_\be_\bS_\bo_\bl_\bv_\be_\br\n-IterativeSolver(const LinearOperator< X, Y > &op, Preconditioner< X, Y > &prec,\n-scalar_real_type reduction, int maxit, int verbose)\n-General constructor to initialize an iterative solver.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn solver.hh:230\n-_\bD_\bu_\bn_\be_\b:_\b:_\bI_\bt_\be_\br_\ba_\bt_\bi_\bv_\be_\bS_\bo_\bl_\bv_\be_\br_\b:_\b:_\b__\bo_\bp\n-std::shared_ptr< const LinearOperator< X, Y > > _op\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn solver.hh:504\n-_\bD_\bu_\bn_\be_\b:_\b:_\bI_\bt_\be_\br_\ba_\bt_\bi_\bv_\be_\bS_\bo_\bl_\bv_\be_\br_\b:_\b:_\b__\bm_\ba_\bx_\bi_\bt\n-int _maxit\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn solver.hh:508\n-_\bD_\bu_\bn_\be_\b:_\b:_\bI_\bt_\be_\br_\ba_\bt_\bi_\bv_\be_\bS_\bo_\bl_\bv_\be_\br_\b:_\b:_\b__\bv_\be_\br_\bb_\bo_\bs_\be\n-int _verbose\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn solver.hh:509\n-_\bD_\bu_\bn_\be_\b:_\b:_\bI_\bt_\be_\br_\ba_\bt_\bi_\bv_\be_\bS_\bo_\bl_\bv_\be_\br_\b:_\b:_\b__\br_\be_\bd_\bu_\bc_\bt_\bi_\bo_\bn\n-scalar_real_type _reduction\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn solver.hh:507\n-_\bD_\bu_\bn_\be_\b:_\b:_\bI_\bt_\be_\br_\ba_\bt_\bi_\bv_\be_\bS_\bo_\bl_\bv_\be_\br_\b:_\b:_\bI_\bt_\be_\br_\ba_\bt_\bi_\bv_\be_\bS_\bo_\bl_\bv_\be_\br\n-IterativeSolver(const LinearOperator< X, Y > &op, const ScalarProduct< X > &sp,\n-Preconditioner< X, Y > &prec, scalar_real_type reduction, int maxit, int\n-verbose)\n-General constructor to initialize an iterative solver.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn solver.hh:262\n-_\bD_\bu_\bn_\be_\b:_\b:_\bI_\bt_\be_\br_\ba_\bt_\bi_\bv_\be_\bS_\bo_\bl_\bv_\be_\br_\b:_\b:_\b__\bc_\ba_\bt_\be_\bg_\bo_\br_\by\n-SolverCategory::Category _category\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn solver.hh:510\n-_\bD_\bu_\bn_\be_\b:_\b:_\bI_\bt_\be_\br_\ba_\bt_\bi_\bv_\be_\bS_\bo_\bl_\bv_\be_\br_\b:_\b:_\b__\bp_\br_\be_\bc\n-std::shared_ptr< Preconditioner< X, Y > > _prec\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn solver.hh:505\n-_\bD_\bu_\bn_\be_\b:_\b:_\bI_\bt_\be_\br_\ba_\bt_\bi_\bv_\be_\bS_\bo_\bl_\bv_\be_\br_\b:_\b:_\bc_\ba_\bt_\be_\bg_\bo_\br_\by\n-virtual SolverCategory::Category category() const\n-Category of the solver (see SolverCategory::Category)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn solver.hh:383\n-_\bD_\bu_\bn_\be_\b:_\b:_\bI_\bt_\be_\br_\ba_\bt_\bi_\bv_\be_\bS_\bo_\bl_\bv_\be_\br_\b:_\b:_\bI_\bt_\be_\br_\ba_\bt_\bi_\bo_\bn\n-Class for controlling iterative methods.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn solver.hh:411\n-_\bD_\bu_\bn_\be_\b:_\b:_\bI_\bt_\be_\br_\ba_\bt_\bi_\bv_\be_\bS_\bo_\bl_\bv_\be_\br_\b:_\b:_\bI_\bt_\be_\br_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bI_\bt_\be_\br_\ba_\bt_\bi_\bo_\bn\n-Iteration(const IterativeSolver &parent, InverseOperatorResult &res)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn solver.hh:413\n-_\bD_\bu_\bn_\be_\b:_\b:_\bI_\bt_\be_\br_\ba_\bt_\bi_\bv_\be_\bS_\bo_\bl_\bv_\be_\br_\b:_\b:_\bI_\bt_\be_\br_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bI_\bt_\be_\br_\ba_\bt_\bi_\bo_\bn\n-Iteration(Iteration &&other)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn solver.hh:428\n-_\bD_\bu_\bn_\be_\b:_\b:_\bI_\bt_\be_\br_\ba_\bt_\bi_\bv_\be_\bS_\bo_\bl_\bv_\be_\br_\b:_\b:_\bI_\bt_\be_\br_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\b__\br_\be_\bs\n-InverseOperatorResult & _res\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn solver.hh:498\n-_\bD_\bu_\bn_\be_\b:_\b:_\bI_\bt_\be_\br_\ba_\bt_\bi_\bv_\be_\bS_\bo_\bl_\bv_\be_\br_\b:_\b:_\bI_\bt_\be_\br_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\b__\bp_\ba_\br_\be_\bn_\bt\n-const IterativeSolver & _parent\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn solver.hh:499\n-_\bD_\bu_\bn_\be_\b:_\b:_\bI_\bt_\be_\br_\ba_\bt_\bi_\bv_\be_\bS_\bo_\bl_\bv_\be_\br_\b:_\b:_\bI_\bt_\be_\br_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\b__\bw_\ba_\bt_\bc_\bh\n-Timer _watch\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn solver.hh:497\n-_\bD_\bu_\bn_\be_\b:_\b:_\bI_\bt_\be_\br_\ba_\bt_\bi_\bv_\be_\bS_\bo_\bl_\bv_\be_\br_\b:_\b:_\bI_\bt_\be_\br_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bI_\bt_\be_\br_\ba_\bt_\bi_\bo_\bn\n-Iteration(const Iteration &)=delete\n-_\bD_\bu_\bn_\be_\b:_\b:_\bI_\bt_\be_\br_\ba_\bt_\bi_\bv_\be_\bS_\bo_\bl_\bv_\be_\br_\b:_\b:_\bI_\bt_\be_\br_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\b__\bi\n-CountType _i\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn solver.hh:496\n-_\bD_\bu_\bn_\be_\b:_\b:_\bI_\bt_\be_\br_\ba_\bt_\bi_\bv_\be_\bS_\bo_\bl_\bv_\be_\br_\b:_\b:_\bI_\bt_\be_\br_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\b__\bd_\be_\bf_\b0\n-real_type _def0\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn solver.hh:495\n-_\bD_\bu_\bn_\be_\b:_\b:_\bI_\bt_\be_\br_\ba_\bt_\bi_\bv_\be_\bS_\bo_\bl_\bv_\be_\br_\b:_\b:_\bI_\bt_\be_\br_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bs_\bt_\be_\bp\n-bool step(CountType i, real_type def)\n-registers the iteration step, checks for invalid defect norm and convergence.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn solver.hh:455\n-_\bD_\bu_\bn_\be_\b:_\b:_\bI_\bt_\be_\br_\ba_\bt_\bi_\bv_\be_\bS_\bo_\bl_\bv_\be_\br_\b:_\b:_\bI_\bt_\be_\br_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bf_\bi_\bn_\ba_\bl_\bi_\bz_\be\n-void finalize()\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn solver.hh:480\n-_\bD_\bu_\bn_\be_\b:_\b:_\bI_\bt_\be_\br_\ba_\bt_\bi_\bv_\be_\bS_\bo_\bl_\bv_\be_\br_\b:_\b:_\bI_\bt_\be_\br_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\b__\bd_\be_\bf\n-real_type _def\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn solver.hh:495\n-_\bD_\bu_\bn_\be_\b:_\b:_\bI_\bt_\be_\br_\ba_\bt_\bi_\bv_\be_\bS_\bo_\bl_\bv_\be_\br_\b:_\b:_\bI_\bt_\be_\br_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\b~_\bI_\bt_\be_\br_\ba_\bt_\bi_\bo_\bn\n-~Iteration()\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn solver.hh:440\n-_\bD_\bu_\bn_\be_\b:_\b:_\bI_\bt_\be_\br_\ba_\bt_\bi_\bv_\be_\bS_\bo_\bl_\bv_\be_\br_\b:_\b:_\bI_\bt_\be_\br_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\b__\bv_\ba_\bl_\bi_\bd\n-bool _valid\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn solver.hh:500\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bo_\bl_\bv_\be_\br_\bH_\be_\bl_\bp_\be_\br\n-Helper class for notifying a DUNE-ISTL linear solver about a change of the\n-iteration matrix object in...\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn solver.hh:522\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bo_\bl_\bv_\be_\br_\bH_\be_\bl_\bp_\be_\br_\b:_\b:_\bs_\be_\bt_\bM_\ba_\bt_\br_\bi_\bx\n-static void setMatrix(ISTLLinearSolver &solver, const BCRSMatrix &matrix)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn solver.hh:524\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bo_\bl_\bv_\be_\br_\bH_\be_\bl_\bp_\be_\br_\b:_\b:_\bI_\bm_\bp_\bl_\be_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn\n-Implementation that works together with iterative ISTL solvers, e.g. Dune::\n-CGSolver or Dune::BiCGSTAB...\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn solver.hh:540\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bo_\bl_\bv_\be_\br_\bH_\be_\bl_\bp_\be_\br_\b:_\b:_\bI_\bm_\bp_\bl_\be_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bs_\be_\bt_\bM_\ba_\bt_\br_\bi_\bx\n-static void setMatrix(ISTLLinearSolver &, const BCRSMatrix &)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn solver.hh:541\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bo_\bl_\bv_\be_\br_\bH_\be_\bl_\bp_\be_\br_\b:_\b:_\bI_\bm_\bp_\bl_\be_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b<_\b _\bt_\br_\bu_\be_\b,_\b _\bD_\bu_\bm_\bm_\by_\b _\b>_\b:_\b:_\bs_\be_\bt_\bM_\ba_\bt_\br_\bi_\bx\n-static void setMatrix(ISTLLinearSolver &solver, const BCRSMatrix &matrix)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn solver.hh:553\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:_\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:_\bI_\bs_\bD_\bi_\br_\be_\bc_\bt_\bS_\bo_\bl_\bv_\be_\br\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn solvertype.hh:16\n+_\bD_\bu_\bn_\be_\b:_\b:_\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b<_\b<\n+std::ostream & operator<<(std::ostream &s, const BlockVector< K, A > &v)\n+Send BlockVector to an output stream.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn bvector.hh:590\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:395\n+_\bD_\bu_\bn_\be_\b:_\b:_\bB_\bl_\bo_\bc_\bk_\bV_\be_\bc_\bt_\bo_\br_\b:_\b:_\bB_\bl_\bo_\bc_\bk_\bV_\be_\bc_\bt_\bo_\br\n+BlockVector()\n+makes empty vector\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn bvector.hh:425\n+_\bD_\bu_\bn_\be_\b:_\b:_\bB_\bl_\bo_\bc_\bk_\bV_\be_\bc_\bt_\bo_\br_\b:_\b:_\br_\be_\bs_\be_\br_\bv_\be\n+void reserve(size_type capacity)\n+Reserve space.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn bvector.hh:475\n+_\bD_\bu_\bn_\be_\b:_\b:_\bB_\bl_\bo_\bc_\bk_\bV_\be_\bc_\bt_\bo_\br_\b:_\b:_\bB_\bl_\bo_\bc_\bk_\bV_\be_\bc_\bt_\bo_\br\n+BlockVector(BlockVector &&a) noexcept(noexcept(std::declval< BlockVector >\n+().swap(a)))\n+move constructor\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn bvector.hh:519\n+_\bD_\bu_\bn_\be_\b:_\b:_\bB_\bl_\bo_\bc_\bk_\bV_\be_\bc_\bt_\bo_\br_\b:_\b:_\bB_\bl_\bo_\bc_\bk_\bV_\be_\bc_\bt_\bo_\br\n+BlockVector(size_type _n)\n+make vector with _n components\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn bvector.hh:431\n+_\bD_\bu_\bn_\be_\b:_\b:_\bB_\bl_\bo_\bc_\bk_\bV_\be_\bc_\bt_\bo_\br_\b:_\b:_\br_\be_\bs_\bi_\bz_\be\n+void resize(size_type size)\n+Resize the vector.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn bvector.hh:503\n+_\bD_\bu_\bn_\be_\b:_\b:_\bB_\bl_\bo_\bc_\bk_\bV_\be_\bc_\bt_\bo_\br_\b:_\b:_\bI_\bt_\be_\br_\ba_\bt_\bo_\br\n+Imp::block_vector_unmanaged< B, A >::Iterator Iterator\n+make iterators available as types\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn bvector.hh:417\n+_\bD_\bu_\bn_\be_\b:_\b:_\bB_\bl_\bo_\bc_\bk_\bV_\be_\bc_\bt_\bo_\br_\b:_\b:_\bb_\bl_\bo_\bc_\bk_\bl_\be_\bv_\be_\bl\n+static constexpr unsigned int blocklevel\n+increment block level counter\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn bvector.hh:414\n+_\bD_\bu_\bn_\be_\b:_\b:_\bB_\bl_\bo_\bc_\bk_\bV_\be_\bc_\bt_\bo_\br_\b:_\b:_\bB_\bl_\bo_\bc_\bk_\bV_\be_\bc_\bt_\bo_\br\n+BlockVector(const BlockVector &a) noexcept(noexcept(std::declval< BlockVector >\n+().storage_=a.storage_))\n+copy constructor\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn bvector.hh:511\n+_\bD_\bu_\bn_\be_\b:_\b:_\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+A allocator_type\n+export the allocator type\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn bvector.hh:407\n+_\bD_\bu_\bn_\be_\b:_\b:_\bB_\bl_\bo_\bc_\bk_\bV_\be_\bc_\bt_\bo_\br_\b:_\b:_\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b=\n+BlockVector & operator=(const BlockVector &a) noexcept(noexcept(std::declval<\n+BlockVector >().storage_=a.storage_))\n+assignment\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn bvector.hh:526\n+_\bD_\bu_\bn_\be_\b:_\b:_\bB_\bl_\bo_\bc_\bk_\bV_\be_\bc_\bt_\bo_\br_\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 bvector.hh:401\n+_\bD_\bu_\bn_\be_\b:_\b:_\bB_\bl_\bo_\bc_\bk_\bV_\be_\bc_\bt_\bo_\br_\b:_\b:_\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be\n+A::size_type size_type\n+The type for the index access.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn bvector.hh:410\n+_\bD_\bu_\bn_\be_\b:_\b:_\bB_\bl_\bo_\bc_\bk_\bV_\be_\bc_\bt_\bo_\br_\b:_\b:_\bB_\bl_\bo_\bc_\bk_\bV_\be_\bc_\bt_\bo_\br\n+BlockVector(std::initializer_list< B > const &l)\n+Construct from a std::initializer_list.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn bvector.hh:437\n+_\bD_\bu_\bn_\be_\b:_\b:_\bB_\bl_\bo_\bc_\bk_\bV_\be_\bc_\bt_\bo_\br_\b:_\b:_\bc_\ba_\bp_\ba_\bc_\bi_\bt_\by\n+size_type capacity() const\n+Get the capacity of the vector.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn bvector.hh:488\n+_\bD_\bu_\bn_\be_\b:_\b:_\bB_\bl_\bo_\bc_\bk_\bV_\be_\bc_\bt_\bo_\br_\b:_\b:_\bB_\bl_\bo_\bc_\bk_\bV_\be_\bc_\bt_\bo_\br\n+BlockVector(size_type _n, S _capacity)\n+Make vector with _n components but preallocating capacity components.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn bvector.hh:455\n+_\bD_\bu_\bn_\be_\b:_\b:_\bB_\bl_\bo_\bc_\bk_\bV_\be_\bc_\bt_\bo_\br_\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 bvector.hh:404\n+_\bD_\bu_\bn_\be_\b:_\b:_\bB_\bl_\bo_\bc_\bk_\bV_\be_\bc_\bt_\bo_\br_\b:_\b:_\bs_\bw_\ba_\bp\n+void swap(BlockVector &other) noexcept(noexcept(std::declval< BlockVector & >\n+().storage_.swap(other.storage_)))\n+swap operation\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn bvector.hh:544\n+_\bD_\bu_\bn_\be_\b:_\b:_\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+Imp::block_vector_unmanaged< B, A >::ConstIterator ConstIterator\n+make iterators available as types\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn bvector.hh:420\n+_\bD_\bu_\bn_\be_\b:_\b:_\bF_\bi_\be_\bl_\bd_\bT_\br_\ba_\bi_\bt_\bs_\b<_\b _\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 bvector.hh:582\n+_\bD_\bu_\bn_\be_\b:_\b:_\bF_\bi_\be_\bl_\bd_\bT_\br_\ba_\bi_\bt_\bs_\b<_\b _\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 bvector.hh:581\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: foreach.hh File Reference \n+dune-istl: ilu.hh File Reference \n \n-
#include <type_traits>\n-
#include <utility>\n-
#include <cassert>\n-
#include <dune/common/std/type_traits.hh>\n-
#include <dune/common/diagonalmatrix.hh>\n-
#include <dune/common/hybridutilities.hh>\n-
#include <dune/common/indices.hh>\n-
#include <dune/istl/bcrsmatrix.hh >\n-
#include <dune/istl/scaledidmatrix.hh >\n+\n+
The incomplete LU factorization kernels. \n+More...
\n+
#include <cmath>\n+
#include <complex>\n+
#include <map>\n+
#include <vector>\n+
#include <dune/common/fmatrix.hh>\n+
#include <dune/common/scalarvectorview.hh>\n+
#include <dune/common/scalarmatrixview.hh>\n+
#include "istlexception.hh "\n
\n
Go to the source code of this file.
\n
\n template<class Matrix > auto Dune::ForEach::rows (Matrix const &matrix) template<class Matrix > auto Dune::ForEach::cols (Matrix const &matrix) template<class Vector > auto Dune::ForEach::size (Vector const &vector) template<class Vector , class F > std::size_t Dune::flatVectorForEach (Vector &&vector, F &&f, std::size_t offset=0) Traverse a blocked vector and call a functor at each scalar entry. template<class Matrix , class F > std::pair< std::size_t, std::size_t > Dune::flatMatrixForEach (Matrix &&matrix, F &&f, std::size_t rowOffset=0, std::size_t colOffset=0) Traverse a blocked matrix and call a functor at each scalar entry. template<class M > void Dune::ILU::blockILU0Decomposition (M &A) compute ILU decomposition of A. A is overwritten by its decomposition template<class M , class X , class Y > void Dune::ILU::blockILUBacksolve (const M &A, X &v, const Y &d) LU backsolve with stored inverse. template<class M > M::field_type & Dune::ILU::firstMatrixElement (M &A, typename std::enable_if_t<!Dune::IsNumber< M >::value > *sfinae=nullptr) template<class K > K & Dune::ILU::firstMatrixElement (K &A, typename std::enable_if_t< Dune::IsNumber< K >::value > *sfinae=nullptr) template<class K , int n, int m> K & Dune::ILU::firstMatrixElement (FieldMatrix < K, n, m > &A) template<class M > void Dune::ILU::blockILUDecomposition (const M &A, int n, M &ILU) template<class M , class CRS , class InvVector > void Dune::ILU::convertToCRS (const M &A, CRS &lower, CRS &upper, InvVector &inv) convert ILU decomposition into CRS format for lower and upper triangular and inverse. template<class CRS , class InvVector , class X , class Y > void Dune::ILU::blockILUBacksolve (const CRS &lower, const CRS &upper, const InvVector &inv, X &v, const Y &d) LU backsolve with stored inverse in CRS format for lower and upper triangular.
\n-
\n+
\n+
The incomplete LU factorization kernels.
\n+
\n-#include \n-#include \n-#include \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/_\bs_\bc_\ba_\bl_\be_\bd_\bi_\bd_\bm_\ba_\bt_\br_\bi_\bx_\b._\bh_\bh>\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+ilu.hh File Reference\n+The incomplete LU factorization kernels. _\bM_\bo_\br_\be_\b._\b._\b.\n+#include \n+#include \n+#include \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 _\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:_\bI_\bL_\bU_\b:_\b:_\bC_\bR_\bS_\b<_\b _\bB_\b,_\b _\bA_\bl_\bl_\bo_\bc_\b _\b>\n+\u00a0 a simple compressed row storage matrix class _\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:_\bF_\bo_\br_\bE_\ba_\bc_\bh\n+namespace \u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bI_\bL_\bU\n \u00a0\n F\bFu\bun\bnc\bct\bti\bio\bon\bns\bs\n-template\n- auto\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bF_\bo_\br_\bE_\ba_\bc_\bh_\b:_\b:_\br_\bo_\bw_\bs (_\bM_\ba_\bt_\br_\bi_\bx const\n- &matrix)\n-\u00a0\n-template\n- auto\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bF_\bo_\br_\bE_\ba_\bc_\bh_\b:_\b:_\bc_\bo_\bl_\bs (_\bM_\ba_\bt_\br_\bi_\bx const\n- &matrix)\n-\u00a0\n-template\n- auto\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bF_\bo_\br_\bE_\ba_\bc_\bh_\b:_\b:_\bs_\bi_\bz_\be (Vector const\n- &vector)\n-\u00a0\n-template\n- std::size_t\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bf_\bl_\ba_\bt_\bV_\be_\bc_\bt_\bo_\br_\bF_\bo_\br_\bE_\ba_\bc_\bh (Vector\n- &&vector, F &&f, std::size_t offset=0)\n-\u00a0 Traverse a blocked vector and call a\n- functor at each scalar entry.\n-\u00a0\n-template\n-std::pair< std::size_t, std::size_t >\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bf_\bl_\ba_\bt_\bM_\ba_\bt_\br_\bi_\bx_\bF_\bo_\br_\bE_\ba_\bc_\bh (_\bM_\ba_\bt_\br_\bi_\bx\n- &&matrix, F &&f, std::size_t\n- rowOffset=0, std::size_t colOffset=0)\n-\u00a0 Traverse a blocked matrix and call a\n- functor at each scalar entry.\n+template\n+ void\u00a0 _\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 (M &A)\n+\u00a0 compute _\bI_\bL_\bU decomposition of A. A is overwritten by its\n+ decomposition\n+\u00a0\n+template\n+ void\u00a0 _\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 (const M &A, X &v, const Y &d)\n+\u00a0 LU backsolve with stored inverse.\n+\u00a0\n+template\n+M::field_type &\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bI_\bL_\bU_\b:_\b:_\bf_\bi_\br_\bs_\bt_\bM_\ba_\bt_\br_\bi_\bx_\bE_\bl_\be_\bm_\be_\bn_\bt (M &A, typename std::\n+ enable_if_t::value > *sfinae=nullptr)\n+\u00a0\n+template\n+ K &\u00a0 _\bD_\bu_\bn_\be_\b:_\b:_\bI_\bL_\bU_\b:_\b:_\bf_\bi_\br_\bs_\bt_\bM_\ba_\bt_\br_\bi_\bx_\bE_\bl_\be_\bm_\be_\bn_\bt (K &A, typename std::\n+ enable_if_t< Dune::IsNumber< K >::value > *sfinae=nullptr)\n+\u00a0\n+template
![\"$C=A*B$\"](\"form_29_dark.png\")
![\"$C=A*B^T$\"](\"form_30_dark.png\")
![\"$C=A^T*B$\"](\"form_31_dark.png\")
![\"doxygen\"/](\"doxygen.svg\")