Dune::FieldVector< K, SIZE > Class Template Reference
[Dense Matrix and Vector Template Library]
#include <fvector.hh>
Detailed Description
template<class K, int SIZE>
class Dune::FieldVector< K, SIZE >
Construct a vector space out of a tensor product of fields.
K is the field type (use float, double, complex, etc) and n is the number of components.
It is generally assumed that K is a numerical type compatible with double (E.g. norms are always computed in double precision).
Public Types | |
enum | { blocklevel = 1 } |
We are at the leaf of the block recursion. More... | |
enum | { size = SIZE } |
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 the index access and size operation. | |
typedef FieldIterator< FieldVector< K, SIZE >, K > | Iterator |
Iterator class for sequential access. | |
typedef Iterator | iterator |
typedef for stl compliant access | |
typedef FieldIterator< const FieldVector< K, SIZE >, const K > | ConstIterator |
ConstIterator class for sequential access. | |
typedef ConstIterator | const_iterator |
typedef for stl compliant access | |
Public Member Functions | |
FieldVector () | |
Constructor making uninitialized vector. | |
FieldVector (const K &t) | |
Constructor making vector with identical coordinates. | |
FieldVector & | operator= (const K &k) |
Assignment operator for scalar. | |
K & | operator[] (size_type i) |
random access | |
const K & | operator[] (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 | |
Iterator | find (size_type i) |
return iterator to given element or end() | |
ConstIterator | begin () const |
begin ConstIterator | |
ConstIterator | end () const |
end ConstIterator | |
ConstIterator | rbegin () const |
begin ConstIterator | |
ConstIterator | rend () const |
end ConstIterator | |
ConstIterator | find (size_type i) const |
return iterator to given element or end() | |
FieldVector & | operator+= (const FieldVector &y) |
vector space addition | |
FieldVector & | operator-= (const FieldVector &y) |
vector space subtraction | |
FieldVector< K, size > | operator+ (const FieldVector< K, size > &b) const |
Binary vector addition. | |
FieldVector< K, size > | operator- (const FieldVector< K, size > &b) const |
Binary vector subtraction. | |
FieldVector & | operator+= (const K &k) |
vector space add scalar to all comps | |
FieldVector & | operator-= (const K &k) |
vector space subtract scalar from all comps | |
FieldVector & | operator *= (const K &k) |
vector space multiplication with scalar | |
FieldVector & | operator/= (const K &k) |
vector space division by scalar | |
bool | operator== (const FieldVector &y) const |
Binary vector comparison. | |
FieldVector & | axpy (const K &a, const FieldVector &y) |
vector space axpy operation | |
K | operator * (const FieldVector &y) const |
scalar product | |
double | one_norm () const |
one norm (sum over absolute values of entries) | |
double | one_norm_real () const |
simplified one norm (uses Manhattan norm for complex values) | |
double | two_norm () const |
two norm sqrt(sum over squared values of entries) | |
double | two_norm2 () const |
square of two norm (sum over squared values of entries), need for block recursion | |
double | infinity_norm () const |
infinity norm (maximum of absolute values of entries) | |
double | infinity_norm_real () const |
simplified infinity norm (uses Manhattan norm for complex values) | |
size_type | N () const |
number of blocks in the vector (are of size 1 here) | |
size_type | dim () const |
dimension of the vector space |
Member Enumeration Documentation
template<class K, int SIZE>
anonymous enum |
The documentation for this class was generated from the following file: