dune-istl
2.2.0
|
A multiple of the identity matrix of static size. More...
#include <dune/istl/scaledidmatrix.hh>
Public Types | |
enum | { blocklevel = 1 } |
We are at the leaf of the block recursion. More... | |
enum | { rows = n, cols = n } |
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 operations. | |
typedef DiagonalRowVector< K, n > | row_type |
Each row is implemented by a field vector. | |
typedef row_type | reference |
typedef DiagonalRowVectorConst < K, n > | const_row_type |
typedef const_row_type | const_reference |
typedef ContainerWrapperIterator < const WrapperType, reference, 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 row_type::Iterator | ColIterator |
rename the iterators for easier access | |
typedef ContainerWrapperIterator < const WrapperType, const_reference, const_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 const_row_type::ConstIterator | ConstColIterator |
rename the iterators for easier access |
Public Member Functions | |
ScaledIdentityMatrix () | |
Default constructor. | |
ScaledIdentityMatrix (const K &k) | |
Constructor initializing the whole matrix with a scalar. | |
ScaledIdentityMatrix & | operator= (const K &k) |
bool | identical (const ScaledIdentityMatrix< K, n > &other) const |
Iterator | begin () |
begin iterator | |
Iterator | end () |
end iterator | |
Iterator | beforeEnd () |
Iterator | beforeBegin () |
ConstIterator | begin () const |
begin iterator | |
ConstIterator | end () const |
end iterator | |
ConstIterator | beforeEnd () const |
ConstIterator | beforeBegin () const |
ScaledIdentityMatrix & | operator+= (const ScaledIdentityMatrix &y) |
vector space addition | |
ScaledIdentityMatrix & | operator-= (const ScaledIdentityMatrix &y) |
vector space subtraction | |
ScaledIdentityMatrix & | operator+= (const K &k) |
vector space multiplication with scalar | |
ScaledIdentityMatrix & | operator-= (const K &k) |
vector space division by scalar | |
ScaledIdentityMatrix & | operator*= (const K &k) |
vector space multiplication with scalar | |
ScaledIdentityMatrix & | operator/= (const K &k) |
vector space division by scalar | |
bool | operator== (const ScaledIdentityMatrix &other) const |
comparison operator | |
bool | operator!= (const ScaledIdentityMatrix &other) const |
incomparison operator | |
template<class X , class Y > | |
void | mv (const X &x, Y &y) const |
y = A x | |
template<class X , class Y > | |
void | mtv (const X &x, Y &y) const |
y = A^T x | |
template<class X , class Y > | |
void | umv (const X &x, Y &y) const |
y += A x | |
template<class X , class Y > | |
void | umtv (const X &x, Y &y) const |
y += A^T x | |
template<class X , class Y > | |
void | umhv (const X &x, Y &y) const |
y += A^H x | |
template<class X , class Y > | |
void | mmv (const X &x, Y &y) const |
y -= A x | |
template<class X , class Y > | |
void | mmtv (const X &x, Y &y) const |
y -= A^T x | |
template<class X , class Y > | |
void | mmhv (const X &x, Y &y) const |
y -= A^H x | |
template<class X , class Y > | |
void | usmv (const K &alpha, const X &x, Y &y) const |
y += alpha A x | |
template<class X , class Y > | |
void | usmtv (const K &alpha, const X &x, Y &y) const |
y += alpha A^T x | |
template<class X , class Y > | |
void | usmhv (const K &alpha, const X &x, Y &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) | |
template<class V > | |
void | solve (V &x, const V &b) const |
Solve system A x = b. | |
void | invert () |
Compute inverse. | |
K | determinant () const |
calculates the determinant of this matrix | |
size_type | N () const |
number of blocks in row direction | |
size_type | M () const |
number of blocks in column direction | |
bool | exists (size_type i, size_type j) const |
return true when (i,j) is in pattern | |
reference | operator[] (size_type i) |
Return reference object as row replacement. | |
const_reference | operator[] (size_type i) const |
Return const_reference object as row replacement. | |
const K & | diagonal (size_type i) const |
Get const reference to diagonal entry. | |
K & | diagonal (size_type i) |
Get reference to diagonal entry. | |
const K & | scalar () const |
Get const reference to the scalar diagonal value. | |
K & | scalar () |
Get reference to the scalar diagonal value. |
Friends | |
std::ostream & | operator<< (std::ostream &s, const ScaledIdentityMatrix< K, n > &a) |
Sends the matrix to an output stream. |
A multiple of the identity matrix of static size.
typedef K Dune::ScaledIdentityMatrix< K, n >::block_type |
export the type representing the components
typedef row_type::Iterator Dune::ScaledIdentityMatrix< K, n >::ColIterator |
rename the iterators for easier access
typedef ConstIterator Dune::ScaledIdentityMatrix< K, n >::const_iterator |
typedef for stl compliant access
typedef const_row_type Dune::ScaledIdentityMatrix< K, n >::const_reference |
typedef DiagonalRowVectorConst<K,n> Dune::ScaledIdentityMatrix< K, n >::const_row_type |
typedef const_row_type::ConstIterator Dune::ScaledIdentityMatrix< K, n >::ConstColIterator |
rename the iterators for easier access
typedef ContainerWrapperIterator<const WrapperType, const_reference, const_reference> Dune::ScaledIdentityMatrix< K, n >::ConstIterator |
Iterator class for sequential access.
typedef ConstIterator Dune::ScaledIdentityMatrix< K, n >::ConstRowIterator |
rename the iterators for easier access
typedef K Dune::ScaledIdentityMatrix< K, n >::field_type |
export the type representing the field
typedef ContainerWrapperIterator<const WrapperType, reference, reference> Dune::ScaledIdentityMatrix< K, n >::Iterator |
Iterator class for sequential access.
typedef Iterator Dune::ScaledIdentityMatrix< K, n >::iterator |
typedef for stl compliant access
typedef row_type Dune::ScaledIdentityMatrix< K, n >::reference |
typedef DiagonalRowVector<K,n> Dune::ScaledIdentityMatrix< K, n >::row_type |
Each row is implemented by a field vector.
typedef Iterator Dune::ScaledIdentityMatrix< K, n >::RowIterator |
rename the iterators for easier access
typedef std::size_t Dune::ScaledIdentityMatrix< K, n >::size_type |
The type used for the index access and size operations.
anonymous enum |
anonymous enum |
|
inline |
Default constructor.
|
inline |
Constructor initializing the whole matrix with a scalar.
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
begin iterator
|
inline |
begin iterator
|
inline |
calculates the determinant of this matrix
|
inline |
Get const reference to diagonal entry.
|
inline |
Get reference to diagonal entry.
|
inline |
end iterator
|
inline |
end iterator
|
inline |
return true when (i,j) is in pattern
|
inline |
frobenius norm: sqrt(sum over squared values of entries)
|
inline |
square of frobenius norm, need for block recursion
|
inline |
|
inline |
infinity norm (row sum norm, how to generalize for blocks?)
|
inline |
simplified infinity norm (uses Manhattan norm for complex values)
|
inline |
Compute inverse.
|
inline |
number of blocks in column direction
Referenced by Dune::ScaledIdentityMatrix< K, n >::mmhv(), Dune::ScaledIdentityMatrix< K, n >::mmtv(), Dune::ScaledIdentityMatrix< K, n >::mmv(), Dune::ScaledIdentityMatrix< K, n >::mv(), Dune::ScaledIdentityMatrix< K, n >::umhv(), Dune::ScaledIdentityMatrix< K, n >::umtv(), Dune::ScaledIdentityMatrix< K, n >::umv(), Dune::ScaledIdentityMatrix< K, n >::usmhv(), Dune::ScaledIdentityMatrix< K, n >::usmtv(), and Dune::ScaledIdentityMatrix< K, n >::usmv().
|
inline |
y -= A^H x
References Dune::ScaledIdentityMatrix< K, n >::M(), and Dune::ScaledIdentityMatrix< K, n >::N().
|
inline |
y -= A^T x
References Dune::ScaledIdentityMatrix< K, n >::M(), and Dune::ScaledIdentityMatrix< K, n >::N().
|
inline |
y -= A x
References Dune::ScaledIdentityMatrix< K, n >::M(), and Dune::ScaledIdentityMatrix< K, n >::N().
|
inline |
y = A^T x
References Dune::ScaledIdentityMatrix< K, n >::mv().
|
inline |
y = A x
References Dune::ScaledIdentityMatrix< K, n >::M(), and Dune::ScaledIdentityMatrix< K, n >::N().
Referenced by Dune::ScaledIdentityMatrix< K, n >::mtv().
|
inline |
number of blocks in row direction
Referenced by Dune::ScaledIdentityMatrix< K, n >::mmhv(), Dune::ScaledIdentityMatrix< K, n >::mmtv(), Dune::ScaledIdentityMatrix< K, n >::mmv(), Dune::ScaledIdentityMatrix< K, n >::mv(), Dune::ScaledIdentityMatrix< K, n >::umhv(), Dune::ScaledIdentityMatrix< K, n >::umtv(), Dune::ScaledIdentityMatrix< K, n >::umv(), Dune::ScaledIdentityMatrix< K, n >::usmhv(), Dune::ScaledIdentityMatrix< K, n >::usmtv(), and Dune::ScaledIdentityMatrix< K, n >::usmv().
|
inline |
incomparison operator
References Dune::ScaledIdentityMatrix< K, n >::scalar().
|
inline |
vector space multiplication with scalar
|
inline |
vector space addition
|
inline |
vector space multiplication with scalar
|
inline |
vector space subtraction
|
inline |
vector space division by scalar
|
inline |
vector space division by scalar
|
inline |
|
inline |
comparison operator
References Dune::ScaledIdentityMatrix< K, n >::scalar().
|
inline |
Return reference object as row replacement.
|
inline |
Return const_reference object as row replacement.
|
inline |
Get const reference to the scalar diagonal value.
Referenced by Dune::istl_assign_to_fmatrix(), Dune::ScaledIdentityMatrix< K, n >::operator!=(), and Dune::ScaledIdentityMatrix< K, n >::operator==().
|
inline |
Get reference to the scalar diagonal value.
|
inline |
Solve system A x = b.
|
inline |
y += A^H x
References Dune::ScaledIdentityMatrix< K, n >::M(), and Dune::ScaledIdentityMatrix< K, n >::N().
|
inline |
y += A^T x
References Dune::ScaledIdentityMatrix< K, n >::M(), and Dune::ScaledIdentityMatrix< K, n >::N().
|
inline |
y += A x
References Dune::ScaledIdentityMatrix< K, n >::M(), and Dune::ScaledIdentityMatrix< K, n >::N().
|
inline |
y += alpha A^H x
References Dune::ScaledIdentityMatrix< K, n >::M(), and Dune::ScaledIdentityMatrix< K, n >::N().
|
inline |
y += alpha A^T x
References Dune::ScaledIdentityMatrix< K, n >::M(), and Dune::ScaledIdentityMatrix< K, n >::N().
|
inline |
y += alpha A x
References Dune::ScaledIdentityMatrix< K, n >::M(), and Dune::ScaledIdentityMatrix< K, n >::N().
|
friend |
Sends the matrix to an output stream.