dune-istl
2.2.0
|
Block parallel preconditioner. More...
#include <dune/istl/schwarz.hh>
Public Types | |
enum | { category = SolverCategory::overlapping } |
typedef X | domain_type |
The domain type of the preconditioner. | |
typedef Y | range_type |
The range type of the preconditioner. | |
typedef X::field_type | field_type |
The field type of the preconditioner. | |
typedef C | communication_type |
The type of the communication object. |
Public Member Functions | |
BlockPreconditioner (T &p, const communication_type &c) | |
Constructor. | |
virtual void | pre (X &x, Y &b) |
Prepare the preconditioner. | |
virtual void | apply (X &v, const Y &d) |
Apply the preconditioner. | |
template<bool forward> | |
void | apply (X &v, const Y &d) |
Apply one step of the preconditioner to the system A(v)=d. | |
virtual void | post (X &x) |
Clean up. |
Friends | |
class | Amg::ConstructionTraits< BlockPreconditioner< X, Y, C, T > > |
Block parallel preconditioner.
This is essentially a wrapper that take a sequential preconditoner. In each step the sequential preconditioner is applied and then all owner data points are updates on all other processes.
typedef C Dune::BlockPreconditioner< X, Y, C, T >::communication_type |
The type of the communication object.
typedef X Dune::BlockPreconditioner< X, Y, C, T >::domain_type |
The domain type of the preconditioner.
Reimplemented from Dune::Preconditioner< X, Y >.
typedef X::field_type Dune::BlockPreconditioner< X, Y, C, T >::field_type |
The field type of the preconditioner.
Reimplemented from Dune::Preconditioner< X, Y >.
typedef Y Dune::BlockPreconditioner< X, Y, C, T >::range_type |
The range type of the preconditioner.
Reimplemented from Dune::Preconditioner< X, Y >.
anonymous enum |
|
inline |
Constructor.
constructor gets all parameters to operate the prec.
p | The sequential preconditioner. |
c | The communication object for syncing overlap and copy data points. (E.~g. OwnerOverlapCommunication ) |
|
inlinevirtual |
Apply the preconditioner.
Apply one step of the preconditioner to the system A(v)=d. On entry v=0 and d=b-A(x) (although this might not be computed in that way. On exit v contains the update, i.e one step computes where
is the approximate inverse of the operator
characterizing the preconditioner.
[out] | v | The update to be computed |
d | The current defect. |
Implements Dune::Preconditioner< X, Y >.
|
inlinevirtual |
Apply one step of the preconditioner to the system A(v)=d.
On entry v=0 and d=b-A(x) (although this might not be computed in that way. On exit v contains the update, i.e one step computes where
is the approximate inverse of the operator
characterizing the preconditioner.
[out] | v | The update to be computed |
d | The current defect. |
Implements Dune::Preconditioner< X, Y >.
|
inlinevirtual |
Clean up.
Clean up. This method is called after the last apply call for the linear system to be solved. Memory may be deallocated safely here. x is the solution of the linear equation.
x | The right hand side of the equation. |
Implements Dune::Preconditioner< X, Y >.
|
inlinevirtual |
Prepare the preconditioner.
Prepare the preconditioner. A solver solves a linear operator equation A(x)=b by applying one or several steps of the preconditioner. The method pre() is called before the first apply operation. b and x are right hand side and solution vector of the linear system respectively. It may. e.g., scale the system, allocate memory or compute a (I)LU decomposition. Note: The ILU decomposition could also be computed in the constructor or with a separate method of the derived method if several linear systems with the same matrix are to be solved.
x | The left hand side of the equation. |
b | The right hand side of the equation. |
Implements Dune::Preconditioner< X, Y >.
|
friend |