|
dune-common
2.2.0
|
A dense n x m matrix. More...
#include <dune/common/fmatrix.hh>
Public Types | |
| enum | { rows = ROWS, cols = COLS } |
| export size More... | |
| typedef Base::size_type | size_type |
| The type used for the index access and size operation. | |
| typedef Base::row_type | row_type |
| The type used to represent a row (must fulfill the Dune::DenseVector interface) | |
| typedef Base::row_reference | row_reference |
| The type used to represent a reference to a row (usually row_type &) | |
| typedef Base::const_row_reference | const_row_reference |
| The type used to represent a reference to a constant row (usually const row_type &) | |
| enum | |
| We are at the leaf of the block recursion. More... | |
| typedef Traits::derived_type | derived_type |
| type of derived matrix class | |
| typedef Traits::value_type | value_type |
| export the type representing the field | |
| typedef Traits::value_type | field_type |
| export the type representing the field | |
| typedef Traits::value_type | block_type |
| export the type representing the components | |
| typedef DenseIterator < DenseMatrix, row_type > | Iterator |
| Iterator class for sequential access. | |
| typedef Iterator | iterator |
| typedef for stl compliant access | |
| typedef Iterator | RowIterator |
| rename the iterators for easier access | |
| typedef row_type::Iterator | ColIterator |
| rename the iterators for easier access | |
| typedef DenseIterator< const DenseMatrix, const row_type > | ConstIterator |
| Iterator class for sequential access. | |
| typedef ConstIterator | const_iterator |
| typedef for stl compliant access | |
| typedef ConstIterator | ConstRowIterator |
| rename the iterators for easier access | |
| typedef row_type::ConstIterator | ConstColIterator |
| rename the iterators for easier access | |
Public Member Functions | |
| FieldMatrix () | |
| Default constructor. | |
| FieldMatrix (const K &k) | |
| Constructor initializing the whole matrix with a scalar. | |
| template<typename T > | |
| FieldMatrix (const T &t) | |
| template<int l> | |
| FieldMatrix< K, l, cols > | leftmultiplyany (const FieldMatrix< K, l, rows > &M) const |
| Multiplies M from the left to this matrix, this matrix is not modified. | |
| FieldMatrix & | rightmultiply (const FieldMatrix< K, cols, cols > &M) |
| Multiplies M from the right to this matrix. | |
| template<int l> | |
| FieldMatrix< K, rows, l > | rightmultiplyany (const FieldMatrix< K, cols, l > &M) const |
| Multiplies M from the right to this matrix, this matrix is not modified. | |
| size_type | mat_rows () const |
| size_type | mat_cols () const |
| row_reference | mat_access (size_type i) |
| const_row_reference | mat_access (size_type i) const |
| row_reference | operator[] (size_type i) |
| random access | |
| const_row_reference | operator[] (size_type i) const |
| size_type | size () const |
| size method (number of rows) | |
| Iterator | begin () |
| begin iterator | |
| ConstIterator | begin () const |
| begin iterator | |
| Iterator | end () |
| end iterator | |
| ConstIterator | end () const |
| end iterator | |
| Iterator | beforeEnd () |
| ConstIterator | beforeEnd () const |
| Iterator | beforeBegin () |
| ConstIterator | beforeBegin () const |
| DenseMatrix & | operator+= (const DenseMatrix< Other > &y) |
| vector space addition | |
| DenseMatrix & | operator-= (const DenseMatrix< Other > &y) |
| vector space subtraction | |
| DenseMatrix & | operator*= (const field_type &k) |
| vector space multiplication with scalar | |
| DenseMatrix & | operator/= (const field_type &k) |
| vector space division by scalar | |
| DenseMatrix & | axpy (const field_type &k, const DenseMatrix< Other > &y) |
| vector space axpy operation (*this += k y) | |
| bool | operator== (const DenseMatrix< Other > &y) const |
| Binary matrix comparison. | |
| bool | operator!= (const DenseMatrix< Other > &y) const |
| Binary matrix incomparison. | |
| void | mv (const X &x, Y &y) const |
| y = A x | |
| void | mtv (const X &x, Y &y) const |
| y = A^T x | |
| void | umv (const X &x, Y &y) const |
| y += A x | |
| void | umtv (const X &x, Y &y) const |
| y += A^T x | |
| void | umhv (const X &x, Y &y) const |
| y += A^H x | |
| void | mmv (const X &x, Y &y) const |
| y -= A x | |
| void | mmtv (const X &x, Y &y) const |
| y -= A^T x | |
| void | mmhv (const X &x, Y &y) const |
| y -= A^H x | |
| void | usmv (const field_type &alpha, const X &x, Y &y) const |
| y += alpha A x | |
| void | usmtv (const field_type &alpha, const X &x, Y &y) const |
| y += alpha A^T x | |
| void | usmhv (const field_type &alpha, const X &x, Y &y) const |
| y += alpha A^H x | |
| FieldTraits< value_type > ::real_type | frobenius_norm () const |
| frobenius norm: sqrt(sum over squared values of entries) | |
| FieldTraits< value_type > ::real_type | frobenius_norm2 () const |
| square of frobenius norm, need for block recursion | |
| FieldTraits< value_type > ::real_type | infinity_norm () const |
| infinity norm (row sum norm, how to generalize for blocks?) | |
| FieldTraits< value_type > ::real_type | infinity_norm_real () const |
| simplified infinity norm (uses Manhattan norm for complex values) | |
| void | solve (V &x, const V &b) const |
| Solve system A x = b. | |
| void | invert () |
| Compute inverse. | |
| field_type | determinant () const |
| calculates the determinant of this matrix | |
| FieldMatrix< K, ROWS, COLS > & | leftmultiply (const DenseMatrix< M2 > &M) |
| Multiplies M from the left to this matrix. | |
| FieldMatrix< K, ROWS, COLS > & | rightmultiply (const DenseMatrix< M2 > &M) |
| Multiplies M from the right to this matrix. | |
| size_type | N () const |
| number of rows | |
| size_type | M () const |
| number of columns | |
| size_type | rows () const |
| number of rows | |
| size_type | cols () const |
| number of columns | |
| bool | exists (size_type i, size_type j) const |
| return true when (i,j) is in pattern | |
A dense n x m matrix.
Matrices represent linear maps from a vector space V to a vector space W. This class represents such a linear map by storing a two-dimensional array of numbers of a given field type K. The number of rows and columns is given at compile time.
|
inherited |
export the type representing the components
|
inherited |
rename the iterators for easier access
|
inherited |
typedef for stl compliant access
| typedef Base::const_row_reference Dune::FieldMatrix< K, ROWS, COLS >::const_row_reference |
The type used to represent a reference to a constant row (usually const row_type &)
Reimplemented from Dune::DenseMatrix< FieldMatrix< K, ROWS, COLS > >.
|
inherited |
rename the iterators for easier access
|
inherited |
Iterator class for sequential access.
|
inherited |
rename the iterators for easier access
|
inherited |
type of derived matrix class
|
inherited |
export the type representing the field
|
inherited |
Iterator class for sequential access.
|
inherited |
typedef for stl compliant access
| typedef Base::row_reference Dune::FieldMatrix< K, ROWS, COLS >::row_reference |
The type used to represent a reference to a row (usually row_type &)
Reimplemented from Dune::DenseMatrix< FieldMatrix< K, ROWS, COLS > >.
| typedef Base::row_type Dune::FieldMatrix< K, ROWS, COLS >::row_type |
The type used to represent a row (must fulfill the Dune::DenseVector interface)
Reimplemented from Dune::DenseMatrix< FieldMatrix< K, ROWS, COLS > >.
|
inherited |
rename the iterators for easier access
| typedef Base::size_type Dune::FieldMatrix< K, ROWS, COLS >::size_type |
The type used for the index access and size operation.
Reimplemented from Dune::DenseMatrix< FieldMatrix< K, ROWS, COLS > >.
|
inherited |
export the type representing the field
| anonymous enum |
|
inherited |
We are at the leaf of the block recursion.
|
inline |
Default constructor.
|
inlineexplicit |
Constructor initializing the whole matrix with a scalar.
|
inlineexplicit |
|
inlineinherited |
vector space axpy operation (*this += k y)
|
inlineinherited |
|
inlineinherited |
|
inlineinherited |
|
inlineinherited |
|
inlineinherited |
begin iterator
|
inlineinherited |
begin iterator
|
inlineinherited |
number of columns
Referenced by Dune::FieldMatrix< T, n, m >::leftmultiplyany(), Dune::FieldMatrix< T, n, m >::rightmultiply(), and Dune::FieldMatrix< T, n, m >::rightmultiplyany().
|
inherited |
calculates the determinant of this matrix
|
inlineinherited |
end iterator
|
inlineinherited |
end iterator
|
inlineinherited |
return true when (i,j) is in pattern
|
inlineinherited |
frobenius norm: sqrt(sum over squared values of entries)
|
inlineinherited |
square of frobenius norm, need for block recursion
|
inlineinherited |
infinity norm (row sum norm, how to generalize for blocks?)
|
inlineinherited |
simplified infinity norm (uses Manhattan norm for complex values)
|
inherited |
Compute inverse.
| FMatrixError | if the matrix is singular |
|
inlineinherited |
Multiplies M from the left to this matrix.
|
inline |
Multiplies M from the left to this matrix, this matrix is not modified.
|
inlineinherited |
number of columns
|
inline |
|
inline |
|
inline |
|
inline |
|
inlineinherited |
y -= A^H x
|
inlineinherited |
y -= A^T x
|
inlineinherited |
y -= A x
|
inlineinherited |
y = A^T x
|
inlineinherited |
y = A x
|
inlineinherited |
number of rows
|
inlineinherited |
Binary matrix incomparison.
|
inlineinherited |
vector space multiplication with scalar
|
inlineinherited |
vector space addition
|
inlineinherited |
vector space subtraction
|
inlineinherited |
vector space division by scalar
|
inlineinherited |
Binary matrix comparison.
|
inlineinherited |
random access
|
inlineinherited |
|
inline |
Multiplies M from the right to this matrix.
|
inlineinherited |
Multiplies M from the right to this matrix.
|
inline |
Multiplies M from the right to this matrix, this matrix is not modified.
|
inlineinherited |
|
inlineinherited |
size method (number of rows)
|
inherited |
Solve system A x = b.
| FMatrixError | if the matrix is singular |
|
inlineinherited |
y += A^H x
|
inlineinherited |
y += A^T x
|
inlineinherited |
y += A x
|
inlineinherited |
y += alpha A^H x
|
inlineinherited |
y += alpha A^T x
|
inlineinherited |
y += alpha A x
1.8.1