Classes |
struct | Dune::CompressionStatistics< size_type > |
| Statistics about compression achieved in implicit mode. More...
|
class | Dune::ImplicitMatrixBuilder< M_ > |
| A wrapper for uniform access to the BCRSMatrix during and after the build stage in implicit build mode. More...
|
class | Dune::BCRSMatrix< B, A > |
| A sparse block matrix with compressed row storage. More...
|
class | Dune::BDMatrix< B, A > |
| A block-diagonal matrix. More...
|
class | Dune::BTDMatrix< B, A > |
| A block-tridiagonal matrix. More...
|
class | Dune::BlockVector< B, A > |
| A vector of blocks with memory management. More...
|
class | Dune::Matrix< T, A > |
| A generic dynamic dense matrix. More...
|
struct | Dune::MatMultMatResult< M1, M2 > |
| Helper TMP to get the result type of a sparse matrix matrix multiplication ( ) More...
|
struct | Dune::MatMultMatResult< FieldMatrix< T, n, k >, FieldMatrix< T, k, m > > |
struct | Dune::MatMultMatResult< BCRSMatrix< FieldMatrix< T, n, k >, A >, BCRSMatrix< FieldMatrix< T, k, m >, A1 > > |
struct | Dune::TransposedMatMultMatResult< M1, M2 > |
| Helper TMP to get the result type of a sparse matrix matrix multiplication ( ) More...
|
struct | Dune::TransposedMatMultMatResult< FieldMatrix< T, k, n >, FieldMatrix< T, k, m > > |
struct | Dune::TransposedMatMultMatResult< BCRSMatrix< FieldMatrix< T, k, n >, A >, BCRSMatrix< FieldMatrix< T, k, m >, A1 > > |
struct | Dune::CheckIfDiagonalPresent< Matrix, blocklevel, l > |
| Check whether the a matrix has diagonal values on blocklevel recursion levels. More...
|
struct | Dune::CheckIfDiagonalPresent< Matrix, 0, l > |
struct | Dune::CheckIfDiagonalPresent< MultiTypeBlockMatrix< T1, T2, T3, T4, T5, T6, T7, T8, T9 >, blocklevel, l > |
class | Dune::VariableBlockVector< B, A > |
| A Vector of blocks with different blocksizes. More...
|
Typedefs |
typedef BCRSMatrix
< FieldMatrix< T, n, m >, A >
::CreateIterator | Dune::SparsityPatternInitializer< T, A, n, m >::CreateIterator |
typedef BCRSMatrix
< FieldMatrix< T, n, m >, A >
::size_type | Dune::SparsityPatternInitializer< T, A, n, m >::size_type |
typedef Dune::BCRSMatrix
< FieldMatrix< T, n, m >, TA > | Dune::MatrixInitializer< transpose, T, TA, n, m >::Matrix |
typedef Matrix::CreateIterator | Dune::MatrixInitializer< transpose, T, TA, n, m >::CreateIterator |
typedef Matrix::size_type | Dune::MatrixInitializer< transpose, T, TA, n, m >::size_type |
typedef Dune::BCRSMatrix
< Dune::FieldMatrix< T, n, m >
, TA > | Dune::MatrixInitializer< 1, T, TA, n, m >::Matrix |
typedef Matrix::CreateIterator | Dune::MatrixInitializer< 1, T, TA, n, m >::CreateIterator |
typedef Matrix::size_type | Dune::MatrixInitializer< 1, T, TA, n, m >::size_type |
typedef BCRSMatrix
< FieldMatrix< T, n, m >, A > | Dune::EntryAccumulatorFather< T, A, n, m >::Matrix |
typedef Matrix::RowIterator | Dune::EntryAccumulatorFather< T, A, n, m >::Row |
typedef Matrix::ColIterator | Dune::EntryAccumulatorFather< T, A, n, m >::Col |
typedef BCRSMatrix
< FieldMatrix< T, n, m >, A > | Dune::EntryAccumulator< T, A, n, m, transpose >::Matrix |
typedef Matrix::size_type | Dune::EntryAccumulator< T, A, n, m, transpose >::size_type |
typedef BCRSMatrix
< FieldMatrix< T, n, m >, A > | Dune::EntryAccumulator< T, A, n, m, 0 >::Matrix |
typedef Matrix::size_type | Dune::EntryAccumulator< T, A, n, m, 0 >::size_type |
typedef BCRSMatrix
< FieldMatrix< T, n, m >, A > | Dune::EntryAccumulator< T, A, n, m, 1 >::Matrix |
typedef Matrix::size_type | Dune::EntryAccumulator< T, A, n, m, 1 >::size_type |
typedef BCRSMatrix
< FieldMatrix< T, n, m >, A > | Dune::EntryAccumulator< T, A, n, m, 2 >::Matrix |
typedef Matrix::size_type | Dune::EntryAccumulator< T, A, n, m, 2 >::size_type |
typedef FieldMatrix< T, n, m > | Dune::MatMultMatResult< FieldMatrix< T, n, k >, FieldMatrix< T, k, m > >::type |
typedef BCRSMatrix< typename
MatMultMatResult< FieldMatrix
< T, n, k >, FieldMatrix< T, k,
m > >::type, std::allocator
< typename MatMultMatResult
< FieldMatrix< T, n, k >
, FieldMatrix< T, k, m >
>::type > > | Dune::MatMultMatResult< BCRSMatrix< FieldMatrix< T, n, k >, A >, BCRSMatrix< FieldMatrix< T, k, m >, A1 > >::type |
typedef FieldMatrix< T, n, m > | Dune::TransposedMatMultMatResult< FieldMatrix< T, k, n >, FieldMatrix< T, k, m > >::type |
typedef BCRSMatrix< typename
MatMultMatResult< FieldMatrix
< T, n, k >, FieldMatrix< T, k,
m > >::type, std::allocator
< typename MatMultMatResult
< FieldMatrix< T, n, k >
, FieldMatrix< T, k, m >
>::type > > | Dune::TransposedMatMultMatResult< BCRSMatrix< FieldMatrix< T, k, n >, A >, BCRSMatrix< FieldMatrix< T, k, m >, A1 > >::type |
Functions |
template<class T , class A , class A1 , class A2 , int n, int m, int k> |
void | Dune::matMultTransposeMat (BCRSMatrix< FieldMatrix< T, n, k >, A > &res, const BCRSMatrix< FieldMatrix< T, n, m >, A1 > &mat, const BCRSMatrix< FieldMatrix< T, k, m >, A2 > &matt, bool tryHard=false) |
| Calculate product of a sparse matrix with a transposed sparse matrices ( ).
|
template<class T , class A , class A1 , class A2 , int n, int m, int k> |
void | Dune::matMultMat (BCRSMatrix< FieldMatrix< T, n, m >, A > &res, const BCRSMatrix< FieldMatrix< T, n, k >, A1 > &mat, const BCRSMatrix< FieldMatrix< T, k, m >, A2 > &matt, bool tryHard=false) |
| Calculate product of two sparse matrices ( ).
|
template<class T , class A , class A1 , class A2 , int n, int m, int k> |
void | Dune::transposeMatMultMat (BCRSMatrix< FieldMatrix< T, n, m >, A > &res, const BCRSMatrix< FieldMatrix< T, k, n >, A1 > &mat, const BCRSMatrix< FieldMatrix< T, k, m >, A2 > &matt, bool tryHard=false) |
| Calculate product of a transposed sparse matrix with another sparse matrices ( ).
|
template<class M > |
int | Dune::countNonZeros (const M &matrix) |
| Get the number of nonzero fields in the matrix.
|
The interface of our matrices is designed according to what they represent from a mathematical point of view. The vector classes are representations of vector spaces:
template<class M >
int Dune::countNonZeros |
( |
const M & |
matrix | ) |
|
|
inline |
Get the number of nonzero fields in the matrix.
This is not the number of nonzero blocks, but the number of non zero scalar entries (on blocklevel 1) if the matrix is viewed as a flat matrix.
For FieldMatrix this is simply the number of columns times the number of rows, for a BCRSMatrix<FieldMatrix<K,n,m>> this is the number of nonzero blocks time n*m.
References count.
Referenced by Dune::Amg::MatrixHierarchy< M, PI, A >::build(), and Dune::writeMatrixMarket().