TrilinosWrappers Namespace Reference
[Sparsity patternsTrilinosWrappers]


Classes

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

Namespaces

namespace  MPI
namespace  MatrixIterators
namespace  SparsityPatternIterators


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

deal.II documentation generated on Wed Jul 28 23:07:02 2010 by doxygen 1.5.6