5 #ifndef DUNE_ISTL_TWOLEVELMETHOD_HH
6 #define DUNE_ISTL_TWOLEVELMETHOD_HH
36 template<
class FO,
class CO>
140 template<
class O,
class C>
156 prolongDamp_ = criterion_.getProlongationDampingFactor();
163 typedef NegateSet<typename ParallelInformation::OwnerSet> OverlapFlags;
165 aggregatesMap_ = std::make_shared<AggregatesMap>(pg.
maxVertex()+1);
167 int noAggregates, isoAggregates, oneAggregates, skippedAggregates;
169 std::tie(noAggregates, isoAggregates, oneAggregates, skippedAggregates) =
170 aggregatesMap_->buildAggregates(fineOperator.getmat(), pg, criterion_,
true);
171 std::cout<<
"no aggregates="<<noAggregates<<
" iso="<<isoAggregates<<
" one="<<oneAggregates<<
" skipped="<<skippedAggregates<<std::endl;
174 typedef std::vector<bool>::iterator Iterator;
175 typedef Dune::IteratorPropertyMap<Iterator, Dune::IdentityMap> VisitedMap;
176 std::vector<bool> excluded(fineOperator.getmat().N(),
false);
177 VisitedMap vm(excluded.begin(), Dune::IdentityMap());
179 std::size_t aggregates = renumberer.coarsen(pinfo, pg, vm,
180 *aggregatesMap_, pinfo,
182 std::vector<bool>& visited=excluded;
184 typedef std::vector<bool>::iterator Iterator;
186 for(Iterator iter= visited.begin(), end=visited.end();
189 matrix_.reset(productBuilder.
build(mg, vm,
194 productBuilder.
calculate(fineOperator.getmat(), *aggregatesMap_, *matrix_, pinfo, OverlapFlags());
195 this->
lhs_.resize(this->matrix_->M());
196 this->
rhs_.resize(this->matrix_->N());
197 this->
operator_ = std::make_shared<O>(*matrix_);
220 typename O::matrix_type::field_type prolongDamp_;
221 std::shared_ptr<AggregatesMap> aggregatesMap_;
223 std::shared_ptr<typename O::matrix_type> matrix_;
232 template<
class O,
class S,
class C>
239 typedef typename O::range_type
X;
254 : smootherArgs_(args), criterion_(c)
258 : coarseOperator_(other.coarseOperator_), smootherArgs_(other.smootherArgs_),
259 criterion_(other.criterion_)
273 : amg_(op, crit,args), first_(true)
287 void apply(
X& x,
X& b, InverseOperatorResult& res)
289 return apply(x,b,1e-8,res);
295 return amg_.category();
298 ~AMGInverseOperator()
303 AMGInverseOperator(
const AMGInverseOperator& other)
304 : x_(other.x_), amg_(other.amg_), first_(other.first_)
327 coarseOperator_=transferPolicy.getCoarseLevelOperator();
328 AMGInverseOperator* inv =
new AMGInverseOperator(*coarseOperator_,
338 std::shared_ptr<Operator> coarseOperator_;
350 template<
class FO,
class CSP,
class S>
352 public Preconditioner<typename FO::domain_type, typename FO::range_type>
405 std::shared_ptr<SmootherType> smoother,
409 std::size_t preSteps=1, std::size_t postSteps=1)
410 : operator_(&op), smoother_(smoother),
411 preSteps_(preSteps), postSteps_(postSteps)
413 policy_ = policy.
clone();
415 coarseSolver_=coarsePolicy.createCoarseLevelSolver(*policy_);
419 : operator_(other.operator_), coarseSolver_(new
CoarseLevelSolver(*other.coarseSolver_)),
420 smoother_(other.smoother_), policy_(other.policy_->clone()),
421 preSteps_(other.preSteps_), postSteps_(other.postSteps_)
428 delete coarseSolver_;
443 LevelContext context;
448 context.smoother=smoother_;
450 context.matrix=operator_;
459 *context.update += *context.lhs;
480 std::shared_ptr<SmootherType> smoother;
508 std::shared_ptr<S> smoother_;
510 LevelTransferPolicy<FO,typename CSP::Operator>* policy_;
512 std::size_t preSteps_;
514 std::size_t postSteps_;
Define general, extensible interface for operators. The available implementation wraps a matrix.
Provides a class for building the galerkin product based on a aggregation scheme.
Define general, extensible interface for inverse operators.
G::MutableMatrix * build(G &fineGraph, V &visitedMap, const ParallelInformation &pinfo, AggregatesMap< typename G::VertexDescriptor > &aggregates, const typename G::Matrix::size_type &size, const Set ©)
Calculates the coarse matrix via a Galerkin product.
Definition: galerkin.hh:563
SmootherTraits< Smoother >::Arguments SmootherArgs
The argument type for the construction of the smoother.
Definition: amg.hh:100
Operator Operator
The matrix operator type.
Definition: amg.hh:73
void presmooth(LevelContext &levelContext, size_t steps)
Apply pre smoothing on the current level.
Definition: smoother.hh:406
void postsmooth(LevelContext &levelContext, size_t steps)
Apply post smoothing on the current level.
Definition: smoother.hh:428
void calculate(const M &fine, const AggregatesMap< V > &aggregates, M &coarse, const I &pinfo, const O ©)
Calculate the galerkin product.
Definition: allocator.hh:11
Class providing information about the mapping of the vertices onto aggregates.
Definition: aggregates.hh:560
Class representing the properties of an ede in the matrix graph.
Definition: dependency.hh:39
Class representing a node in the matrix graph.
Definition: dependency.hh:126
Definition: galerkin.hh:118
The (undirected) graph of a matrix.
Definition: graph.hh:51
Attaches properties to the edges and vertices of a graph.
Definition: graph.hh:978
VertexDescriptor maxVertex() const
Get the maximal vertex descriptor.
Definition: indicescoarsener.hh:36
The default class for the smoother arguments.
Definition: smoother.hh:38
static void restrictVector(const AggregatesMap< Vertex > &aggregates, Vector &coarse, const Vector &fine, T &comm)
static void prolongateVector(const AggregatesMap< Vertex > &aggregates, Vector &coarse, Vector &fine, Vector &fineRedist, T1 damp, R &redistributor=R())
Abstract base class for transfer between levels and creation of the coarse level system.
Definition: twolevelmethod.hh:38
CO CoarseOperatorType
The linear operator of the finel level system. Has to be derived from AssembledLinearOperator.
Definition: twolevelmethod.hh:57
virtual void moveToCoarseLevel(const FineRangeType &fineRhs)=0
Transfers the data to the coarse level.
FineOperatorType::range_type FineRangeType
The type of the range of the fine level operator.
Definition: twolevelmethod.hh:48
virtual void createCoarseLevelSystem(const FineOperatorType &fineOperator)=0
Algebraically creates the coarse level system.
CoarseOperatorType::range_type CoarseRangeType
The type of the range of the coarse level operator.
Definition: twolevelmethod.hh:61
CoarseRangeType & getCoarseLevelRhs()
Get the coarse level right hand side.
Definition: twolevelmethod.hh:78
virtual ~LevelTransferPolicy()
Destructor.
Definition: twolevelmethod.hh:124
CoarseDomainType lhs_
The coarse level lhs.
Definition: twolevelmethod.hh:130
std::shared_ptr< CoarseOperatorType > operator_
the coarse level linear operator.
Definition: twolevelmethod.hh:132
CoarseRangeType rhs_
The coarse level rhs.
Definition: twolevelmethod.hh:128
std::shared_ptr< CoarseOperatorType > & getCoarseLevelOperator()
Get the coarse level operator.
Definition: twolevelmethod.hh:70
virtual void moveToFineLevel(FineDomainType &fineLhs)=0
Updates the fine level linear system after the correction of the coarse levels system.
FO FineOperatorType
The linear operator of the finel level system. Has to be derived from AssembledLinearOperator.
Definition: twolevelmethod.hh:44
CoarseOperatorType::domain_type CoarseDomainType
The type of the domain of the coarse level operator.
Definition: twolevelmethod.hh:65
CoarseDomainType & getCoarseLevelLhs()
Get the coarse level left hand side.
Definition: twolevelmethod.hh:87
virtual LevelTransferPolicy * clone() const =0
Clone the current object.
FineOperatorType::domain_type FineDomainType
The type of the domain of the fine level operator.
Definition: twolevelmethod.hh:52
A LeveTransferPolicy that used aggregation to construct the coarse level system.
Definition: twolevelmethod.hh:143
C Criterion
Definition: twolevelmethod.hh:147
AggregationLevelTransferPolicy * clone() const
Clone the current object.
Definition: twolevelmethod.hh:214
AggregationLevelTransferPolicy(const Criterion &crit)
Definition: twolevelmethod.hh:150
void moveToFineLevel(typename FatherType::FineDomainType &fineLhs)
Updates the fine level linear system after the correction of the coarse levels system.
Definition: twolevelmethod.hh:207
void moveToCoarseLevel(const typename FatherType::FineRangeType &fineRhs)
Definition: twolevelmethod.hh:200
SequentialInformation ParallelInformation
Definition: twolevelmethod.hh:148
LevelTransferPolicy< O, O > FatherType
Definition: twolevelmethod.hh:146
void createCoarseLevelSystem(const O &fineOperator)
Algebraically creates the coarse level system.
Definition: twolevelmethod.hh:154
A policy class for solving the coarse level system using one step of AMG.
Definition: twolevelmethod.hh:234
OneStepAMGCoarseSolverPolicy(const SmootherArgs &args, const Criterion &c)
Constructs the coarse solver policy.
Definition: twolevelmethod.hh:253
AMGInverseOperator CoarseLevelSolver
The type of solver constructed for the coarse level.
Definition: twolevelmethod.hh:315
OneStepAMGCoarseSolverPolicy(const OneStepAMGCoarseSolverPolicy &other)
Copy constructor.
Definition: twolevelmethod.hh:257
O::range_type X
The type of the range and domain of the operator.
Definition: twolevelmethod.hh:239
C Criterion
The type of the crition used for the aggregation within AMG.
Definition: twolevelmethod.hh:241
Dune::Amg::SmootherTraits< S >::Arguments SmootherArgs
The type of the arguments used for constructing the smoother.
Definition: twolevelmethod.hh:245
O Operator
The type of the linear operator used.
Definition: twolevelmethod.hh:237
CoarseLevelSolver * createCoarseLevelSolver(P &transferPolicy)
Constructs a coarse level solver.
Definition: twolevelmethod.hh:325
AMG< Operator, X, Smoother > AMGType
The type of the AMG construct on the coarse level.
Definition: twolevelmethod.hh:247
S Smoother
The type of the smoother used in AMG.
Definition: twolevelmethod.hh:243
Definition: twolevelmethod.hh:353
CoarseOperatorType::range_type CoarseRangeType
The type of the range of the coarse level operator.
Definition: twolevelmethod.hh:380
FineOperatorType::domain_type FineDomainType
The type of the domain of the fine level operator.
Definition: twolevelmethod.hh:371
TwoLevelMethod(const TwoLevelMethod &other)
Definition: twolevelmethod.hh:418
void pre(FineDomainType &x, FineRangeType &b)
Definition: twolevelmethod.hh:431
FO FineOperatorType
The linear operator of the finel level system. Has to be derived from AssembledLinearOperator.
Definition: twolevelmethod.hh:363
CoarseLevelSolverPolicy::CoarseLevelSolver CoarseLevelSolver
The type of the coarse level solver.
Definition: twolevelmethod.hh:358
void apply(FineDomainType &v, const FineRangeType &d)
Definition: twolevelmethod.hh:439
CSP CoarseLevelSolverPolicy
The type of the policy for constructing the coarse level solver.
Definition: twolevelmethod.hh:356
CoarseOperatorType::domain_type CoarseDomainType
The type of the domain of the coarse level operator.
Definition: twolevelmethod.hh:384
TwoLevelMethod(const FineOperatorType &op, std::shared_ptr< SmootherType > smoother, const LevelTransferPolicy< FineOperatorType, CoarseOperatorType > &policy, CoarseLevelSolverPolicy &coarsePolicy, std::size_t preSteps=1, std::size_t postSteps=1)
Constructs a two level method.
Definition: twolevelmethod.hh:404
virtual SolverCategory::Category category() const
Category of the preconditioner (see SolverCategory::Category)
Definition: twolevelmethod.hh:466
FineOperatorType::range_type FineRangeType
The type of the range of the fine level operator.
Definition: twolevelmethod.hh:367
~TwoLevelMethod()
Definition: twolevelmethod.hh:424
CSP::Operator CoarseOperatorType
The linear operator of the finel level system. Has to be derived from AssembledLinearOperator.
Definition: twolevelmethod.hh:376
void post([[maybe_unused]] FineDomainType &x)
Definition: twolevelmethod.hh:436
S SmootherType
The type of the fine level smoother.
Definition: twolevelmethod.hh:388
Base class for matrix free definition of preconditioners.
Definition: preconditioner.hh:32
Statistics about the application of an inverse operator.
Definition: solver.hh:48
Abstract base class for all solvers.
Definition: solver.hh:99
virtual void apply(X &x, X &b, InverseOperatorResult &res)=0
Apply inverse operator,.
Category
Definition: solvercategory.hh:23
@ sequential
Category for sequential solvers.
Definition: solvercategory.hh:25