Dune::FieldMatrix< K, 1, 1 > Class Template Reference
[Dense Matrix and Vector Template Library]

#include <fmatrix.hh>

List of all members.


Detailed Description

template<class K>
class Dune::FieldMatrix< K, 1, 1 >

Special type for 1x1 matrices.


Public Types

enum  { blocklevel = 1 }
 We are at the leaf of the block recursion. More...
enum  { rows = 1 , cols = 1 }
 export size More...
typedef K field_type
 export the type representing the field
typedef K block_type
 export the type representing the components
typedef std::size_t size_type
 The type used for index access and size operations.
typedef FieldVector< K, 1 > row_type
 Each row is implemented by a field vector.
typedef FieldIterator< FieldMatrix<
K, n, m >, 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 FieldIterator< const
FieldMatrix< K, n, m >, 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.
row_typeoperator[] (size_type i)
 random access to the rows
const row_typeoperator[] (size_type i) const
 same for read only access
Iterator begin ()
 begin iterator
Iterator end ()
 end iterator
Iterator rbegin ()
 begin iterator
Iterator rend ()
 end iterator
ConstIterator begin () const
 begin iterator
ConstIterator end () const
 end iterator
ConstIterator rbegin () const
 begin iterator
ConstIterator rend () const
 end iterator
FieldMatrixoperator+= (const K &y)
 vector space addition
FieldMatrixoperator-= (const K &y)
 vector space subtraction
FieldMatrixoperator *= (const K &k)
 vector space multiplication with scalar
FieldMatrixoperator/= (const K &k)
 vector space division by scalar
void mv (const FieldVector< K, 1 > &x, FieldVector< K, 1 > &y) const
 y = A x
void umv (const FieldVector< K, 1 > &x, FieldVector< K, 1 > &y) const
 y += A x
void umtv (const FieldVector< K, 1 > &x, FieldVector< K, 1 > &y) const
 y += A^T x
void umhv (const FieldVector< K, 1 > &x, FieldVector< K, 1 > &y) const
 y += A^H x
void mmv (const FieldVector< K, 1 > &x, FieldVector< K, 1 > &y) const
 y -= A x
void mmtv (const FieldVector< K, 1 > &x, FieldVector< K, 1 > &y) const
 y -= A^T x
void mmhv (const FieldVector< K, 1 > &x, FieldVector< K, 1 > &y) const
 y -= A^H x
void usmv (const K &alpha, const FieldVector< K, 1 > &x, FieldVector< K, 1 > &y) const
 y += alpha A x
void usmtv (const K &alpha, const FieldVector< K, 1 > &x, FieldVector< K, 1 > &y) const
 y += alpha A^T x
void usmhv (const K &alpha, const FieldVector< K, 1 > &x, FieldVector< K, 1 > &y) const
 y += alpha A^H x
double frobenius_norm () const
 frobenius norm: sqrt(sum over squared values of entries)
double frobenius_norm2 () const
 square of frobenius norm, need for block recursion
double infinity_norm () const
 infinity norm (row sum norm, how to generalize for blocks?)
double infinity_norm_real () const
 simplified infinity norm (uses Manhattan norm for complex values)
void solve (FieldVector< K, 1 > &x, const FieldVector< K, 1 > &b) const
 Solve system A x = b.
void invert ()
 compute inverse
determinant () const
 calculates the determinant of this matrix
FieldMatrixleftmultiply (const FieldMatrix &M)
 left multiplication
FieldMatrixrightmultiply (const FieldMatrix &M)
 left multiplication
size_type N () const
 number of blocks in row direction
size_type M () const
 number of blocks in column direction
size_type rowdim (size_type r) const
 row dimension of block r
size_type coldim (size_type c) const
 col dimension of block c
size_type rowdim () const
 dimension of the destination vector space
size_type coldim () const
 dimension of the source vector space
bool exists (size_type i, size_type j) const
 return true when (i,j) is in pattern

Member Enumeration Documentation

template<class K>
anonymous enum

We are at the leaf of the block recursion.

Enumerator:
blocklevel  The number of block levels we contain. This is always one for this type.

template<class K>
anonymous enum

export size

Enumerator:
rows  The number of rows. This is always one for this type.
cols  The number of columns. This is always one for this type.


The documentation for this class was generated from the following file:

Generated on 9 Apr 2008 with Doxygen (ver 1.5.2) [logfile].