deal.II version GIT relicensing-1989-gd7a2c90e4e 2024-10-14 01:50:00+00:00
|
Namespaces | |
namespace | BlockMatrixIterators |
namespace | ChunkSparseMatrixIterators |
namespace | std |
STL namespace. | |
namespace | SparseMatrixIterators |
Classes | |
class | BlockMatrixBase< MatrixType > |
class | BlockSparseMatrix< number > |
class | BlockSparseMatrixEZ< Number > |
class | ChunkSparseMatrix< number > |
class | FullMatrix< number > |
class | IdentityMatrix |
class | LAPACKFullMatrix< number > |
class | PETScWrappers::MPI::BlockSparseMatrix |
class | PETScWrappers::FullMatrix |
class | PETScWrappers::MatrixBase |
class | PETScWrappers::MatrixFree |
class | PETScWrappers::SparseMatrix |
class | PETScWrappers::MPI::SparseMatrix |
class | ScaLAPACKMatrix< NumberType > |
class | SparseMatrix< number > |
class | SparseMatrixEZ< number > |
class | TridiagonalMatrix< number > |
class | TrilinosWrappers::BlockSparseMatrix |
class | TrilinosWrappers::SparseMatrix |
class | LinearAlgebra::TpetraWrappers::BlockSparseMatrix< Number, MemorySpace > |
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.