|
typedef T | Dune::Amg::AggregationCriterion< T >::DependencyPolicy |
| The policy for calculating the dependency graph.
|
|
typedef M | Dune::Amg::SymmetricMatrixDependency< M, N >::Matrix |
| The matrix type we build the dependency of.
|
|
typedef N | Dune::Amg::SymmetricMatrixDependency< M, N >::Norm |
| The norm to use for examining the matrix entries.
|
|
typedef Matrix::row_type | Dune::Amg::SymmetricMatrixDependency< M, N >::Row |
| Constant Row iterator of the matrix.
|
|
typedef Matrix::ConstColIterator | Dune::Amg::SymmetricMatrixDependency< M, N >::ColIter |
| Constant column iterator of the matrix.
|
|
typedef Matrix::field_type | Dune::Amg::SymmetricMatrixDependency< M, N >::field_type |
| The current max value.
|
|
typedef FieldTraits< field_type >::real_type | Dune::Amg::SymmetricMatrixDependency< M, N >::real_type |
|
typedef M | Dune::Amg::Dependency< M, N >::Matrix |
| The matrix type we build the dependency of.
|
|
typedef N | Dune::Amg::Dependency< M, N >::Norm |
| The norm to use for examining the matrix entries.
|
|
typedef Matrix::row_type | Dune::Amg::Dependency< M, N >::Row |
| Constant Row iterator of the matrix.
|
|
typedef Matrix::ConstColIterator | Dune::Amg::Dependency< M, N >::ColIter |
| Constant column iterator of the matrix.
|
|
typedef Matrix::field_type | Dune::Amg::Dependency< M, N >::field_type |
| The current max value.
|
|
typedef FieldTraits< field_type >::real_type | Dune::Amg::Dependency< M, N >::real_type |
|
typedef M | Dune::Amg::SymmetricDependency< M, N >::Matrix |
| The matrix type we build the dependency of.
|
|
typedef N | Dune::Amg::SymmetricDependency< M, N >::Norm |
| The norm to use for examining the matrix entries.
|
|
typedef Matrix::row_type | Dune::Amg::SymmetricDependency< M, N >::Row |
| Constant Row iterator of the matrix.
|
|
typedef Matrix::ConstColIterator | Dune::Amg::SymmetricDependency< M, N >::ColIter |
| Constant column iterator of the matrix.
|
|
typedef Matrix::field_type | Dune::Amg::SymmetricDependency< M, N >::field_type |
| The current max value.
|
|
typedef FieldTraits< field_type >::real_type | Dune::Amg::SymmetricDependency< M, N >::real_type |
|
typedef V | Dune::Amg::AggregatesMap< V >::VertexDescriptor |
| The vertex descriptor type.
|
|
typedef V | Dune::Amg::AggregatesMap< V >::AggregateDescriptor |
| The aggregate descriptor type.
|
|
typedef PoolAllocator< VertexDescriptor, 100 > | Dune::Amg::AggregatesMap< V >::Allocator |
| The allocator we use for our lists and the set.
|
|
typedef SLList< VertexDescriptor, Allocator > | Dune::Amg::AggregatesMap< V >::VertexList |
| The type of a single linked list of vertex descriptors.
|
|
typedef const AggregateDescriptor * | Dune::Amg::AggregatesMap< V >::const_iterator |
|
typedef AggregateDescriptor * | Dune::Amg::AggregatesMap< V >::iterator |
|
typedef G | Dune::Amg::Aggregate< G, S >::MatrixGraph |
|
typedef MatrixGraph::VertexDescriptor | Dune::Amg::Aggregate< G, S >::Vertex |
| The vertex descriptor type.
|
|
typedef PoolAllocator< Vertex, 100 > | Dune::Amg::Aggregate< G, S >::Allocator |
| The allocator we use for our lists and the set.
|
|
typedef S | Dune::Amg::Aggregate< G, S >::VertexSet |
| The type of a single linked list of vertex descriptors.
|
|
typedef VertexSet::const_iterator | Dune::Amg::Aggregate< G, S >::const_iterator |
| Const iterator over a vertex list.
|
|
typedef std::size_t * | Dune::Amg::Aggregate< G, S >::SphereMap |
| Type of the mapping of aggregate members onto distance spheres.
|
|
typedef G | Dune::Amg::Aggregator< G >::MatrixGraph |
| The matrix graph type used.
|
|
typedef MatrixGraph::VertexDescriptor | Dune::Amg::Aggregator< G >::Vertex |
| The vertex identifier.
|
|
typedef MatrixGraph::VertexDescriptor | Dune::Amg::Aggregator< G >::AggregateDescriptor |
| The type of the aggregate descriptor.
|
|
typedef V | Dune::Amg::Aggregator< G >::AggregateVisitor< V >::Visitor |
| The type of the adapted visitor.
|
|
typedef M | Dune::Amg::AMG< M, X, S, PI, A >::Operator |
| The matrix operator type.
|
|
typedef PI | Dune::Amg::AMG< M, X, S, PI, A >::ParallelInformation |
| The type of the parallel information. Either OwnerOverlapCommunication or another type describing the parallel data distribution and providing communication methods.
|
|
typedef MatrixHierarchy< M, ParallelInformation, A > | Dune::Amg::AMG< M, X, S, PI, A >::OperatorHierarchy |
| The operator hierarchy type.
|
|
typedef OperatorHierarchy::ParallelInformationHierarchy | Dune::Amg::AMG< M, X, S, PI, A >::ParallelInformationHierarchy |
| The parallal data distribution hierarchy type.
|
|
typedef X | Dune::Amg::AMG< M, X, S, PI, A >::Domain |
| The domain type.
|
|
typedef X | Dune::Amg::AMG< M, X, S, PI, A >::Range |
| The range type.
|
|
typedef InverseOperator< X, X > | Dune::Amg::AMG< M, X, S, PI, A >::CoarseSolver |
| the type of the coarse solver.
|
|
typedef S | Dune::Amg::AMG< M, X, S, PI, A >::Smoother |
| The type of the smoother.
|
|
typedef SmootherTraits< Smoother >::Arguments | Dune::Amg::AMG< M, X, S, PI, A >::SmootherArgs |
| The argument type for the construction of the smoother.
|
|
typedef Smoother | Dune::Amg::AMG< M, X, S, PI, A >::LevelContext::SmootherType |
|
typedef Matrix::field_type | Dune::Amg::DirectSolverSelector< Matrix, Vector >::field_type |
|
typedef InverseOperator< Vector, Vector > | Dune::Amg::DirectSolverSelector< Matrix, Vector >::Solver< M, SolverType >::type |
|
typedef SuperLU< M > | Dune::Amg::DirectSolverSelector< Matrix, Vector >::Solver< M, superlu >::type |
|
typedef Solver< Matrix, solver > | Dune::Amg::DirectSolverSelector< Matrix, Vector >::SelectedSolver |
|
typedef SelectedSolver::type | Dune::Amg::DirectSolverSelector< Matrix, Vector >::DirectSolver |
|
typedef const void * | Dune::Amg::ConstructionTraits< T >::Arguments |
| A type holding all the arguments needed to call the constructor.
|
|
typedef const int | Dune::Amg::ConstructionTraits< BlockVector< T, A > >::Arguments |
|
typedef ReadWritePropertyMapTag | Dune::Amg::PropertyGraphVertexPropertyMap< G, i >::Category |
|
typedef G | Dune::Amg::PropertyGraphVertexPropertyMap< G, i >::Graph |
| The type of the graph with internal properties.
|
|
typedef std::bitset< VertexProperties::SIZE > | Dune::Amg::PropertyGraphVertexPropertyMap< G, i >::BitSet |
| The type of the bitset.
|
|
typedef BitSet::reference | Dune::Amg::PropertyGraphVertexPropertyMap< G, i >::Reference |
| The reference type.
|
|
typedef bool | Dune::Amg::PropertyGraphVertexPropertyMap< G, i >::ValueType |
| The value type.
|
|
typedef G::VertexDescriptor | Dune::Amg::PropertyGraphVertexPropertyMap< G, i >::Vertex |
| The vertex descriptor.
|
|
typedef Amg::PropertyGraphVertexPropertyMap< Amg::PropertiesGraph< G, Amg::VertexProperties, EP, VM, EM >, Amg::VertexProperties::VISITED > | Dune::PropertyMapTypeSelector< Amg::VertexVisitedTag, Amg::PropertiesGraph< G, Amg::VertexProperties, EP, VM, EM > >::Type |
|
typedef T | Dune::Amg::OverlapVertex< T >::Aggregate |
| The aggregate descriptor.
|
|
typedef T | Dune::Amg::OverlapVertex< T >::Vertex |
| The vertex descriptor.
|
|
typedef T | Dune::Amg::GalerkinProduct< T >::ParallelInformation |
|
typedef G | Dune::Amg::BaseConnectivityConstructor::ConnectedBuilder< G, S, V >::Graph |
| The type of the graph.
|
|
typedef Graph::ConstEdgeIterator | Dune::Amg::BaseConnectivityConstructor::ConnectedBuilder< G, S, V >::ConstEdgeIterator |
| The constant edge iterator.
|
|
typedef S | Dune::Amg::BaseConnectivityConstructor::ConnectedBuilder< G, S, V >::Set |
| The type of the connected set.
|
|
typedef V | Dune::Amg::BaseConnectivityConstructor::ConnectedBuilder< G, S, V >::VisitedMap |
| The type of the map for marking vertices as visited.
|
|
typedef Graph::VertexDescriptor | Dune::Amg::BaseConnectivityConstructor::ConnectedBuilder< G, S, V >::Vertex |
| The vertex descriptor of the graph.
|
|
typedef G::VertexDescriptor | Dune::Amg::ConnectivityConstructor< G, T >::Vertex |
|
typedef G::VertexDescriptor | Dune::Amg::ConnectivityConstructor< G, SequentialInformation >::Vertex |
|
typedef TI | Dune::Amg::GlobalAggregatesMap< T, TI >::ParallelIndexSet |
|
typedef ParallelIndexSet::GlobalIndex | Dune::Amg::GlobalAggregatesMap< T, TI >::GlobalIndex |
|
typedef ParallelIndexSet::GlobalIndex | Dune::Amg::GlobalAggregatesMap< T, TI >::IndexedType |
|
typedef ParallelIndexSet::LocalIndex | Dune::Amg::GlobalAggregatesMap< T, TI >::LocalIndex |
|
typedef T | Dune::Amg::GlobalAggregatesMap< T, TI >::Vertex |
|
typedef TI | Dune::Amg::AggregatesGatherScatter< T, TI >::ParallelIndexSet |
|
typedef ParallelIndexSet::GlobalIndex | Dune::Amg::AggregatesGatherScatter< T, TI >::GlobalIndex |
|
typedef T | Dune::Amg::AggregatesPublisher< T, O, OwnerOverlapCopyCommunication< T1, T2 > >::Vertex |
|
typedef O | Dune::Amg::AggregatesPublisher< T, O, OwnerOverlapCopyCommunication< T1, T2 > >::OverlapFlags |
|
typedef OwnerOverlapCopyCommunication< T1, T2 > | Dune::Amg::AggregatesPublisher< T, O, OwnerOverlapCopyCommunication< T1, T2 > >::ParallelInformation |
|
typedef ParallelInformation::GlobalLookupIndexSet | Dune::Amg::AggregatesPublisher< T, O, OwnerOverlapCopyCommunication< T1, T2 > >::GlobalLookupIndexSet |
|
typedef ParallelInformation::ParallelIndexSet | Dune::Amg::AggregatesPublisher< T, O, OwnerOverlapCopyCommunication< T1, T2 > >::IndexSet |
|
typedef T | Dune::Amg::AggregatesPublisher< T, O, SequentialInformation >::Vertex |
|
typedef SequentialInformation | Dune::Amg::AggregatesPublisher< T, O, SequentialInformation >::ParallelInformation |
|
typedef ParallelInformation::GlobalLookupIndexSet | Dune::Amg::AggregatesPublisher< T, O, SequentialInformation >::GlobalLookupIndexSet |
|
typedef Amg::AggregatesMap< T > | Dune::CommPolicy< Amg::GlobalAggregatesMap< T, TI > >::Type |
|
typedef Amg::GlobalAggregatesMap< T, TI >::IndexedType | Dune::CommPolicy< Amg::GlobalAggregatesMap< T, TI > >::IndexedType |
|
typedef SizeOne | Dune::CommPolicy< Amg::GlobalAggregatesMap< T, TI > >::IndexedTypeFlag |
|
typedef E | Dune::Amg::ParallelIndicesCoarsener< T, E >::ExcludedAttributes |
| The set of excluded attributes.
|
|
typedef T | Dune::Amg::ParallelIndicesCoarsener< T, E >::ParallelInformation |
| The type of the parallel information.
|
|
typedef ParallelInformation::ParallelIndexSet | Dune::Amg::ParallelIndicesCoarsener< T, E >::ParallelIndexSet |
|
typedef ParallelIndexSet::GlobalIndex | Dune::Amg::ParallelIndicesCoarsener< T, E >::GlobalIndex |
| The type of the global index.
|
|
typedef ParallelIndexSet::LocalIndex | Dune::Amg::ParallelIndicesCoarsener< T, E >::LocalIndex |
| The type of the local index.
|
|
typedef LocalIndex::Attribute | Dune::Amg::ParallelIndicesCoarsener< T, E >::Attribute |
| The type of the attribute.
|
|
typedef Dune::RemoteIndices< ParallelIndexSet > | Dune::Amg::ParallelIndicesCoarsener< T, E >::RemoteIndices |
| The type of the remote indices.
|
|
typedef C | Dune::Amg::RandomAccessBundledPropertyMap< C, K, i, T, R >::Container |
| The container that holds the properties.
|
|
typedef R | Dune::Amg::RandomAccessBundledPropertyMap< C, K, i, T, R >::Reference |
| The reference type of the container.
|
|
typedef K | Dune::Amg::RandomAccessBundledPropertyMap< C, K, i, T, R >::Key |
| The key of the property map.
|
|
typedef LvaluePropertyMapTag | Dune::Amg::RandomAccessBundledPropertyMap< C, K, i, T, R >::Category |
| The category of the property map.
|
|
typedef FieldTraits< T >::real_type | Dune::Amg::DefaultSmootherArgs< T >::RelaxationFactor |
| The type of the relaxation factor.
|
|
typedef DefaultSmootherArgs< typename T::matrix_type::field_type > | Dune::Amg::SmootherTraits< T >::Arguments |
|
typedef DefaultSmootherArgs< typename X::field_type > | Dune::Amg::SmootherTraits< Richardson< X, Y > >::Arguments |
|
typedef DefaultConstructionArgs< SeqSSOR< M, X, Y, l > > | Dune::Amg::ConstructionTraits< SeqSSOR< M, X, Y, l > >::Arguments |
|
typedef DefaultConstructionArgs< SeqSOR< M, X, Y, l > > | Dune::Amg::ConstructionTraits< SeqSOR< M, X, Y, l > >::Arguments |
|
typedef DefaultConstructionArgs< SeqJac< M, X, Y, l > > | Dune::Amg::ConstructionTraits< SeqJac< M, X, Y, l > >::Arguments |
|
typedef DefaultConstructionArgs< Richardson< X, Y > > | Dune::Amg::ConstructionTraits< Richardson< X, Y > >::Arguments |
|
typedef ConstructionArgs< SeqILU< M, X, Y > > | Dune::Amg::ConstructionTraits< SeqILU< M, X, Y > >::Arguments |
|
typedef DefaultParallelConstructionArgs< M, C > | Dune::Amg::ConstructionTraits< ParSSOR< M, X, Y, C > >::Arguments |
|
typedef DefaultParallelConstructionArgs< T, C > | Dune::Amg::ConstructionTraits< BlockPreconditioner< X, Y, C, T > >::Arguments |
|
typedef ConstructionTraits< T > | Dune::Amg::ConstructionTraits< BlockPreconditioner< X, Y, C, T > >::SeqConstructionTraits |
|
typedef DefaultParallelConstructionArgs< T, C > | Dune::Amg::ConstructionTraits< NonoverlappingBlockPreconditioner< C, T > >::Arguments |
|
typedef ConstructionTraits< T > | Dune::Amg::ConstructionTraits< NonoverlappingBlockPreconditioner< C, T > >::SeqConstructionTraits |
|
typedef T | Dune::Amg::SmootherApplier< T >::Smoother |
|
typedef Smoother::range_type | Dune::Amg::SmootherApplier< T >::Range |
|
typedef Smoother::domain_type | Dune::Amg::SmootherApplier< T >::Domain |
|
typedef SeqSOR< M, X, Y, l > | Dune::Amg::SmootherApplier< SeqSOR< M, X, Y, l > >::Smoother |
|
typedef Smoother::range_type | Dune::Amg::SmootherApplier< SeqSOR< M, X, Y, l > >::Range |
|
typedef Smoother::domain_type | Dune::Amg::SmootherApplier< SeqSOR< M, X, Y, l > >::Domain |
|
typedef BlockPreconditioner< X, Y, C, SeqSOR< M, X, Y, l > > | Dune::Amg::SmootherApplier< BlockPreconditioner< X, Y, C, SeqSOR< M, X, Y, l > > >::Smoother |
|
typedef Smoother::range_type | Dune::Amg::SmootherApplier< BlockPreconditioner< X, Y, C, SeqSOR< M, X, Y, l > > >::Range |
|
typedef Smoother::domain_type | Dune::Amg::SmootherApplier< BlockPreconditioner< X, Y, C, SeqSOR< M, X, Y, l > > >::Domain |
|
typedef NonoverlappingBlockPreconditioner< C, SeqSOR< M, X, Y, l > > | Dune::Amg::SmootherApplier< NonoverlappingBlockPreconditioner< C, SeqSOR< M, X, Y, l > > >::Smoother |
|
typedef Smoother::range_type | Dune::Amg::SmootherApplier< NonoverlappingBlockPreconditioner< C, SeqSOR< M, X, Y, l > > >::Range |
|
typedef Smoother::domain_type | Dune::Amg::SmootherApplier< NonoverlappingBlockPreconditioner< C, SeqSOR< M, X, Y, l > > >::Domain |
|
typedef SeqOverlappingSchwarz< M, X, MultiplicativeSchwarzMode, MS, TA > | Dune::Amg::SmootherApplier< SeqOverlappingSchwarz< M, X, MultiplicativeSchwarzMode, MS, TA > >::Smoother |
|
typedef Smoother::range_type | Dune::Amg::SmootherApplier< SeqOverlappingSchwarz< M, X, MultiplicativeSchwarzMode, MS, TA > >::Range |
|
typedef Smoother::domain_type | Dune::Amg::SmootherApplier< SeqOverlappingSchwarz< M, X, MultiplicativeSchwarzMode, MS, TA > >::Domain |
|
typedef SeqOverlappingSchwarzSmootherArgs< typename M::field_type > | Dune::Amg::SmootherTraits< SeqOverlappingSchwarz< M, X, TM, TS, TA > >::Arguments |
|
typedef MatrixGraph< M >::VertexDescriptor | Dune::Amg::ConstructionArgs< SeqOverlappingSchwarz< M, X, TM, TS, TA > >::VertexDescriptor |
|
typedef Dune::Amg::AggregatesMap< VertexDescriptor > | Dune::Amg::ConstructionArgs< SeqOverlappingSchwarz< M, X, TM, TS, TA > >::AggregatesMap |
|
typedef AggregatesMap::AggregateDescriptor | Dune::Amg::ConstructionArgs< SeqOverlappingSchwarz< M, X, TM, TS, TA > >::AggregateDescriptor |
|
typedef SeqOverlappingSchwarz< M, X, TM, TS, TA >::subdomain_vector | Dune::Amg::ConstructionArgs< SeqOverlappingSchwarz< M, X, TM, TS, TA > >::Vector |
|
typedef Vector::value_type | Dune::Amg::ConstructionArgs< SeqOverlappingSchwarz< M, X, TM, TS, TA > >::Subdomain |
|
typedef ConstructionArgs< SeqOverlappingSchwarz< M, X, TM, TS, TA > > | Dune::Amg::ConstructionTraits< SeqOverlappingSchwarz< M, X, TM, TS, TA > >::Arguments |
|
|
| Dune::Amg::AggregationCriterion< T >::AggregationCriterion () |
| Constructor.
|
|
| Dune::Amg::AggregationCriterion< T >::AggregationCriterion (const Parameters &parms) |
|
void | Dune::Amg::AggregationCriterion< T >::setDefaultValuesIsotropic (std::size_t dim, std::size_t diameter=2) |
| Sets reasonable default values for an isotropic problem.
|
|
void | Dune::Amg::AggregationCriterion< T >::setDefaultValuesAnisotropic (std::size_t dim, std::size_t diameter=2) |
| Sets reasonable default values for an aisotropic problem.
|
|
template<class T > |
std::ostream & | Dune::Amg::operator<< (std::ostream &os, const AggregationCriterion< T > &criterion) |
|
void | Dune::Amg::SymmetricMatrixDependency< M, N >::init (const Matrix *matrix) |
|
void | Dune::Amg::SymmetricMatrixDependency< M, N >::initRow (const Row &row, int index) |
|
void | Dune::Amg::SymmetricMatrixDependency< M, N >::examine (const ColIter &col) |
|
template<class G > |
void | Dune::Amg::SymmetricMatrixDependency< M, N >::examine (G &graph, const typename G::EdgeIterator &edge, const ColIter &col) |
|
bool | Dune::Amg::SymmetricMatrixDependency< M, N >::isIsolated () |
|
| Dune::Amg::SymmetricMatrixDependency< M, N >::SymmetricMatrixDependency (const Parameters &parms) |
|
| Dune::Amg::SymmetricMatrixDependency< M, N >::SymmetricMatrixDependency () |
|
void | Dune::Amg::Dependency< M, N >::init (const Matrix *matrix) |
|
void | Dune::Amg::Dependency< M, N >::initRow (const Row &row, int index) |
|
void | Dune::Amg::Dependency< M, N >::examine (const ColIter &col) |
|
template<class G > |
void | Dune::Amg::Dependency< M, N >::examine (G &graph, const typename G::EdgeIterator &edge, const ColIter &col) |
|
bool | Dune::Amg::Dependency< M, N >::isIsolated () |
|
| Dune::Amg::Dependency< M, N >::Dependency (const Parameters &parms) |
|
| Dune::Amg::Dependency< M, N >::Dependency () |
|
void | Dune::Amg::SymmetricDependency< M, N >::init (const Matrix *matrix) |
|
void | Dune::Amg::SymmetricDependency< M, N >::initRow (const Row &row, int index) |
|
void | Dune::Amg::SymmetricDependency< M, N >::examine (const ColIter &col) |
|
template<class G > |
void | Dune::Amg::SymmetricDependency< M, N >::examine (G &graph, const typename G::EdgeIterator &edge, const ColIter &col) |
|
bool | Dune::Amg::SymmetricDependency< M, N >::isIsolated () |
|
| Dune::Amg::SymmetricDependency< M, N >::SymmetricDependency (const Parameters &parms) |
|
| Dune::Amg::SymmetricDependency< M, N >::SymmetricDependency () |
|
template<class M > |
FieldTraits< typenameM::field_type >::real_type | Dune::Amg::Diagonal< N >::operator() (const M &m, typename std::enable_if_t<!Dune::IsNumber< M >::value > *sfinae=nullptr) const |
| compute the norm of a matrix.
|
|
template<class M > |
auto | Dune::Amg::Diagonal< N >::operator() (const M &m, typename std::enable_if_t< Dune::IsNumber< M >::value > *sfinae=nullptr) const |
| Compute the norm of a scalar.
|
|
template<class M > |
FieldTraits< typenameM::field_type >::real_type | Dune::Amg::RowSum::operator() (const M &m) const |
| compute the norm of a matrix.
|
|
template<class M > |
FieldTraits< typenameM::field_type >::real_type | Dune::Amg::FrobeniusNorm::operator() (const M &m) const |
| compute the norm of a matrix.
|
|
template<class M > |
FieldTraits< typenameM::field_type >::real_type | Dune::Amg::AlwaysOneNorm::operator() (const M &m) const |
| compute the norm of a matrix.
|
|
| Dune::Amg::SymmetricCriterion< M, Norm >::SymmetricCriterion (const Parameters &parms) |
|
| Dune::Amg::SymmetricCriterion< M, Norm >::SymmetricCriterion () |
|
| Dune::Amg::UnSymmetricCriterion< M, Norm >::UnSymmetricCriterion (const Parameters &parms) |
|
| Dune::Amg::UnSymmetricCriterion< M, Norm >::UnSymmetricCriterion () |
|
template<class EdgeIterator > |
void | Dune::Amg::AggregatesMap< V >::DummyEdgeVisitor::operator() (const EdgeIterator &edge) const |
|
| Dune::Amg::AggregatesMap< V >::AggregatesMap () |
| Constructs without allocating memory.
|
|
| Dune::Amg::AggregatesMap< V >::AggregatesMap (std::size_t noVertices) |
| Constructs with allocating memory.
|
|
| Dune::Amg::AggregatesMap< V >::~AggregatesMap () |
| Destructor.
|
|
template<class M , class G , class C > |
std::tuple< int, int, int, int > | Dune::Amg::AggregatesMap< V >::buildAggregates (const M &matrix, G &graph, const C &criterion, bool finestLevel) |
| Build the aggregates.
|
|
template<bool reset, class G , class F , class VM > |
std::size_t | Dune::Amg::AggregatesMap< V >::breadthFirstSearch (const VertexDescriptor &start, const AggregateDescriptor &aggregate, const G &graph, F &aggregateVisitor, VM &visitedMap) const |
| Breadth first search within an aggregate.
|
|
template<bool remove, bool reset, class G , class L , class F1 , class F2 , class VM > |
std::size_t | Dune::Amg::AggregatesMap< V >::breadthFirstSearch (const VertexDescriptor &start, const AggregateDescriptor &aggregate, const G &graph, L &visited, F1 &aggregateVisitor, F2 &nonAggregateVisitor, VM &visitedMap) const |
| Breadth first search within an aggregate.
|
|
void | Dune::Amg::AggregatesMap< V >::allocate (std::size_t noVertices) |
| Allocate memory for holding the information.
|
|
std::size_t | Dune::Amg::AggregatesMap< V >::noVertices () const |
| Get the number of vertices.
|
|
void | Dune::Amg::AggregatesMap< V >::free () |
| Free the allocated memory.
|
|
AggregateDescriptor & | Dune::Amg::AggregatesMap< V >::operator[] (const VertexDescriptor &v) |
| Get the aggregate a vertex belongs to.
|
|
const AggregateDescriptor & | Dune::Amg::AggregatesMap< V >::operator[] (const VertexDescriptor &v) const |
| Get the aggregate a vertex belongs to.
|
|
const_iterator | Dune::Amg::AggregatesMap< V >::begin () const |
|
const_iterator | Dune::Amg::AggregatesMap< V >::end () const |
|
iterator | Dune::Amg::AggregatesMap< V >::begin () |
|
iterator | Dune::Amg::AggregatesMap< V >::end () |
|
template<class G , class C > |
void | Dune::Amg::buildDependency (G &graph, const typename C::Matrix &matrix, C criterion, bool finestLevel) |
| Build the dependency of the matrix graph.
|
|
| Dune::Amg::Aggregate< G, S >::Aggregate (MatrixGraph &graph, AggregatesMap< Vertex > &aggregates, VertexSet &connectivity, std::vector< Vertex > &front_) |
| Constructor.
|
|
void | Dune::Amg::Aggregate< G, S >::invalidate () |
|
void | Dune::Amg::Aggregate< G, S >::reconstruct (const Vertex &vertex) |
| Reconstruct the aggregat from an seed node.
|
|
void | Dune::Amg::Aggregate< G, S >::seed (const Vertex &vertex) |
| Initialize the aggregate with one vertex.
|
|
void | Dune::Amg::Aggregate< G, S >::add (const Vertex &vertex) |
| Add a vertex to the aggregate.
|
|
void | Dune::Amg::Aggregate< G, S >::add (std::vector< Vertex > &vertex) |
|
void | Dune::Amg::Aggregate< G, S >::clear () |
| Clear the aggregate.
|
|
VertexSet::size_type | Dune::Amg::Aggregate< G, S >::size () |
| Get the size of the aggregate.
|
|
VertexSet::size_type | Dune::Amg::Aggregate< G, S >::connectSize () |
| Get tne number of connections to other aggregates.
|
|
int | Dune::Amg::Aggregate< G, S >::id () |
| Get the id identifying the aggregate.
|
|
const_iterator | Dune::Amg::Aggregate< G, S >::begin () const |
| get an iterator over the vertices of the aggregate.
|
|
const_iterator | Dune::Amg::Aggregate< G, S >::end () const |
| get an iterator over the vertices of the aggregate.
|
|
| Dune::Amg::Aggregator< G >::Aggregator () |
| Constructor.
|
|
| Dune::Amg::Aggregator< G >::~Aggregator () |
| Destructor.
|
|
template<class M , class C > |
std::tuple< int, int, int, int > | Dune::Amg::Aggregator< G >::build (const M &m, G &graph, AggregatesMap< Vertex > &aggregates, const C &c, bool finestLevel) |
| Build the aggregates.
|
|
| Dune::Amg::Aggregator< G >::Stack::Stack (const MatrixGraph &graph, const Aggregator< G > &aggregatesBuilder, const AggregatesMap< Vertex > &aggregates) |
|
| Dune::Amg::Aggregator< G >::Stack::~Stack () |
|
Vertex | Dune::Amg::Aggregator< G >::Stack::pop () |
|
| Dune::Amg::Aggregator< G >::AggregateVisitor< V >::AggregateVisitor (const AggregatesMap< Vertex > &aggregates, const AggregateDescriptor &aggregate, Visitor &visitor) |
| Constructor.
|
|
void | Dune::Amg::Aggregator< G >::AggregateVisitor< V >::operator() (const typename MatrixGraph::ConstEdgeIterator &edge) |
| Examine an edge.
|
|
| Dune::Amg::Aggregator< G >::Counter::Counter () |
| Constructor.
|
|
int | Dune::Amg::Aggregator< G >::Counter::value () |
| Access the current count.
|
|
void | Dune::Amg::Aggregator< G >::Counter::increment () |
| Increment counter.
|
|
void | Dune::Amg::Aggregator< G >::Counter::decrement () |
| Decrement counter.
|
|
| Dune::Amg::Aggregator< G >::FrontNeighbourCounter::FrontNeighbourCounter (const MatrixGraph &front) |
| Constructor.
|
|
void | Dune::Amg::Aggregator< G >::FrontNeighbourCounter::operator() (const typename MatrixGraph::ConstEdgeIterator &edge) |
|
void | Dune::Amg::Aggregator< G >::TwoWayCounter::operator() (const typename MatrixGraph::ConstEdgeIterator &edge) |
|
void | Dune::Amg::Aggregator< G >::OneWayCounter::operator() (const typename MatrixGraph::ConstEdgeIterator &edge) |
|
| Dune::Amg::Aggregator< G >::ConnectivityCounter::ConnectivityCounter (const VertexSet &connected, const AggregatesMap< Vertex > &aggregates) |
| Constructor.
|
|
void | Dune::Amg::Aggregator< G >::ConnectivityCounter::operator() (const typename MatrixGraph::ConstEdgeIterator &edge) |
|
| Dune::Amg::Aggregator< G >::DependencyCounter::DependencyCounter () |
| Constructor.
|
|
void | Dune::Amg::Aggregator< G >::DependencyCounter::operator() (const typename MatrixGraph::ConstEdgeIterator &edge) |
|
| Dune::Amg::Aggregator< G >::FrontMarker::FrontMarker (std::vector< Vertex > &front, MatrixGraph &graph) |
| Constructor.
|
|
void | Dune::Amg::Aggregator< G >::FrontMarker::operator() (const typename MatrixGraph::ConstEdgeIterator &edge) |
|
template<class V > |
void | Dune::Amg::printAggregates2d (const AggregatesMap< V > &aggregates, int n, int m, std::ostream &os) |
|
| Dune::Amg::AMG< M, X, S, PI, A >::AMG (OperatorHierarchy &matrices, CoarseSolver &coarseSolver, const SmootherArgs &smootherArgs, const Parameters &parms) |
| Construct a new amg with a specific coarse solver.
|
|
template<class C > |
| Dune::Amg::AMG< M, X, S, PI, A >::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.
|
|
| Dune::Amg::AMG< M, X, S, PI, A >::AMG (std::shared_ptr< const Operator > fineOperator, const ParameterTree &configuration, const ParallelInformation &pinfo=ParallelInformation()) |
| Constructor an AMG via ParameterTree.
|
|
| Dune::Amg::AMG< M, X, S, PI, A >::AMG (const AMG &amg) |
| Copy constructor.
|
|
void | Dune::Amg::AMG< M, X, S, PI, A >::pre (Domain &x, Range &b) |
| Prepare the preconditioner.
|
|
void | Dune::Amg::AMG< M, X, S, PI, A >::apply (Domain &v, const Range &d) |
| Apply one step of the preconditioner to the system A(v)=d.
|
|
virtual SolverCategory::Category | Dune::Amg::AMG< M, X, S, PI, A >::category () const |
| Category of the preconditioner (see SolverCategory::Category)
|
|
void | Dune::Amg::AMG< M, X, S, PI, A >::post (Domain &x) |
| Clean up.
|
|
template<class A1 > |
void | Dune::Amg::AMG< M, X, S, PI, A >::getCoarsestAggregateNumbers (std::vector< std::size_t, A1 > &cont) |
| Get the aggregate number of each unknown on the coarsest level.
|
|
std::size_t | Dune::Amg::AMG< M, X, S, PI, A >::levels () |
|
std::size_t | Dune::Amg::AMG< M, X, S, PI, A >::maxlevels () |
|
void | Dune::Amg::AMG< M, X, S, PI, A >::recalculateHierarchy () |
| Recalculate the matrix hierarchy.
|
|
bool | Dune::Amg::AMG< M, X, S, PI, A >::usesDirectCoarseLevelSolver () const |
| Check whether the coarse solver used is a direct solver.
|
|
std::string | Dune::Amg::AMG< M, X, S, PI, A >::ToLower::operator() (const std::string &str) |
|
static type * | Dune::Amg::DirectSolverSelector< Matrix, Vector >::Solver< M, SolverType >::create (const M &mat, bool verbose, bool reusevector) |
|
static std::string | Dune::Amg::DirectSolverSelector< Matrix, Vector >::Solver< M, SolverType >::name () |
|
static type * | Dune::Amg::DirectSolverSelector< Matrix, Vector >::Solver< M, superlu >::create (const M &mat, bool verbose, bool reusevector) |
|
static std::string | Dune::Amg::DirectSolverSelector< Matrix, Vector >::Solver< M, superlu >::name () |
|
static std::string | Dune::Amg::DirectSolverSelector< Matrix, Vector >::name () |
|
static DirectSolver * | Dune::Amg::DirectSolverSelector< Matrix, Vector >::create (const Matrix &mat, bool verbose, bool reusevector) |
|
template<class OP > |
std::shared_ptr< Dune::Preconditioner< typename OP::element_type::domain_type, typename OP::element_type::range_type > > | Dune::AMGCreator::makeAMG (const OP &op, const std::string &smoother, const Dune::ParameterTree &config) const |
|
template<class M , class X , class Y > |
std::shared_ptr< Dune::Preconditioner< X, Y > > | Dune::AMGCreator::makeAMG (const std::shared_ptr< MatrixAdapter< M, X, Y > > &op, const std::string &smoother, const Dune::ParameterTree &config) const |
|
template<class M , class X , class Y , class C > |
std::shared_ptr< Dune::Preconditioner< X, Y > > | Dune::AMGCreator::makeAMG (const std::shared_ptr< OverlappingSchwarzOperator< M, X, Y, C > > &op, const std::string &smoother, const Dune::ParameterTree &config) const |
|
template<class M , class X , class Y , class C > |
std::shared_ptr< Dune::Preconditioner< X, Y > > | Dune::AMGCreator::makeAMG (const std::shared_ptr< NonoverlappingSchwarzOperator< M, X, Y, C > > &op, const std::string &smoother, const Dune::ParameterTree &config) const |
|
template<typename TL , typename OP > |
std::shared_ptr< Dune::Preconditioner< typename Dune::TypeListElement< 1, TL >::type, typename Dune::TypeListElement< 2, TL >::type > > | Dune::AMGCreator::operator() (TL tl, const std::shared_ptr< OP > &op, const Dune::ParameterTree &config, std::enable_if_t< isValidBlockType< typename OP::matrix_type::block_type >::value, int >=0) const |
|
template<typename TL , typename OP > |
std::shared_ptr< Dune::Preconditioner< typename Dune::TypeListElement< 1, TL >::type, typename Dune::TypeListElement< 2, TL >::type > > | Dune::AMGCreator::operator() (TL, const std::shared_ptr< OP > &, const Dune::ParameterTree &, std::enable_if_t<!isValidBlockType< typename OP::matrix_type::block_type >::value, int >=0) const |
|
static std::shared_ptr< T > | Dune::Amg::ConstructionTraits< T >::construct (Arguments &args) |
| Construct an object with the specified arguments.
|
|
static std::shared_ptr< BlockVector< T, A > > | Dune::Amg::ConstructionTraits< BlockVector< T, A > >::construct (Arguments &n) |
|
| Dune::Amg::ParallelOperatorArgs< M, C >::ParallelOperatorArgs (std::shared_ptr< M > matrix, const C &comm) |
|
| Dune::Amg::OwnerOverlapCopyCommunicationArgs::OwnerOverlapCopyCommunicationArgs (MPI_Comm comm, SolverCategory::Category cat) |
|
| Dune::Amg::SequentialCommunicationArgs::SequentialCommunicationArgs (CollectiveCommunication< void * > comm, int cat) |
|
| Dune::Amg::EdgeProperties::EdgeProperties () |
| Constructor.
|
|
std::bitset< SIZE >::reference | Dune::Amg::EdgeProperties::operator[] (std::size_t v) |
| Access the bits directly.
|
|
bool | Dune::Amg::EdgeProperties::operator[] (std::size_t v) const |
| Access the bits directly.
|
|
bool | Dune::Amg::EdgeProperties::depends () const |
| Checks wether the vertex the edge points to depends on the vertex the edge starts.
|
|
void | Dune::Amg::EdgeProperties::setDepends () |
| Marks the edge as one of which the end point depends on the starting point.
|
|
void | Dune::Amg::EdgeProperties::resetDepends () |
| Resets the depends flag.
|
|
bool | Dune::Amg::EdgeProperties::influences () const |
| Checks wether the start vertex is influenced by the end vertex.
|
|
void | Dune::Amg::EdgeProperties::setInfluences () |
| Marks the edge as one of which the start vertex by the end vertex.
|
|
void | Dune::Amg::EdgeProperties::resetInfluences () |
| Resets the influence flag.
|
|
bool | Dune::Amg::EdgeProperties::isOneWay () const |
| Checks wether the edge is one way. I.e. either the influence or the depends flag but is set.
|
|
bool | Dune::Amg::EdgeProperties::isTwoWay () const |
| Checks wether the edge is two way. I.e. both the influence flag and the depends flag are that.
|
|
bool | Dune::Amg::EdgeProperties::isStrong () const |
| Checks wether the edge is strong. I.e. the influence or depends flag is set.
|
|
void | Dune::Amg::EdgeProperties::reset () |
| Reset all flags.
|
|
void | Dune::Amg::EdgeProperties::printFlags () const |
| Prints the attributes of the edge for debugging.
|
|
| Dune::Amg::VertexProperties::VertexProperties () |
| Constructor.
|
|
std::bitset< SIZE >::reference | Dune::Amg::VertexProperties::operator[] (std::size_t v) |
| Access the bits directly.
|
|
bool | Dune::Amg::VertexProperties::operator[] (std::size_t v) const |
| Access the bits directly.
|
|
void | Dune::Amg::VertexProperties::setIsolated () |
| Marks that node as being isolated.
|
|
bool | Dune::Amg::VertexProperties::isolated () const |
| Checks wether the node is isolated.
|
|
void | Dune::Amg::VertexProperties::resetIsolated () |
| Resets the isolated flag.
|
|
void | Dune::Amg::VertexProperties::setVisited () |
| Mark the node as already visited.
|
|
bool | Dune::Amg::VertexProperties::visited () const |
| Checks wether the node is marked as visited.
|
|
void | Dune::Amg::VertexProperties::resetVisited () |
| Resets the visited flag.
|
|
void | Dune::Amg::VertexProperties::setFront () |
| Marks the node as belonging to the current clusters front.
|
|
bool | Dune::Amg::VertexProperties::front () const |
| Checks wether the node is marked as a front node.
|
|
void | Dune::Amg::VertexProperties::resetFront () |
| Resets the front node flag.
|
|
void | Dune::Amg::VertexProperties::setExcludedBorder () |
| Marks the vertex as excluded from the aggregation.
|
|
bool | Dune::Amg::VertexProperties::excludedBorder () const |
| Tests whether the vertex is excluded from the aggregation.
|
|
void | Dune::Amg::VertexProperties::resetExcludedBorder () |
| Marks the vertex as included in the aggregation.
|
|
void | Dune::Amg::VertexProperties::reset () |
| Reset all flags.
|
|
| Dune::Amg::PropertyGraphVertexPropertyMap< G, i >::PropertyGraphVertexPropertyMap (G &g) |
| Constructor.
|
|
| Dune::Amg::PropertyGraphVertexPropertyMap< G, i >::PropertyGraphVertexPropertyMap () |
| Default constructor.
|
|
Reference | Dune::Amg::PropertyGraphVertexPropertyMap< G, i >::operator[] (const Vertex &vertex) const |
| Get the properties associated to a vertex.
|
|
std::ostream & | Dune::Amg::operator<< (std::ostream &os, const EdgeProperties &props) |
|
std::ostream & | Dune::Amg::operator<< (std::ostream &os, const VertexProperties &props) |
|
| Dune::Amg::SparsityBuilder< M >::SparsityBuilder (M &matrix) |
| Constructor.
|
|
void | Dune::Amg::SparsityBuilder< M >::insert (const typename M::size_type &index) |
|
void | Dune::Amg::SparsityBuilder< M >::operator++ () |
|
std::size_t | Dune::Amg::SparsityBuilder< M >::minRowSize () |
|
std::size_t | Dune::Amg::SparsityBuilder< M >::maxRowSize () |
|
std::size_t | Dune::Amg::SparsityBuilder< M >::sumRowSize () |
|
std::size_t | Dune::Amg::SparsityBuilder< M >::index () |
|
template<class M , class V , class I , class O > |
void | Dune::Amg::BaseGalerkinProduct::calculate (const M &fine, const AggregatesMap< V > &aggregates, M &coarse, const I &pinfo, const O ©) |
| Calculate the galerkin product.
|
|
template<class G , class V , class Set > |
G::MutableMatrix * | Dune::Amg::GalerkinProduct< T >::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.
|
|
bool | Dune::Amg::GalerkinProduct< T >::OVLess< A >::operator() (const OverlapVertex< A > &o1, const OverlapVertex< A > &o2) |
|
template<class G , class V , class Set > |
G::MutableMatrix * | Dune::Amg::GalerkinProduct< SequentialInformation >::build (G &fineGraph, V &visitedMap, const SequentialInformation &pinfo, const AggregatesMap< typename G::VertexDescriptor > &aggregates, const typename G::Matrix::size_type &size, const Set ©) |
| Calculates the coarse matrix via a Galerkin product.
|
|
template<class R , class G , class V > |
static void | Dune::Amg::BaseConnectivityConstructor::constructOverlapConnectivity (R &row, G &graph, V &visitedMap, const AggregatesMap< typename G::VertexDescriptor > &aggregates, const OverlapVertex< typename G::VertexDescriptor > *&seed, const OverlapVertex< typename G::VertexDescriptor > *overlapEnd) |
|
template<class R , class G , class V > |
static void | Dune::Amg::BaseConnectivityConstructor::constructNonOverlapConnectivity (R &row, G &graph, V &visitedMap, const AggregatesMap< typename G::VertexDescriptor > &aggregates, const typename G::VertexDescriptor &seed) |
| Construct the connectivity of an aggregate in the overlap.
|
|
| Dune::Amg::BaseConnectivityConstructor::ConnectedBuilder< G, S, V >::ConnectedBuilder (const AggregatesMap< Vertex > &aggregates, Graph &graph, VisitedMap &visitedMap, Set &connected) |
| Constructor.
|
|
void | Dune::Amg::BaseConnectivityConstructor::ConnectedBuilder< G, S, V >::operator() (const ConstEdgeIterator &edge) |
| Process an edge pointing to another aggregate.
|
|
template<class V , class O , class R > |
static void | Dune::Amg::ConnectivityConstructor< G, T >::examine (G &graph, V &visitedMap, const T &pinfo, const AggregatesMap< Vertex > &aggregates, const O &overlap, const OverlapVertex< Vertex > *overlapVertices, const OverlapVertex< Vertex > *overlapEnd, R &row) |
|
template<class V , class R > |
static void | Dune::Amg::ConnectivityConstructor< G, SequentialInformation >::examine (G &graph, V &visitedMap, const SequentialInformation &pinfo, const AggregatesMap< Vertex > &aggregates, R &row) |
|
template<class M , class O > |
static void | Dune::Amg::DirichletBoundarySetter< T >::set (M &coarse, const T &pinfo, const O ©) |
|
template<class M , class O > |
static void | Dune::Amg::DirichletBoundarySetter< SequentialInformation >::set (M &coarse, const SequentialInformation &pinfo, const O ©) |
|
| Dune::Amg::GlobalAggregatesMap< T, TI >::GlobalAggregatesMap (AggregatesMap< Vertex > &aggregates, const GlobalLookupIndexSet< ParallelIndexSet > &indexset) |
|
const GlobalIndex & | Dune::Amg::GlobalAggregatesMap< T, TI >::operator[] (std::size_t index) const |
|
GlobalIndex & | Dune::Amg::GlobalAggregatesMap< T, TI >::get (std::size_t index) |
|
| Dune::Amg::GlobalAggregatesMap< T, TI >::Proxy::Proxy (const GlobalLookupIndexSet< ParallelIndexSet > &indexset, Vertex &aggregate) |
|
Proxy & | Dune::Amg::GlobalAggregatesMap< T, TI >::Proxy::operator= (const GlobalIndex &global) |
|
Proxy | Dune::Amg::GlobalAggregatesMap< T, TI >::operator[] (std::size_t index) |
|
void | Dune::Amg::GlobalAggregatesMap< T, TI >::put (const GlobalIndex &global, size_t i) |
|
static const GlobalIndex & | Dune::Amg::AggregatesGatherScatter< T, TI >::gather (const GlobalAggregatesMap< T, TI > &ga, size_t i) |
|
static void | Dune::Amg::AggregatesGatherScatter< T, TI >::scatter (GlobalAggregatesMap< T, TI > &ga, GlobalIndex global, size_t i) |
|
static void | Dune::Amg::AggregatesPublisher< T, O, OwnerOverlapCopyCommunication< T1, T2 > >::publish (AggregatesMap< Vertex > &aggregates, ParallelInformation &pinfo, const GlobalLookupIndexSet &globalLookup) |
|
static void | Dune::Amg::AggregatesPublisher< T, O, SequentialInformation >::publish (AggregatesMap< Vertex > &aggregates, ParallelInformation &pinfo, const GlobalLookupIndexSet &globalLookup) |
|
static int | Dune::CommPolicy< Amg::GlobalAggregatesMap< T, TI > >::getSize (const Type &, int) |
|
template<class G , class V > |
int | Dune::Amg::visitNeighbours (const G &graph, const typename G::VertexDescriptor &vertex, V &visitor) |
| Visit all neighbour vertices of a vertex in a graph.
|
|
template<typename Graph , typename VM > |
static Graph::VertexDescriptor | Dune::Amg::ParallelIndicesCoarsener< T, E >::coarsen (ParallelInformation &fineInfo, Graph &fineGraph, VM &visitedMap, AggregatesMap< typename Graph::VertexDescriptor > &aggregates, ParallelInformation &coarseInfo, typename Graph::VertexDescriptor noAggregates) |
| Build the coarse index set after the aggregatio.
|
|
| Dune::Amg::ParallelIndicesCoarsener< T, E >::ParallelAggregateRenumberer< G, I >::ParallelAggregateRenumberer (AggregatesMap< Vertex > &aggregates, const I &lookup) |
|
void | Dune::Amg::ParallelIndicesCoarsener< T, E >::ParallelAggregateRenumberer< G, I >::operator() (const typename G::ConstEdgeIterator &edge) |
|
Vertex | Dune::Amg::ParallelIndicesCoarsener< T, E >::ParallelAggregateRenumberer< G, I >::operator() (const GlobalIndex &global) |
|
bool | Dune::Amg::ParallelIndicesCoarsener< T, E >::ParallelAggregateRenumberer< G, I >::isPublic () |
|
void | Dune::Amg::ParallelIndicesCoarsener< T, E >::ParallelAggregateRenumberer< G, I >::isPublic (bool b) |
|
void | Dune::Amg::ParallelIndicesCoarsener< T, E >::ParallelAggregateRenumberer< G, I >::reset () |
|
void | Dune::Amg::ParallelIndicesCoarsener< T, E >::ParallelAggregateRenumberer< G, I >::attribute (const Attribute &attribute) |
|
Attribute | Dune::Amg::ParallelIndicesCoarsener< T, E >::ParallelAggregateRenumberer< G, I >::attribute () |
|
const GlobalIndex & | Dune::Amg::ParallelIndicesCoarsener< T, E >::ParallelAggregateRenumberer< G, I >::globalIndex () const |
|
void | Dune::Amg::ParallelIndicesCoarsener< T, E >::ParallelAggregateRenumberer< G, I >::globalIndex (const GlobalIndex &global) |
|
template<typename Graph , typename VM > |
static Graph::VertexDescriptor | Dune::Amg::IndicesCoarsener< SequentialInformation, E >::coarsen (const SequentialInformation &fineInfo, Graph &fineGraph, VM &visitedMap, AggregatesMap< typename Graph::VertexDescriptor > &aggregates, SequentialInformation &coarseInfo, typename Graph::VertexDescriptor noAggregates) |
|
template<typename M , typename C1 > |
bool | Dune::Amg::repartitionAndDistributeMatrix (const M &origMatrix, std::shared_ptr< M > newMatrix, SequentialInformation &origComm, std::shared_ptr< SequentialInformation > &newComm, RedistributeInformation< SequentialInformation > &ri, int nparts, C1 &criterion) |
|
template<typename M , typename C , typename C1 > |
bool | Dune::Amg::repartitionAndDistributeMatrix (const M &origMatrix, std::shared_ptr< M > newMatrix, C &origComm, std::shared_ptr< C > &newComm, RedistributeInformation< C > &ri, int nparts, C1 &criterion) |
|
| Dune::Amg::DependencyParameters::DependencyParameters () |
| Constructor.
|
|
void | Dune::Amg::DependencyParameters::setBeta (double b) |
| Set threshold for marking nodes as isolated. The default value is 1.0E-5.
|
|
double | Dune::Amg::DependencyParameters::beta () const |
| Get the threshold for marking nodes as isolated. The default value is 1.0E-5.
|
|
void | Dune::Amg::DependencyParameters::setAlpha (double a) |
| Set the scaling value for marking connections as strong. Default value is 1/3.
|
|
double | Dune::Amg::DependencyParameters::alpha () const |
| Get the scaling value for marking connections as strong. Default value is 1/3.
|
|
| Dune::Amg::AggregationParameters::AggregationParameters () |
| Constructor.
|
|
void | Dune::Amg::AggregationParameters::setDefaultValuesIsotropic (std::size_t dim, std::size_t diameter=2) |
| Sets reasonable default values for an isotropic problem.
|
|
void | Dune::Amg::AggregationParameters::setDefaultValuesAnisotropic (std::size_t dim, std::size_t diameter=2) |
| Sets reasonable default values for an anisotropic problem.
|
|
std::size_t | Dune::Amg::AggregationParameters::maxDistance () const |
| Get the maximal distance allowed between two nodes in a aggregate.
|
|
void | Dune::Amg::AggregationParameters::setMaxDistance (std::size_t distance) |
| Set the maximal distance allowed between two nodes in a aggregate.
|
|
bool | Dune::Amg::AggregationParameters::skipIsolated () const |
| Whether isolated aggregates will not be represented on the coarse level.
|
|
void | Dune::Amg::AggregationParameters::setSkipIsolated (bool skip) |
| Set whether isolated aggregates will not be represented on the coarse level.
|
|
std::size_t | Dune::Amg::AggregationParameters::minAggregateSize () const |
| Get the minimum number of nodes a aggregate has to consist of.
|
|
void | Dune::Amg::AggregationParameters::setMinAggregateSize (std::size_t size) |
| Set the minimum number of nodes a aggregate has to consist of.
|
|
std::size_t | Dune::Amg::AggregationParameters::maxAggregateSize () const |
| Get the maximum number of nodes a aggregate is allowed to have.
|
|
void | Dune::Amg::AggregationParameters::setMaxAggregateSize (std::size_t size) |
| Set the maximum number of nodes a aggregate is allowed to have.
|
|
std::size_t | Dune::Amg::AggregationParameters::maxConnectivity () const |
| Get the maximum number of connections a aggregate is allowed to have.
|
|
void | Dune::Amg::AggregationParameters::setMaxConnectivity (std::size_t connectivity) |
| Set the maximum number of connections a aggregate is allowed to have.
|
|
void | Dune::Amg::CoarseningParameters::setMaxLevel (int l) |
| Set the maximum number of levels allowed in the hierarchy.
|
|
int | Dune::Amg::CoarseningParameters::maxLevel () const |
| Get the maximum number of levels allowed in the hierarchy.
|
|
void | Dune::Amg::CoarseningParameters::setCoarsenTarget (int nodes) |
| Set the maximum number of unknowns allowed on the coarsest level.
|
|
int | Dune::Amg::CoarseningParameters::coarsenTarget () const |
| Get the maximum number of unknowns allowed on the coarsest level.
|
|
void | Dune::Amg::CoarseningParameters::setMinCoarsenRate (double rate) |
| Set the minimum coarsening rate to be achieved in each coarsening.
|
|
double | Dune::Amg::CoarseningParameters::minCoarsenRate () const |
| Get the minimum coarsening rate to be achieved.
|
|
AccumulationMode | Dune::Amg::CoarseningParameters::accumulate () const |
| Whether the data should be accumulated on fewer processes on coarser levels.
|
|
void | Dune::Amg::CoarseningParameters::setAccumulate (AccumulationMode accu) |
| Set whether he data should be accumulated on fewer processes on coarser levels.
|
|
void | Dune::Amg::CoarseningParameters::setAccumulate (bool accu) |
|
void | Dune::Amg::CoarseningParameters::setProlongationDampingFactor (double d) |
| Set the damping factor for the prolongation.
|
|
double | Dune::Amg::CoarseningParameters::getProlongationDampingFactor () const |
| Get the damping factor for the prolongation.
|
|
| Dune::Amg::CoarseningParameters::CoarseningParameters (int maxLevel=100, int coarsenTarget=1000, double minCoarsenRate=1.2, double prolongDamp=1.6, AccumulationMode accumulate=successiveAccu) |
| Constructor.
|
|
void | Dune::Amg::Parameters::setDebugLevel (int level) |
| Set the debugging level.
|
|
int | Dune::Amg::Parameters::debugLevel () const |
| Get the debugging Level.
|
|
void | Dune::Amg::Parameters::setNoPreSmoothSteps (std::size_t steps) |
| Set the number of presmoothing steps to apply.
|
|
std::size_t | Dune::Amg::Parameters::getNoPreSmoothSteps () const |
| Get the number of presmoothing steps to apply.
|
|
void | Dune::Amg::Parameters::setNoPostSmoothSteps (std::size_t steps) |
| Set the number of postsmoothing steps to apply.
|
|
std::size_t | Dune::Amg::Parameters::getNoPostSmoothSteps () const |
| Get the number of postsmoothing steps to apply.
|
|
void | Dune::Amg::Parameters::setGamma (std::size_t gamma) |
| Set the value of gamma; 1 for V-cycle, 2 for W-cycle.
|
|
std::size_t | Dune::Amg::Parameters::getGamma () const |
| Get the value of gamma; 1 for V-cycle, 2 for W-cycle.
|
|
void | Dune::Amg::Parameters::setAdditive (bool additive) |
| Set whether to use additive multigrid.
|
|
bool | Dune::Amg::Parameters::getAdditive () const |
| Get whether to use additive multigrid.
|
|
| Dune::Amg::Parameters::Parameters (int maxLevel=100, int coarsenTarget=1000, double minCoarsenRate=1.2, double prolongDamp=1.6, AccumulationMode accumulate=successiveAccu) |
| Constructor.
|
|
Reference | Dune::Amg::RandomAccessBundledPropertyMap< C, K, i, T, R >::operator[] (const Key &key) const |
| Get the property for a key.
|
|
| Dune::Amg::RandomAccessBundledPropertyMap< C, K, i, T, R >::RandomAccessBundledPropertyMap (Container &container) |
| Constructor.
|
|
| Dune::Amg::RandomAccessBundledPropertyMap< C, K, i, T, R >::RandomAccessBundledPropertyMap () |
| The default constructor.
|
|
| Dune::Amg::DefaultSmootherArgs< T >::DefaultSmootherArgs () |
| Default constructor.
|
|
virtual | Dune::Amg::DefaultConstructionArgs< T >::~DefaultConstructionArgs () |
|
void | Dune::Amg::DefaultConstructionArgs< T >::setMatrix (const Matrix &matrix) |
|
virtual void | Dune::Amg::DefaultConstructionArgs< T >::setMatrix (const Matrix &matrix, const AggregatesMap &amap) |
|
const Matrix & | Dune::Amg::DefaultConstructionArgs< T >::getMatrix () const |
|
void | Dune::Amg::DefaultConstructionArgs< T >::setArgs (const SmootherArgs &args) |
|
template<class T1 > |
void | Dune::Amg::DefaultConstructionArgs< T >::setComm (T1 &comm) |
|
const SequentialInformation & | Dune::Amg::DefaultConstructionArgs< T >::getComm () |
|
const SmootherArgs | Dune::Amg::DefaultConstructionArgs< T >::getArgs () const |
|
virtual | Dune::Amg::DefaultParallelConstructionArgs< T, C >::~DefaultParallelConstructionArgs () |
|
void | Dune::Amg::DefaultParallelConstructionArgs< T, C >::setComm (const C &comm) |
|
const C & | Dune::Amg::DefaultParallelConstructionArgs< T, C >::getComm () const |
|
virtual | Dune::Amg::DefaultConstructionArgs< Richardson< X, Y > >::~DefaultConstructionArgs () |
|
template<class... Args> |
void | Dune::Amg::DefaultConstructionArgs< Richardson< X, Y > >::setMatrix (const Args &...) |
|
void | Dune::Amg::DefaultConstructionArgs< Richardson< X, Y > >::setArgs (const SmootherArgs &args) |
|
template<class T1 > |
void | Dune::Amg::DefaultConstructionArgs< Richardson< X, Y > >::setComm (T1 &comm) |
|
const SequentialInformation & | Dune::Amg::DefaultConstructionArgs< Richardson< X, Y > >::getComm () |
|
const SmootherArgs | Dune::Amg::DefaultConstructionArgs< Richardson< X, Y > >::getArgs () const |
|
static std::shared_ptr< SeqSSOR< M, X, Y, l > > | Dune::Amg::ConstructionTraits< SeqSSOR< M, X, Y, l > >::construct (Arguments &args) |
|
static std::shared_ptr< SeqSOR< M, X, Y, l > > | Dune::Amg::ConstructionTraits< SeqSOR< M, X, Y, l > >::construct (Arguments &args) |
|
static std::shared_ptr< SeqJac< M, X, Y, l > > | Dune::Amg::ConstructionTraits< SeqJac< M, X, Y, l > >::construct (Arguments &args) |
|
static std::shared_ptr< Richardson< X, Y > > | Dune::Amg::ConstructionTraits< Richardson< X, Y > >::construct (Arguments &args) |
|
| Dune::Amg::ConstructionArgs< SeqILU< M, X, Y > >::ConstructionArgs (int n=0) |
|
void | Dune::Amg::ConstructionArgs< SeqILU< M, X, Y > >::setN (int n) |
|
int | Dune::Amg::ConstructionArgs< SeqILU< M, X, Y > >::getN () |
|
static std::shared_ptr< SeqILU< M, X, Y > > | Dune::Amg::ConstructionTraits< SeqILU< M, X, Y > >::construct (Arguments &args) |
|
static std::shared_ptr< ParSSOR< M, X, Y, C > > | Dune::Amg::ConstructionTraits< ParSSOR< M, X, Y, C > >::construct (Arguments &args) |
|
static std::shared_ptr< BlockPreconditioner< X, Y, C, T > > | Dune::Amg::ConstructionTraits< BlockPreconditioner< X, Y, C, T > >::construct (Arguments &args) |
|
static std::shared_ptr< NonoverlappingBlockPreconditioner< C, T > > | Dune::Amg::ConstructionTraits< NonoverlappingBlockPreconditioner< C, T > >::construct (Arguments &args) |
|
static void | Dune::Amg::SmootherApplier< T >::preSmooth (Smoother &smoother, Domain &v, const Range &d) |
| apply pre smoothing in forward direction
|
|
static void | Dune::Amg::SmootherApplier< T >::postSmooth (Smoother &smoother, Domain &v, const Range &d) |
| apply post smoothing in forward direction
|
|
template<typename LevelContext > |
void | Dune::Amg::presmooth (LevelContext &levelContext, size_t steps) |
| Apply pre smoothing on the current level.
|
|
template<typename LevelContext > |
void | Dune::Amg::postsmooth (LevelContext &levelContext, size_t steps) |
| Apply post smoothing on the current level.
|
|
static void | Dune::Amg::SmootherApplier< SeqSOR< M, X, Y, l > >::preSmooth (Smoother &smoother, Domain &v, Range &d) |
|
static void | Dune::Amg::SmootherApplier< SeqSOR< M, X, Y, l > >::postSmooth (Smoother &smoother, Domain &v, Range &d) |
|
static void | Dune::Amg::SmootherApplier< BlockPreconditioner< X, Y, C, SeqSOR< M, X, Y, l > > >::preSmooth (Smoother &smoother, Domain &v, Range &d) |
|
static void | Dune::Amg::SmootherApplier< BlockPreconditioner< X, Y, C, SeqSOR< M, X, Y, l > > >::postSmooth (Smoother &smoother, Domain &v, Range &d) |
|
static void | Dune::Amg::SmootherApplier< NonoverlappingBlockPreconditioner< C, SeqSOR< M, X, Y, l > > >::preSmooth (Smoother &smoother, Domain &v, Range &d) |
|
static void | Dune::Amg::SmootherApplier< NonoverlappingBlockPreconditioner< C, SeqSOR< M, X, Y, l > > >::postSmooth (Smoother &smoother, Domain &v, Range &d) |
|
static void | Dune::Amg::SmootherApplier< SeqOverlappingSchwarz< M, X, MultiplicativeSchwarzMode, MS, TA > >::preSmooth (Smoother &smoother, Domain &v, const Range &d) |
|
static void | Dune::Amg::SmootherApplier< SeqOverlappingSchwarz< M, X, MultiplicativeSchwarzMode, MS, TA > >::postSmooth (Smoother &smoother, Domain &v, const Range &d) |
|
| Dune::Amg::SeqOverlappingSchwarzSmootherArgs< T >::SeqOverlappingSchwarzSmootherArgs (Overlap overlap_=vertex, bool onthefly_=false) |
|
virtual void | Dune::Amg::ConstructionArgs< SeqOverlappingSchwarz< M, X, TM, TS, TA > >::setMatrix (const M &matrix, const AggregatesMap &amap) |
|
void | Dune::Amg::ConstructionArgs< SeqOverlappingSchwarz< M, X, TM, TS, TA > >::setMatrix (const M &matrix) |
|
const Vector & | Dune::Amg::ConstructionArgs< SeqOverlappingSchwarz< M, X, TM, TS, TA > >::getSubDomains () |
|
| Dune::Amg::ConstructionArgs< SeqOverlappingSchwarz< M, X, TM, TS, TA > >::VertexAdder::VertexAdder (Vector &subdomains_, const AggregatesMap &aggregates_) |
|
template<class T > |
void | Dune::Amg::ConstructionArgs< SeqOverlappingSchwarz< M, X, TM, TS, TA > >::VertexAdder::operator() (const T &edge) |
|
int | Dune::Amg::ConstructionArgs< SeqOverlappingSchwarz< M, X, TM, TS, TA > >::VertexAdder::setAggregate (const AggregateDescriptor &aggregate_) |
|
int | Dune::Amg::ConstructionArgs< SeqOverlappingSchwarz< M, X, TM, TS, TA > >::VertexAdder::noSubdomains () const |
|
template<class T > |
void | Dune::Amg::ConstructionArgs< SeqOverlappingSchwarz< M, X, TM, TS, TA > >::NoneAdder::operator() (const T &edge) |
|
int | Dune::Amg::ConstructionArgs< SeqOverlappingSchwarz< M, X, TM, TS, TA > >::NoneAdder::setAggregate (const AggregateDescriptor &aggregate_) |
|
int | Dune::Amg::ConstructionArgs< SeqOverlappingSchwarz< M, X, TM, TS, TA > >::NoneAdder::noSubdomains () const |
|
| Dune::Amg::ConstructionArgs< SeqOverlappingSchwarz< M, X, TM, TS, TA > >::AggregateAdder< VM >::AggregateAdder (Vector &subdomains_, const AggregatesMap &aggregates_, const MatrixGraph< const M > &graph_, VM &visitedMap_) |
|
template<class T > |
void | Dune::Amg::ConstructionArgs< SeqOverlappingSchwarz< M, X, TM, TS, TA > >::AggregateAdder< VM >::operator() (const T &edge) |
|
int | Dune::Amg::ConstructionArgs< SeqOverlappingSchwarz< M, X, TM, TS, TA > >::AggregateAdder< VM >::setAggregate (const AggregateDescriptor &aggregate_) |
|
int | Dune::Amg::ConstructionArgs< SeqOverlappingSchwarz< M, X, TM, TS, TA > >::AggregateAdder< VM >::noSubdomains () const |
|
static std::shared_ptr< SeqOverlappingSchwarz< M, X, TM, TS, TA > > | Dune::Amg::ConstructionTraits< SeqOverlappingSchwarz< M, X, TM, TS, TA > >::construct (Arguments &args) |
|
template<class M , class V , class P , class O > |
void | Dune::Amg::BaseGalerkinProduct::calculate (const M &fine, const AggregatesMap< V > &aggregates, M &coarse, const P &pinfo, const O ©) |
|
| Dune::Amg::Hierarchy< T, A >::Hierarchy (const std::shared_ptr< MemberType > &first) |
| Construct a new hierarchy.
|
|
| Dune::Amg::Hierarchy< T, A >::Hierarchy (const Hierarchy &other) |
| Copy constructor (deep copy!).
|
|
std::size_t | Dune::Amg::Hierarchy< T, A >::levels () const |
| Get the number of levels in the hierarchy.
|
|
void | Dune::Amg::Hierarchy< T, A >::addRedistributedOnCoarsest (Arguments &args) |
|
void | Dune::Amg::Hierarchy< T, A >::addCoarser (Arguments &args) |
| Add an element on a coarser level.
|
|
void | Dune::Amg::Hierarchy< T, A >::addFiner (Arguments &args) |
| Add an element on a finer level.
|
|
Iterator | Dune::Amg::Hierarchy< T, A >::finest () |
| Get an iterator positioned at the finest level.
|
|
Iterator | Dune::Amg::Hierarchy< T, A >::coarsest () |
| Get an iterator positioned at the coarsest level.
|
|
ConstIterator | Dune::Amg::Hierarchy< T, A >::finest () const |
| Get an iterator positioned at the finest level.
|
|
ConstIterator | Dune::Amg::Hierarchy< T, A >::coarsest () const |
| Get an iterator positioned at the coarsest level.
|
|
| Dune::Amg::KAMG< M, X, S, PI, K, A >::KAMG (OperatorHierarchy &matrices, CoarseSolver &coarseSolver, const SmootherArgs &smootherArgs, const Parameters &parms, std::size_t maxLevelKrylovSteps=3, double minDefectReduction=1e-1) |
| Construct a new amg with a specific coarse solver.
|
|
template<class C > |
| Dune::Amg::KAMG< M, X, S, PI, K, A >::KAMG (const Operator &fineOperator, const C &criterion, const SmootherArgs &smootherArgs=SmootherArgs(), std::size_t maxLevelKrylovSteps=3, double minDefectReduction=1e-1, const ParallelInformation &pinfo=ParallelInformation()) |
| Construct an AMG with an inexact coarse solver based on the smoother.
|
|
void | Dune::Amg::KAMG< M, X, S, PI, K, A >::pre (Domain &x, Range &b) |
| Prepare the preconditioner.
|
|
void | Dune::Amg::KAMG< M, X, S, PI, K, A >::post (Domain &x) |
| Clean up.
|
|
void | Dune::Amg::KAMG< M, X, S, PI, K, A >::apply (Domain &v, const Range &d) |
| Apply one step of the preconditioner to the system A(v)=d.
|
|
std::size_t | Dune::Amg::KAMG< M, X, S, PI, K, A >::maxlevels () |
|
| Dune::Amg::MatrixHierarchy< M, PI, A >::MatrixHierarchy (std::shared_ptr< MatrixOperator > fineMatrix, std::shared_ptr< ParallelInformation > pinfo=std::make_shared< ParallelInformation >()) |
| Constructor.
|
|
template<typename O , typename T > |
void | Dune::Amg::MatrixHierarchy< M, PI, A >::build (const T &criterion) |
| Build the matrix hierarchy using aggregation.
|
|
const ParallelMatrixHierarchy & | Dune::Amg::MatrixHierarchy< M, PI, A >::matrices () const |
| Get the matrix hierarchy.
|
|
const ParallelInformationHierarchy & | Dune::Amg::MatrixHierarchy< M, PI, A >::parallelInformation () const |
| Get the hierarchy of the parallel data distribution information.
|
|
void | Dune::Amg::MatrixHierarchy< M, PI, A >::getCoarsestAggregatesOnFinest (std::vector< std::size_t > &data) const |
| Get the mapping of fine level unknowns to coarse level aggregates.
|
|
const AggregatesMapList & | Dune::Amg::MatrixHierarchy< M, PI, A >::aggregatesMaps () const |
| Get the hierarchy of the mappings of the nodes onto aggregates.
|
|
const RedistributeInfoList & | Dune::Amg::MatrixHierarchy< M, PI, A >::redistributeInformation () const |
| Get the hierarchy of the information about redistributions,.
|
|
| Dune::Amg::MatrixHierarchy< M, PI, A >::~MatrixHierarchy () |
|
template<class V , class BA , class TA > |
void | Dune::Amg::MatrixHierarchy< M, PI, A >::coarsenVector (Hierarchy< BlockVector< V, BA >, TA > &hierarchy) const |
| Coarsen the vector hierarchy according to the matrix hierarchy.
|
|
template<class S , class TA > |
void | Dune::Amg::MatrixHierarchy< M, PI, A >::coarsenSmoother (Hierarchy< S, TA > &smoothers, const typename SmootherTraits< S >::Arguments &args) const |
| Coarsen the smoother hierarchy according to the matrix hierarchy.
|
|
template<class F > |
void | Dune::Amg::MatrixHierarchy< M, PI, A >::recalculateGalerkin (const F ©Flags) |
| Recalculate the galerkin products.
|
|
std::size_t | Dune::Amg::MatrixHierarchy< M, PI, A >::levels () const |
| Get the number of levels in the hierarchy.
|
|
std::size_t | Dune::Amg::MatrixHierarchy< M, PI, A >::maxlevels () const |
| Get the max number of levels in the hierarchy of processors.
|
|
bool | Dune::Amg::MatrixHierarchy< M, PI, A >::hasCoarsest () const |
|
bool | Dune::Amg::MatrixHierarchy< M, PI, A >::isBuilt () const |
| Whether the hierarchy was built.
|
|
template<typename T > |
void | Dune::Amg::Transfer< V, V1, SequentialInformation >::prolongateVector (const AggregatesMap< Vertex > &aggregates, Vector &coarse, Vector &fine, Vector &fineRedist, T damp, const SequentialInformation &comm, const Redist &redist) |
|
template<typename T > |
void | Dune::Amg::Transfer< V, V1, SequentialInformation >::prolongateVector (const AggregatesMap< Vertex > &aggregates, Vector &coarse, Vector &fine, T damp, const SequentialInformation &comm) |
|
static void | Dune::Amg::Transfer< V, V1, SequentialInformation >::restrictVector (const AggregatesMap< Vertex > &aggregates, Vector &coarse, const Vector &fine, const SequentialInformation &comm) |
|
template<typename T3 > |
static void | Dune::Amg::Transfer< V, V1, OwnerOverlapCopyCommunication< T1, T2 > >::prolongateVector (const AggregatesMap< Vertex > &aggregates, Vector &coarse, Vector &fine, Vector &fineRedist, T3 damp, OwnerOverlapCopyCommunication< T1, T2 > &comm, const Redist &redist) |
|
template<typename T3 > |
static void | Dune::Amg::Transfer< V, V1, OwnerOverlapCopyCommunication< T1, T2 > >::prolongateVector (const AggregatesMap< Vertex > &aggregates, Vector &coarse, Vector &fine, T3 damp, OwnerOverlapCopyCommunication< T1, T2 > &comm) |
|
static void | Dune::Amg::Transfer< V, V1, OwnerOverlapCopyCommunication< T1, T2 > >::restrictVector (const AggregatesMap< Vertex > &aggregates, Vector &coarse, const Vector &fine, OwnerOverlapCopyCommunication< T1, T2 > &comm) |
|
A Parallel Algebraic Multigrid based on Agglomeration.