A fast (sequential) algebraic multigrid based on agglomeration that saves memory bandwidth.
More...
|
| FastAMG (const OperatorHierarchy &matrices, CoarseSolver &coarseSolver, const Parameters &parms, bool symmetric=true) |
| Construct a new amg with a specific coarse solver.
|
|
template<class C > |
| FastAMG (const Operator &fineOperator, const C &criterion, const Parameters &parms=Parameters(), bool symmetric=true, const ParallelInformation &pinfo=ParallelInformation()) |
| Construct an AMG with an inexact coarse solver based on the smoother.
|
|
| FastAMG (const FastAMG &amg) |
| Copy constructor.
|
|
| ~FastAMG () |
|
void | pre (Domain &x, Range &b) |
| Prepare the preconditioner.
|
|
void | apply (Domain &v, const Range &d) |
| Apply one step of the preconditioner to the system A(v)=d.
|
|
void | post (Domain &x) |
| Clean up.
|
|
template<class A1 > |
void | getCoarsestAggregateNumbers (std::vector< std::size_t, A1 > &cont) |
| Get the aggregate number of each unknown on the coarsest level.
|
|
std::size_t | levels () |
|
std::size_t | maxlevels () |
|
void | recalculateHierarchy () |
| Recalculate the matrix hierarchy.
|
|
bool | usesDirectCoarseLevelSolver () const |
| Check whether the coarse solver used is a direct solver.
|
|
template<
class M,
class X,
class PI = SequentialInformation,
class A = std::allocator<X>>
class Dune::Amg::FastAMG< M, X, PI, A >
A fast (sequential) algebraic multigrid based on agglomeration that saves memory bandwidth.
It combines one Gauss-Seidel smoothing sweep with the defect calculation to reduce memory transfers.
- Template Parameters
-
M | The matrix type |
X | The vector type |
PI | Currently ignored. |
A | An allocator for X |