Reference documentation for deal.II version 8.4.1
Namespaces | Classes

Namespaces

 MPI
 
 SparseMatrixIterators
 

Classes

class  BlockSparseMatrix
 
class  BlockVector
 
class  PreconditionAMG
 
class  PreconditionAMGMueLu
 
class  PreconditionBase
 
class  PreconditionBlockJacobi
 
class  PreconditionBlockSOR
 
class  PreconditionBlockSSOR
 
class  PreconditionBlockwiseDirect
 
class  PreconditionChebyshev
 
class  PreconditionIC
 
class  PreconditionIdentity
 
class  PreconditionILU
 
class  PreconditionILUT
 
class  PreconditionJacobi
 
class  PreconditionSOR
 
class  PreconditionSSOR
 
class  SolverBase
 
class  SolverBicgstab
 
class  SolverCG
 
class  SolverCGS
 
class  SolverDirect
 
class  SolverGMRES
 
class  SolverTFQMR
 
class  SparseMatrix
 
class  SparsityPattern
 
class  Vector
 
class  VectorBase
 

Detailed Description

This class extends the base class to implement an array of Trilinos sparsity patterns that can be used to initialize Trilinos block sparse matrices that can be distributed among different processors. It is used in the same way as the BlockSparsityPattern except that it builds upon the TrilinosWrappers::SparsityPattern instead of the SparsityPattern. See the documentation of the BlockSparsityPattern for examples.

This class is has properties of the "dynamic" type of Sparsity patterns (in the sense that it can extend the memory if too little elements were allocated), but otherwise is more like the basic deal.II SparsityPattern (in the sense that the method compress() needs to be called before the pattern can be used).

This class is used in step-32.

Author
Martin Kronbichler, 2008, 2009