![\"doxygen\"/](\"doxygen.svg\")
Classes for using SuperLU with ISTL matrices. \n-More...
\n-#include "superlufunctions.hh"#include "solvers.hh"#include "supermatrix.hh"#include <algorithm>#include <functional>#include "bcrsmatrix.hh"#include "bvector.hh"#include "istlexception.hh"#include <dune/common/fmatrix.hh>#include <dune/common/fvector.hh>#include <dune/common/stdstreams.hh>#include <dune/istl/solvertype.hh>#include <dune/istl/solverfactory.hh>#include "supermatrix.h"#include "slu_util.h"Go to the source code of this file.
\n\n-Classes | |
| struct | Dune::SuperLUSolveChooser< T > |
| struct | Dune::SuperLUDenseMatChooser< T > |
| struct | Dune::SuperLUQueryChooser< T > |
| struct | Dune::QuerySpaceChooser< T > |
| class | Dune::SuperLU< M > |
| SuperLu Solver. More... | |
| struct | Dune::IsDirectSolver< SuperLU< BCRSMatrix< T, A > > > |
| struct | Dune::StoresColumnCompressed< SuperLU< BCRSMatrix< T, A > > > |
| struct | Dune::SuperLUCreator |
| struct | Dune::SuperLUCreator::isValidBlock< class > |
| struct | Dune::SuperLUCreator::isValidBlock< Dune::FieldVector< double, k > > |
| struct | Dune::SuperLUCreator::isValidBlock< Dune::FieldVector< std::complex< double >, k > > |
| struct | Dune::SuperLUCreator::isValidBlock< double > |
| struct | Dune::SuperLUCreator::isValidBlock< std::complex< double > > |
\n-Namespaces | |
| namespace | Dune |
\n-Functions | |
| Dune::DUNE_REGISTER_DIRECT_SOLVER ("superlu", SuperLUCreator()) | |
\n+Macros | |
| #define | int_t SUPERLU_INT_TYPE |
Classes for using SuperLU with ISTL matrices.
\n-| #define int_t SUPERLU_INT_TYPE | \n+
1.9.8\n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,65 +1,19 @@\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 | _\bF_\bu_\bn_\bc_\bt_\bi_\bo_\bn_\bs\n-superlu.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)\n-Classes for using SuperLU with ISTL matrices. _\bM_\bo_\br_\be_\b._\b._\b.\n-#include \"_\bs_\bu_\bp_\be_\br_\bl_\bu_\bf_\bu_\bn_\bc_\bt_\bi_\bo_\bn_\bs_\b._\bh_\bh\"\n-#include \"_\bs_\bo_\bl_\bv_\be_\br_\bs_\b._\bh_\bh\"\n-#include \"_\bs_\bu_\bp_\be_\br_\bm_\ba_\bt_\br_\bi_\bx_\b._\bh_\bh\"\n-#include 1.9.8\n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,947 +1,129 @@\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+superlufunctions.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-7\n-8#if HAVE_SUPERLU\n+5#ifndef DUNE_ISTL_SUPERLUFUNCTIONS_HH\n+6#define DUNE_ISTL_SUPERLUFUNCTIONS_HH\n+7#if HAVE_SUPERLU\n+8\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 #include <iostream>#include <fstream>#include <vector>#include <sstream>#include <cmath>#include <dune/common/timer.hh>#include "io.hh"#include "bvector.hh"#include "vbvector.hh"#include "bcrsmatrix.hh"#include "gsetc.hh"#include "ilu.hh"#include "operators.hh"#include "solvers.hh"#include "preconditioners.hh"#include "scalarproducts.hh"#include "owneroverlapcopy.hh"Functionality for redistributing a sparse matrix. \n+More...
\n+#include <memory>#include "repartition.hh"#include <dune/common/exceptions.hh>#include <dune/common/parallel/indexset.hh>#include <dune/istl/owneroverlapcopy.hh>#include <dune/istl/paamg/pinfo.hh>Go to the source code of this file.
\n\n Namespaces | |
| namespace | Dune |
| namespace | Dune::Amg |
\n+Functions | |
| template<typename M , typename C > | |
| void | Dune::redistributeSparsityPattern (M &origMatrix, M &newMatrix, C &origComm, C &newComm, RedistributeInformation< C > &ri) |
| template<typename M , typename C > | |
| void | Dune::redistributeMatrixEntries (M &origMatrix, M &newMatrix, C &origComm, C &newComm, RedistributeInformation< C > &ri) |
| template<typename M , typename C > | |
| void | Dune::redistributeMatrix (M &origMatrix, M &newMatrix, C &origComm, C &newComm, RedistributeInformation< C > &ri) |
| Redistribute a matrix according to given domain decompositions. | |
| template<typename M > | |
| void | Dune::redistributeMatrixEntries (M &origMatrix, M &newMatrix, Dune::Amg::SequentialInformation &origComm, Dune::Amg::SequentialInformation &newComm, RedistributeInformation< Dune::Amg::SequentialInformation > &ri) |
| template<typename M > | |
| void | Dune::redistributeMatrix (M &origMatrix, M &newMatrix, Dune::Amg::SequentialInformation &origComm, Dune::Amg::SequentialInformation &newComm, RedistributeInformation< Dune::Amg::SequentialInformation > &ri) |
Functionality for redistributing a sparse matrix.
\n+ 1.9.8\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-_\bC_\bl_\ba_\bs_\bs_\be_\bs | _\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs\n-schwarz.hh File Reference\n-#include 1.9.8\n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,395 +1,1173 @@\n dune-istl\u00a02.9.0\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bi_\bs_\bt_\bl\n-schwarz.hh\n+matrixredistribute.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_SCHWARZ_HH\n-6#define DUNE_ISTL_SCHWARZ_HH\n-7\n-8#include & 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+299 if(nnz>0) {\n+300 m.setSize(_\ba_\bg_\bg_\bi_\bd_\bx_\bs_\be_\bt.size(), _\ba_\bg_\bg_\bi_\bd_\bx_\bs_\be_\bt.size(), nnz);\n+301 m.setBuildMode(M::row_wise);\n+302 typename M::CreateIterator citer=m.createbegin();\n+303#ifdef DEBUG_REPART\n+304 std::size_t idx=0;\n+305 bool correct=true;\n+306 Dune::GlobalLookupIndexSet global(_\ba_\bg_\bg_\bi_\bd_\bx_\bs_\be_\bt);\n+307#endif\n+308 typedef typename std::vector _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-_\bg_\bs_\be_\bt_\bc_\b._\bh_\bh\n-Simple iterative methods like Jacobi, Gauss-Seidel, SOR, SSOR, etc. in a\n-generic way.\n-_\bi_\bo_\b._\bh_\bh\n-Some generic functions for pretty printing vectors and matrices.\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-_\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-_\bb_\bc_\br_\bs_\bm_\ba_\bt_\br_\bi_\bx_\b._\bh_\bh\n-Implementation of the BCRSMatrix class.\n-_\bs_\bo_\bl_\bv_\be_\br_\bs_\b._\bh_\bh\n-Implementations of the inverse operator interface.\n-_\bi_\bl_\bu_\b._\bh_\bh\n-The incomplete LU factorization kernels.\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+331 }\n+332\n+_\b3_\b4_\b0 void _\bc_\bo_\bm_\bp_\bl_\be_\bt_\be_\bS_\bp_\ba_\br_\bs_\bi_\bt_\by_\bP_\ba_\bt_\bt_\be_\br_\bn(std::vector
#include "bcrsmatrix.hh"#include "bvector.hh"#include <dune/common/fmatrix.hh>#include <dune/common/fvector.hh>#include <dune/common/typetraits.hh>#include <limits>#include <dune/istl/bccsmatrixinitializer.hh>#include "superlufunctions.hh"#include <iostream>#include <fstream>#include <vector>#include <sstream>#include <cmath>#include <dune/common/timer.hh>#include "io.hh"#include "bvector.hh"#include "vbvector.hh"#include "bcrsmatrix.hh"#include "gsetc.hh"#include "ilu.hh"#include "operators.hh"#include "solvers.hh"#include "preconditioners.hh"#include "scalarproducts.hh"#include "owneroverlapcopy.hh"Go to the source code of this file.
\n\n Namespaces | |
| namespace | Dune |
| namespace | Dune::Amg |
1.9.8\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,50 +1,43 @@\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-supermatrix.hh File Reference\n-#include \"_\bb_\bc_\br_\bs_\bm_\ba_\bt_\br_\bi_\bx_\b._\bh_\bh\"\n+schwarz.hh File Reference\n+#include 1.9.8\n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,461 +1,395 @@\n dune-istl\u00a02.9.0\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bi_\bs_\bt_\bl\n-supermatrix.hh\n+schwarz.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_SUPERMATRIX_HH\n-6#define DUNE_ISTL_SUPERMATRIX_HH\n+5#ifndef DUNE_ISTL_SCHWARZ_HH\n+6#define DUNE_ISTL_SCHWARZ_HH\n 7\n-8#if HAVE_SUPERLU\n-9\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 & 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 _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+_\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+_\bi_\bo_\b._\bh_\bh\n+Some generic functions for pretty printing vectors and matrices.\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+_\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+_\bv_\bb_\bv_\be_\bc_\bt_\bo_\br_\b._\bh_\bh\n+???\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-_\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+_\bb_\bc_\br_\bs_\bm_\ba_\bt_\br_\bi_\bx_\b._\bh_\bh\n+Implementation of the BCRSMatrix class.\n+_\bs_\bo_\bl_\bv_\be_\br_\bs_\b._\bh_\bh\n+Implementations of the inverse operator interface.\n+_\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\bs_\b._\bh_\bh\n+Define general, extensible interface for operators. The available\n+implementation wraps a matrix.\n+_\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_\bl_\bu_\b._\bh_\bh\n+The incomplete LU factorization kernels.\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 _\bD_\bu_\bn_\be\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn allocator.hh:11\n-_\bD_\bu_\bn_\be_\b:_\b:_\bO_\bv_\be_\br_\bl_\ba_\bp_\bp_\bi_\bn_\bg_\bS_\bc_\bh_\bw_\ba_\br_\bz_\bI_\bn_\bi_\bt_\bi_\ba_\bl_\bi_\bz_\be_\br\n-Initializer for SuperLU Matrices representing the subdomains.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn overlappingschwarz.hh:47\n-_\bD_\bu_\bn_\be_\b:_\b:_\bM_\ba_\bt_\br_\bi_\bx_\bD_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b:_\b:_\bc_\bo_\bl_\bd_\bi_\bm\n-static auto coldim(const M &A)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn matrixutils.hh:219\n-_\bD_\bu_\bn_\be_\b:_\b:_\bM_\ba_\bt_\br_\bi_\bx_\bD_\bi_\bm_\be_\bn_\bs_\bi_\bo_\bn_\b:_\b:_\br_\bo_\bw_\bd_\bi_\bm\n-static auto rowdim(const M &A)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn matrixutils.hh:214\n-_\bD_\bu_\bn_\be_\b:_\b:_\bB_\bC_\bR_\bS_\bM_\ba_\bt_\br_\bi_\bx\n-A sparse block matrix with compressed row storage.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn bcrsmatrix.hh:466\n-_\bD_\bu_\bn_\be_\b:_\b:_\bB_\bC_\bR_\bS_\bM_\ba_\bt_\br_\bi_\bx_\b:_\b:_\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be\n-A::size_type size_type\n-The type for the index access and the size.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn bcrsmatrix.hh: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:_\bS_\bu_\bp_\be_\br_\bL_\bU\n-SuperLu Solver.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn superlu.hh:271\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bu_\bp_\be_\br_\bM_\ba_\bt_\br_\bi_\bx_\bC_\br_\be_\ba_\bt_\be_\bS_\bp_\ba_\br_\bs_\be_\bC_\bh_\bo_\bo_\bs_\be_\br\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn supermatrix.hh:26\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bu_\bp_\be_\br_\bM_\ba_\bt_\br_\bi_\bx_\bP_\br_\bi_\bn_\bt_\be_\br\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn supermatrix.hh:30\n-_\bD_\bu_\bn_\be_\b:_\b:_\bB_\ba_\bs_\be_\bG_\be_\bt_\bS_\bu_\bp_\be_\br_\bL_\bU_\bT_\by_\bp_\be\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn supermatrix.hh:126\n-_\bD_\bu_\bn_\be_\b:_\b:_\bB_\ba_\bs_\be_\bG_\be_\bt_\bS_\bu_\bp_\be_\br_\bL_\bU_\bT_\by_\bp_\be_\b:_\b:_\bt_\by_\bp_\be\n-static const Dtype_t type\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn supermatrix.hh:127\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bt_\bS_\bu_\bp_\be_\br_\bL_\bU_\bT_\by_\bp_\be\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn supermatrix.hh:132\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bt_\bS_\bu_\bp_\be_\br_\bL_\bU_\bT_\by_\bp_\be_\b<_\b _\bd_\bo_\bu_\bb_\bl_\be_\b _\b>_\b:_\b:_\bf_\bl_\bo_\ba_\bt_\b__\bt_\by_\bp_\be\n-double float_type\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn supermatrix.hh:144\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bt_\bS_\bu_\bp_\be_\br_\bL_\bU_\bT_\by_\bp_\be_\b<_\b _\bf_\bl_\bo_\ba_\bt_\b _\b>_\b:_\b:_\bf_\bl_\bo_\ba_\bt_\b__\bt_\by_\bp_\be\n-float float_type\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn supermatrix.hh:151\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bt_\bS_\bu_\bp_\be_\br_\bL_\bU_\bT_\by_\bp_\be_\b<_\b _\bs_\bt_\bd_\b:_\b:_\bc_\bo_\bm_\bp_\bl_\be_\bx_\b<_\b _\bd_\bo_\bu_\bb_\bl_\be_\b _\b>_\b _\b>_\b:_\b:_\bf_\bl_\bo_\ba_\bt_\b__\bt_\by_\bp_\be\n-double float_type\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn supermatrix.hh:158\n-_\bD_\bu_\bn_\be_\b:_\b:_\bG_\be_\bt_\bS_\bu_\bp_\be_\br_\bL_\bU_\bT_\by_\bp_\be_\b<_\b _\bs_\bt_\bd_\b:_\b:_\bc_\bo_\bm_\bp_\bl_\be_\bx_\b<_\b _\bf_\bl_\bo_\ba_\bt_\b _\b>_\b _\b>_\b:_\b:_\bf_\bl_\bo_\ba_\bt_\b__\bt_\by_\bp_\be\n-float float_type\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn supermatrix.hh:165\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bu_\bp_\be_\br_\bL_\bU_\bM_\ba_\bt_\br_\bi_\bx\n-Utility class for converting an ISTL Matrix into a SuperLU Matrix.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn supermatrix.hh:175\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bu_\bp_\be_\br_\bM_\ba_\bt_\br_\bi_\bx_\bI_\bn_\bi_\bt_\bi_\ba_\bl_\bi_\bz_\be_\br\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn supermatrix.hh:179\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bu_\bp_\be_\br_\bL_\bU_\bM_\ba_\bt_\br_\bi_\bx_\b<_\b _\bB_\bC_\bR_\bS_\bM_\ba_\bt_\br_\bi_\bx_\b<_\b _\bB_\b,_\b _\bT_\bA_\b _\b>_\b _\b>_\b:_\b:_\bf_\br_\be_\be\n-virtual void free()\n-free allocated space.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn supermatrix.hh:303\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bu_\bp_\be_\br_\bL_\bU_\bM_\ba_\bt_\br_\bi_\bx_\b<_\b _\bB_\bC_\bR_\bS_\bM_\ba_\bt_\br_\bi_\bx_\b<_\b _\bB_\b,_\b _\bT_\bA_\b _\b>_\b _\b>_\b:_\b:_\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b=\n-SuperLUMatrix< BCRSMatrix< B, TA > > & operator=(const SuperLUMatrix<\n-BCRSMatrix< B, TA > > &mat)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn supermatrix.hh:256\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bu_\bp_\be_\br_\bL_\bU_\bM_\ba_\bt_\br_\bi_\bx_\b<_\b _\bB_\bC_\bR_\bS_\bM_\ba_\bt_\br_\bi_\bx_\b<_\b _\bB_\b,_\b _\bT_\bA_\b _\b>_\b _\b>_\b:_\b:_\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b=\n-SuperLUMatrix< BCRSMatrix< B, TA > > & operator=(const BCRSMatrix< B, TA >\n-&mat)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn supermatrix.hh:237\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bu_\bp_\be_\br_\bL_\bU_\bM_\ba_\bt_\br_\bi_\bx_\b<_\b _\bB_\bC_\bR_\bS_\bM_\ba_\bt_\br_\bi_\bx_\b<_\b _\bB_\b,_\b _\bT_\bA_\b _\b>_\b _\b>_\b:_\b:_\bS_\bu_\bp_\be_\br_\bL_\bU_\bM_\ba_\bt_\br_\bi_\bx\n-SuperLUMatrix(const Matrix &mat)\n-Constructor that initializes the data.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn supermatrix.hh:212\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bu_\bp_\be_\br_\bL_\bU_\bM_\ba_\bt_\br_\bi_\bx_\b<_\b _\bB_\bC_\bR_\bS_\bM_\ba_\bt_\br_\bi_\bx_\b<_\b _\bB_\b,_\b _\bT_\bA_\b _\b>_\b _\b>_\b:_\b:_\bs_\be_\bt_\bM_\ba_\bt_\br_\bi_\bx\n-virtual void setMatrix(const Matrix &mat)\n-Initialize data from given matrix.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn supermatrix.hh:293\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bu_\bp_\be_\br_\bL_\bU_\bM_\ba_\bt_\br_\bi_\bx_\b<_\b _\bB_\bC_\bR_\bS_\bM_\ba_\bt_\br_\bi_\bx_\b<_\b _\bB_\b,_\b _\bT_\bA_\b _\b>_\b _\b>_\b:_\b:_\bS_\bu_\bp_\be_\br_\bL_\bU_\bM_\ba_\bt_\br_\bi_\bx\n-SuperLUMatrix()\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn supermatrix.hh:215\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bu_\bp_\be_\br_\bL_\bU_\bM_\ba_\bt_\br_\bi_\bx_\b<_\b _\bB_\bC_\bR_\bS_\bM_\ba_\bt_\br_\bi_\bx_\b<_\b _\bB_\b,_\b _\bT_\bA_\b _\b>_\b _\b>_\b:_\b:_\bs_\bi_\bz_\be_\b__\bt_\by_\bp_\be\n-Matrix::size_type size_type\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn supermatrix.hh:206\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bu_\bp_\be_\br_\bL_\bU_\bM_\ba_\bt_\br_\bi_\bx_\b<_\b _\bB_\bC_\bR_\bS_\bM_\ba_\bt_\br_\bi_\bx_\b<_\b _\bB_\b,_\b _\bT_\bA_\b _\b>_\b _\b>_\b:_\b:_\bM_\ba_\bt_\br_\bi_\bx\n-BCRSMatrix< B, TA > Matrix\n-The type of the matrix to convert.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn supermatrix.hh:202\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bu_\bp_\be_\br_\bL_\bU_\bM_\ba_\bt_\br_\bi_\bx_\b<_\b _\bB_\bC_\bR_\bS_\bM_\ba_\bt_\br_\bi_\bx_\b<_\b _\bB_\b,_\b _\bT_\bA_\b _\b>_\b _\b>_\b:_\b:_\bs_\be_\bt_\bM_\ba_\bt_\br_\bi_\bx\n-virtual void setMatrix(const Matrix &mat, const std::set< std::size_t > &mrs)\n-Initialize data from a given set of matrix rows and columns.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn supermatrix.hh:281\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bu_\bp_\be_\br_\bL_\bU_\bM_\ba_\bt_\br_\bi_\bx_\b<_\b _\bB_\bC_\bR_\bS_\bM_\ba_\bt_\br_\bi_\bx_\b<_\b _\bB_\b,_\b _\bT_\bA_\b _\b>_\b _\b>_\b:_\b:_\b~_\bS_\bu_\bp_\be_\br_\bL_\bU_\bM_\ba_\bt_\br_\bi_\bx\n-virtual ~SuperLUMatrix()\n-Destructor.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn supermatrix.hh:219\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bu_\bp_\be_\br_\bM_\ba_\bt_\br_\bi_\bx_\bI_\bn_\bi_\bt_\bi_\ba_\bl_\bi_\bz_\be_\br_\b<_\b _\bB_\bC_\bR_\bS_\bM_\ba_\bt_\br_\bi_\bx_\b<_\b _\bB_\b,_\b _\bA_\b _\b>_\b _\b>_\b:_\b:_\bS_\bu_\bp_\be_\br_\bL_\bU_\bM_\ba_\bt_\br_\bi_\bx\n-Dune::SuperLUMatrix< Matrix > SuperLUMatrix\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn supermatrix.hh:320\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bu_\bp_\be_\br_\bM_\ba_\bt_\br_\bi_\bx_\bI_\bn_\bi_\bt_\bi_\ba_\bl_\bi_\bz_\be_\br_\b<_\b _\bB_\bC_\bR_\bS_\bM_\ba_\bt_\br_\bi_\bx_\b<_\b _\bB_\b,_\b _\bA_\b _\b>_\b _\b>_\b:_\b:_\bM_\ba_\bt_\br_\bi_\bx\n-BCRSMatrix< B, A > Matrix\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn supermatrix.hh:319\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bu_\bp_\be_\br_\bM_\ba_\bt_\br_\bi_\bx_\bI_\bn_\bi_\bt_\bi_\ba_\bl_\bi_\bz_\be_\br_\b<_\b _\bB_\bC_\bR_\bS_\bM_\ba_\bt_\br_\bi_\bx_\b<_\b _\bB_\b,_\b _\bA_\b _\b>_\b _\b>_\b:_\b:_\bS_\bu_\bp_\be_\br_\bM_\ba_\bt_\br_\bi_\bx_\bI_\bn_\bi_\bt_\bi_\ba_\bl_\bi_\bz_\be_\br\n-SuperMatrixInitializer()\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn supermatrix.hh:326\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bu_\bp_\be_\br_\bM_\ba_\bt_\br_\bi_\bx_\bI_\bn_\bi_\bt_\bi_\ba_\bl_\bi_\bz_\be_\br_\b<_\b _\bB_\bC_\bR_\bS_\bM_\ba_\bt_\br_\bi_\bx_\b<_\b _\bB_\b,_\b _\bA_\b _\b>_\b _\b>_\b:_\b:_\bc_\br_\be_\ba_\bt_\be_\bM_\ba_\bt_\br_\bi_\bx\n-virtual void createMatrix() const\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn supermatrix.hh:329\n-_\bD_\bu_\bn_\be_\b:_\b:_\bS_\bu_\bp_\be_\br_\bM_\ba_\bt_\br_\bi_\bx_\bI_\bn_\bi_\bt_\bi_\ba_\bl_\bi_\bz_\be_\br_\b<_\b _\bB_\bC_\bR_\bS_\bM_\ba_\bt_\br_\bi_\bx_\b<_\b _\bB_\b,_\b _\bA_\b _\b>_\b _\b>_\b:_\b:_\bS_\bu_\bp_\be_\br_\bM_\ba_\bt_\br_\bi_\bx_\bI_\bn_\bi_\bt_\bi_\ba_\bl_\bi_\bz_\be_\br\n-SuperMatrixInitializer(SuperLUMatrix &lum)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn supermatrix.hh:322\n+_\bD_\bu_\bn_\be_\b:_\b:_\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+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+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+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+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+_\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/a00017.html", "source2": "./usr/share/doc/libdune-istl-doc/doxygen/a00017.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n
Simple iterative methods like Jacobi, Gauss-Seidel, SOR, SSOR, etc. in a generic way. \n+
Provides classes for reading and writing MatrixMarket Files with an extension for parallel matrices. \n More...
\n-#include <cmath>#include <algorithm>#include <complex>#include <cstddef>#include <fstream>#include <ios>#include <iostream>#include <iomanip>#include <istream>#include <limits>#include <ostream>#include <set>#include <sstream>#include <string>#include <tuple>#include <type_traits>#include <vector>#include <dune/common/exceptions.hh>#include <dune/common/fmatrix.hh>#include <dune/common/fvector.hh>#include <dune/common/hybridutilities.hh>#include "multitypeblockvector.hh"#include "multitypeblockmatrix.hh"#include "istlexception.hh"#include <dune/common/stdstreams.hh>#include <dune/common/simd/simd.hh>#include <dune/istl/bcrsmatrix.hh>#include <dune/istl/bvector.hh>#include <dune/istl/matrixutils.hh>#include <dune/istl/owneroverlapcopy.hh>Go to the source code of this file.
\n\n Namespaces | |
| namespace | Dune |
| namespace | Dune::MatrixMarketImpl |
\n Functions | |
| template<class M , class X , class Y > | |
| void | Dune::bltsolve (const M &A, X &v, const Y &d) |
| block lower triangular solve | |
| template<class M , class X , class Y , class K > | |
| void | Dune::bltsolve (const M &A, X &v, const Y &d, const K &w) |
| relaxed block lower triangular solve | |
| template<class M , class X , class Y > | |
| void | Dune::ubltsolve (const M &A, X &v, const Y &d) |
| unit block lower triangular solve | |
| template<class M , class X , class Y , class K > | |
| void | Dune::ubltsolve (const M &A, X &v, const Y &d, const K &w) |
| relaxed unit block lower triangular solve | |
| template<class M , class X , class Y > | |
| void | Dune::butsolve (const M &A, X &v, const Y &d) |
| block upper triangular solve | |
| template<class M , class X , class Y , class K > | |
| void | Dune::butsolve (const M &A, X &v, const Y &d, const K &w) |
| relaxed block upper triangular solve | |
| template<class M , class X , class Y > | |
| void | Dune::ubutsolve (const M &A, X &v, const Y &d) |
| unit block upper triangular solve | |
| template<class M , class X , class Y , class K > | |
| void | Dune::ubutsolve (const M &A, X &v, const Y &d, const K &w) |
| relaxed unit block upper triangular solve | |
| template<class M , class X , class Y , int l> | |
| void | Dune::bltsolve (const M &A, X &v, const Y &d, BL< l >) |
| block lower triangular solve | |
| template<class M , class X , class Y , class K , int l> | |
| void | Dune::bltsolve (const M &A, X &v, const Y &d, const K &w, BL< l >) |
| relaxed block lower triangular solve | |
| template<class M , class X , class Y , int l> | |
| void | Dune::ubltsolve (const M &A, X &v, const Y &d, BL< l >) |
| unit block lower triangular solve | |
| template<class M , class X , class Y , class K , int l> | |
| void | Dune::ubltsolve (const M &A, X &v, const Y &d, const K &w, BL< l >) |
| relaxed unit block lower triangular solve | |
| template<class M , class X , class Y , int l> | |
| void | Dune::butsolve (const M &A, X &v, const Y &d, BL< l > bl) |
| block upper triangular solve | |
| template<class M , class X , class Y , class K , int l> | |
| void | Dune::butsolve (const M &A, X &v, const Y &d, const K &w, BL< l > bl) |
| relaxed block upper triangular solve | |
| template<class M , class X , class Y , int l> | |
| void | Dune::ubutsolve (const M &A, X &v, const Y &d, BL< l > bl) |
| unit block upper triangular solve | |
| template<class M , class X , class Y , class K , int l> | |
| void | Dune::ubutsolve (const M &A, X &v, const Y &d, const K &w, BL< l > bl) |
| relaxed unit block upper triangular solve | |
| template<class M , class X , class Y > | |
| void | Dune::bdsolve (const M &A, X &v, const Y &d) |
| block diagonal solve, no relaxation | |
| template<class M , class X , class Y , class K > | |
| void | Dune::bdsolve (const M &A, X &v, const Y &d, const K &w) |
| block diagonal solve, with relaxation | |
| template<class M , class X , class Y , int l> | |
| void | Dune::bdsolve (const M &A, X &v, const Y &d, BL< l >) |
| block diagonal solve, no relaxation | |
| template<class M , class X , class Y , class K , int l> | |
| void | Dune::bdsolve (const M &A, X &v, const Y &d, const K &w, BL< l >) |
| block diagonal solve, with relaxation | |
| template<class M , class X , class Y , class K > | |
| void | Dune::dbgs (const M &A, X &x, const Y &b, const K &w) |
| GS step. | |
| template<class M , class X , class Y , class K , int l> | |
| void | Dune::dbgs (const M &A, X &x, const Y &b, const K &w, BL< l >) |
| GS step. | |
| template<class M , class X , class Y , class K > | |
| void | Dune::bsorf (const M &A, X &x, const Y &b, const K &w) |
| SOR step. | |
| template<class M , class X , class Y , class K , int l> | |
| void | Dune::bsorf (const M &A, X &x, const Y &b, const K &w, BL< l >) |
| SOR step. | |
| template<class M , class X , class Y , class K > | |
| void | Dune::bsorb (const M &A, X &x, const Y &b, const K &w) |
| SSOR step. | |
| template<class M , class X , class Y , class K , int l> | |
| void | Dune::bsorb (const M &A, X &x, const Y &b, const K &w, BL< l >) |
| Backward SOR step. | |
| template<class M , class X , class Y , class K > | |
| void | Dune::dbjac (const M &A, X &x, const Y &b, const K &w) |
| Jacobi step. | |
| template<class M , class X , class Y , class K , int l> | |
| void | Dune::dbjac (const M &A, X &x, const Y &b, const K &w, BL< l >) |
| Jacobi step. | |
| bool | Dune::MatrixMarketImpl::lineFeed (std::istream &file) |
| void | Dune::MatrixMarketImpl::skipComments (std::istream &file) |
| bool | Dune::MatrixMarketImpl::readMatrixMarketBanner (std::istream &file, MMHeader &mmHeader) |
| template<std::size_t brows, std::size_t bcols> | |
| std::tuple< std::size_t, std::size_t, std::size_t > | Dune::MatrixMarketImpl::calculateNNZ (std::size_t rows, std::size_t cols, std::size_t entries, const MMHeader &header) |
| template<typename T > | |
| std::istream & | Dune::MatrixMarketImpl::operator>> (std::istream &is, NumericWrapper< T > &num) |
| std::istream & | Dune::MatrixMarketImpl::operator>> (std::istream &is, NumericWrapper< PatternDummy > &num) |
| template<typename T > | |
| bool | Dune::MatrixMarketImpl::operator< (const IndexData< T > &i1, const IndexData< T > &i2) |
| LessThan operator. | |
| template<typename T > | |
| std::istream & | Dune::MatrixMarketImpl::operator>> (std::istream &is, IndexData< T > &data) |
| Read IndexData from a stream. | |
| template<typename T > | |
| std::istream & | Dune::MatrixMarketImpl::operator>> (std::istream &is, IndexData< NumericWrapper< std::complex< T > > > &data) |
| Read IndexData from a stream. Specialization for std::complex. | |
| template<class T > | |
| std::enable_if_t<!is_complex< T >::value, T > | Dune::MatrixMarketImpl::conj (const T &r) |
| template<class T > | |
| std::enable_if_t< is_complex< T >::value, T > | Dune::MatrixMarketImpl::conj (const T &r) |
| template<typename T , typename A , typename D > | |
| void | Dune::MatrixMarketImpl::readSparseEntries (Dune::BCRSMatrix< T, A > &matrix, std::istream &file, std::size_t entries, const MMHeader &mmHeader, const D &) |
| std::tuple< std::string, std::string > | Dune::MatrixMarketImpl::splitFilename (const std::string &filename) |
| void | Dune::mm_read_header (std::size_t &rows, std::size_t &cols, MatrixMarketImpl::MMHeader &header, std::istream &istr, bool isVector) |
| template<typename T , typename A > | |
| void | Dune::mm_read_vector_entries (Dune::BlockVector< T, A > &vector, std::size_t size, std::istream &istr, size_t lane) |
| template<typename T , typename A , int entries> | |
| void | Dune::mm_read_vector_entries (Dune::BlockVector< Dune::FieldVector< T, entries >, A > &vector, std::size_t size, std::istream &istr, size_t lane) |
| template<typename T , typename A > | |
| void | Dune::readMatrixMarket (Dune::BlockVector< T, A > &vector, std::istream &istr) |
| Reads a BlockVector from a matrix market file. | |
| template<typename T , typename A > | |
| void | Dune::readMatrixMarket (Dune::BCRSMatrix< T, A > &matrix, std::istream &istr) |
| Reads a sparse matrix from a matrix market file. | |
| template<typename B > | |
| void | Dune::mm_print_entry (const B &entry, std::size_t rowidx, std::size_t colidx, std::ostream &ostr) |
| template<typename V > | |
| void | Dune::mm_print_vector_entry (const V &entry, std::ostream &ostr, const std::integral_constant< int, 1 > &, size_t lane) |
| template<typename V > | |
| void | Dune::mm_print_vector_entry (const V &vector, std::ostream &ostr, const std::integral_constant< int, 0 > &, size_t lane) |
| template<typename T , typename A > | |
| std::size_t | Dune::countEntries (const BlockVector< T, A > &vector) |
| template<typename T , typename A , int i> | |
| std::size_t | Dune::countEntries (const BlockVector< FieldVector< T, i >, A > &vector) |
| template<typename V > | |
| void | Dune::writeMatrixMarket (const V &vector, std::ostream &ostr, const std::integral_constant< int, 0 > &) |
| template<typename M > | |
| void | Dune::writeMatrixMarket (const M &matrix, std::ostream &ostr, const std::integral_constant< int, 1 > &) |
| template<typename M > | |
| void | Dune::writeMatrixMarket (const M &matrix, std::ostream &ostr) |
| writes a ISTL matrix or vector to a stream in matrix market format. | |
| template<typename M > | |
| void | Dune::storeMatrixMarket (const M &matrix, std::string filename, int prec=default_precision) |
| Stores a parallel matrix/vector in matrix market format in a file. | |
| template<typename M , typename G , typename L > | |
| void | Dune::storeMatrixMarket (const M &matrix, std::string filename, const OwnerOverlapCopyCommunication< G, L > &comm, bool storeIndices=true, int prec=default_precision) |
| Stores a parallel matrix/vector in matrix market format in a file. | |
| template<typename M , typename G , typename L > | |
| void | Dune::loadMatrixMarket (M &matrix, const std::string &filename, OwnerOverlapCopyCommunication< G, L > &comm, bool readIndices=true) |
| Load a parallel matrix/vector stored in matrix market format. | |
| template<typename M > | |
| void | Dune::loadMatrixMarket (M &matrix, const std::string &filename) |
| Load a matrix/vector stored in matrix market format. | |
\n+Variables | |
| static const int | Dune::default_precision = -1 |
Simple iterative methods like Jacobi, Gauss-Seidel, SOR, SSOR, etc. in a generic way.
\n+Provides classes for reading and writing MatrixMarket Files with an extension for parallel matrices.
\n+ 1.9.8\n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,173 +1,316 @@\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 | _\bE_\bn_\bu_\bm_\be_\br_\ba_\bt_\bi_\bo_\bn_\bs | _\bF_\bu_\bn_\bc_\bt_\bi_\bo_\bn_\bs\n-gsetc.hh File Reference\n-Simple iterative methods like Jacobi, Gauss-Seidel, SOR, SSOR, etc. in a\n-generic way. _\bM_\bo_\br_\be_\b._\b._\b.\n-#include 1.9.8\n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,832 +1,1632 @@\n dune-istl\u00a02.9.0\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bi_\bs_\bt_\bl\n-gsetc.hh\n+matrixmarket.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_GSETC_HH\n-6#define DUNE_ISTL_GSETC_HH\n+5#ifndef DUNE_ISTL_MATRIXMARKET_HH\n+6#define DUNE_ISTL_MATRIXMARKET_HH\n 7\n-8#include