|
virtual bool | apply (Y &c, const X &d) |
| compute new correction c = B*d More...
|
|
virtual bool | apply_update_defect (Y &c, X &d) |
| compute new correction c = B*d and update defect d := d - A*c More...
|
|
virtual SmartPtr< ILinearIterator< X, Y > > | clone () |
| clone More...
|
|
virtual bool | init (SmartPtr< ILinearOperator< Y, X > > J, const Y &u) |
| initialize for operator J(u) and linearization point u More...
|
|
virtual bool | init (SmartPtr< ILinearOperator< Y, X > > L) |
| initialize for linear operator L More...
|
|
| LinearIteratorProduct () |
|
| LinearIteratorProduct (const std::vector< SmartPtr< ILinearIterator< X, Y > > > &vIterator) |
|
virtual const char * | name () const |
| returns the name of iterator More...
|
|
void | add_iterator (SmartPtr< ILinearIterator< X, Y > > I) |
|
void | add_iterator (SmartPtr< ILinearIterator< X, Y > > I, size_t nr) |
|
| CombinedLinearIterator () |
|
| CombinedLinearIterator (const std::vector< SmartPtr< ILinearIterator< X, Y > > > &vIterator) |
|
virtual bool | supports_parallel () const |
| returns if parallel solving is supported More...
|
|
virtual std::string | config_string () const |
|
SmartPtr< IDamping< X, Y > > | damping () |
| returns the scaling More...
|
|
| ILinearIterator () |
| constructor More...
|
|
| ILinearIterator (const ILinearIterator< X, Y > &parent) |
| copy constructor More...
|
|
void | set_damp (number factor) |
| sets the damping to a constant factor More...
|
|
void | set_damp (SmartPtr< IDamping< X, Y > > spScaling) |
| sets a scaling for the correction More...
|
|
virtual | ~ILinearIterator () |
| virtual destructor More...
|
|
template<typename X, typename Y>
class ug::LinearIteratorProduct< X, Y >
This operator is a product of ILinearIterator (multiplicative composition).
template<typename X , typename Y >
template<typename X , typename Y >
compute new correction c = B*d and update defect d := d - A*c
This method applies the inverse operator, i.e. c = B*d. The domain function d is changed in the way, that the defect d := d - A*c is returned in the function. This is always useful, when the iterating algorithm can (or must) update the defect during computation (this is e.g. the case for the geometric multigrid method). Note, that this method can always be implemented by calling apply and then computing d := d - A*c.
- Parameters
-
[in,out] | d | defect |
[out] | u | correction |
- Returns
- bool success flag
Implements ug::CombinedLinearIterator< X, Y >.
References ug::LinearIteratorProduct< X, Y >::m_vIterator.
Referenced by ug::LinearIteratorProduct< X, Y >::apply().
template<typename X , typename Y >
initialize for operator J(u) and linearization point u
This method passes the linear operator J(u) that should be used as underlying by this iterator. As second argument the linearization point is passed. This is needed e.g. for the geometric multigrid method.
- Parameters
-
[in] | J | linearized operator to use as underlying |
[in] | u | linearization point |
- Returns
- bool success flag
Implements ug::CombinedLinearIterator< X, Y >.
References ug::LinearIteratorProduct< X, Y >::m_vIterator.
template<typename X , typename Y >
returns the name of iterator
This method returns the name of the iterator operator. This function is typically needed, when the iterator operator is used inside of another operator and some debug output should be printed
- Returns
- const char* name of inverse operator
Implements ug::CombinedLinearIterator< X, Y >.