Reference documentation for deal.II version 8.1.0
Namespaces | Classes
Collaboration diagram for Basic matrices:

Namespaces

 SparseMatrixIterators
 
 ChunkSparseMatrixIterators
 
 BlockMatrixIterators
 

Classes

class  TrilinosWrappers::BlockSparseMatrix
 
class  FullMatrix< number >
 
class  BlockSparseMatrix< number >
 
class  TrilinosWrappers::SparseMatrix
 
class  SparseMatrix< number >
 
class  PETScWrappers::MPI::BlockSparseMatrix
 
class  PETScWrappers::BlockSparseMatrix
 
class  ChunkSparseMatrix< number >
 
class  BlockSparseMatrixEZ< Number >
 
class  PETScWrappers::SparseMatrix
 
class  PETScWrappers::FullMatrix
 
class  IdentityMatrix
 
class  PETScWrappers::MPI::SparseMatrix
 
class  SparseMatrixEZ< number >
 
class  PETScWrappers::MatrixFree
 
class  TridiagonalMatrix< number >
 
class  PETScWrappers::MatrixBase
 
class  LAPACKFullMatrix< number >
 
class  BlockMatrixBase< MatrixType >
 

Detailed Description

These are the actual matrix classes provided by deal.II. It is possible to store values in them and retrieve them. Furthermore, they provide the full interface required by linear solvers (see Linear solver classes).

Among the matrices in this group are full matrices, different sparse matrices, and block matrices. In addition, some of the classes in the interfaces to other linear algebra libraries (for example the PETScWrappers) are matrices.

Most of the deal.II sparse matrix classes are separated from their sparsity patterns, to make storing several matrices with the same sparsity pattern more efficient. See Sparsity patterns for more information.