Dune Core Modules (2.7.1)
Two grid operator for AMG with Krylov cycle. More...
#include <dune/istl/paamg/kamg.hh>
Public Types | |
typedef AMG::Domain | domain_type |
The domain type of the preconditioner. | |
typedef AMG::Range | range_type |
The range type of the preconditioner. | |
typedef X::field_type | field_type |
The field type of the preconditioner. | |
Public Member Functions | |
virtual SolverCategory::Category | category () const |
Category of the preconditioner (see SolverCategory::Category) | |
KAmgTwoGrid (AMG &amg, std::shared_ptr< InverseOperator< Domain, Range > > coarseSolver) | |
Constructor. More... | |
void | pre (typename AMG::Domain &x, typename AMG::Range &b) |
Prepare the preconditioner. More... | |
void | post (typename AMG::Domain &x) |
Clean up. More... | |
void | apply (typename AMG::Domain &v, const typename AMG::Range &d) |
Apply one step of the preconditioner to the system A(v)=d. More... | |
InverseOperator< Domain, Range > * | coarseSolver () |
Get a pointer to the coarse grid solver. More... | |
void | setLevelContext (std::shared_ptr< typename AMG::LevelContext > p) |
Set the level context pointer. More... | |
~KAmgTwoGrid () | |
Destructor. | |
virtual void | pre (AMG::Domain &x, AMG::Range &b)=0 |
Prepare the preconditioner. More... | |
virtual void | apply (AMG::Domain &v, const AMG::Range &d)=0 |
Apply one step of the preconditioner to the system A(v)=d. More... | |
virtual void | post (AMG::Domain &x)=0 |
Clean up. More... | |
Detailed Description
Constructor & Destructor Documentation
◆ KAmgTwoGrid()
|
inline |
Constructor.
- Parameters
-
amg The underlying amg. It is used as the storage for the hierarchic data structures. coarseSolver The solver used for the coarse grid correction.
Member Function Documentation
◆ apply() [1/2]
|
pure virtualinherited |
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 \( v = M^{-1} d \) where \( M \) is the approximate inverse of the operator \( A \) characterizing the preconditioner.
- Parameters
-
[out] v The update to be computed d The current defect.
◆ apply() [2/2]
|
inline |
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 \( v = M^{-1} d \) where \( M \) is the approximate inverse of the operator \( A \) characterizing the preconditioner.
- Parameters
-
[out] v The update to be computed d The current defect.
References Dune::Amg::postsmooth(), and Dune::Amg::presmooth().
◆ coarseSolver()
|
inline |
Get a pointer to the coarse grid solver.
- Returns
- The coarse grid solver.
◆ post() [1/2]
|
pure virtualinherited |
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.
- Parameters
-
x The right hand side of the equation.
◆ post() [2/2]
|
inline |
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.
- Parameters
-
x The right hand side of the equation.
References DUNE_UNUSED_PARAMETER.
◆ pre() [1/2]
|
pure virtualinherited |
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.
- Note
- if a preconditioner is copied (e.g. for a second thread) again the pre() method has to be called to ensure proper memory mangement.
- Parameters
-
x The left hand side of the equation. b The right hand side of the equation.
◆ pre() [2/2]
|
inline |
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.
- Note
- if a preconditioner is copied (e.g. for a second thread) again the pre() method has to be called to ensure proper memory mangement.
- Parameters
-
x The left hand side of the equation. b The right hand side of the equation.
References DUNE_UNUSED_PARAMETER.
◆ setLevelContext()
|
inline |
Set the level context pointer.
- Parameters
-
p The pointer to set it to.
The documentation for this class was generated from the following files: