dune-istl 3.0-git
|
A Vector of blocks with different blocksizes. More...
#include <dune/istl/matrix.hh>
Classes | |
class | ConstIterator |
ConstIterator class for sequential access. More... | |
class | Iterator |
Iterator class for sequential access. More... | |
Public Types | |
typedef B::field_type | field_type |
export the type representing the field | |
typedef A | allocator_type |
export the allocator type | |
typedef A::size_type | size_type |
The size type for the index access. | |
typedef BlockVector< B, A > | value_type |
Type of the elements of the outer vector, i.e., dynamic vectors of B. | |
typedef BlockVector< B, A > | block_type |
Same as value_type, here for historical reasons. | |
typedef BlockVectorWindow< B, A > | window_type |
typedef window_type | reference |
typedef const window_type | const_reference |
using | iterator = Iterator |
Export the iterator type using std naming rules. | |
using | const_iterator = ConstIterator |
Export the const iterator type using std naming rules. | |
typedef base_array_unmanaged< B, A >::iterator | Iterator |
make iterators available as types | |
typedef base_array_unmanaged< B, A >::const_iterator | ConstIterator |
make iterators available as types | |
typedef B | member_type |
export the type representing the components | |
Public Member Functions | |
DenseMatrixBase () | |
DenseMatrixBase (size_type rows, size_type columns) | |
DenseMatrixBase (const DenseMatrixBase &a) | |
copy constructor, has copy semantics | |
~DenseMatrixBase () | |
free dynamic memory | |
void | resize (size_type rows, size_type columns) |
same effect as constructor with same argument | |
DenseMatrixBase & | operator= (const DenseMatrixBase &a) |
assignment | |
DenseMatrixBase & | operator= (const field_type &k) |
assign from scalar | |
reference | operator[] (size_type i) |
random access to blocks | |
const_reference | operator[] (size_type i) const |
same for read only access | |
Iterator | begin () |
begin Iterator | |
Iterator | end () |
end Iterator | |
Iterator | beforeEnd () |
Iterator | beforeBegin () const |
Iterator | find (size_type i) |
random access returning iterator (end if not contained) | |
ConstIterator | find (size_type i) const |
random access returning iterator (end if not contained) | |
ConstIterator | begin () const |
begin ConstIterator | |
ConstIterator | end () const |
end ConstIterator | |
ConstIterator | beforeEnd () const |
ConstIterator | rend () const |
end ConstIterator | |
size_type | N () const |
number of blocks in the vector (are of variable size here) | |
block_vector_unmanaged & | operator+= (const block_vector_unmanaged &y) |
vector space addition | |
block_vector_unmanaged & | operator-= (const block_vector_unmanaged &y) |
vector space subtraction | |
block_vector_unmanaged & | operator*= (const field_type &k) |
vector space multiplication with scalar | |
block_vector_unmanaged & | operator/= (const field_type &k) |
vector space division by scalar | |
block_vector_unmanaged & | axpy (const field_type &a, const block_vector_unmanaged &y) |
vector space axpy operation | |
template<class OtherB , class OtherA > | |
PromotionTraits< field_type, typenameOtherB::field_type >::PromotedType | operator* (const block_vector_unmanaged< OtherB, OtherA > &y) const |
indefinite vector dot product ![]() | |
template<class OtherB , class OtherA > | |
PromotionTraits< field_type, typenameOtherB::field_type >::PromotedType | dot (const block_vector_unmanaged< OtherB, OtherA > &y) const |
vector dot product ![]() | |
FieldTraits< field_type >::real_type | one_norm () const |
one norm (sum over absolute values of entries) | |
FieldTraits< field_type >::real_type | one_norm_real () const |
simplified one norm (uses Manhattan norm for complex values) | |
FieldTraits< field_type >::real_type | two_norm () const |
two norm sqrt(sum over squared values of entries) | |
FieldTraits< field_type >::real_type | two_norm2 () const |
Square of the two-norm (the sum over the squared values of the entries) | |
template<typename ft = field_type, typename std::enable_if<!has_nan< ft >::value, int >::type = 0> | |
FieldTraits< ft >::real_type | infinity_norm () const |
infinity norm (maximum of absolute values of entries) | |
template<typename ft = field_type, typename std::enable_if< has_nan< ft >::value, int >::type = 0> | |
FieldTraits< ft >::real_type | infinity_norm () const |
infinity norm (maximum of absolute values of entries) | |
template<typename ft = field_type, typename std::enable_if<!has_nan< ft >::value, int >::type = 0> | |
FieldTraits< ft >::real_type | infinity_norm_real () const |
simplified infinity norm (uses Manhattan norm for complex values) | |
template<typename ft = field_type, typename std::enable_if< has_nan< ft >::value, int >::type = 0> | |
FieldTraits< ft >::real_type | infinity_norm_real () const |
simplified infinity norm (uses Manhattan norm for complex values) | |
size_type | dim () const |
dimension of the vector space | |
iterator | beforeBegin () |
size_type | size () const |
number of blocks in the array (are of size 1 here) | |
Protected Attributes | |
size_type | n |
B * | p |
A Vector of blocks with different blocksizes.
This class started as a copy of VariableBlockVector, which used to be used for the internal memory managerment of the 'Matrix' class. However, that mechanism stopped working when I started using the RandomAccessIteratorFacade in VariableBlockVector (308dd85483108f8baaa4051251e2c75e2a9aed32, to make VariableBlockVector pass a number of tightened interface compliance tests), and I couldn't quite figure out how to fix that. However, using VariableBlockVector in Matrix internally was a hack anyway, so I simply took the working version of VariableBlockVector and copied it here under the new name of DenseMatrixBase. This is still hacky, but one step closer to an elegant solution.
typedef A Dune::MatrixImp::DenseMatrixBase< B, A >::allocator_type |
export the allocator type
typedef BlockVector<B,A> Dune::MatrixImp::DenseMatrixBase< B, A >::block_type |
Same as value_type, here for historical reasons.
using Dune::MatrixImp::DenseMatrixBase< B, A >::const_iterator = ConstIterator |
Export the const iterator type using std naming rules.
typedef const window_type Dune::MatrixImp::DenseMatrixBase< B, A >::const_reference |
|
inherited |
make iterators available as types
typedef B::field_type Dune::MatrixImp::DenseMatrixBase< B, A >::field_type |
export the type representing the field
|
inherited |
make iterators available as types
using Dune::MatrixImp::DenseMatrixBase< B, A >::iterator = Iterator |
Export the iterator type using std naming rules.
|
inherited |
export the type representing the components
typedef window_type Dune::MatrixImp::DenseMatrixBase< B, A >::reference |
typedef A::size_type Dune::MatrixImp::DenseMatrixBase< B, A >::size_type |
The size type for the index access.
typedef BlockVector<B,A> Dune::MatrixImp::DenseMatrixBase< B, A >::value_type |
Type of the elements of the outer vector, i.e., dynamic vectors of B.
Note that this is not the type refered to by the iterators and random access operators, which return proxy objects.
typedef BlockVectorWindow<B,A> Dune::MatrixImp::DenseMatrixBase< B, A >::window_type |
|
inline |
constructor without arguments makes empty vector, object cannot be used yet
|
inline |
make vector with given number of blocks each having a constant size, object is fully usable then.
_nblocks | Number of blocks |
m | Number of elements in each block |
|
inline |
copy constructor, has copy semantics
|
inline |
free dynamic memory
|
inlineinherited |
vector space axpy operation
|
inlineinherited |
|
inline |
|
inline |
|
inline |
|
inline |
begin Iterator
|
inline |
begin ConstIterator
|
inlineinherited |
dimension of the vector space
|
inlineinherited |
vector dot product
http://www.mcs.anl.gov/petsc/petsc-current/docs/manualpages/Vec/VecDot.html
y | other (compatible) vector |
|
inline |
end Iterator
|
inline |
end ConstIterator
|
inline |
random access returning iterator (end if not contained)
|
inline |
random access returning iterator (end if not contained)
|
inlineinherited |
infinity norm (maximum of absolute values of entries)
|
inlineinherited |
infinity norm (maximum of absolute values of entries)
|
inlineinherited |
simplified infinity norm (uses Manhattan norm for complex values)
|
inlineinherited |
simplified infinity norm (uses Manhattan norm for complex values)
|
inline |
number of blocks in the vector (are of variable size here)
|
inlineinherited |
one norm (sum over absolute values of entries)
|
inlineinherited |
simplified one norm (uses Manhattan norm for complex values)
|
inlineinherited |
indefinite vector dot product
http://www.mcs.anl.gov/petsc/petsc-current/docs/manualpages/Vec/VecTDot.html
y | other (compatible) vector |
|
inlineinherited |
vector space multiplication with scalar
|
inlineinherited |
vector space addition
|
inlineinherited |
vector space subtraction
|
inlineinherited |
vector space division by scalar
|
inline |
assignment
|
inline |
assign from scalar
|
inline |
random access to blocks
|
inline |
same for read only access
|
inline |
end ConstIterator
|
inline |
same effect as constructor with same argument
|
inlineinherited |
number of blocks in the array (are of size 1 here)
|
inlineinherited |
two norm sqrt(sum over squared values of entries)
|
inlineinherited |
Square of the two-norm (the sum over the squared values of the entries)
|
protectedinherited |
|
protectedinherited |