duneistl
2.7.1
About: duneistl  DUNE (Distributed and Unified Numerics Environment) is a modular toolbox for solving partial differential equations (PDEs) with gridbased methods: DUNE Iterative Solver Template Library.
Fossies Dox: duneistl2.7.1.tar.gz ("unofficial" and yet experimental doxygengenerated source code documentation) 
Iterative Solvers supporting block recursive matrix and vector classes at compile time. More...
Modules  
Iterative Solvers  
Communication Interface  
Sparse Matrix and Vector classes  
Matrix and Vector classes that support a block recursive structure capable of representing the natural structure from Finite Element discretisations.  
Classes  
class  Dune::ILUSubdomainSolver< M, X, Y > 
base class encapsulating common algorithms of ILU0SubdomainSolver and ILUNSubdomainSolver. More...  
class  Dune::ILU0SubdomainSolver< M, X, Y > 
Exact subdomain solver using ILU(p) with appropriate p. More...  
class  Dune::ILUNSubdomainSolver< M, X, Y > 
class  Dune::ISTLError 
derive error class from the base class in common More...  
class  Dune::BCRSMatrixError 
Error specific to BCRSMatrix. More...  
class  Dune::ImplicitModeOverflowExhausted 
The overflow error used during implicit BCRSMatrix construction was exhausted. More...  
class  Dune::SolverAbort 
Thrown when a solver aborts due to some problem. More...  
Functions  
template<class S >  
std::size_t  Dune::ILUSubdomainSolver< M, X, Y >::copyToLocalMatrix (const M &A, S &rowset) 
Copy the local part of the global matrix to ILU. More...  
template<class S >  
void  Dune::ILU0SubdomainSolver< M, X, Y >::setSubMatrix (const M &A, S &rowset) 
Set the data of the local problem. More...  
template<class S >  
void  Dune::ILUNSubdomainSolver< M, X, Y >::setSubMatrix (const M &A, S &rowset) 
Set the data of the local problem. More...  
Iterative Solvers supporting block recursive matrix and vector classes at compile time.
The Iterative Solver Template Library applies generic programming in C++ to the domain of iterative solvers of linear systems stemming from finite element discretizations. Those discretizations exhibit a lot of structure, e.g:
Our matrix and vector interface supports a block recursive structure. Each sparse matrix entry can itself be either a sparse or a small dense matrix.
The solvers use this recursive block structure via template meta programming at compile time.
ISTL consists of the matrix and vector API and the solvers which use the Preconditioners preconditioners. */
/**

protected 
Copy the local part of the global matrix to ILU.
A  The global matrix. 
rowset  The global indices of the local problem. 
Definition at line 148 of file ilusubdomainsolver.hh.
void Dune::ILU0SubdomainSolver< M, X, Y >::setSubMatrix  (  const M &  A, 
S &  rowset  
) 
Set the data of the local problem.
A  The global matrix. 
rowset  The global indices of the local problem. 
S  The type of the set with the indices. 
Definition at line 218 of file ilusubdomainsolver.hh.
References A, and Dune::bilu0_decomposition().
void Dune::ILUNSubdomainSolver< M, X, Y >::setSubMatrix  (  const M &  A, 
S &  rowset  
) 
Set the data of the local problem.
A  The global matrix. 
rowset  The global indices of the local problem. 
S  The type of the set with the indices. 
Definition at line 226 of file ilusubdomainsolver.hh.
References A, and Dune::bilu_decomposition().