- Home
- About DUNE
- Download
- Documentation
- Community
- Development
A Parallel Algebraic Multigrid based on Agglomeration. More...
![]() |
Classes | |
class | Dune::Amg::AggregationCriterion< T > |
Base class of all aggregation criterions. More... | |
class | Dune::Amg::DependencyParameters |
Paramters needed to check whether a node depends on another. More... | |
class | Dune::Amg::Dependency< M, N > |
Dependency policy for symmetric matrices. More... | |
class | Dune::Amg::SymmetricDependency< M, N > |
Dependency policy for symmetric matrices. More... | |
class | Dune::Amg::Diagonal< N > |
Norm that uses only the [N][N] entry of the block to determine couplings. More... | |
class | Dune::Amg::FirstDiagonal |
Norm that uses only the [0][0] entry of the block to determine couplings. More... | |
struct | Dune::Amg::RowSum |
Functor using the row sum (infinity) norm to determine strong couplings. More... | |
struct | Dune::Amg::FrobeniusNorm |
struct | Dune::Amg::AlwaysOneNorm |
class | Dune::Amg::SymmetricCriterion< M, Norm > |
Criterion taking advantage of symmetric matrices. More... | |
class | Dune::Amg::UnSymmetricCriterion< M, Norm > |
Criterion suited for unsymmetric matrices. More... | |
class | Dune::Amg::AggregatesMap< V > |
Class providing information about the mapping of the vertices onto aggregates. More... | |
class | Dune::Amg::AggregatesMap< V >::DummyEdgeVisitor |
A Dummy visitor that does nothing for each visited edge. More... | |
class | Dune::Amg::Aggregate< G, S > |
A class for temporarily storing the vertices of an aggregate in. More... | |
class | Dune::Amg::Aggregator< G > |
Class for building the aggregates. More... | |
class | Dune::Amg::Aggregator< G >::Stack |
Stack. | |
class | Dune::Amg::Aggregator< G >::AggregateVisitor< V > |
An Adaptor for vsitors that only evaluates edges pointing to a specific aggregate. | |
class | Dune::Amg::Aggregator< G >::Counter |
A simple counter functor. | |
class | Dune::Amg::Aggregator< G >::FrontNeighbourCounter |
Counts the number of edges to vertices belonging to the aggregate front. | |
class | Dune::Amg::Aggregator< G >::TwoWayCounter |
Counter of TwoWayConnections. | |
class | Dune::Amg::Aggregator< G >::OneWayCounter |
Counter of OneWayConnections. | |
class | Dune::Amg::Aggregator< G >::ConnectivityCounter |
Connectivity counter. | |
class | Dune::Amg::Aggregator< G >::DependencyCounter |
Counts the edges depending on the dependency. | |
class | Dune::Amg::Aggregator< G >::FrontMarker |
Adds the targets of each edge to the list of front vertices. | |
class | Dune::Amg::AMG< M, X, S, PI, A > |
Parallel algebraic multigrid based on agglomeration. More... | |
class | Dune::Amg::ConstructionTraits< T > |
Traits class for generically constructing non default constructable types. More... | |
class | Dune::Amg::ConstructionTraits< BlockVector< T > > |
struct | Dune::Amg::OverlappingSchwarzOperatorArgs< M, C > |
struct | Dune::Amg::NonoverlappingOperatorArgs< M, C > |
struct | Dune::Amg::OwnerOverlapCopyCommunicationArgs |
struct | Dune::Amg::SequentialCommunicationArgs |
class | Dune::Amg::ConstructionTraits< NonoverlappingSchwarzOperator< M, X, Y, C > > |
struct | Dune::Amg::MatrixAdapterArgs< M, X, Y > |
class | Dune::Amg::ConstructionTraits< MatrixAdapter< M, X, Y > > |
class | Dune::Amg::ConstructionTraits< SequentialInformation > |
class | Dune::Amg::ConstructionTraits< OwnerOverlapCopyCommunication< T1, T2 > > |
class | Dune::Amg::EdgeProperties |
Class representing the properties of an ede in the matrix graph. More... | |
class | Dune::Amg::VertexProperties |
Class representing a node in the matrix graph. More... | |
class | Dune::Amg::PropertyGraphVertexPropertyMap< G, i > |
struct | Dune::Amg::OverlapVertex< T > |
class | Dune::Amg::SparsityBuilder< M > |
Functor for building the sparsity pattern of the matrix using examineConnectivity. More... | |
class | Dune::Amg::BaseGalerkinProduct |
class | Dune::Amg::GalerkinProduct< T > |
struct | Dune::Amg::GalerkinProduct< T >::OVLess< A > |
class | Dune::Amg::GalerkinProduct< SequentialInformation > |
struct | Dune::Amg::BaseConnectivityConstructor |
class | Dune::Amg::BaseConnectivityConstructor::ConnectedBuilder< G, S, V > |
Visitor for identifying connected aggregates during a breadthFirstSearch. More... | |
struct | Dune::Amg::ConnectivityConstructor< G, T > |
struct | Dune::Amg::ConnectivityConstructor< G, SequentialInformation > |
struct | Dune::Amg::DirichletBoundarySetter< T > |
struct | Dune::Amg::DirichletBoundarySetter< SequentialInformation > |
class | Dune::Amg::MatrixGraph< M > |
The (undirected) graph of a matrix. More... | |
class | Dune::Amg::SubGraph< G, T > |
A subgraph of a graph. More... | |
class | Dune::Amg::VertexPropertiesGraph< G, VP, VM > |
Attaches properties to the vertices of a graph. More... | |
class | Dune::Amg::PropertiesGraph< G, VP, EP, VM, EM > |
Attaches properties to the edges and vertices of a graph. More... | |
class | Dune::Amg::GraphVertexPropertiesSelector< G > |
Wrapper to access the internal edge properties of a graph via operator[](). More... | |
class | Dune::Amg::GraphEdgePropertiesSelector< G > |
Wrapper to access the internal vertex properties of a graph via operator[](). More... | |
class | Dune::Amg::Hierarchy< T, A > |
A hierarchy of coantainers (e.g. matrices or vectors). More... | |
class | Dune::Amg::MatrixHierarchy< M, PI, A > |
The hierarchies build by the coarsening process. More... | |
class | Dune::Amg::CoarsenCriterion< T > |
The criterion describing the stop criteria for the coarsening process. More... | |
class | Dune::Amg::IndicesCoarsener< T, E > |
class | Dune::Amg::ParallelIndicesCoarsener< T, E > |
class | Dune::Amg::ParallelIndicesCoarsener< T, E >::ParallelAggregateRenumberer< G, I > |
class | Dune::Amg::IndicesCoarsener< OwnerOverlapCopyCommunication< G, L >, E > |
Coarsen Indices in the parallel case. More... | |
class | Dune::Amg::IndicesCoarsener< SequentialInformation, E > |
Coarsen Indices in the sequential case. More... | |
class | Dune::Amg::KAmgTwoGrid< AMG > |
Two grid operator for AMG with Krylov cycle. More... | |
class | Dune::Amg::KAMG< M, X, S, PI, K, A > |
an algebraic multigrid method using a Krylov-cycle. More... | |
struct | Dune::Amg::VertexVisitedTag |
Tag idnetifying the visited property of a vertex. More... | |
class | Dune::Amg::RandomAccessBundledPropertyMap< C, K, i, T, R > |
A property map that extracts one property out of a bundle using operator[](). More... | |
struct | Dune::Amg::DefaultSmootherArgs< T > |
The default class for the smoother arguments. More... | |
struct | Dune::Amg::SmootherTraits< T > |
Traits class for getting the attribute class of a smoother. More... | |
struct | Dune::Amg::SmootherTraits< BlockPreconditioner< X, Y, C, T > > |
struct | Dune::Amg::SmootherTraits< NonoverlappingBlockPreconditioner< C, T > > |
class | Dune::Amg::DefaultConstructionArgs< T > |
Construction Arguments for the default smoothers. More... | |
struct | Dune::Amg::ConstructionArgs< T > |
class | Dune::Amg::DefaultParallelConstructionArgs< T, C > |
struct | Dune::Amg::ConstructionTraits< SeqSSOR< M, X, Y, l > > |
Policy for the construction of the SeqSSOR smoother. More... | |
struct | Dune::Amg::ConstructionTraits< SeqSOR< M, X, Y, l > > |
Policy for the construction of the SeqSOR smoother. More... | |
struct | Dune::Amg::ConstructionTraits< SeqJac< M, X, Y, l > > |
Policy for the construction of the SeqJac smoother. More... | |
struct | Dune::Amg::ConstructionTraits< SeqILU0< M, X, Y > > |
Policy for the construction of the SeqILUn smoother. More... | |
class | Dune::Amg::ConstructionArgs< SeqILUn< M, X, Y > > |
struct | Dune::Amg::ConstructionTraits< SeqILUn< M, X, Y > > |
Policy for the construction of the SeqJac smoother. More... | |
struct | Dune::Amg::ConstructionTraits< ParSSOR< M, X, Y, C > > |
Policy for the construction of the ParSSOR smoother. More... | |
struct | Dune::Amg::ConstructionTraits< BlockPreconditioner< X, Y, C, T > > |
struct | Dune::Amg::ConstructionTraits< NonoverlappingBlockPreconditioner< C, T > > |
struct | Dune::Amg::SmootherApplier< T > |
Helper class for applying the smoothers. More... | |
struct | Dune::Amg::SmootherApplier< SeqSOR< M, X, Y, l > > |
struct | Dune::Amg::SmootherApplier< BlockPreconditioner< X, Y, C, SeqSOR< M, X, Y, l > > > |
struct | Dune::Amg::SmootherApplier< NonoverlappingBlockPreconditioner< C, SeqSOR< M, X, Y, l > > > |
struct | Dune::Amg::SeqOverlappingSchwarzSmootherArgs< T > |
struct | Dune::Amg::SmootherTraits< SeqOverlappingSchwarz< M, X, TM, TS, TA > > |
class | Dune::Amg::ConstructionArgs< SeqOverlappingSchwarz< M, X, TM, TS, TA > > |
struct | Dune::Amg::ConstructionArgs< SeqOverlappingSchwarz< M, X, TM, TS, TA > >::VertexAdder |
struct | Dune::Amg::ConstructionArgs< SeqOverlappingSchwarz< M, X, TM, TS, TA > >::NoneAdder |
struct | Dune::Amg::ConstructionArgs< SeqOverlappingSchwarz< M, X, TM, TS, TA > >::AggregateAdder< VM > |
struct | Dune::Amg::ConstructionTraits< SeqOverlappingSchwarz< M, X, TM, TS, TA > > |
class | Dune::Amg::Transfer< V1, V2, T > |
class | Dune::Amg::Transfer< V, V1, SequentialInformation > |
class | Dune::Amg::Transfer< V, V1, OwnerOverlapCopyCommunication< T1, T2 > > |
Files | |
file | aggregates.hh |
Provides classes for the Coloring process of AMG. | |
file | amg.hh |
The AMG preconditioner. | |
file | construction.hh |
Helper classes for the construction of classes without empty constructor. | |
file | dependency.hh |
Provides classes for initializing the link attributes of a matrix graph. | |
file | galerkin.hh |
Provides a class for building the galerkin product based on a aggregation scheme. | |
file | graph.hh |
Provides classes for building the matrix graph. | |
file | hierarchy.hh |
Provides a classes representing the hierarchies in AMG. | |
file | indicescoarsener.hh |
Provides a class for building the index set and remote indices on the coarse level. | |
file | kamg.hh |
Provides an algebraic multigrid using a Krylov cycle. | |
file | properties.hh |
Provides classes for handling internal properties in a graph. | |
file | smoother.hh |
Classes for the generic construction and application of the smoothers. | |
file | transfer.hh |
Prolongation and restriction for amg. | |
Typedefs | |
typedef N | Dune::Amg::Dependency::Norm |
The norm to use for examining the matrix entries. | |
typedef Matrix::row_type | Dune::Amg::Dependency::Row |
Constant Row iterator of the matrix. | |
typedef Matrix::ConstColIterator | Dune::Amg::Dependency::ColIter |
Constant column iterator of the matrix. | |
typedef N | Dune::Amg::SymmetricDependency::Norm |
The norm to use for examining the matrix entries. | |
typedef Matrix::row_type | Dune::Amg::SymmetricDependency::Row |
Constant Row iterator of the matrix. | |
typedef Matrix::ConstColIterator | Dune::Amg::SymmetricDependency::ColIter |
Constant column iterator of the matrix. | |
typedef V | Dune::Amg::AggregatesMap::VertexDescriptor |
The vertex descriptor type. | |
typedef V | Dune::Amg::AggregatesMap::AggregateDescriptor |
The aggregate descriptor type. | |
typedef PoolAllocator < VertexDescriptor, 100 > | Dune::Amg::AggregatesMap::Allocator |
The allocator we use for our lists and the set. | |
typedef SLList < VertexDescriptor, Allocator > | Dune::Amg::AggregatesMap::VertexList |
The type of a single linked list of vertex descriptors. | |
typedef const AggregateDescriptor * | Dune::Amg::AggregatesMap::const_iterator |
typedef AggregateDescriptor * | Dune::Amg::AggregatesMap::iterator |
typedef MatrixGraph::VertexDescriptor | Dune::Amg::Aggregate::Vertex |
The vertex descriptor type. | |
typedef PoolAllocator< Vertex, 100 > | Dune::Amg::Aggregate::Allocator |
The allocator we use for our lists and the set. | |
typedef SLList< Vertex, Allocator > | Dune::Amg::Aggregate::VertexList |
The type of a single linked list of vertex descriptors. | |
typedef S | Dune::Amg::Aggregate::VertexSet |
The type of a single linked list of vertex descriptors. | |
typedef VertexList::const_iterator | Dune::Amg::Aggregate::const_iterator |
Const iterator over a vertex list. | |
typedef std::size_t * | Dune::Amg::Aggregate::SphereMap |
Type of the mapping of aggregate members onto distance spheres. | |
typedef MatrixGraph::VertexDescriptor | Dune::Amg::Aggregator::Vertex |
The vertex identifier. | |
typedef MatrixGraph::VertexDescriptor | Dune::Amg::Aggregator::AggregateDescriptor |
The type of the aggregate descriptor. | |
typedef M | Dune::Amg::AMG::Operator |
The matrix operator type. | |
typedef PI | Dune::Amg::AMG::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::OperatorHierarchy |
The operator hierarchy type. | |
typedef OperatorHierarchy::ParallelInformationHierarchy | Dune::Amg::AMG::ParallelInformationHierarchy |
The parallal data distribution hierarchy type. | |
typedef X | Dune::Amg::AMG::Domain |
The domain type. | |
typedef X | Dune::Amg::AMG::Range |
The range type. | |
typedef InverseOperator< X, X > | Dune::Amg::AMG::CoarseSolver |
the type of the coarse solver. | |
typedef S | Dune::Amg::AMG::Smoother |
The type of the smoother. | |
typedef SmootherTraits < Smoother >::Arguments | Dune::Amg::AMG::SmootherArgs |
The argument type for the construction of the smoother. | |
typedef G | Dune::Amg::PropertyGraphVertexPropertyMap::Graph |
The type of the graph with internal properties. | |
typedef std::bitset < VertexProperties::SIZE > | Dune::Amg::PropertyGraphVertexPropertyMap::BitSet |
The type of the bitset. | |
typedef BitSet::reference | Dune::Amg::PropertyGraphVertexPropertyMap::Reference |
The reference type. | |
typedef bool | Dune::Amg::PropertyGraphVertexPropertyMap::ValueType |
The value type. | |
typedef G::VertexDescriptor | Dune::Amg::PropertyGraphVertexPropertyMap::Vertex |
The vertex descriptor. | |
typedef T | Dune::Amg::OverlapVertex::Vertex |
The vertex descriptor. | |
typedef Graph::ConstEdgeIterator | Dune::Amg::BaseConnectivityConstructor::ConnectedBuilder::ConstEdgeIterator |
The constant edge iterator. | |
typedef S | Dune::Amg::BaseConnectivityConstructor::ConnectedBuilder::Set |
The type of the connected set. | |
typedef V | Dune::Amg::BaseConnectivityConstructor::ConnectedBuilder::VisitedMap |
The type of the map for marking vertices as visited. | |
typedef Graph::VertexDescriptor | Dune::Amg::BaseConnectivityConstructor::ConnectedBuilder::Vertex |
The vertex descriptor of the graph. | |
typedef T | Dune::Amg::ParallelIndicesCoarsener::ParallelInformation |
The type of the parallel information. | |
typedef ParallelInformation::ParallelIndexSet | Dune::Amg::ParallelIndicesCoarsener::ParallelIndexSet |
typedef ParallelIndexSet::GlobalIndex | Dune::Amg::ParallelIndicesCoarsener::GlobalIndex |
The type of the global index. | |
typedef ParallelIndexSet::LocalIndex | Dune::Amg::ParallelIndicesCoarsener::LocalIndex |
The type of the local index. | |
typedef LocalIndex::Attribute | Dune::Amg::ParallelIndicesCoarsener::Attribute |
The type of the attribute. | |
typedef Dune::RemoteIndices < ParallelIndexSet > | Dune::Amg::ParallelIndicesCoarsener::RemoteIndices |
The type of the remote indices. | |
typedef R | Dune::Amg::RandomAccessBundledPropertyMap::Reference |
The reference type of the container. | |
typedef K | Dune::Amg::RandomAccessBundledPropertyMap::Key |
The key of the property map. | |
typedef LvaluePropertyMapTag | Dune::Amg::RandomAccessBundledPropertyMap::Category |
The category of the property map. | |
typedef ConstructionTraits< T > | Dune::Amg::ConstructionTraits< BlockPreconditioner< X, Y, C, T > >::SeqConstructionTraits |
typedef ConstructionTraits< T > | Dune::Amg::ConstructionTraits< NonoverlappingBlockPreconditioner< C, T > >::SeqConstructionTraits |
typedef Smoother::range_type | Dune::Amg::SmootherApplier::Range |
typedef Smoother::domain_type | Dune::Amg::SmootherApplier::Domain |
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 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 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 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 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 |
Enumerations | |
enum | { Dune::Amg::AMG::category = S::category } |
enum | { Dune::Amg::EdgeProperties::INFLUENCE, Dune::Amg::EdgeProperties::DEPEND, Dune::Amg::EdgeProperties::SIZE } |
Flags of the link. More... | |
enum | { Dune::Amg::VertexProperties::ISOLATED, Dune::Amg::VertexProperties::VISITED, Dune::Amg::VertexProperties::FRONT, Dune::Amg::VertexProperties::BORDER, Dune::Amg::VertexProperties::SIZE } |
enum | { Dune::Amg::PropertyGraphVertexPropertyMap::index = i } |
enum | { Dune::Amg::MAX_PROCESSES = 72000 } |
enum | Dune::Amg::AccumulationMode { Dune::Amg::noAccu = 0, Dune::Amg::atOnceAccu = 1, Dune::Amg::successiveAccu = 2 } |
Identifiers for the different accumulation modes. More... | |
enum | { Dune::Amg::RandomAccessBundledPropertyMap::index = i } |
Functions | |
Dune::Amg::AggregationCriterion::AggregationCriterion () | |
Constructor. | |
void | Dune::Amg::AggregationCriterion::setDefaultValuesIsotropic (std::size_t dim, std::size_t diameter=2) |
Sets reasonable default values for an isotropic problem. | |
void | Dune::Amg::AggregationCriterion::setDefaultValuesAnisotropic (std::size_t dim, std::size_t diameter=2) |
Sets reasonable default values for an aisotropic problem. | |
std::size_t | Dune::Amg::AggregationCriterion::maxDistance () const |
Get the maximal distance allowed between to nodes in a aggregate. | |
void | Dune::Amg::AggregationCriterion::setMaxDistance (std::size_t distance) |
Set the maximal distance allowed between to nodes in a aggregate. | |
bool | Dune::Amg::AggregationCriterion::skipIsolated () const |
Whether isolated aggregates will not be represented on the coarse level. | |
void | Dune::Amg::AggregationCriterion::setSkipIsolated (bool skip) |
Set whether isolated aggregates will not be represented on the coarse level. | |
std::size_t | Dune::Amg::AggregationCriterion::minAggregateSize () const |
Get the minimum number of nodes a aggregate has to consist of. | |
void | Dune::Amg::AggregationCriterion::setMinAggregateSize (std::size_t size) |
Set the minimum number of nodes a aggregate has to consist of. | |
std::size_t | Dune::Amg::AggregationCriterion::maxAggregateSize () const |
Get the maximum number of nodes a aggregate is allowed to have. | |
void | Dune::Amg::AggregationCriterion::setMaxAggregateSize (std::size_t size) |
Set the maximum number of nodes a aggregate is allowed to have. | |
std::size_t | Dune::Amg::AggregationCriterion::maxConnectivity () const |
Get the maximum number of connections a aggregate is allowed to have. | |
void | Dune::Amg::AggregationCriterion::setMaxConnectivity (std::size_t connectivity) |
Set the maximum number of connections a aggregate is allowed to have. | |
void | Dune::Amg::AggregationCriterion::setDebugLevel (int level) |
Set the debugging level. | |
int | Dune::Amg::AggregationCriterion::debugLevel () const |
Get the debugging Level. | |
template<class T > | |
std::ostream & | Dune::Amg::operator<< (std::ostream &os, const AggregationCriterion< T > &criterion) |
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. | |
void | Dune::Amg::Dependency::init (const Matrix *matrix) |
void | Dune::Amg::Dependency::initRow (const Row &row, int index) |
void | Dune::Amg::Dependency::examine (const ColIter &col) |
template<class G > | |
void | Dune::Amg::Dependency::examine (G &graph, const typename G::EdgeIterator &edge, const ColIter &col) |
bool | Dune::Amg::Dependency::isIsolated () |
void | Dune::Amg::SymmetricDependency::init (const Matrix *matrix) |
void | Dune::Amg::SymmetricDependency::initRow (const Row &row, int index) |
void | Dune::Amg::SymmetricDependency::examine (const ColIter &col) |
template<class G > | |
void | Dune::Amg::SymmetricDependency::examine (G &graph, const typename G::EdgeIterator &edge, const ColIter &col) |
bool | Dune::Amg::SymmetricDependency::isIsolated () |
template<class M > | |
M::field_type | Dune::Amg::Diagonal::operator() (const M &m) const |
compute the norm of a matrix. | |
template<class M > | |
M::field_type | Dune::Amg::RowSum::operator() (const M &m) const |
compute the norm of a matrix. | |
template<class M > | |
M::field_type | Dune::Amg::FrobeniusNorm::operator() (const M &m) const |
compute the norm of a matrix. | |
template<class M > | |
M::field_type | Dune::Amg::AlwaysOneNorm::operator() (const M &m) const |
compute the norm of a matrix. | |
Dune::Amg::AggregatesMap::AggregatesMap () | |
Constructs without allocating memory. | |
Dune::Amg::AggregatesMap::AggregatesMap (std::size_t noVertices) | |
Constructs with allocating memory. | |
Dune::Amg::AggregatesMap::~AggregatesMap () | |
Destructor. | |
template<class M , class G , class C > | |
tuple< int, int, int, int > | Dune::Amg::AggregatesMap::buildAggregates (const M &matrix, G &graph, const C &criterion) |
Build the aggregates. | |
template<bool reset, class G , class F , class VM > | |
std::size_t | Dune::Amg::AggregatesMap::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::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::allocate (std::size_t noVertices) |
Allocate memory for holding the information. | |
std::size_t | Dune::Amg::AggregatesMap::noVertices () const |
Get the number of vertices. | |
void | Dune::Amg::AggregatesMap::free () |
Free the allocated memory. | |
AggregateDescriptor & | Dune::Amg::AggregatesMap::operator[] (const VertexDescriptor &v) |
Get the aggregate a vertex belongs to. | |
const AggregateDescriptor & | Dune::Amg::AggregatesMap::operator[] (const VertexDescriptor &v) const |
Get the aggregate a vertex belongs to. | |
const_iterator | Dune::Amg::AggregatesMap::begin () const |
const_iterator | Dune::Amg::AggregatesMap::end () const |
iterator | Dune::Amg::AggregatesMap::begin () |
iterator | Dune::Amg::AggregatesMap::end () |
template<class G , class C > | |
void | Dune::Amg::buildDependency (G &graph, const typename C::Matrix &matrix, C criterion) |
Build the dependency of the matrix graph. | |
Dune::Amg::Aggregate::Aggregate (const MatrixGraph &graph, AggregatesMap< Vertex > &aggregates, VertexSet &connectivity) | |
Constructor. | |
void | Dune::Amg::Aggregate::reconstruct (const Vertex &vertex) |
Reconstruct the aggregat from an seed node. | |
void | Dune::Amg::Aggregate::seed (const Vertex &vertex) |
Initialize the aggregate with one vertex. | |
void | Dune::Amg::Aggregate::add (const Vertex &vertex) |
Add a vertex to the aggregate. | |
void | Dune::Amg::Aggregate::clear () |
Clear the aggregate. | |
VertexList::size_type | Dune::Amg::Aggregate::size () |
Get the size of the aggregate. | |
VertexList::size_type | Dune::Amg::Aggregate::connectSize () |
Get tne number of connections to other aggregates. | |
int | Dune::Amg::Aggregate::id () |
Get the id identifying the aggregate. | |
const_iterator | Dune::Amg::Aggregate::begin () const |
get an iterator over the vertices of the aggregate. | |
const_iterator | Dune::Amg::Aggregate::end () const |
get an iterator over the vertices of the aggregate. | |
Dune::Amg::Aggregator::Aggregator () | |
Constructor. | |
Dune::Amg::Aggregator::~Aggregator () | |
Destructor. | |
template<class M , class C > | |
tuple< int, int, int, int > | Dune::Amg::Aggregator::build (const M &m, G &graph, AggregatesMap< Vertex > &aggregates, const C &c) |
Build the aggregates. | |
Dune::Amg::Aggregator::Stack::Stack (const MatrixGraph &graph, const Aggregator< G > &aggregatesBuilder, const AggregatesMap< Vertex > &aggregates) | |
Dune::Amg::Aggregator::Stack::~Stack () | |
bool | Dune::Amg::Aggregator::Stack::push (const Vertex &v) |
void | Dune::Amg::Aggregator::Stack::fill () |
Vertex | Dune::Amg::Aggregator::Stack::pop () |
Dune::Amg::Aggregator::AggregateVisitor::AggregateVisitor (const AggregatesMap< Vertex > &aggregates, const AggregateDescriptor &aggregate, Visitor &visitor) | |
Constructor. | |
void | Dune::Amg::Aggregator::AggregateVisitor::operator() (const typename MatrixGraph::ConstEdgeIterator &edge) |
Examine an edge. | |
int | Dune::Amg::Aggregator::Counter::value () |
Access the current count. | |
void | Dune::Amg::Aggregator::Counter::increment () |
Increment counter. | |
void | Dune::Amg::Aggregator::Counter::decrement () |
Decrement counter. | |
void | Dune::Amg::Aggregator::FrontNeighbourCounter::operator() (const typename MatrixGraph::ConstEdgeIterator &edge) |
void | Dune::Amg::Aggregator::ConnectivityCounter::operator() (const typename MatrixGraph::ConstEdgeIterator &edge) |
void | Dune::Amg::Aggregator::DependencyCounter::operator() (const typename MatrixGraph::ConstEdgeIterator &edge) |
void | Dune::Amg::Aggregator::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::AMG (const OperatorHierarchy &matrices, CoarseSolver &coarseSolver, const SmootherArgs &smootherArgs, std::size_t gamma, std::size_t preSmoothingSteps, std::size_t postSmoothingSteps, bool additive=false) | |
Construct a new amg with a specific coarse solver. | |
template<class C > | |
Dune::Amg::AMG::AMG (const Operator &fineOperator, const C &criterion, const SmootherArgs &smootherArgs, std::size_t gamma=1, std::size_t preSmoothingSteps=2, std::size_t postSmoothingSteps=2, bool additive=false, const ParallelInformation &pinfo=ParallelInformation()) | |
Construct an AMG with an inexact coarse solver based on the smoother. | |
Dune::Amg::AMG::~AMG () | |
void | Dune::Amg::AMG::pre (Domain &x, Range &b) |
void | Dune::Amg::AMG::apply (Domain &v, const Range &d) |
void | Dune::Amg::AMG::post (Domain &x) |
template<class A1 > | |
void | Dune::Amg::AMG::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::levels () |
std::size_t | Dune::Amg::AMG::maxlevels () |
void | Dune::Amg::AMG::recalculateHierarchy () |
Recalculate the matrix hierarchy. | |
static T * | Dune::Amg::ConstructionTraits::construct (Arguments &args) |
Construct an object with the specified arguments. | |
static void | Dune::Amg::ConstructionTraits::deconstruct (T *t) |
Destroys an object. | |
static BlockVector< T > * | Dune::Amg::ConstructionTraits< BlockVector< T > >::construct (Arguments &n) |
static void | Dune::Amg::ConstructionTraits< BlockVector< T > >::deconstruct (BlockVector< T > *t) |
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 |
Acess 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 |
Acess 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::PropertyGraphVertexPropertyMap (G &g) | |
Constructor. | |
Dune::Amg::PropertyGraphVertexPropertyMap::PropertyGraphVertexPropertyMap () | |
Default constructor. | |
Reference | Dune::Amg::PropertyGraphVertexPropertyMap::operator[] (const Vertex &vertex) const |
Get the properties associated to a vertex. | |
std::ostream & | Dune::Amg::operator<< (std::ostream &os, const VertexProperties &props) |
void | Dune::Amg::SparsityBuilder::insert (const typename M::size_type &index) |
void | Dune::Amg::SparsityBuilder::operator++ () |
std::size_t | Dune::Amg::SparsityBuilder::minRowSize () |
std::size_t | Dune::Amg::SparsityBuilder::maxRowSize () |
std::size_t | Dune::Amg::SparsityBuilder::sumRowSize () |
std::size_t | Dune::Amg::SparsityBuilder::index () |
template<class M , class G , class V , class Set > | |
M * | Dune::Amg::GalerkinProduct::build (const M &fine, G &fineGraph, V &visitedMap, const ParallelInformation &pinfo, AggregatesMap< typename G::VertexDescriptor > &aggregates, const typename M::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::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::ConnectedBuilder (const AggregatesMap< Vertex > &aggregates, Graph &graph, VisitedMap &visitedMap, Set &connected) | |
Constructor. | |
void | Dune::Amg::BaseConnectivityConstructor::ConnectedBuilder::operator() (const ConstEdgeIterator &edge) |
Process an edge pointing to another aggregate. | |
template<class V , class O , class R > | |
static void | Dune::Amg::ConnectivityConstructor::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 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 M , typename C1 > | |
bool | Dune::Amg::repartitionAndDistributeMatrix (const M &origMatrix, M &newMatrix, SequentialInformation &origSequentialInformationomm, SequentialInformation *&newComm, RedistributeInformation< SequentialInformation > &ri, int nparts, C1 &criterion) |
template<typename M , typename C , typename C1 > | |
bool | Dune::Amg::repartitionAndDistributeMatrix (const M &origMatrix, M &newMatrix, C &origComm, C *&newComm, RedistributeInformation< C > &ri, int nparts, C1 &criterion) |
template<typename M > | |
bool | Dune::Amg::repartitionAndDistributeMatrix (M &origMatrix, M &newMatrix, SequentialInformation &origComm, SequentialInformation &newComm, RedistributeInformation< SequentialInformation > &ri) |
template<typename Graph , typename VM > | |
static Graph::VertexDescriptor | Dune::Amg::ParallelIndicesCoarsener::coarsen (ParallelInformation &fineInfo, Graph &fineGraph, VM &visitedMap, AggregatesMap< typename Graph::VertexDescriptor > &aggregates, ParallelInformation &coarseInfo) |
Build the coarse index set after the aggregatio. | |
Dune::Amg::ParallelIndicesCoarsener::ParallelAggregateRenumberer::ParallelAggregateRenumberer (AggregatesMap< Vertex > &aggregates, const I &lookup) | |
void | Dune::Amg::ParallelIndicesCoarsener::ParallelAggregateRenumberer::operator() (const typename G::ConstEdgeIterator &edge) |
Vertex | Dune::Amg::ParallelIndicesCoarsener::ParallelAggregateRenumberer::operator() (const GlobalIndex &global) |
bool | Dune::Amg::ParallelIndicesCoarsener::ParallelAggregateRenumberer::isPublic () |
void | Dune::Amg::ParallelIndicesCoarsener::ParallelAggregateRenumberer::isPublic (bool b) |
void | Dune::Amg::ParallelIndicesCoarsener::ParallelAggregateRenumberer::reset () |
void | Dune::Amg::ParallelIndicesCoarsener::ParallelAggregateRenumberer::attribute (const Attribute &attribute) |
Attribute | Dune::Amg::ParallelIndicesCoarsener::ParallelAggregateRenumberer::attribute () |
const GlobalIndex & | Dune::Amg::ParallelIndicesCoarsener::ParallelAggregateRenumberer::globalIndex () const |
void | Dune::Amg::ParallelIndicesCoarsener::ParallelAggregateRenumberer::globalIndex (const GlobalIndex &global) |
Reference | Dune::Amg::RandomAccessBundledPropertyMap::operator[] (const Key &key) const |
Get the property for a key. | |
Dune::Amg::RandomAccessBundledPropertyMap::RandomAccessBundledPropertyMap (Container &container) | |
Constructor. | |
Dune::Amg::RandomAccessBundledPropertyMap::RandomAccessBundledPropertyMap () | |
The default constructor. | |
Dune::Amg::DefaultSmootherArgs::DefaultSmootherArgs () | |
Default constructor. | |
virtual | Dune::Amg::DefaultConstructionArgs::~DefaultConstructionArgs () |
void | Dune::Amg::DefaultConstructionArgs::setMatrix (const Matrix &matrix) |
virtual void | Dune::Amg::DefaultConstructionArgs::setMatrix (const Matrix &matrix, const AggregatesMap &amap) |
const Matrix & | Dune::Amg::DefaultConstructionArgs::getMatrix () const |
void | Dune::Amg::DefaultConstructionArgs::setArgs (const SmootherArgs &args) |
template<class T1 > | |
void | Dune::Amg::DefaultConstructionArgs::setComm (T1 &comm) |
const SmootherArgs | Dune::Amg::DefaultConstructionArgs::getArgs () const |
void | Dune::Amg::DefaultParallelConstructionArgs::setComm (const C &comm) |
const C & | Dune::Amg::DefaultParallelConstructionArgs::getComm () const |
static SeqSSOR< M, X, Y, l > * | Dune::Amg::ConstructionTraits< SeqSSOR< M, X, Y, l > >::construct (Arguments &args) |
static void | Dune::Amg::ConstructionTraits< SeqSSOR< M, X, Y, l > >::deconstruct (SeqSSOR< M, X, Y, l > *ssor) |
static SeqSOR< M, X, Y, l > * | Dune::Amg::ConstructionTraits< SeqSOR< M, X, Y, l > >::construct (Arguments &args) |
static void | Dune::Amg::ConstructionTraits< SeqSOR< M, X, Y, l > >::deconstruct (SeqSOR< M, X, Y, l > *sor) |
static SeqJac< M, X, Y, l > * | Dune::Amg::ConstructionTraits< SeqJac< M, X, Y, l > >::construct (Arguments &args) |
static void | Dune::Amg::ConstructionTraits< SeqJac< M, X, Y, l > >::deconstruct (SeqJac< M, X, Y, l > *jac) |
static SeqILU0< M, X, Y > * | Dune::Amg::ConstructionTraits< SeqILU0< M, X, Y > >::construct (Arguments &args) |
static void | Dune::Amg::ConstructionTraits< SeqILU0< M, X, Y > >::deconstruct (SeqILU0< M, X, Y > *ilu) |
void | Dune::Amg::ConstructionArgs< SeqILUn< M, X, Y > >::setN (int n) |
int | Dune::Amg::ConstructionArgs< SeqILUn< M, X, Y > >::getN () |
static SeqILUn< M, X, Y > * | Dune::Amg::ConstructionTraits< SeqILUn< M, X, Y > >::construct (Arguments &args) |
static void | Dune::Amg::ConstructionTraits< SeqILUn< M, X, Y > >::deconstruct (SeqILUn< M, X, Y > *ilu) |
static ParSSOR< M, X, Y, C > * | Dune::Amg::ConstructionTraits< ParSSOR< M, X, Y, C > >::construct (Arguments &args) |
static void | Dune::Amg::ConstructionTraits< ParSSOR< M, X, Y, C > >::deconstruct (ParSSOR< M, X, Y, C > *ssor) |
static BlockPreconditioner< X, Y, C, T > * | Dune::Amg::ConstructionTraits< BlockPreconditioner< X, Y, C, T > >::construct (Arguments &args) |
static void | Dune::Amg::ConstructionTraits< BlockPreconditioner< X, Y, C, T > >::deconstruct (BlockPreconditioner< X, Y, C, T > *bp) |
static NonoverlappingBlockPreconditioner < C, T > * | Dune::Amg::ConstructionTraits< NonoverlappingBlockPreconditioner< C, T > >::construct (Arguments &args) |
static void | Dune::Amg::ConstructionTraits< NonoverlappingBlockPreconditioner< C, T > >::deconstruct (NonoverlappingBlockPreconditioner< C, T > *bp) |
static void | Dune::Amg::SmootherApplier::preSmooth (Smoother &smoother, Domain &v, const Range &d) |
apply pre smoothing in forward direction | |
static void | Dune::Amg::SmootherApplier::postSmooth (Smoother &smoother, Domain &v, const Range &d) |
apply post smoothing in forward direction | |
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::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 () |
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 |
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 |
template<class T > | |
void | Dune::Amg::ConstructionArgs< SeqOverlappingSchwarz< M, X, TM, TS, TA > >::AggregateAdder::operator() (const T &edge) |
int | Dune::Amg::ConstructionArgs< SeqOverlappingSchwarz< M, X, TM, TS, TA > >::AggregateAdder::setAggregate (const AggregateDescriptor &aggregate_) |
int | Dune::Amg::ConstructionArgs< SeqOverlappingSchwarz< M, X, TM, TS, TA > >::AggregateAdder::noSubdomains () const |
static SeqOverlappingSchwarz < M, X, TM, TS, TA > * | Dune::Amg::ConstructionTraits< SeqOverlappingSchwarz< M, X, TM, TS, TA > >::construct (Arguments &args) |
static void | Dune::Amg::ConstructionTraits< SeqOverlappingSchwarz< M, X, TM, TS, TA > >::deconstruct (SeqOverlappingSchwarz< M, X, TM, TS, TA > *schwarz) |
template<class C > | |
Dune::Amg::AMG::AMG (const Operator &matrix, const C &criterion, const SmootherArgs &smootherArgs, std::size_t gamma, std::size_t preSmoothingSteps, std::size_t postSmoothingSteps, bool additive_, const PI &pinfo) | |
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) |
Dune::Amg::SparsityBuilder::SparsityBuilder (M &matrix) | |
Constructor. | |
template<class M , class G , class V , class Set > | |
M * | Dune::Amg::GalerkinProduct< SequentialInformation >::build (const M &fine, G &fineGraph, V &visitedMap, const SequentialInformation &pinfo, const AggregatesMap< typename G::VertexDescriptor > &aggregates, const typename M::size_type &size, const Set ©) |
Calculates the coarse matrix via a Galerkin product. | |
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 ©) |
template<class M , class O > | |
static void | Dune::Amg::DirichletBoundarySetter::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::MatrixHierarchy::MatrixHierarchy (const MatrixOperator &fineMatrix, const ParallelInformation &pinfo=ParallelInformation()) | |
Constructor. | |
template<typename O , typename T > | |
void | Dune::Amg::MatrixHierarchy::build (const T &criterion) |
Build the matrix hierarchy using aggregation. | |
const ParallelMatrixHierarchy & | Dune::Amg::MatrixHierarchy::matrices () const |
Get the matrix hierarchy. | |
const ParallelInformationHierarchy & | Dune::Amg::MatrixHierarchy::parallelInformation () const |
Get the hierarchy of the parallel data distribution information. | |
void | Dune::Amg::MatrixHierarchy::getCoarsestAggregatesOnFinest (std::vector< std::size_t > &data) const |
Get the mapping of fine level unknowns to coarse level aggregates. | |
const AggregatesMapList & | Dune::Amg::MatrixHierarchy::aggregatesMaps () const |
Get the hierarchy of the mappings of the nodes onto aggregates. | |
const RedistributeInfoList & | Dune::Amg::MatrixHierarchy::redistributeInformation () const |
Get the hierachy of the information about redistributions,. | |
Dune::Amg::MatrixHierarchy::~MatrixHierarchy () | |
template<class V , class TA > | |
void | Dune::Amg::MatrixHierarchy::coarsenVector (Hierarchy< BlockVector< V, TA > > &hierarchy) const |
Coarsen the vector hierarchy according to the matrix hierarchy. | |
template<class S , class TA > | |
void | Dune::Amg::MatrixHierarchy::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::recalculateGalerkin (const F ©Flags) |
Recalculate the galerkin products. | |
std::size_t | Dune::Amg::MatrixHierarchy::levels () const |
Get the number of levels in the hierarchy. | |
std::size_t | Dune::Amg::MatrixHierarchy::maxlevels () const |
Get the max number of levels in the hierarchy of processors. | |
bool | Dune::Amg::MatrixHierarchy::hasCoarsest () const |
bool | Dune::Amg::MatrixHierarchy::isBuilt () const |
Whether the hierarchy wis built. | |
Dune::Amg::Hierarchy::Hierarchy () | |
Construct a new empty hierarchy. | |
Dune::Amg::Hierarchy::Hierarchy (MemberType &first) | |
Construct a new hierarchy. | |
Dune::Amg::Hierarchy::~Hierarchy () | |
Destructor. | |
std::size_t | Dune::Amg::Hierarchy::levels () const |
Get the number of levels in the hierarchy. | |
void | Dune::Amg::Hierarchy::addRedistributedOnCoarsest (T *t) |
void | Dune::Amg::Hierarchy::addCoarser (Arguments &args) |
Add an element on a coarser level. | |
void | Dune::Amg::Hierarchy::addFiner (Arguments &args) |
Add an element on a finer level. | |
Iterator | Dune::Amg::Hierarchy::finest () |
Get an iterator positioned at the finest level. | |
Iterator | Dune::Amg::Hierarchy::coarsest () |
Get an iterator positioned at the coarsest level. | |
ConstIterator | Dune::Amg::Hierarchy::finest () const |
Get an iterator positioned at the finest level. | |
ConstIterator | Dune::Amg::Hierarchy::coarsest () const |
Get an iterator positioned at the coarsest level. | |
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) |
Dune::Amg::KAMG::KAMG (const OperatorHierarchy &matrices, CoarseSolver &coarseSolver, const SmootherArgs &smootherArgs, std::size_t gamma, std::size_t preSmoothingSteps=1, std::size_t postSmoothingSteps=1, std::size_t maxLevelKrylovSteps=3, double minDefectReduction=1e-1) | |
Construct a new amg with a specific coarse solver. | |
template<class C > | |
Dune::Amg::KAMG::KAMG (const Operator &fineOperator, const C &criterion, const SmootherArgs &smootherArgs, std::size_t gamma=1, std::size_t preSmoothingSteps=1, std::size_t postSmoothingSteps=1, 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::pre (Domain &x, Range &b) |
void | Dune::Amg::KAMG::post (Domain &x) |
void | Dune::Amg::KAMG::apply (Domain &x, const Range &b) |
std::size_t | Dune::Amg::KAMG::maxlevels () |
template<typename T > | |
void | Dune::Amg::Transfer< V, V1, SequentialInformation >::prolongate (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 >::prolongate (const AggregatesMap< Vertex > &aggregates, Vector &coarse, Vector &fine, T damp, const SequentialInformation &comm) |
static void | Dune::Amg::Transfer< V, V1, SequentialInformation >::restrict (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 > >::prolongate (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 > >::prolongate (const AggregatesMap< Vertex > &aggregates, Vector &coarse, Vector &fine, T3 damp, OwnerOverlapCopyCommunication< T1, T2 > &comm) |
static void | Dune::Amg::Transfer< V, V1, OwnerOverlapCopyCommunication< T1, T2 > >::restrict (const AggregatesMap< Vertex > &aggregates, Vector &coarse, const Vector &fine, OwnerOverlapCopyCommunication< T1, T2 > &comm) |
Variables | |
static const V | Dune::Amg::AggregatesMap::ISOLATED |
Identifier of isolated vertices. | |
M * | Dune::Amg::OverlappingSchwarzOperatorArgs::matrix_ |
C * | Dune::Amg::OverlappingSchwarzOperatorArgs::comm_ |
M * | Dune::Amg::NonoverlappingOperatorArgs::matrix_ |
C * | Dune::Amg::NonoverlappingOperatorArgs::comm_ |
MPI_Comm | Dune::Amg::OwnerOverlapCopyCommunicationArgs::comm_ |
SolverCategory::Category | Dune::Amg::OwnerOverlapCopyCommunicationArgs::cat_ |
CollectiveCommunication< void * > | Dune::Amg::SequentialCommunicationArgs::comm_ |
Aggregate * | Dune::Amg::OverlapVertex::aggregate |
The aggregate the vertex belongs to. | |
Vertex | Dune::Amg::OverlapVertex::vertex |
The vertex descriptor. | |
int | Dune::Amg::DefaultSmootherArgs::iterations |
The numbe of iterations to perform. | |
RelaxationFactor | Dune::Amg::DefaultSmootherArgs::relaxationFactor |
The relaxation factor to use. | |
const Matrix * | Dune::Amg::DefaultConstructionArgs::matrix_ |
Overlap | Dune::Amg::SeqOverlappingSchwarzSmootherArgs::overlap |
bool | Dune::Amg::SeqOverlappingSchwarzSmootherArgs::onthefly |
Friends | |
class | Dune::Amg::Aggregator::Stack |
class | Dune::Amg::AMG::KAmgTwoGrid< AMG > |
A Parallel Algebraic Multigrid based on Agglomeration.
typedef V Dune::Amg::AggregatesMap< V >::AggregateDescriptor [inherited] |
The aggregate descriptor type.
typedef MatrixGraph::VertexDescriptor Dune::Amg::Aggregator< G >::AggregateDescriptor [inherited] |
The type of the aggregate descriptor.
typedef AggregatesMap::AggregateDescriptor Dune::Amg::ConstructionArgs< SeqOverlappingSchwarz< M, X, TM, TS, TA > >::AggregateDescriptor [inherited] |
typedef Dune::Amg::AggregatesMap<VertexDescriptor> Dune::Amg::ConstructionArgs< SeqOverlappingSchwarz< M, X, TM, TS, TA > >::AggregatesMap [inherited] |
Reimplemented from Dune::Amg::DefaultConstructionArgs< SeqOverlappingSchwarz< M, X, TM, TS, TA > >.
typedef PoolAllocator<VertexDescriptor,100> Dune::Amg::AggregatesMap< V >::Allocator [inherited] |
The allocator we use for our lists and the set.
typedef PoolAllocator<Vertex,100> Dune::Amg::Aggregate< G, S >::Allocator [inherited] |
The allocator we use for our lists and the set.
typedef LocalIndex::Attribute Dune::Amg::ParallelIndicesCoarsener< T, E >::Attribute [inherited] |
The type of the attribute.
typedef std::bitset<VertexProperties::SIZE> Dune::Amg::PropertyGraphVertexPropertyMap< G, i >::BitSet [inherited] |
The type of the bitset.
typedef LvaluePropertyMapTag Dune::Amg::RandomAccessBundledPropertyMap< C, K, i, T, R >::Category [inherited] |
The category of the property map.
typedef InverseOperator<X,X> Dune::Amg::AMG< M, X, S, PI, A >::CoarseSolver [inherited] |
the type of the coarse solver.
typedef Matrix::ConstColIterator Dune::Amg::Dependency< M, N >::ColIter [inherited] |
Constant column iterator of the matrix.
typedef Matrix::ConstColIterator Dune::Amg::SymmetricDependency< M, N >::ColIter [inherited] |
Constant column iterator of the matrix.
typedef VertexList::const_iterator Dune::Amg::Aggregate< G, S >::const_iterator [inherited] |
Const iterator over a vertex list.
typedef const AggregateDescriptor* Dune::Amg::AggregatesMap< V >::const_iterator [inherited] |
typedef Graph::ConstEdgeIterator Dune::Amg::BaseConnectivityConstructor::ConnectedBuilder< G, S, V >::ConstEdgeIterator [inherited] |
The constant edge iterator.
typedef Smoother::domain_type Dune::Amg::SmootherApplier< SeqSOR< M, X, Y, l > >::Domain [inherited] |
typedef Smoother::domain_type Dune::Amg::SmootherApplier< BlockPreconditioner< X, Y, C, SeqSOR< M, X, Y, l > > >::Domain [inherited] |
typedef Smoother::domain_type Dune::Amg::SmootherApplier< NonoverlappingBlockPreconditioner< C, SeqSOR< M, X, Y, l > > >::Domain [inherited] |
typedef Smoother::domain_type Dune::Amg::SmootherApplier< SeqOverlappingSchwarz< M, X, MultiplicativeSchwarzMode, MS, TA > >::Domain [inherited] |
typedef X Dune::Amg::AMG< M, X, S, PI, A >::Domain [inherited] |
The domain type.
typedef Smoother::domain_type Dune::Amg::SmootherApplier< T >::Domain [inherited] |
typedef ParallelIndexSet::GlobalIndex Dune::Amg::ParallelIndicesCoarsener< T, E >::GlobalIndex [inherited] |
The type of the global index.
typedef G Dune::Amg::PropertyGraphVertexPropertyMap< G, i >::Graph [inherited] |
The type of the graph with internal properties.
typedef AggregateDescriptor* Dune::Amg::AggregatesMap< V >::iterator [inherited] |
typedef K Dune::Amg::RandomAccessBundledPropertyMap< C, K, i, T, R >::Key [inherited] |
The key of the property map.
typedef ParallelIndexSet::LocalIndex Dune::Amg::ParallelIndicesCoarsener< T, E >::LocalIndex [inherited] |
The type of the local index.
typedef N Dune::Amg::SymmetricDependency< M, N >::Norm [inherited] |
The norm to use for examining the matrix entries.
typedef N Dune::Amg::Dependency< M, N >::Norm [inherited] |
The norm to use for examining the matrix entries.
typedef M Dune::Amg::AMG< M, X, S, PI, A >::Operator [inherited] |
The matrix operator type.
typedef MatrixHierarchy<M, ParallelInformation, A> Dune::Amg::AMG< M, X, S, PI, A >::OperatorHierarchy [inherited] |
The operator hierarchy type.
typedef ParallelInformation::ParallelIndexSet Dune::Amg::ParallelIndicesCoarsener< T, E >::ParallelIndexSet [inherited] |
typedef T Dune::Amg::ParallelIndicesCoarsener< T, E >::ParallelInformation [inherited] |
The type of the parallel information.
typedef PI Dune::Amg::AMG< M, X, S, PI, A >::ParallelInformation [inherited] |
The type of the parallel information. Either OwnerOverlapCommunication or another type describing the parallel data distribution and providing communication methods.
typedef OperatorHierarchy::ParallelInformationHierarchy Dune::Amg::AMG< M, X, S, PI, A >::ParallelInformationHierarchy [inherited] |
The parallal data distribution hierarchy type.
typedef Smoother::range_type Dune::Amg::SmootherApplier< SeqSOR< M, X, Y, l > >::Range [inherited] |
typedef Smoother::range_type Dune::Amg::SmootherApplier< BlockPreconditioner< X, Y, C, SeqSOR< M, X, Y, l > > >::Range [inherited] |
typedef Smoother::range_type Dune::Amg::SmootherApplier< NonoverlappingBlockPreconditioner< C, SeqSOR< M, X, Y, l > > >::Range [inherited] |
typedef Smoother::range_type Dune::Amg::SmootherApplier< SeqOverlappingSchwarz< M, X, MultiplicativeSchwarzMode, MS, TA > >::Range [inherited] |
typedef Smoother::range_type Dune::Amg::SmootherApplier< T >::Range [inherited] |
typedef X Dune::Amg::AMG< M, X, S, PI, A >::Range [inherited] |
The range type.
typedef BitSet::reference Dune::Amg::PropertyGraphVertexPropertyMap< G, i >::Reference [inherited] |
The reference type.
typedef R Dune::Amg::RandomAccessBundledPropertyMap< C, K, i, T, R >::Reference [inherited] |
The reference type of the container.
typedef Dune::RemoteIndices<ParallelIndexSet> Dune::Amg::ParallelIndicesCoarsener< T, E >::RemoteIndices [inherited] |
The type of the remote indices.
typedef Matrix::row_type Dune::Amg::SymmetricDependency< M, N >::Row [inherited] |
Constant Row iterator of the matrix.
typedef Matrix::row_type Dune::Amg::Dependency< M, N >::Row [inherited] |
Constant Row iterator of the matrix.
typedef ConstructionTraits<T> Dune::Amg::ConstructionTraits< NonoverlappingBlockPreconditioner< C, T > >::SeqConstructionTraits [inherited] |
typedef ConstructionTraits<T> Dune::Amg::ConstructionTraits< BlockPreconditioner< X, Y, C, T > >::SeqConstructionTraits [inherited] |
typedef S Dune::Amg::BaseConnectivityConstructor::ConnectedBuilder< G, S, V >::Set [inherited] |
The type of the connected set.
typedef S Dune::Amg::AMG< M, X, S, PI, A >::Smoother [inherited] |
The type of the smoother.
One of the preconditioners implementing the Preconditioner interface. Note that the smoother has to fit the ParallelInformation.
typedef SmootherTraits<Smoother>::Arguments Dune::Amg::AMG< M, X, S, PI, A >::SmootherArgs [inherited] |
The argument type for the construction of the smoother.
typedef std::size_t* Dune::Amg::Aggregate< G, S >::SphereMap [inherited] |
Type of the mapping of aggregate members onto distance spheres.
typedef Vector::value_type Dune::Amg::ConstructionArgs< SeqOverlappingSchwarz< M, X, TM, TS, TA > >::Subdomain [inherited] |
typedef bool Dune::Amg::PropertyGraphVertexPropertyMap< G, i >::ValueType [inherited] |
The value type.
typedef SeqOverlappingSchwarz<M,X,TM,TS,TA>::subdomain_vector Dune::Amg::ConstructionArgs< SeqOverlappingSchwarz< M, X, TM, TS, TA > >::Vector [inherited] |
typedef T Dune::Amg::OverlapVertex< T >::Vertex [inherited] |
The vertex descriptor.
typedef G::VertexDescriptor Dune::Amg::PropertyGraphVertexPropertyMap< G, i >::Vertex [inherited] |
The vertex descriptor.
typedef MatrixGraph::VertexDescriptor Dune::Amg::Aggregator< G >::Vertex [inherited] |
The vertex identifier.
typedef Graph::VertexDescriptor Dune::Amg::BaseConnectivityConstructor::ConnectedBuilder< G, S, V >::Vertex [inherited] |
The vertex descriptor of the graph.
typedef MatrixGraph::VertexDescriptor Dune::Amg::Aggregate< G, S >::Vertex [inherited] |
The vertex descriptor type.
typedef V Dune::Amg::AggregatesMap< V >::VertexDescriptor [inherited] |
The vertex descriptor type.
typedef MatrixGraph<M>::VertexDescriptor Dune::Amg::ConstructionArgs< SeqOverlappingSchwarz< M, X, TM, TS, TA > >::VertexDescriptor [inherited] |
typedef SLList<Vertex,Allocator> Dune::Amg::Aggregate< G, S >::VertexList [inherited] |
The type of a single linked list of vertex descriptors.
typedef SLList<VertexDescriptor,Allocator> Dune::Amg::AggregatesMap< V >::VertexList [inherited] |
The type of a single linked list of vertex descriptors.
typedef S Dune::Amg::Aggregate< G, S >::VertexSet [inherited] |
The type of a single linked list of vertex descriptors.
typedef V Dune::Amg::BaseConnectivityConstructor::ConnectedBuilder< G, S, V >::VisitedMap [inherited] |
The type of the map for marking vertices as visited.
anonymous enum [inherited] |
anonymous enum [inherited] |
anonymous enum |
anonymous enum [inherited] |
Identifiers for the different accumulation modes.
void Dune::Amg::Aggregate< G, S >::add | ( | const Vertex & | vertex | ) | [inherited] |
Add a vertex to the aggregate.
void Dune::Amg::Hierarchy< T, A >::addCoarser | ( | Arguments & | args | ) | [inherited] |
Add an element on a coarser level.
args | The arguments needed for the construction. |
Referenced by Dune::Amg::MatrixHierarchy< M, PI, A >::build(), and Dune::Amg::MatrixHierarchy< M, PI, A >::coarsenSmoother().
void Dune::Amg::Hierarchy< T, A >::addFiner | ( | Arguments & | args | ) | [inherited] |
Add an element on a finer level.
args | The arguments needed for the construction. |
void Dune::Amg::Hierarchy< T, A >::addRedistributedOnCoarsest | ( | T * | t | ) | [inherited] |
Dune::Amg::Aggregate< G, S >::Aggregate | ( | const MatrixGraph & | graph, | |
AggregatesMap< Vertex > & | aggregates, | |||
VertexSet & | connectivity | |||
) | [inherited] |
Constructor.
graph | The matrix graph we work on. | |
aggregates | The mapping of vertices onto aggregates. | |
connectivity | The set of vertices connected to the aggregate. distance spheres. |
Dune::Amg::AggregatesMap< V >::AggregatesMap | ( | std::size_t | noVertices | ) | [inherited] |
Constructs with allocating memory.
noVertices | The number of vertices we will hold information for. |
Dune::Amg::AggregatesMap< V >::AggregatesMap | ( | ) | [inherited] |
Constructs without allocating memory.
const MatrixHierarchy< M, IS, A >::AggregatesMapList & Dune::Amg::MatrixHierarchy< M, IS, A >::aggregatesMaps | ( | ) | const [inherited] |
Get the hierarchy of the mappings of the nodes onto aggregates.
Referenced by Dune::Amg::MatrixHierarchy< M, PI, A >::getCoarsestAggregatesOnFinest().
Dune::Amg::Aggregator< G >::AggregateVisitor< V >::AggregateVisitor | ( | const AggregatesMap< Vertex > & | aggregates, | |
const AggregateDescriptor & | aggregate, | |||
Visitor & | visitor | |||
) | [inherited] |
Constructor.
aggregates | The aggregate numbers of the vertices. | |
aggregate | The id of the aggregate to visit. | |
visitor | The visitor. |
Dune::Amg::AggregationCriterion< T >::AggregationCriterion | ( | ) | [inline, inherited] |
Constructor.
The paramters will be initialized with default values suitable for 2D isotropic problems.
If that does not fit your needs either use setDefaultValuesIsotropic setDefaultValuesAnisotropic or setup the values by hand
Dune::Amg::Aggregator< G >::Aggregator | ( | ) | [inherited] |
Constructor.
void Dune::Amg::AggregatesMap< V >::allocate | ( | std::size_t | noVertices | ) | [inherited] |
Allocate memory for holding the information.
noVertices | The total number of vertices to be mapped. |
double Dune::Amg::DependencyParameters::alpha | ( | ) | const [inline, inherited] |
Get the scaling value for marking connections as strong. Default value is 1/3.
Dune::Amg::AMG< M, X, S, PI, A >::AMG | ( | const OperatorHierarchy & | matrices, | |
CoarseSolver & | coarseSolver, | |||
const SmootherArgs & | smootherArgs, | |||
std::size_t | gamma, | |||
std::size_t | preSmoothingSteps, | |||
std::size_t | postSmoothingSteps, | |||
bool | additive = false | |||
) | [inherited] |
Construct a new amg with a specific coarse solver.
matrices | The already set up matix hierarchy. | |
coarseSolver | The set up solver to use on the coarse grid, must natch the soarse matrix in the matrix hierachy. | |
smootherArgs | The arguments needed for thesmoother to use for pre and post smoothing | |
gamma | The number of subcycles. 1 for V-cycle, 2 for W-cycle. | |
preSmoothingSteps | The number of smoothing steps for premoothing. | |
postSmoothingSteps | The number of smoothing steps for postmoothing. |
References Dune::Amg::MatrixHierarchy< M, PI, A >::coarsenSmoother(), and Dune::Amg::MatrixHierarchy< M, PI, A >::isBuilt().
Dune::Amg::AMG< M, X, S, PI, A >::AMG | ( | const Operator & | fineOperator, | |
const C & | criterion, | |||
const SmootherArgs & | smootherArgs, | |||
std::size_t | gamma = 1 , |
|||
std::size_t | preSmoothingSteps = 2 , |
|||
std::size_t | postSmoothingSteps = 2 , |
|||
bool | additive = false , |
|||
const ParallelInformation & | pinfo = ParallelInformation() | |||
) | [inherited] |
Construct an AMG with an inexact coarse solver based on the smoother.
As coarse solver a preconditioned CG method with the smoother as preconditioner will be used. The matrix hierarchy is built automatically.
fineOperator | The operator on the fine level. | |
criterion | The criterion describing the coarsening strategy. E. g. SymmetricCriterion or UnsymmetricCriterion. | |
smootherArgs | The arguments for constructing the smoothers. | |
gamma | 1 for V-cycle, 2 for W-cycle | |
preSmoothingSteps | The number of smoothing steps for premoothing. | |
postSmoothingSteps | The number of smoothing steps for postmoothing. | |
pinfo | The information about the parallel distribution of the data. |
Dune::Amg::AMG< M, X, S, PI, A >::AMG | ( | const Operator & | matrix, | |
const C & | criterion, | |||
const SmootherArgs & | smootherArgs, | |||
std::size_t | gamma, | |||
std::size_t | preSmoothingSteps, | |||
std::size_t | postSmoothingSteps, | |||
bool | additive_, | |||
const PI & | pinfo | |||
) | [inherited] |
void Dune::Amg::KAMG< M, X, S, P, K, A >::apply | ( | Domain & | x, | |
const Range & | b | |||
) | [inherited] |
References Dune::InverseOperator< X, Y >::apply().
void Dune::Amg::AMG< M, X, S, PI, A >::apply | ( | Domain & | v, | |
const Range & | d | |||
) | [inherited] |
Apply one step of the preconditioner to the system A(v)=d.
On entry v=0 and d=b-A(x) (although this might not be computed in that way. On exit v contains the update, i.e one step computes where
is the approximate inverse of the operator
characterizing the preconditioner.
[out] | v | The update to be computed |
d | The current defect. |
References Dune::Amg::Hierarchy< T, A >::finest(), and Dune::Amg::MatrixHierarchy< M, PI, A >::maxlevels().
void Dune::Amg::ParallelIndicesCoarsener< T, E >::ParallelAggregateRenumberer< G, I >::attribute | ( | const Attribute & | attribute | ) | [inline, inherited] |
Attribute Dune::Amg::ParallelIndicesCoarsener< T, E >::ParallelAggregateRenumberer< G, I >::attribute | ( | ) | [inline, inherited] |
const_iterator Dune::Amg::AggregatesMap< V >::begin | ( | ) | const [inline, inherited] |
iterator Dune::Amg::AggregatesMap< V >::begin | ( | ) | [inline, inherited] |
const_iterator Dune::Amg::Aggregate< G, S >::begin | ( | ) | const [inherited] |
get an iterator over the vertices of the aggregate.
double Dune::Amg::DependencyParameters::beta | ( | ) | const [inline, inherited] |
Get the threshold for marking nodes as isolated. The default value is 1.0E-5.
std::size_t Dune::Amg::AggregatesMap< V >::breadthFirstSearch | ( | const VertexDescriptor & | start, | |
const AggregateDescriptor & | aggregate, | |||
const G & | graph, | |||
F & | aggregateVisitor, | |||
VM & | visitedMap | |||
) | const [inherited] |
Breadth first search within an aggregate.
The template parameters:
start | The vertex where the search should start from. This does not need to belong to the aggregate. | |
aggregate | The aggregate id. | |
graph | The matrix graph to perform the search on. | |
visitedMap | A map to mark the already visited vertices | |
aggregateVisitor | A functor that is called with each G::ConstEdgeIterator with an edge pointing to the aggregate. Use DummyVisitor if these are of no interest. |
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 [inherited] |
Breadth first search within an aggregate.
The template parameters:
start | The vertex where the search should start from. This does not need to belong to the aggregate. | |
aggregate | The aggregate id. | |
graph | The matrix graph to perform the search on. | |
visited | A list to store the visited vertices in. | |
aggregateVisitor | A functor that is called with each G::ConstEdgeIterator with an edge pointing to the aggregate. Use DummyVisitor these are of no interest. | |
nonAggregateVisitor | A functor that is called with each G::ConstEdgeIterator with an edge pointing to another aggregate. Use DummyVisitor these are of no interest. | |
visitedMap | A map to mark the already visited vertices |
tuple<int,int,int,int> Dune::Amg::Aggregator< G >::build | ( | const M & | m, | |
G & | graph, | |||
AggregatesMap< Vertex > & | aggregates, | |||
const C & | c | |||
) | [inherited] |
Build the aggregates.
The template parameter C Is the type of the coarsening Criterion to use.
m | The matrix to build the aggregates accordingly. | |
graph | A (sub) graph of the matrix. | |
aggregates | Aggregate map we will build. All entries should be initialized to UNAGGREGATED! | |
c | The coarsening criterion to use. |
M * Dune::Amg::GalerkinProduct< T >::build | ( | const M & | fine, | |
G & | fineGraph, | |||
V & | visitedMap, | |||
const ParallelInformation & | pinfo, | |||
AggregatesMap< typename G::VertexDescriptor > & | aggregates, | |||
const typename M::size_type & | size, | |||
const Set & | copy | |||
) | [inherited] |
Calculates the coarse matrix via a Galerkin product.
fine | The matrix on the fine level. | |
fineGraph | The graph of the fine matrix. | |
visitedMap | Map for marking vertices as visited. | |
pinfo | Parallel information about the fine level. | |
aggregates | The mapping of the fine level unknowns onto aggregates. | |
size | The number of columns and rows of the coarse matrix. | |
copy | The attribute set identifying the copy nodes of the graph. |
References count, Dune::Amg::SparsityBuilder< M >::maxRowSize(), Dune::Amg::SparsityBuilder< M >::minRowSize(), and Dune::Amg::SparsityBuilder< M >::sumRowSize().
Referenced by Dune::Amg::MatrixHierarchy< M, PI, A >::build().
M * Dune::Amg::GalerkinProduct< SequentialInformation >::build | ( | const M & | fine, | |
G & | fineGraph, | |||
V & | visitedMap, | |||
const SequentialInformation & | pinfo, | |||
const AggregatesMap< typename G::VertexDescriptor > & | aggregates, | |||
const typename M::size_type & | size, | |||
const Set & | copy | |||
) | [inherited] |
Calculates the coarse matrix via a Galerkin product.
fine | The matrix on the fine level. | |
fineGraph | The graph of the fine matrix. | |
visitedMap | Map for marking vertices as visited. | |
pinfo | Parallel information about the fine level. | |
aggregates | The mapping of the fine level unknowns onto aggregates. | |
size | The number of columns and rows of the coarse matrix. | |
copy | The attribute set identifying the copy nodes of the graph. |
References Dune::Amg::SparsityBuilder< M >::maxRowSize(), Dune::Amg::SparsityBuilder< M >::minRowSize(), and Dune::Amg::SparsityBuilder< M >::sumRowSize().
void Dune::Amg::MatrixHierarchy< M, IS, A >::build | ( | const T & | criterion | ) | [inherited] |
Build the matrix hierarchy using aggregation.
criterion The criterion describing the aggregation process.
References Dune::Amg::Hierarchy< T, A >::addCoarser(), Dune::Amg::atOnceAccu, Dune::Amg::GalerkinProduct< T >::build(), Dune::Amg::AggregatesMap< V >::buildAggregates(), Dune::Amg::BaseGalerkinProduct::calculate(), Dune::countNonZeros(), Dune::Amg::Hierarchy< T, A >::finest(), Dune::Amg::AggregatesMap< V >::free(), Dune::Amg::MatrixHierarchy< M, PI, A >::hasCoarsest(), Dune::Amg::MatrixHierarchy< M, PI, A >::levels(), Dune::Amg::Hierarchy< T, A >::levels(), Dune::Amg::MAX_PROCESSES, Dune::Amg::AggregatesMap< V >::noVertices(), Dune::Amg::repartitionAndDistributeMatrix(), and Dune::Amg::successiveAccu.
tuple<int,int,int,int> Dune::Amg::AggregatesMap< V >::buildAggregates | ( | const M & | matrix, | |
G & | graph, | |||
const C & | criterion | |||
) | [inherited] |
Build the aggregates.
matrix | The matrix describing the dependency. | |
graph | The graph corresponding to the matrix. | |
criterion | The aggregation criterion. |
Referenced by Dune::Amg::MatrixHierarchy< M, PI, A >::build().
void Dune::Amg::buildDependency | ( | G & | graph, | |
const typename C::Matrix & | matrix, | |||
C | criterion | |||
) |
Build the dependency of the matrix graph.
Referenced by Dune::Amg::repartitionAndDistributeMatrix().
void Dune::Amg::BaseGalerkinProduct::calculate | ( | const M & | fine, | |
const AggregatesMap< V > & | aggregates, | |||
M & | coarse, | |||
const P & | pinfo, | |||
const O & | copy | |||
) | [inherited] |
void Dune::Amg::Aggregate< G, S >::clear | ( | ) | [inherited] |
Clear the aggregate.
Graph::VertexDescriptor Dune::Amg::IndicesCoarsener< SequentialInformation, E >::coarsen | ( | const SequentialInformation & | fineInfo, | |
Graph & | fineGraph, | |||
VM & | visitedMap, | |||
AggregatesMap< typename Graph::VertexDescriptor > & | aggregates, | |||
SequentialInformation & | coarseInfo | |||
) | [static, inherited] |
Graph::VertexDescriptor Dune::Amg::ParallelIndicesCoarsener< T, E >::coarsen | ( | ParallelInformation & | fineInfo, | |
Graph & | fineGraph, | |||
VM & | visitedMap, | |||
AggregatesMap< typename Graph::VertexDescriptor > & | aggregates, | |||
ParallelInformation & | coarseInfo | |||
) | [inline, static, inherited] |
Build the coarse index set after the aggregatio.
fineInfo | The parallel information at the fine level. | |
fineGraph | The graph of the fine lecel, | |
visitedMap | Map for marking vertices as visited. | |
aggregates | The mapping of unknowns onto aggregates. | |
coarseInfo | The information about the parallel data decomposition on the coarse level. |
void Dune::Amg::MatrixHierarchy< M, IS, A >::coarsenSmoother | ( | Hierarchy< S, TA > & | smoothers, | |
const typename SmootherTraits< S >::Arguments & | args | |||
) | const [inherited] |
Coarsen the smoother hierarchy according to the matrix hierarchy.
smoothers | The smoother hierarchy to coarsen. | |
args | The arguments for the construction of the coarse level smoothers. |
References Dune::Amg::Hierarchy< T, A >::addCoarser(), Dune::Amg::Hierarchy< T, A >::coarsest(), Dune::Amg::Hierarchy< T, A >::finest(), Dune::Amg::MatrixHierarchy< M, PI, A >::levels(), Dune::Amg::Hierarchy< T, A >::levels(), and Dune::Amg::MatrixHierarchy< M, PI, A >::maxlevels().
Referenced by Dune::Amg::AMG< M, X, S, PI, A >::AMG().
void Dune::Amg::MatrixHierarchy< M, IS, A >::coarsenVector | ( | Hierarchy< BlockVector< V, TA > > & | hierarchy | ) | const [inherited] |
Coarsen the vector hierarchy according to the matrix hierarchy.
hierarchy | The vector hierarchy to coarsen. |
References Dune::Amg::Hierarchy< T, A >::coarsest(), and Dune::Amg::Hierarchy< T, A >::finest().
Referenced by Dune::Amg::AMG< M, X, S, PI, A >::pre().
Hierarchy< T, A >::Iterator Dune::Amg::Hierarchy< T, A >::coarsest | ( | ) | [inherited] |
Get an iterator positioned at the coarsest level.
Referenced by Dune::Amg::MatrixHierarchy< M, PI, A >::coarsenSmoother(), Dune::Amg::MatrixHierarchy< M, PI, A >::coarsenVector(), Dune::Amg::MatrixHierarchy< M, PI, A >::getCoarsestAggregatesOnFinest(), Dune::Amg::MatrixHierarchy< M, PI, A >::hasCoarsest(), Dune::Amg::AMG< M, X, S, PI, A >::post(), Dune::Amg::KAMG< M, X, S, PI, K, A >::pre(), Dune::Amg::AMG< M, X, S, PI, A >::pre(), Dune::Amg::MatrixHierarchy< M, PI, A >::recalculateGalerkin(), and Dune::Amg::MatrixHierarchy< M, PI, A >::~MatrixHierarchy().
Hierarchy< T, A >::ConstIterator Dune::Amg::Hierarchy< T, A >::coarsest | ( | ) | const [inherited] |
Get an iterator positioned at the coarsest level.
Dune::Amg::BaseConnectivityConstructor::ConnectedBuilder< G, S, V >::ConnectedBuilder | ( | const AggregatesMap< Vertex > & | aggregates, | |
Graph & | graph, | |||
VisitedMap & | visitedMap, | |||
Set & | connected | |||
) | [inherited] |
Constructor.
aggregates | The mapping of the vertices onto the aggregates. | |
graph | The graph to work on. | |
visitedMap | The map for marking vertices as visited | |
connected | The set to added the connected aggregates to. |
VertexList::size_type Dune::Amg::Aggregate< G, S >::connectSize | ( | ) | [inherited] |
Get tne number of connections to other aggregates.
static SeqSSOR<M,X,Y,l>* Dune::Amg::ConstructionTraits< SeqSSOR< M, X, Y, l > >::construct | ( | Arguments & | args | ) | [inline, static, inherited] |
static SeqSOR<M,X,Y,l>* Dune::Amg::ConstructionTraits< SeqSOR< M, X, Y, l > >::construct | ( | Arguments & | args | ) | [inline, static, inherited] |
static SeqJac<M,X,Y,l>* Dune::Amg::ConstructionTraits< SeqJac< M, X, Y, l > >::construct | ( | Arguments & | args | ) | [inline, static, inherited] |
static SeqILU0<M,X,Y>* Dune::Amg::ConstructionTraits< SeqILU0< M, X, Y > >::construct | ( | Arguments & | args | ) | [inline, static, inherited] |
static SeqILUn<M,X,Y>* Dune::Amg::ConstructionTraits< SeqILUn< M, X, Y > >::construct | ( | Arguments & | args | ) | [inline, static, inherited] |
static ParSSOR<M,X,Y,C>* Dune::Amg::ConstructionTraits< ParSSOR< M, X, Y, C > >::construct | ( | Arguments & | args | ) | [inline, static, inherited] |
static BlockPreconditioner<X,Y,C,T>* Dune::Amg::ConstructionTraits< BlockPreconditioner< X, Y, C, T > >::construct | ( | Arguments & | args | ) | [inline, static, inherited] |
static NonoverlappingBlockPreconditioner<C,T>* Dune::Amg::ConstructionTraits< NonoverlappingBlockPreconditioner< C, T > >::construct | ( | Arguments & | args | ) | [inline, static, inherited] |
static T* Dune::Amg::ConstructionTraits< T >::construct | ( | Arguments & | args | ) | [inline, static, inherited] |
Construct an object with the specified arguments.
In the default implementation the copy constructor is called.
args | The arguments for the construction. |
Referenced by Dune::Amg::ConstructionTraits< NonoverlappingBlockPreconditioner< C, T > >::construct(), and Dune::Amg::ConstructionTraits< BlockPreconditioner< X, Y, C, T > >::construct().
static BlockVector<T>* Dune::Amg::ConstructionTraits< BlockVector< T > >::construct | ( | Arguments & | n | ) | [inline, static, inherited] |
static SeqOverlappingSchwarz<M,X,TM,TS,TA>* Dune::Amg::ConstructionTraits< SeqOverlappingSchwarz< M, X, TM, TS, TA > >::construct | ( | Arguments & | args | ) | [inline, static, inherited] |
void Dune::Amg::BaseConnectivityConstructor::constructNonOverlapConnectivity | ( | R & | row, | |
G & | graph, | |||
V & | visitedMap, | |||
const AggregatesMap< typename G::VertexDescriptor > & | aggregates, | |||
const typename G::VertexDescriptor & | seed | |||
) | [static, inherited] |
Construct the connectivity of an aggregate in the overlap.
Referenced by Dune::Amg::ConnectivityConstructor< G, SequentialInformation >::examine(), and Dune::Amg::ConnectivityConstructor< G, T >::examine().
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 | |||
) | [static, inherited] |
int Dune::Amg::AggregationCriterion< T >::debugLevel | ( | ) | const [inline, inherited] |
Get the debugging Level.
static void Dune::Amg::ConstructionTraits< SeqSSOR< M, X, Y, l > >::deconstruct | ( | SeqSSOR< M, X, Y, l > * | ssor | ) | [inline, static, inherited] |
static void Dune::Amg::ConstructionTraits< SeqSOR< M, X, Y, l > >::deconstruct | ( | SeqSOR< M, X, Y, l > * | sor | ) | [inline, static, inherited] |
static void Dune::Amg::ConstructionTraits< SeqJac< M, X, Y, l > >::deconstruct | ( | SeqJac< M, X, Y, l > * | jac | ) | [inline, static, inherited] |
static void Dune::Amg::ConstructionTraits< SeqILU0< M, X, Y > >::deconstruct | ( | SeqILU0< M, X, Y > * | ilu | ) | [inline, static, inherited] |
static void Dune::Amg::ConstructionTraits< SeqILUn< M, X, Y > >::deconstruct | ( | SeqILUn< M, X, Y > * | ilu | ) | [inline, static, inherited] |
static void Dune::Amg::ConstructionTraits< ParSSOR< M, X, Y, C > >::deconstruct | ( | ParSSOR< M, X, Y, C > * | ssor | ) | [inline, static, inherited] |
static void Dune::Amg::ConstructionTraits< BlockPreconditioner< X, Y, C, T > >::deconstruct | ( | BlockPreconditioner< X, Y, C, T > * | bp | ) | [inline, static, inherited] |
static void Dune::Amg::ConstructionTraits< NonoverlappingBlockPreconditioner< C, T > >::deconstruct | ( | NonoverlappingBlockPreconditioner< C, T > * | bp | ) | [inline, static, inherited] |
static void Dune::Amg::ConstructionTraits< T >::deconstruct | ( | T * | t | ) | [inline, static, inherited] |
Destroys an object.
t | Pointer to the object to destroy. |
Referenced by Dune::Amg::ConstructionTraits< NonoverlappingBlockPreconditioner< C, T > >::deconstruct(), and Dune::Amg::ConstructionTraits< BlockPreconditioner< X, Y, C, T > >::deconstruct().
static void Dune::Amg::ConstructionTraits< BlockVector< T > >::deconstruct | ( | BlockVector< T > * | t | ) | [inline, static, inherited] |
static void Dune::Amg::ConstructionTraits< SeqOverlappingSchwarz< M, X, TM, TS, TA > >::deconstruct | ( | SeqOverlappingSchwarz< M, X, TM, TS, TA > * | schwarz | ) | [inline, static, inherited] |
void Dune::Amg::Aggregator< G >::Counter::decrement | ( | ) | [protected, inherited] |
Decrement counter.
Dune::Amg::DefaultSmootherArgs< T >::DefaultSmootherArgs | ( | ) | [inline, inherited] |
Default constructor.
bool Dune::Amg::EdgeProperties::depends | ( | ) | const [inline, inherited] |
Checks wether the vertex the edge points to depends on the vertex the edge starts.
References Dune::Amg::EdgeProperties::DEPEND.
Dune::Amg::EdgeProperties::EdgeProperties | ( | ) | [inline, inherited] |
Constructor.
const_iterator Dune::Amg::AggregatesMap< V >::end | ( | ) | const [inline, inherited] |
iterator Dune::Amg::AggregatesMap< V >::end | ( | ) | [inline, inherited] |
const_iterator Dune::Amg::Aggregate< G, S >::end | ( | ) | const [inherited] |
get an iterator over the vertices of the aggregate.
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 | |||
) | [static, inherited] |
void Dune::Amg::ConnectivityConstructor< G, SequentialInformation >::examine | ( | G & | graph, | |
V & | visitedMap, | |||
const SequentialInformation & | pinfo, | |||
const AggregatesMap< Vertex > & | aggregates, | |||
R & | row | |||
) | [static, inherited] |
void Dune::Amg::Dependency< M, N >::examine | ( | const ColIter & | col | ) | [inherited] |
void Dune::Amg::Dependency< M, N >::examine | ( | G & | graph, | |
const typename G::EdgeIterator & | edge, | |||
const ColIter & | col | |||
) | [inherited] |
void Dune::Amg::SymmetricDependency< M, N >::examine | ( | const ColIter & | col | ) | [inherited] |
void Dune::Amg::SymmetricDependency< M, N >::examine | ( | G & | graph, | |
const typename G::EdgeIterator & | edge, | |||
const ColIter & | col | |||
) | [inherited] |
bool Dune::Amg::VertexProperties::excludedBorder | ( | ) | const [inline, inherited] |
Tests whether the vertex is excluded from the aggregation.
References Dune::Amg::VertexProperties::BORDER.
void Dune::Amg::Aggregator< G >::Stack::fill | ( | ) | [inherited] |
Hierarchy< T, A >::Iterator Dune::Amg::Hierarchy< T, A >::finest | ( | ) | [inherited] |
Get an iterator positioned at the finest level.
Referenced by Dune::Amg::AMG< M, X, S, PI, A >::AMG(), Dune::Amg::AMG< M, X, S, PI, A >::apply(), Dune::Amg::MatrixHierarchy< M, PI, A >::build(), Dune::Amg::MatrixHierarchy< M, PI, A >::coarsenSmoother(), Dune::Amg::MatrixHierarchy< M, PI, A >::coarsenVector(), Dune::Amg::MatrixHierarchy< M, PI, A >::getCoarsestAggregatesOnFinest(), Dune::Amg::AMG< M, X, S, PI, A >::post(), Dune::Amg::AMG< M, X, S, PI, A >::pre(), Dune::Amg::MatrixHierarchy< M, PI, A >::recalculateGalerkin(), and Dune::Amg::MatrixHierarchy< M, PI, A >::~MatrixHierarchy().
Hierarchy< T, A >::ConstIterator Dune::Amg::Hierarchy< T, A >::finest | ( | ) | const [inherited] |
Get an iterator positioned at the finest level.
void Dune::Amg::AggregatesMap< V >::free | ( | ) | [inherited] |
Free the allocated memory.
Referenced by Dune::Amg::MatrixHierarchy< M, PI, A >::build().
bool Dune::Amg::VertexProperties::front | ( | ) | const [inline, inherited] |
Checks wether the node is marked as a front node.
References Dune::Amg::VertexProperties::FRONT.
const SmootherArgs Dune::Amg::DefaultConstructionArgs< T >::getArgs | ( | ) | const [inline, inherited] |
Referenced by Dune::Amg::ConstructionTraits< SeqOverlappingSchwarz< M, X, TM, TS, TA > >::construct(), Dune::Amg::ConstructionTraits< ParSSOR< M, X, Y, C > >::construct(), Dune::Amg::ConstructionTraits< SeqILUn< M, X, Y > >::construct(), Dune::Amg::ConstructionTraits< SeqILU0< M, X, Y > >::construct(), Dune::Amg::ConstructionTraits< SeqJac< M, X, Y, l > >::construct(), Dune::Amg::ConstructionTraits< SeqSOR< M, X, Y, l > >::construct(), and Dune::Amg::ConstructionTraits< SeqSSOR< M, X, Y, l > >::construct().
void Dune::Amg::AMG< M, X, S, PI, A >::getCoarsestAggregateNumbers | ( | std::vector< std::size_t, A1 > & | cont | ) | [inherited] |
Get the aggregate number of each unknown on the coarsest level.
cont | The random access container to store the numbers in. |
References Dune::Amg::MatrixHierarchy< M, PI, A >::getCoarsestAggregatesOnFinest().
void Dune::Amg::MatrixHierarchy< M, IS, A >::getCoarsestAggregatesOnFinest | ( | std::vector< std::size_t > & | data | ) | const [inherited] |
Get the mapping of fine level unknowns to coarse level aggregates.
For each fine level unknown i the correcponding data[i] is the aggregate it belongs to on the coarsest level.
[out] | data | The mapping of fine level unknowns to coarse level aggregates. |
References Dune::Amg::MatrixHierarchy< M, PI, A >::aggregatesMaps(), Dune::Amg::AggregatesMap< V >::begin(), Dune::Amg::Hierarchy< T, A >::coarsest(), Dune::Amg::AggregatesMap< V >::end(), Dune::Amg::Hierarchy< T, A >::finest(), Dune::Amg::AggregatesMap< V >::ISOLATED, Dune::Amg::MatrixHierarchy< M, PI, A >::levels(), Dune::Amg::MatrixHierarchy< M, PI, A >::maxlevels(), and Dune::Amg::MatrixHierarchy< M, PI, A >::parallelInformation().
Referenced by Dune::Amg::AMG< M, X, S, PI, A >::getCoarsestAggregateNumbers().
const C& Dune::Amg::DefaultParallelConstructionArgs< T, C >::getComm | ( | ) | const [inline, inherited] |
const Matrix& Dune::Amg::DefaultConstructionArgs< T >::getMatrix | ( | ) | const [inline, inherited] |
Referenced by Dune::Amg::ConstructionTraits< SeqOverlappingSchwarz< M, X, TM, TS, TA > >::construct(), Dune::Amg::ConstructionTraits< ParSSOR< M, X, Y, C > >::construct(), Dune::Amg::ConstructionTraits< SeqILUn< M, X, Y > >::construct(), Dune::Amg::ConstructionTraits< SeqILU0< M, X, Y > >::construct(), Dune::Amg::ConstructionTraits< SeqJac< M, X, Y, l > >::construct(), Dune::Amg::ConstructionTraits< SeqSOR< M, X, Y, l > >::construct(), and Dune::Amg::ConstructionTraits< SeqSSOR< M, X, Y, l > >::construct().
int Dune::Amg::ConstructionArgs< SeqILUn< M, X, Y > >::getN | ( | ) | [inline, inherited] |
const Vector& Dune::Amg::ConstructionArgs< SeqOverlappingSchwarz< M, X, TM, TS, TA > >::getSubDomains | ( | ) | [inline, inherited] |
const GlobalIndex& Dune::Amg::ParallelIndicesCoarsener< T, E >::ParallelAggregateRenumberer< G, I >::globalIndex | ( | ) | const [inline, inherited] |
void Dune::Amg::ParallelIndicesCoarsener< T, E >::ParallelAggregateRenumberer< G, I >::globalIndex | ( | const GlobalIndex & | global | ) | [inline, inherited] |
bool Dune::Amg::MatrixHierarchy< M, IS, A >::hasCoarsest | ( | ) | const [inherited] |
Dune::Amg::Hierarchy< T, A >::Hierarchy | ( | MemberType & | first | ) | [inherited] |
Construct a new hierarchy.
first | The first element in the hierarchy. |
Dune::Amg::Hierarchy< T, A >::Hierarchy | ( | ) | [inherited] |
Construct a new empty hierarchy.
int Dune::Amg::Aggregate< G, S >::id | ( | ) | [inherited] |
Get the id identifying the aggregate.
void Dune::Amg::Aggregator< G >::Counter::increment | ( | ) | [protected, inherited] |
Increment counter.
std::size_t Dune::Amg::SparsityBuilder< M >::index | ( | ) | [inline, inherited] |
bool Dune::Amg::EdgeProperties::influences | ( | ) | const [inline, inherited] |
Checks wether the start vertex is influenced by the end vertex.
References Dune::Amg::EdgeProperties::INFLUENCE.
void Dune::Amg::Dependency< M, N >::init | ( | const Matrix * | matrix | ) | [inherited] |
void Dune::Amg::SymmetricDependency< M, N >::init | ( | const Matrix * | matrix | ) | [inherited] |
void Dune::Amg::Dependency< M, N >::initRow | ( | const Row & | row, | |
int | index | |||
) | [inherited] |
void Dune::Amg::SymmetricDependency< M, N >::initRow | ( | const Row & | row, | |
int | index | |||
) | [inherited] |
void Dune::Amg::SparsityBuilder< M >::insert | ( | const typename M::size_type & | index | ) | [inherited] |
bool Dune::Amg::MatrixHierarchy< M, IS, A >::isBuilt | ( | ) | const [inherited] |
Whether the hierarchy wis built.
Referenced by Dune::Amg::AMG< M, X, S, PI, A >::AMG().
bool Dune::Amg::SymmetricDependency< M, N >::isIsolated | ( | ) | [inherited] |
bool Dune::Amg::Dependency< M, N >::isIsolated | ( | ) | [inherited] |
bool Dune::Amg::VertexProperties::isolated | ( | ) | const [inline, inherited] |
Checks wether the node is isolated.
References Dune::Amg::VertexProperties::ISOLATED.
bool Dune::Amg::EdgeProperties::isOneWay | ( | ) | const [inline, inherited] |
Checks wether the edge is one way. I.e. either the influence or the depends flag but is set.
References Dune::Amg::EdgeProperties::DEPEND, and Dune::Amg::EdgeProperties::INFLUENCE.
void Dune::Amg::ParallelIndicesCoarsener< T, E >::ParallelAggregateRenumberer< G, I >::isPublic | ( | bool | b | ) | [inline, inherited] |
bool Dune::Amg::ParallelIndicesCoarsener< T, E >::ParallelAggregateRenumberer< G, I >::isPublic | ( | ) | [inline, inherited] |
bool Dune::Amg::EdgeProperties::isStrong | ( | ) | const [inline, inherited] |
Checks wether the edge is strong. I.e. the influence or depends flag is set.
References Dune::Amg::EdgeProperties::DEPEND, and Dune::Amg::EdgeProperties::INFLUENCE.
bool Dune::Amg::EdgeProperties::isTwoWay | ( | ) | const [inline, inherited] |
Checks wether the edge is two way. I.e. both the influence flag and the depends flag are that.
References Dune::Amg::EdgeProperties::DEPEND, and Dune::Amg::EdgeProperties::INFLUENCE.
Dune::Amg::KAMG< M, X, S, P, K, A >::KAMG | ( | const OperatorHierarchy & | matrices, | |
CoarseSolver & | coarseSolver, | |||
const SmootherArgs & | smootherArgs, | |||
std::size_t | gamma, | |||
std::size_t | preSmoothingSteps = 1 , |
|||
std::size_t | postSmoothingSteps = 1 , |
|||
std::size_t | maxLevelKrylovSteps = 3 , |
|||
double | minDefectReduction = 1e-1 | |||
) | [inherited] |
Construct a new amg with a specific coarse solver.
matrices | The already set up matix hierarchy. | |
coarseSolver | The set up solver to use on the coarse grid, must natch the soarse matrix in the matrix hierachy. | |
smootherArgs | The arguments needed for thesmoother to use for pre and post smoothing | |
gamma | The number of subcycles. 1 for V-cycle, 2 for W-cycle. | |
preSmoothingSteps | The number of smoothing steps for premoothing. | |
postSmoothingSteps | The number of smoothing steps for postmoothing. |
Dune::Amg::KAMG< M, X, S, P, K, A >::KAMG | ( | const Operator & | fineOperator, | |
const C & | criterion, | |||
const SmootherArgs & | smootherArgs, | |||
std::size_t | gamma = 1 , |
|||
std::size_t | preSmoothingSteps = 1 , |
|||
std::size_t | postSmoothingSteps = 1 , |
|||
std::size_t | maxLevelKrylovSteps = 3 , |
|||
double | minDefectReduction = 1e-1 , |
|||
const ParallelInformation & | pinfo = ParallelInformation() | |||
) | [inherited] |
Construct an AMG with an inexact coarse solver based on the smoother.
As coarse solver a preconditioned CG method with the smoother as preconditioner will be used. The matrix hierarchy is built automatically.
fineOperator | The operator on the fine level. | |
criterion | The criterion describing the coarsening strategy. E. g. SymmetricCriterion or UnsymmetricCriterion. | |
smootherArgs | The arguments for constructing the smoothers. | |
gamma | 1 for V-cycle, 2 for W-cycle | |
preSmoothingSteps | The number of smoothing steps for premoothing. | |
postSmoothingSteps | The number of smoothing steps for postmoothing. | |
maxLevelKrylovSteps | The maximum number of Krylov steps allowed at each level. | |
minDefectReduction | The defect reduction to achieve on each krylov level. | |
pinfo | The information about the parallel distribution of the data. |
std::size_t Dune::Amg::MatrixHierarchy< M, IS, A >::levels | ( | ) | const [inherited] |
Get the number of levels in the hierarchy.
References Dune::Amg::Hierarchy< T, A >::levels().
Referenced by Dune::Amg::MatrixHierarchy< M, PI, A >::build(), Dune::Amg::MatrixHierarchy< M, PI, A >::coarsenSmoother(), Dune::Amg::MatrixHierarchy< M, PI, A >::getCoarsestAggregatesOnFinest(), Dune::Amg::MatrixHierarchy< M, PI, A >::hasCoarsest(), Dune::Amg::AMG< M, X, S, PI, A >::levels(), Dune::Amg::AMG< M, X, S, PI, A >::post(), and Dune::Amg::AMG< M, X, S, PI, A >::pre().
std::size_t Dune::Amg::Hierarchy< T, A >::levels | ( | ) | const [inherited] |
Get the number of levels in the hierarchy.
Referenced by Dune::Amg::MatrixHierarchy< M, PI, A >::build(), Dune::Amg::MatrixHierarchy< M, PI, A >::coarsenSmoother(), Dune::Amg::MatrixHierarchy< M, PI, A >::levels(), Dune::Amg::AMG< M, X, S, PI, A >::post(), and Dune::Amg::AMG< M, X, S, PI, A >::pre().
std::size_t Dune::Amg::AMG< M, X, S, PI, A >::levels | ( | ) | [inherited] |
References Dune::Amg::MatrixHierarchy< M, PI, A >::levels().
Referenced by Dune::Amg::KAMG< M, X, S, PI, K, A >::pre().
const MatrixHierarchy< M, IS, A >::ParallelMatrixHierarchy & Dune::Amg::MatrixHierarchy< M, IS, A >::matrices | ( | ) | const [inherited] |
Get the matrix hierarchy.
Referenced by Dune::Amg::KAMG< M, X, S, PI, K, A >::pre(), and Dune::Amg::AMG< M, X, S, PI, A >::pre().
Dune::Amg::MatrixHierarchy< M, IS, A >::MatrixHierarchy | ( | const MatrixOperator & | fineMatrix, | |
const ParallelInformation & | pinfo = ParallelInformation() | |||
) | [inherited] |
Constructor.
fineMatrix | The matrix to coarsen. | |
pinfo | The information about the parallel data decomposition at the first level. |
References Dune::SolverCategory::nonoverlapping, Dune::SolverCategory::overlapping, and Dune::SolverCategory::sequential.
std::size_t Dune::Amg::AggregationCriterion< T >::maxAggregateSize | ( | ) | const [inline, inherited] |
Get the maximum number of nodes a aggregate is allowed to have.
std::size_t Dune::Amg::AggregationCriterion< T >::maxConnectivity | ( | ) | const [inline, inherited] |
Get the maximum number of connections a aggregate is allowed to have.
This limit exists to achieve sparsity of the coarse matrix. the default value is 15.
std::size_t Dune::Amg::AggregationCriterion< T >::maxDistance | ( | ) | const [inline, inherited] |
Get the maximal distance allowed between to nodes in a aggregate.
The distance between two nodes in a aggregate is the minimal number of edges it takes to travel from one node to the other without leaving the aggregate.
std::size_t Dune::Amg::KAMG< M, X, S, P, K, A >::maxlevels | ( | ) | [inherited] |
References Dune::Amg::AMG< M, X, S, PI, A >::maxlevels().
std::size_t Dune::Amg::MatrixHierarchy< M, IS, A >::maxlevels | ( | ) | const [inherited] |
Get the max number of levels in the hierarchy of processors.
Referenced by Dune::Amg::AMG< M, X, S, PI, A >::AMG(), Dune::Amg::AMG< M, X, S, PI, A >::apply(), Dune::Amg::MatrixHierarchy< M, PI, A >::coarsenSmoother(), Dune::Amg::MatrixHierarchy< M, PI, A >::getCoarsestAggregatesOnFinest(), Dune::Amg::MatrixHierarchy< M, PI, A >::hasCoarsest(), Dune::Amg::AMG< M, X, S, PI, A >::maxlevels(), Dune::Amg::AMG< M, X, S, PI, A >::post(), and Dune::Amg::AMG< M, X, S, PI, A >::pre().
std::size_t Dune::Amg::AMG< M, X, S, PI, A >::maxlevels | ( | ) | [inherited] |
std::size_t Dune::Amg::SparsityBuilder< M >::maxRowSize | ( | ) | [inherited] |
std::size_t Dune::Amg::AggregationCriterion< T >::minAggregateSize | ( | ) | const [inline, inherited] |
Get the minimum number of nodes a aggregate has to consist of.
std::size_t Dune::Amg::SparsityBuilder< M >::minRowSize | ( | ) | [inherited] |
int Dune::Amg::ConstructionArgs< SeqOverlappingSchwarz< M, X, TM, TS, TA > >::NoneAdder::noSubdomains | ( | ) | const [inline, inherited] |
int Dune::Amg::ConstructionArgs< SeqOverlappingSchwarz< M, X, TM, TS, TA > >::VertexAdder::noSubdomains | ( | ) | const [inline, inherited] |
int Dune::Amg::ConstructionArgs< SeqOverlappingSchwarz< M, X, TM, TS, TA > >::AggregateAdder< VM >::noSubdomains | ( | ) | const [inline, inherited] |
std::size_t Dune::Amg::AggregatesMap< V >::noVertices | ( | ) | const [inherited] |
Get the number of vertices.
Referenced by Dune::Amg::MatrixHierarchy< M, PI, A >::build(), Dune::Amg::AggregatesMap< Vertex >::end(), and Dune::Amg::ConstructionArgs< SeqOverlappingSchwarz< M, X, TM, TS, TA > >::setMatrix().
M::field_type Dune::Amg::RowSum::operator() | ( | const M & | m | ) | const [inline, inherited] |
compute the norm of a matrix.
m | The matrix row to compute the norm of. |
M::field_type Dune::Amg::AlwaysOneNorm::operator() | ( | const M & | m | ) | const [inline, inherited] |
compute the norm of a matrix.
m | The matrix row to compute the norm of. |
void Dune::Amg::Aggregator< G >::AggregateVisitor< V >::operator() | ( | const typename MatrixGraph::ConstEdgeIterator & | edge | ) | [inherited] |
Examine an edge.
The edge will be examined by the adapted visitor if it belongs to the right aggregate.
void Dune::Amg::Aggregator< G >::FrontNeighbourCounter::operator() | ( | const typename MatrixGraph::ConstEdgeIterator & | edge | ) | [inherited] |
void Dune::Amg::ParallelIndicesCoarsener< T, E >::ParallelAggregateRenumberer< G, I >::operator() | ( | const typename G::ConstEdgeIterator & | edge | ) | [inline, inherited] |
void Dune::Amg::Aggregator< G >::ConnectivityCounter::operator() | ( | const typename MatrixGraph::ConstEdgeIterator & | edge | ) | [inherited] |
void Dune::Amg::BaseConnectivityConstructor::ConnectedBuilder< G, S, V >::operator() | ( | const ConstEdgeIterator & | edge | ) | [inherited] |
Process an edge pointing to another aggregate.
edge | The iterator positioned at the edge. |
void Dune::Amg::Aggregator< G >::DependencyCounter::operator() | ( | const typename MatrixGraph::ConstEdgeIterator & | edge | ) | [inherited] |
void Dune::Amg::Aggregator< G >::FrontMarker::operator() | ( | const typename MatrixGraph::ConstEdgeIterator & | edge | ) | [inherited] |
Vertex Dune::Amg::ParallelIndicesCoarsener< T, E >::ParallelAggregateRenumberer< G, I >::operator() | ( | const GlobalIndex & | global | ) | [inline, inherited] |
M::field_type Dune::Amg::FrobeniusNorm::operator() | ( | const M & | m | ) | const [inline, inherited] |
compute the norm of a matrix.
m | The matrix row to compute the norm of. |
void Dune::Amg::ConstructionArgs< SeqOverlappingSchwarz< M, X, TM, TS, TA > >::VertexAdder::operator() | ( | const T & | edge | ) | [inline, inherited] |
References Dune::Amg::AggregatesMap< V >::ISOLATED.
void Dune::Amg::ConstructionArgs< SeqOverlappingSchwarz< M, X, TM, TS, TA > >::AggregateAdder< VM >::operator() | ( | const T & | edge | ) | [inline, inherited] |
References Dune::Amg::AggregatesMap< V >::ISOLATED.
M::field_type Dune::Amg::Diagonal< N >::operator() | ( | const M & | m | ) | const [inline, inherited] |
compute the norm of a matrix.
m | The matrix ro compute the norm of. |
void Dune::Amg::SparsityBuilder< M >::operator++ | ( | ) | [inherited] |
std::ostream& Dune::Amg::operator<< | ( | std::ostream & | os, | |
const AggregationCriterion< T > & | criterion | |||
) |
std::ostream& Dune::Amg::operator<< | ( | std::ostream & | os, | |
const VertexProperties & | props | |||
) | [inline] |
std::bitset< VertexProperties::SIZE >::reference Dune::Amg::VertexProperties::operator[] | ( | std::size_t | v | ) | [inline, inherited] |
Access the bits directly.
bool Dune::Amg::VertexProperties::operator[] | ( | std::size_t | v | ) | const [inline, inherited] |
Acess the bits directly.
Reference Dune::Amg::PropertyGraphVertexPropertyMap< G, i >::operator[] | ( | const Vertex & | vertex | ) | const [inline, inherited] |
Get the properties associated to a vertex.
vertex | The vertex whose Properties we want. |
AggregateDescriptor& Dune::Amg::AggregatesMap< V >::operator[] | ( | const VertexDescriptor & | v | ) | [inherited] |
Get the aggregate a vertex belongs to.
v | The vertex we want to know the aggregate of. |
const AggregateDescriptor& Dune::Amg::AggregatesMap< V >::operator[] | ( | const VertexDescriptor & | v | ) | const [inherited] |
Get the aggregate a vertex belongs to.
v | The vertex we want to know the aggregate of. |
Reference Dune::Amg::RandomAccessBundledPropertyMap< C, K, i, T, R >::operator[] | ( | const Key & | key | ) | const [inline, inherited] |
Get the property for a key.
key | The key. |
std::bitset< EdgeProperties::SIZE >::reference Dune::Amg::EdgeProperties::operator[] | ( | std::size_t | v | ) | [inline, inherited] |
Access the bits directly.
bool Dune::Amg::EdgeProperties::operator[] | ( | std::size_t | v | ) | const [inline, inherited] |
Acess the bits directly.
Dune::Amg::ParallelIndicesCoarsener< T, E >::ParallelAggregateRenumberer< G, I >::ParallelAggregateRenumberer | ( | AggregatesMap< Vertex > & | aggregates, | |
const I & | lookup | |||
) | [inline, inherited] |
const MatrixHierarchy< M, IS, A >::ParallelInformationHierarchy & Dune::Amg::MatrixHierarchy< M, IS, A >::parallelInformation | ( | ) | const [inherited] |
Get the hierarchy of the parallel data distribution information.
Referenced by Dune::Amg::AMG< M, X, S, PI, A >::AMG(), Dune::Amg::MatrixHierarchy< M, PI, A >::getCoarsestAggregatesOnFinest(), Dune::Amg::KAMG< M, X, S, PI, K, A >::pre(), and Dune::Amg::AMG< M, X, S, PI, A >::pre().
Vertex Dune::Amg::Aggregator< G >::Stack::pop | ( | ) | [inherited] |
void Dune::Amg::KAMG< M, X, S, P, K, A >::post | ( | Domain & | x | ) | [inherited] |
References Dune::Amg::AMG< M, X, S, PI, A >::post().
void Dune::Amg::AMG< M, X, S, PI, A >::post | ( | Domain & | x | ) | [inherited] |
Clean up.
This method is called after the last apply call for the linear system to be solved. Memory may be deallocated safely here. x is the solution of the linear equation.
x | The right hand side of the equation. |
References Dune::Amg::Hierarchy< T, A >::coarsest(), Dune::Amg::Hierarchy< T, A >::finest(), Dune::Amg::MatrixHierarchy< M, PI, A >::levels(), Dune::Amg::Hierarchy< T, A >::levels(), and Dune::Amg::MatrixHierarchy< M, PI, A >::maxlevels().
Referenced by Dune::Amg::KAMG< M, X, S, PI, K, A >::post().
static void Dune::Amg::SmootherApplier< SeqSOR< M, X, Y, l > >::postSmooth | ( | Smoother & | smoother, | |
Domain & | v, | |||
Range & | d | |||
) | [inline, static, inherited] |
static void Dune::Amg::SmootherApplier< BlockPreconditioner< X, Y, C, SeqSOR< M, X, Y, l > > >::postSmooth | ( | Smoother & | smoother, | |
Domain & | v, | |||
Range & | d | |||
) | [inline, static, inherited] |
static void Dune::Amg::SmootherApplier< T >::postSmooth | ( | Smoother & | smoother, | |
Domain & | v, | |||
const Range & | d | |||
) | [inline, static, inherited] |
apply post smoothing in forward direction
smoother | The smoother to use. | |
d | The current defect. | |
v | handle to store the update in. |
static void Dune::Amg::SmootherApplier< NonoverlappingBlockPreconditioner< C, SeqSOR< M, X, Y, l > > >::postSmooth | ( | Smoother & | smoother, | |
Domain & | v, | |||
Range & | d | |||
) | [inline, static, inherited] |
static void Dune::Amg::SmootherApplier< SeqOverlappingSchwarz< M, X, MultiplicativeSchwarzMode, MS, TA > >::postSmooth | ( | Smoother & | smoother, | |
Domain & | v, | |||
const Range & | d | |||
) | [inline, static, inherited] |
void Dune::Amg::KAMG< M, X, S, P, K, A >::pre | ( | Domain & | x, | |
Range & | b | |||
) | [inherited] |
References Dune::Amg::Hierarchy< T, A >::coarsest(), Dune::Amg::AMG< M, X, S, PI, A >::levels(), Dune::Amg::MatrixHierarchy< M, PI, A >::matrices(), Dune::Amg::AMG< M, X, S, PI, A >::maxlevels(), Dune::Amg::MatrixHierarchy< M, PI, A >::parallelInformation(), and Dune::Amg::AMG< M, X, S, PI, A >::pre().
void Dune::Amg::AMG< M, X, S, PI, A >::pre | ( | Domain & | x, | |
Range & | b | |||
) | [inherited] |
Prepare the preconditioner.
A solver solves a linear operator equation A(x)=b by applying one or several steps of the preconditioner. The method pre() is called before the first apply operation. b and x are right hand side and solution vector of the linear system respectively. It may. e.g., scale the system, allocate memory or compute a (I)LU decomposition. Note: The ILU decomposition could also be computed in the constructor or with a separate method of the derived method if several linear systems with the same matrix are to be solved.
x | The left hand side of the equation. | |
b | The right hand side of the equation. |
References Dune::Amg::MatrixHierarchy< M, PI, A >::coarsenVector(), Dune::Amg::Hierarchy< T, A >::coarsest(), Dune::Amg::Hierarchy< T, A >::finest(), Dune::Amg::MatrixHierarchy< M, PI, A >::levels(), Dune::Amg::Hierarchy< T, A >::levels(), Dune::Amg::MatrixHierarchy< M, PI, A >::matrices(), Dune::Amg::MatrixHierarchy< M, PI, A >::maxlevels(), Dune::Amg::MatrixHierarchy< M, PI, A >::parallelInformation(), and Dune::Amg::MatrixHierarchy< M, PI, A >::redistributeInformation().
Referenced by Dune::Amg::KAMG< M, X, S, PI, K, A >::pre().
static void Dune::Amg::SmootherApplier< SeqOverlappingSchwarz< M, X, MultiplicativeSchwarzMode, MS, TA > >::preSmooth | ( | Smoother & | smoother, | |
Domain & | v, | |||
const Range & | d | |||
) | [inline, static, inherited] |
static void Dune::Amg::SmootherApplier< BlockPreconditioner< X, Y, C, SeqSOR< M, X, Y, l > > >::preSmooth | ( | Smoother & | smoother, | |
Domain & | v, | |||
Range & | d | |||
) | [inline, static, inherited] |
static void Dune::Amg::SmootherApplier< NonoverlappingBlockPreconditioner< C, SeqSOR< M, X, Y, l > > >::preSmooth | ( | Smoother & | smoother, | |
Domain & | v, | |||
Range & | d | |||
) | [inline, static, inherited] |
static void Dune::Amg::SmootherApplier< T >::preSmooth | ( | Smoother & | smoother, | |
Domain & | v, | |||
const Range & | d | |||
) | [inline, static, inherited] |
apply pre smoothing in forward direction
smoother | The smoother to use. | |
d | The current defect. | |
v | handle to store the update in. |
static void Dune::Amg::SmootherApplier< SeqSOR< M, X, Y, l > >::preSmooth | ( | Smoother & | smoother, | |
Domain & | v, | |||
Range & | d | |||
) | [inline, static, inherited] |
void Dune::Amg::printAggregates2d | ( | const AggregatesMap< V > & | aggregates, | |
int | n, | |||
int | m, | |||
std::ostream & | os | |||
) |
void Dune::Amg::EdgeProperties::printFlags | ( | ) | const [inherited] |
Prints the attributes of the edge for debugging.
void Dune::Amg::Transfer< V, V1, SequentialInformation >::prolongate | ( | const AggregatesMap< Vertex > & | aggregates, | |
Vector & | coarse, | |||
Vector & | fine, | |||
Vector & | fineRedist, | |||
T | damp, | |||
const SequentialInformation & | comm, | |||
const Redist & | redist | |||
) | [inline, inherited] |
References Dune::Amg::Transfer< V1, V2, T >::prolongate().
void Dune::Amg::Transfer< V, V1, OwnerOverlapCopyCommunication< T1, T2 > >::prolongate | ( | const AggregatesMap< Vertex > & | aggregates, | |
Vector & | coarse, | |||
Vector & | fine, | |||
T3 | damp, | |||
OwnerOverlapCopyCommunication< T1, T2 > & | comm | |||
) | [inline, static, inherited] |
References Dune::Amg::Transfer< V1, V2, T >::prolongate().
void Dune::Amg::Transfer< V, V1, SequentialInformation >::prolongate | ( | const AggregatesMap< Vertex > & | aggregates, | |
Vector & | coarse, | |||
Vector & | fine, | |||
T | damp, | |||
const SequentialInformation & | comm | |||
) | [inline, inherited] |
References index.
void Dune::Amg::Transfer< V, V1, OwnerOverlapCopyCommunication< T1, T2 > >::prolongate | ( | const AggregatesMap< Vertex > & | aggregates, | |
Vector & | coarse, | |||
Vector & | fine, | |||
Vector & | fineRedist, | |||
T3 | damp, | |||
OwnerOverlapCopyCommunication< T1, T2 > & | comm, | |||
const Redist & | redist | |||
) | [inline, static, inherited] |
Dune::Amg::PropertyGraphVertexPropertyMap< G, i >::PropertyGraphVertexPropertyMap | ( | G & | g | ) | [inline, inherited] |
Constructor.
g | The graph whose properties we access. |
Dune::Amg::PropertyGraphVertexPropertyMap< G, i >::PropertyGraphVertexPropertyMap | ( | ) | [inline, inherited] |
Default constructor.
bool Dune::Amg::Aggregator< G >::Stack::push | ( | const Vertex & | v | ) | [inherited] |
Dune::Amg::RandomAccessBundledPropertyMap< C, K, i, T, R >::RandomAccessBundledPropertyMap | ( | Container & | container | ) | [inline, inherited] |
Constructor.
container | The container with the property bundle. |
Dune::Amg::RandomAccessBundledPropertyMap< C, K, i, T, R >::RandomAccessBundledPropertyMap | ( | ) | [inline, inherited] |
The default constructor.
void Dune::Amg::MatrixHierarchy< M, IS, A >::recalculateGalerkin | ( | const F & | copyFlags | ) | [inherited] |
Recalculate the galerkin products.
If the data of the fine matrix changes but not its sparsity pattern this will recalculate all coarser levels without starting the expensive aggregation process all over again.
References Dune::Amg::BaseGalerkinProduct::calculate(), Dune::Amg::Hierarchy< T, A >::coarsest(), Dune::Amg::Hierarchy< T, A >::finest(), and Dune::redistributeMatrixEntries().
Referenced by Dune::Amg::AMG< M, X, S, PI, A >::recalculateHierarchy().
void Dune::Amg::AMG< M, X, S, PI, A >::recalculateHierarchy | ( | ) | [inline, inherited] |
Recalculate the matrix hierarchy.
It is assumed that the coarsening for the changed fine level matrix would yield the same aggregates. In this case it suffices to recalculate all the Galerkin products for the matrices of the coarser levels.
References Dune::Amg::MatrixHierarchy< M, PI, A >::recalculateGalerkin().
void Dune::Amg::Aggregate< G, S >::reconstruct | ( | const Vertex & | vertex | ) | [inherited] |
Reconstruct the aggregat from an seed node.
Will determine all vertices of the same agggregate and reference those.
const MatrixHierarchy< M, IS, A >::RedistributeInfoList & Dune::Amg::MatrixHierarchy< M, IS, A >::redistributeInformation | ( | ) | const [inherited] |
Get the hierachy of the information about redistributions,.
Referenced by Dune::Amg::AMG< M, X, S, PI, A >::pre().
bool Dune::Amg::repartitionAndDistributeMatrix | ( | const M & | origMatrix, | |
M & | newMatrix, | |||
SequentialInformation & | origSequentialInformationomm, | |||
SequentialInformation *& | newComm, | |||
RedistributeInformation< SequentialInformation > & | ri, | |||
int | nparts, | |||
C1 & | criterion | |||
) |
Referenced by Dune::Amg::MatrixHierarchy< M, PI, A >::build().
bool Dune::Amg::repartitionAndDistributeMatrix | ( | M & | origMatrix, | |
M & | newMatrix, | |||
SequentialInformation & | origComm, | |||
SequentialInformation & | newComm, | |||
RedistributeInformation< SequentialInformation > & | ri | |||
) |
bool Dune::Amg::repartitionAndDistributeMatrix | ( | const M & | origMatrix, | |
M & | newMatrix, | |||
C & | origComm, | |||
C *& | newComm, | |||
RedistributeInformation< C > & | ri, | |||
int | nparts, | |||
C1 & | criterion | |||
) |
void Dune::Amg::VertexProperties::reset | ( | ) | [inline, inherited] |
Reset all flags.
void Dune::Amg::ParallelIndicesCoarsener< T, E >::ParallelAggregateRenumberer< G, I >::reset | ( | ) | [inline, inherited] |
void Dune::Amg::EdgeProperties::reset | ( | ) | [inline, inherited] |
Reset all flags.
void Dune::Amg::EdgeProperties::resetDepends | ( | ) | [inline, inherited] |
Resets the depends flag.
References Dune::Amg::EdgeProperties::DEPEND.
void Dune::Amg::VertexProperties::resetExcludedBorder | ( | ) | [inline, inherited] |
Marks the vertex as included in the aggregation.
References Dune::Amg::VertexProperties::BORDER.
void Dune::Amg::VertexProperties::resetFront | ( | ) | [inline, inherited] |
Resets the front node flag.
References Dune::Amg::VertexProperties::FRONT.
void Dune::Amg::EdgeProperties::resetInfluences | ( | ) | [inline, inherited] |
Resets the influence flag.
void Dune::Amg::VertexProperties::resetIsolated | ( | ) | [inline, inherited] |
Resets the isolated flag.
References Dune::Amg::VertexProperties::ISOLATED.
void Dune::Amg::VertexProperties::resetVisited | ( | ) | [inline, inherited] |
Resets the visited flag.
References Dune::Amg::VertexProperties::VISITED.
void Dune::Amg::Transfer< V, V1, SequentialInformation >::restrict | ( | const AggregatesMap< Vertex > & | aggregates, | |
Vector & | coarse, | |||
const Vector & | fine, | |||
const SequentialInformation & | comm | |||
) | [inline, static, inherited] |
void Dune::Amg::Transfer< V, V1, OwnerOverlapCopyCommunication< T1, T2 > >::restrict | ( | const AggregatesMap< Vertex > & | aggregates, | |
Vector & | coarse, | |||
const Vector & | fine, | |||
OwnerOverlapCopyCommunication< T1, T2 > & | comm | |||
) | [inline, static, inherited] |
References Dune::Amg::Transfer< V1, V2, T >::restrict().
void Dune::Amg::Aggregate< G, S >::seed | ( | const Vertex & | vertex | ) | [inherited] |
Initialize the aggregate with one vertex.
Dune::Amg::SeqOverlappingSchwarzSmootherArgs< T >::SeqOverlappingSchwarzSmootherArgs | ( | Overlap | overlap_ = vertex , |
|
bool | onthefly_ = false | |||
) | [inline, inherited] |
void Dune::Amg::DirichletBoundarySetter< SequentialInformation >::set | ( | M & | coarse, | |
const SequentialInformation & | pinfo, | |||
const O & | copy | |||
) | [static, inherited] |
void Dune::Amg::DirichletBoundarySetter< T >::set | ( | M & | coarse, | |
const T & | pinfo, | |||
const O & | copy | |||
) | [static, inherited] |
int Dune::Amg::ConstructionArgs< SeqOverlappingSchwarz< M, X, TM, TS, TA > >::AggregateAdder< VM >::setAggregate | ( | const AggregateDescriptor & | aggregate_ | ) | [inline, inherited] |
int Dune::Amg::ConstructionArgs< SeqOverlappingSchwarz< M, X, TM, TS, TA > >::VertexAdder::setAggregate | ( | const AggregateDescriptor & | aggregate_ | ) | [inline, inherited] |
int Dune::Amg::ConstructionArgs< SeqOverlappingSchwarz< M, X, TM, TS, TA > >::NoneAdder::setAggregate | ( | const AggregateDescriptor & | aggregate_ | ) | [inline, inherited] |
void Dune::Amg::DependencyParameters::setAlpha | ( | double | a | ) | [inline, inherited] |
Set the scaling value for marking connections as strong. Default value is 1/3.
void Dune::Amg::DefaultConstructionArgs< T >::setArgs | ( | const SmootherArgs & | args | ) | [inline, inherited] |
void Dune::Amg::DependencyParameters::setBeta | ( | double | b | ) | [inline, inherited] |
Set threshold for marking nodes as isolated. The default value is 1.0E-5.
void Dune::Amg::DefaultConstructionArgs< T >::setComm | ( | T1 & | comm | ) | [inline, inherited] |
void Dune::Amg::DefaultParallelConstructionArgs< T, C >::setComm | ( | const C & | comm | ) | [inline, inherited] |
void Dune::Amg::AggregationCriterion< T >::setDebugLevel | ( | int | level | ) | [inline, inherited] |
Set the debugging level.
level | If 0 no debugging output will be generated. |
void Dune::Amg::AggregationCriterion< T >::setDefaultValuesAnisotropic | ( | std::size_t | dim, | |
std::size_t | diameter = 2 | |||
) | [inline, inherited] |
Sets reasonable default values for an aisotropic problem.
Reasonable means that we should end up with cube aggregates with sides of diameter 2 and sides in one dimension that are longer (e.g. for 3D: 2x2x3).
dim | The dimension of the problem. | |
diameter | The preferred diameter for the aggregation. |
void Dune::Amg::AggregationCriterion< T >::setDefaultValuesIsotropic | ( | std::size_t | dim, | |
std::size_t | diameter = 2 | |||
) | [inline, inherited] |
Sets reasonable default values for an isotropic problem.
Reasonable means that we should end up with cube aggregates of diameter 2.
dim | The dimension of the problem. | |
diameter | The preferred diameter for the aggregation. |
Referenced by Dune::Amg::AggregationCriterion< SymmetricDependency< M, Norm > >::setDefaultValuesAnisotropic().
void Dune::Amg::EdgeProperties::setDepends | ( | ) | [inline, inherited] |
Marks the edge as one of which the end point depends on the starting point.
References Dune::Amg::EdgeProperties::DEPEND.
void Dune::Amg::VertexProperties::setExcludedBorder | ( | ) | [inline, inherited] |
Marks the vertex as excluded from the aggregation.
References Dune::Amg::VertexProperties::BORDER.
void Dune::Amg::VertexProperties::setFront | ( | ) | [inline, inherited] |
Marks the node as belonging to the current clusters front.
References Dune::Amg::VertexProperties::FRONT.
void Dune::Amg::EdgeProperties::setInfluences | ( | ) | [inline, inherited] |
Marks the edge as one of which the start vertex by the end vertex.
References Dune::Amg::EdgeProperties::INFLUENCE.
void Dune::Amg::VertexProperties::setIsolated | ( | ) | [inline, inherited] |
Marks that node as being isolated.
A node is isolated if it ha not got any strong connections to other nodes in the matrix graph.
References Dune::Amg::VertexProperties::ISOLATED.
virtual void Dune::Amg::DefaultConstructionArgs< T >::setMatrix | ( | const Matrix & | matrix, | |
const AggregatesMap & | amap | |||
) | [inline, virtual, inherited] |
void Dune::Amg::DefaultConstructionArgs< T >::setMatrix | ( | const Matrix & | matrix | ) | [inline, inherited] |
virtual void Dune::Amg::ConstructionArgs< SeqOverlappingSchwarz< M, X, TM, TS, TA > >::setMatrix | ( | const M & | matrix, | |
const AggregatesMap & | amap | |||
) | [inline, virtual, inherited] |
void Dune::Amg::ConstructionArgs< SeqOverlappingSchwarz< M, X, TM, TS, TA > >::setMatrix | ( | const M & | matrix | ) | [inline, inherited] |
void Dune::Amg::AggregationCriterion< T >::setMaxAggregateSize | ( | std::size_t | size | ) | [inline, inherited] |
Set the maximum number of nodes a aggregate is allowed to have.
The default values is 6.
size | The maximum number of nodes. |
void Dune::Amg::AggregationCriterion< T >::setMaxConnectivity | ( | std::size_t | connectivity | ) | [inline, inherited] |
Set the maximum number of connections a aggregate is allowed to have.
This limit exists to achieve sparsity of the coarse matrix. the default value is 15.
connectivity | The maximum number of connections a aggregate is allowed to have. |
void Dune::Amg::AggregationCriterion< T >::setMaxDistance | ( | std::size_t | distance | ) | [inline, inherited] |
Set the maximal distance allowed between to nodes in a aggregate.
The distance between two nodes in a aggregate is the minimal number of edges it takes to travel from one node to the other without leaving the aggregate. The default value is 2.
distance | The maximum distance allowed. |
void Dune::Amg::AggregationCriterion< T >::setMinAggregateSize | ( | std::size_t | size | ) | [inline, inherited] |
Set the minimum number of nodes a aggregate has to consist of.
the default value is 4.
void Dune::Amg::ConstructionArgs< SeqILUn< M, X, Y > >::setN | ( | int | n | ) | [inline, inherited] |
void Dune::Amg::AggregationCriterion< T >::setSkipIsolated | ( | bool | skip | ) | [inline, inherited] |
Set whether isolated aggregates will not be represented on the coarse level.
skip | True if these aggregates will be skipped. |
void Dune::Amg::VertexProperties::setVisited | ( | ) | [inline, inherited] |
Mark the node as already visited.
References Dune::Amg::VertexProperties::VISITED.
VertexList::size_type Dune::Amg::Aggregate< G, S >::size | ( | ) | [inherited] |
Get the size of the aggregate.
bool Dune::Amg::AggregationCriterion< T >::skipIsolated | ( | ) | const [inline, inherited] |
Whether isolated aggregates will not be represented on the coarse level.
Dune::Amg::SparsityBuilder< M >::SparsityBuilder | ( | M & | matrix | ) | [inherited] |
Constructor.
matrix | The matrix whose sparsity pattern we should set up. |
Dune::Amg::Aggregator< G >::Stack::Stack | ( | const MatrixGraph & | graph, | |
const Aggregator< G > & | aggregatesBuilder, | |||
const AggregatesMap< Vertex > & | aggregates | |||
) | [inherited] |
std::size_t Dune::Amg::SparsityBuilder< M >::sumRowSize | ( | ) | [inherited] |
int Dune::Amg::Aggregator< G >::Counter::value | ( | ) | [inherited] |
Access the current count.
Dune::Amg::VertexProperties::VertexProperties | ( | ) | [inline, inherited] |
Constructor.
bool Dune::Amg::VertexProperties::visited | ( | ) | const [inline, inherited] |
Checks wether the node is marked as visited.
References Dune::Amg::VertexProperties::VISITED.
int Dune::Amg::visitNeighbours | ( | const G & | graph, | |
const typename G::VertexDescriptor & | vertex, | |||
V & | visitor | |||
) |
Visit all neighbour vertices of a vertex in a graph.
graph | The graph whose vertices to visit. | |
vertex | The vertex whose neighbours we want to visit. | |
visitor | The visitor evaluated for each EdgeIterator (by its method operator()(const ConstEdgeIterator& edge) |
Referenced by Dune::Amg::BaseConnectivityConstructor::constructOverlapConnectivity().
Dune::Amg::AggregatesMap< V >::~AggregatesMap | ( | ) | [inherited] |
Destructor.
Dune::Amg::Aggregator< G >::~Aggregator | ( | ) | [inherited] |
Destructor.
Dune::Amg::AMG< M, X, S, PI, A >::~AMG | ( | ) | [inherited] |
virtual Dune::Amg::DefaultConstructionArgs< T >::~DefaultConstructionArgs | ( | ) | [inline, virtual, inherited] |
Dune::Amg::Hierarchy< T, A >::~Hierarchy | ( | ) | [inherited] |
Destructor.
Dune::Amg::MatrixHierarchy< M, IS, A >::~MatrixHierarchy | ( | ) | [inherited] |
Dune::Amg::Aggregator< G >::Stack::~Stack | ( | ) | [inherited] |
Aggregate* Dune::Amg::OverlapVertex< T >::aggregate [inherited] |
The aggregate the vertex belongs to.
Referenced by Dune::Amg::BaseConnectivityConstructor::constructOverlapConnectivity(), and Dune::Amg::ConnectivityConstructor< G, T >::examine().
SolverCategory::Category Dune::Amg::OwnerOverlapCopyCommunicationArgs::cat_ [inherited] |
C* Dune::Amg::NonoverlappingOperatorArgs< M, C >::comm_ [inherited] |
C* Dune::Amg::OverlappingSchwarzOperatorArgs< M, C >::comm_ [inherited] |
MPI_Comm Dune::Amg::OwnerOverlapCopyCommunicationArgs::comm_ [inherited] |
CollectiveCommunication<void*> Dune::Amg::SequentialCommunicationArgs::comm_ [inherited] |
const V Dune::Amg::AggregatesMap< V >::ISOLATED [static, inherited] |
Identifier of isolated vertices.
Referenced by Dune::Amg::MatrixHierarchy< M, PI, A >::getCoarsestAggregatesOnFinest(), Dune::Amg::ConstructionArgs< SeqOverlappingSchwarz< M, X, TM, TS, TA > >::AggregateAdder< VM >::operator()(), and Dune::Amg::ConstructionArgs< SeqOverlappingSchwarz< M, X, TM, TS, TA > >::VertexAdder::operator()().
int Dune::Amg::DefaultSmootherArgs< T >::iterations [inherited] |
The numbe of iterations to perform.
M* Dune::Amg::OverlappingSchwarzOperatorArgs< M, C >::matrix_ [inherited] |
M* Dune::Amg::NonoverlappingOperatorArgs< M, C >::matrix_ [inherited] |
const Matrix* Dune::Amg::DefaultConstructionArgs< T >::matrix_ [protected, inherited] |
bool Dune::Amg::SeqOverlappingSchwarzSmootherArgs< T >::onthefly [inherited] |
Overlap Dune::Amg::SeqOverlappingSchwarzSmootherArgs< T >::overlap [inherited] |
RelaxationFactor Dune::Amg::DefaultSmootherArgs< T >::relaxationFactor [inherited] |
The relaxation factor to use.
Vertex Dune::Amg::OverlapVertex< T >::vertex [inherited] |
The vertex descriptor.
Referenced by Dune::Amg::BaseConnectivityConstructor::constructOverlapConnectivity(), and Dune::Amg::ConnectivityConstructor< G, T >::examine().
friend class KAmgTwoGrid< AMG > [friend, inherited] |
friend class Stack [friend, inherited] |
Generated on Fri Apr 29 2011 with Doxygen (ver 1.7.1) [doxygen-log,error-log].