|
| enum | |
| | We are at the leaf of the block recursion.
|
| |
|
typedef Traits::derived_type | derived_type |
| | type of derived matrix class
|
| |
|
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 Traits::row_reference | row_reference |
| | The type used to represent a reference to a row (usually row_type &)
|
| |
|
typedef Traits::const_row_reference | const_row_reference |
| | The type used to represent a reference to a constant row (usually const row_type &)
|
| |
|
typedef DenseIterator< DenseMatrix, row_type, row_reference > | Iterator |
| | Iterator class for sequential access.
|
| |
|
typedef Iterator | iterator |
| | typedef for stl compliant access
|
| |
|
typedef Iterator | RowIterator |
| | rename the iterators for easier access
|
| |
|
typedef remove_reference< row_reference >::type::Iterator | ColIterator |
| | rename the iterators for easier access
|
| |
|
typedef DenseIterator< const DenseMatrix, const row_type, const_row_reference > | 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 remove_reference< const_row_reference >::type::ConstIterator | ConstColIterator |
| | rename the iterators for easier access
|
| |
|
|
| DynamicMatrix () |
| | Default constructor.
|
| |
|
| DynamicMatrix (size_type r, size_type c, value_type v=value_type()) |
| | Constructor initializing the whole matrix with a scalar.
|
| |
|
row_reference | operator[] (size_type i) |
| | random access
|
| |
|
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. More...
|
| |
| void | invert () |
| | Compute inverse. More...
|
| |
|
field_type | determinant () const |
| | calculates the determinant of this matrix
|
| |
|
DynamicMatrix< K > & | leftmultiply (const DenseMatrix< M2 > &M) |
| | Multiplies M from the left to this matrix.
|
| |
|
DynamicMatrix< K > & | 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
|
| |
template<class K>
class Dune::DynamicMatrix< K >
Construct a matrix with a dynamic size.
- Template Parameters
-
| K | is the field type (use float, double, complex, etc) |