|
| | AMG (OperatorHierarchy &matrices, CoarseSolver &coarseSolver, const SmootherArgs &smootherArgs, const Parameters &parms) |
| | Construct a new amg with a specific coarse solver. More...
|
| |
| template<class C > |
| | AMG (const Operator &fineOperator, const C &criterion, const SmootherArgs &smootherArgs=SmootherArgs(), const ParallelInformation &pinfo=ParallelInformation()) |
| | Construct an AMG with an inexact coarse solver based on the smoother. More...
|
| |
| | AMG (std::shared_ptr< const Operator > fineOperator, const ParameterTree &configuration, const ParallelInformation &pinfo=ParallelInformation()) |
| | Constructor an AMG via ParameterTree. More...
|
| |
| | AMG (const AMG &amg) |
| | Copy constructor. More...
|
| |
| void | pre (Domain &x, Range &b) |
| | Prepare the preconditioner. More...
|
| |
| void | apply (Domain &v, const Range &d) |
| | Apply one step of the preconditioner to the system A(v)=d. More...
|
| |
| virtual SolverCategory::Category | category () const |
| | Category of the preconditioner (see SolverCategory::Category) More...
|
| |
| void | post (Domain &x) |
| | Clean up. More...
|
| |
| template<class A1 > |
| void | getCoarsestAggregateNumbers (std::vector< std::size_t, A1 > &cont) |
| | Get the aggregate number of each unknown on the coarsest level. More...
|
| |
| std::size_t | levels () |
| |
| std::size_t | maxlevels () |
| |
| void | recalculateHierarchy () |
| | Recalculate the matrix hierarchy. More...
|
| |
| bool | usesDirectCoarseLevelSolver () const |
| | Check whether the coarse solver used is a direct solver. More...
|
| |
template<class M, class X, class S, class PI = SequentialInformation, class A = std::allocator<X>>
class Dune::Amg::AMG< M, X, S, PI, A >
Parallel algebraic multigrid based on agglomeration.
- Template Parameters
-
| M | The LinearOperator type which represents the matrix |
| X | The vector type |
| S | The smoother type |
| A | An allocator for X |
- Todo:
- drop the smoother template parameter and replace with dynamic construction