![]() |
Ginkgo
Generated from pipelines/2837190956 branch based on develop. Ginkgo version 2.0.0
A numerical linear algebra library targeting many-core architectures
|
A module dedicated to the implementation and usage of the Multigrid solver and its components in Ginkgo. More...
Modules | |
| Multigrid Level | |
| A module dedicated to the implementation and usage of the individual levels of a Multigrid hierarchy in Ginkgo. | |
Classes | |
| class | gko::multigrid::FixedCoarsening< ValueType, IndexType > |
| FixedCoarsening is a very simple coarse grid generation algorithm. More... | |
| class | gko::multigrid::MultigridLevel |
| This class represents two levels in a multigrid hierarchy. More... | |
| class | gko::multigrid::EnableMultigridLevel< ValueType > |
The EnableMultigridLevel gives the default implementation of MultigridLevel with composition and provides set_multigrid_level function. More... | |
| class | gko::multigrid::Pgm< ValueType, IndexType > |
| Parallel graph match (Pgm) is the aggregate method introduced in the paper M. More... | |
| class | gko::multigrid::Pmis< ValueType, IndexType > |
| Parallel modified independent set (Pmis) is the classical coarsening method introduced in the paper H. More... | |
| class | gko::multigrid::Rs< ValueType, IndexType > |
| Rs implements the Ruge–Stueben (classical) Algebraic Multigrid (AMG) coarsening strategy for M-matrices. More... | |
| class | gko::multigrid::UniformCoarsening< ValueType, IndexType > |
| UniformCoarsening is a simple coarse grid generation algorithm. More... | |
| class | gko::solver::Multigrid |
| Multigrid solves a linear system by combining cheap iterative sweeps (smoothers) on a hierarchy of progressively coarser representations of the operator with corrections transferred between adjacent levels. More... | |
A module dedicated to the implementation and usage of the Multigrid solver and its components in Ginkgo.
1.8.16