3 #ifndef DUNE_AMG_KAMG_HH
4 #define DUNE_AMG_KAMG_HH
30 :
public Preconditioner<typename AMG::Domain,typename AMG::Range>
57 DUNE_UNUSED_PARAMETER(x); DUNE_UNUSED_PARAMETER(b);
63 DUNE_UNUSED_PARAMETER(x);
70 *levelContext_->update=0;
71 *levelContext_->rhs = d;
72 *levelContext_->lhs = v;
74 presmooth(*levelContext_, amg_.preSteps_);
75 bool processFineLevel =
76 amg_.moveToCoarseLevel(*levelContext_);
78 if(processFineLevel) {
82 coarseSolver_->apply(x, b, res);
83 *levelContext_->update=x;
86 amg_.moveToFineLevel(*levelContext_, processFineLevel);
89 v=*levelContext_->update;
118 std::shared_ptr<InverseOperator<Domain,Range> > coarseSolver_;
120 std::shared_ptr<typename AMG::LevelContext> levelContext_;
135 template<
class M,
class X,
class S,
class PI=SequentialInformation,
180 KAMG(
const OperatorHierarchy& matrices, CoarseSolver& coarseSolver,
181 const SmootherArgs& smootherArgs, std::size_t gamma,
182 std::size_t preSmoothingSteps =1, std::size_t postSmoothingSteps = 1,
183 std::size_t maxLevelKrylovSteps = 3 ,
double minDefectReduction =1e-1);
202 KAMG(
const Operator& fineOperator,
const C& criterion,
203 const SmootherArgs& smootherArgs, std::size_t gamma=1,
204 std::size_t preSmoothingSteps=1, std::size_t postSmoothingSteps=1,
205 std::size_t maxLevelKrylovSteps=3,
double minDefectReduction=1e-1,
209 void pre(Domain& x, Range& b);
211 void post(Domain& x);
213 void apply(Domain& v,
const Range& d);
222 std::size_t maxLevelKrylovSteps;
225 double levelDefectReduction;
228 std::vector<std::shared_ptr<typename Amg::ScalarProduct> > scalarproducts;
231 std::vector<std::shared_ptr<KAmgTwoGrid<Amg> > > ksolvers;
234 template<
class M,
class X,
class S,
class P,
class K,
class A>
236 const SmootherArgs& smootherArgs,
237 std::size_t gamma, std::size_t preSmoothingSteps,
238 std::size_t postSmoothingSteps,
239 std::size_t ksteps,
double reduction)
240 : amg(matrices, coarseSolver, smootherArgs, gamma, preSmoothingSteps,
241 postSmoothingSteps), maxLevelKrylovSteps(ksteps), levelDefectReduction(reduction)
244 template<
class M,
class X,
class S,
class P,
class K,
class A>
247 const SmootherArgs& smootherArgs, std::size_t gamma,
248 std::size_t preSmoothingSteps, std::size_t postSmoothingSteps,
249 std::size_t ksteps,
double reduction,
250 const ParallelInformation& pinfo)
251 : amg(fineOperator, criterion, smootherArgs, gamma, preSmoothingSteps,
252 postSmoothingSteps, false, pinfo), maxLevelKrylovSteps(ksteps), levelDefectReduction(reduction)
256 template<
class M,
class X,
class S,
class P,
class K,
class A>
260 scalarproducts.reserve(amg.levels());
261 ksolvers.reserve(amg.levels());
263 typename OperatorHierarchy::ParallelMatrixHierarchy::Iterator
264 matrix = amg.matrices_->matrices().coarsest();
266 pinfo = amg.matrices_->parallelInformation().coarsest();
267 bool hasCoarsest=(amg.levels()==amg.maxlevels());
270 if(matrix==amg.matrices_->matrices().finest())
278 std::ostringstream s;
280 if(matrix!=amg.matrices_->matrices().finest())
282 scalarproducts.push_back(std::shared_ptr<typename Amg::ScalarProduct>(Amg::ScalarProductChooser::construct(*pinfo)));
283 std::shared_ptr<InverseOperator<Domain,Range> > ks =
284 std::shared_ptr<InverseOperator<Domain,Range> >(
new KrylovSolver(*matrix, *(scalarproducts.back()),
285 *(ksolvers.back()), levelDefectReduction,
286 maxLevelKrylovSteps, 0));
290 if(matrix==amg.matrices_->matrices().finest())
296 template<
class M,
class X,
class S,
class P,
class K,
class A>
303 template<
class M,
class X,
class S,
class P,
class K,
class A>
306 if(ksolvers.size()==0)
310 amg.solver_->apply(v,td,res);
313 typedef typename Amg::LevelContext LevelContext;
314 std::shared_ptr<LevelContext> levelContext(
new LevelContext);
315 amg.initIteratorsWithFineLevel(*levelContext);
316 typedef typename std::vector<std::shared_ptr<KAmgTwoGrid<Amg> > >::iterator Iter;
317 for(Iter solver=ksolvers.begin(); solver!=ksolvers.end(); ++solver)
318 (*solver)->setLevelContext(levelContext);
319 ksolvers.back()->apply(v,d);
323 template<
class M,
class X,
class S,
class P,
class K,
class A>
326 return amg.maxlevels();
~KAmgTwoGrid()
Destructor.
Definition: kamg.hh:111
void presmooth(LevelContext &levelContext, size_t steps)
Apply pre smoothing on the current level.
Definition: smoother.hh:408
Amg::OperatorHierarchy OperatorHierarchy
The type of the hierarchy of operators.
Definition: kamg.hh:145
Definition: basearray.hh:19
AMG< M, X, S, PI, A > Amg
The type of the underlying AMG.
Definition: kamg.hh:141
Amg::ScalarProduct ScalarProduct
The type of the scalar product.
Definition: kamg.hh:161
void apply(Domain &v, const Range &d)
Apply one step of the preconditioner to the system A(v)=d.
Definition: kamg.hh:304
Two grid operator for AMG with Krylov cycle.
Definition: amg.hh:44
Amg::ParallelInformationHierarchy ParallelInformationHierarchy
The type of the hierarchy of parallel information.
Definition: kamg.hh:159
Amg::Domain Domain
the type of the domain.
Definition: kamg.hh:155
X Range
The range type.
Definition: amg.hh:80
M Operator
The matrix operator type.
Definition: amg.hh:64
void pre(typename AMG::Domain &x, typename AMG::Range &b)
Prepare the preconditioner.
Definition: kamg.hh:55
void post(typename AMG::Domain &x)
Clean up.
Definition: kamg.hh:61
Matrix & A
Definition: matrixmatrix.hh:216
K KrylovSolver
The type of the Krylov solver for the cycle.
Definition: kamg.hh:143
X Domain
The domain type.
Definition: amg.hh:78
The solver category.
Definition: amg.hh:95
PI ParallelInformation
The type of the parallel information. Either OwnerOverlapCommunication or another type describing the...
Definition: amg.hh:71
KAmgTwoGrid(AMG &amg, std::shared_ptr< InverseOperator< Domain, Range > > coarseSolver)
Constructor.
Definition: kamg.hh:50
void pre(Domain &x, Range &b)
Prepare the preconditioner.
Definition: kamg.hh:257
SmootherTraits< Smoother >::Arguments SmootherArgs
The argument type for the construction of the smoother.
Definition: amg.hh:91
The solver category.
Definition: kamg.hh:165
Base class for matrix free definition of preconditioners.
Definition: preconditioner.hh:26
void apply(typename AMG::Domain &v, const typename AMG::Range &d)
Apply one step of the preconditioner to the system A(v)=d.
Definition: kamg.hh:67
InverseOperator< Domain, Range > * coarseSolver()
Get a pointer to the coarse grid solver.
Definition: kamg.hh:96
Abstract base class for all solvers.
Definition: solver.hh:79
KAMG(const OperatorHierarchy &matrices, CoarseSolver &coarseSolver, const SmootherArgs &smootherArgs, std::size_t gamma, std::size_t preSmoothingSteps=1, std::size_t postSmoothingSteps=1, std::size_t maxLevelKrylovSteps=3, double minDefectReduction=1e-1)
Construct a new amg with a specific coarse solver.
Definition: kamg.hh:235
void postsmooth(LevelContext &levelContext, size_t steps)
Apply post smoothing on the current level.
Definition: smoother.hh:430
Amg::Operator Operator
the type of the lineatr operator.
Definition: kamg.hh:153
Amg::Range Range
The type of the range.
Definition: kamg.hh:157
Amg::CoarseSolver CoarseSolver
The type of the coarse solver.
Definition: kamg.hh:147
std::size_t maxlevels()
Definition: kamg.hh:324
Amg::SmootherArgs SmootherArgs
The type of the arguments for construction of the smoothers.
Definition: kamg.hh:151
Parallel algebraic multigrid based on agglomeration.
Definition: amg.hh:55
void setLevelContext(std::shared_ptr< typename AMG::LevelContext > p)
Set the level context pointer.
Definition: kamg.hh:105
void post(Domain &x)
Clean up.
Definition: kamg.hh:297
Generalized preconditioned conjugate gradient solver.
Definition: solvers.hh:1445
The solver category.
Definition: kamg.hh:40
Statistics about the application of an inverse operator.
Definition: solver.hh:31
Define general preconditioner interface.
The hierarchies build by the coarsening process.
Definition: hierarchy.hh:316
Amg::ParallelInformation ParallelInformation
the type of the parallelinformation to use.
Definition: kamg.hh:149
LevelIterator< Hierarchy< ParallelInformation, Allocator >, ParallelInformation > Iterator
Type of the mutable iterator.
Definition: hierarchy.hh:257