Class List

Here are the classes, structs, unions and interfaces with brief descriptions:
Dune::AdderSelector< T, X, S >Template meta program for choosing how to add the correction
Dune::AdderSelector< AdditiveSchwarzMode, X, S >
Dune::AdderSelector< MultiplicativeSchwarzMode, X, S >
Dune::AdderSelector< SymmetricMultiplicativeSchwarzMode, X, S >
Dune::OwnerOverlapCopyCommunication< GlobalIdType, LocalIdType >::AddGatherScatter< T >
Dune::AdditiveAdder< S, T >
Dune::AdditiveAdder< S, BlockVector< FieldVector< T, n >, A > >
Dune::AdditiveSchwarzModeTag that the tells the schwarz method to be additive
Dune::Amg::Aggregate< G, S >A class for temporarily storing the vertices of an aggregate in
Dune::Amg::AggregateRenumberer< G >
Dune::Amg::AggregatesGatherScatter< T, TI >
Dune::Amg::AggregatesMap< V >Class providing information about the mapping of the vertices onto aggregates
Dune::Amg::AggregatesPublisher< T, O, I >
Dune::Amg::AggregatesPublisher< T, O, OwnerOverlapCopyCommunication< T1, T2 > >Utility class for publishing the aggregate number of the DOFs in the overlap to other processors and convert them to local indices
Dune::Amg::AggregatesPublisher< T, O, SequentialInformation >
Dune::Amg::AggregationCriterion< T >Base class of all aggregation criterions
Dune::Amg::Aggregator< G >Class for building the aggregates
Dune::algmeta_bdsolve< I, relax >
Dune::algmeta_bdsolve< 0, norelax >
Dune::algmeta_bdsolve< 0, withrelax >
Dune::algmeta_btsolve< I, diag, relax >
Dune::algmeta_btsolve< 0, nodiag, norelax >
Dune::algmeta_btsolve< 0, nodiag, withrelax >
Dune::algmeta_btsolve< 0, withdiag, norelax >
Dune::algmeta_btsolve< 0, withdiag, withrelax >
Dune::algmeta_itsteps< I >
Dune::algmeta_itsteps< 0 >
Dune::Amg::AlwaysOneNorm
Dune::Amg::AMG< M, X, S, PI, A >Parallel algebraic multigrid based on agglomeration
Dune::Amg::ApplyHelper< i >
Dune::Amg::ApplyHelper< 0 >
Dune::AssembledLinearOperator< M, X, Y >A linear operator exporting itself in matrix form
Dune::base_array< B, A >This container extends base_array_unmanaged by memory management with the usual copy semantics providing the full range of copy constructor, destructor and assignment operators
Dune::base_array_unmanaged< B, A >A simple array container for objects of type B
Dune::base_array_window< B, A >Extend base_array_unmanaged by functions to manipulate
Dune::Amg::BaseConnectivityConstructor
Dune::Amg::BaseGalerkinProduct
Dune::BCRSMatrix< B, A >A sparse block matrix with compressed row storage
Dune::BDMatrix< B, A >A block-diagonal matrix
Dune::BiCGSTABSolver< X >Bi-conjugate Gradient Stabilized (BiCG-STAB)
Dune::BL< l >Compile-time parameter for block recursion depth
Dune::block_vector_unmanaged< B, A >An unmanaged vector of blocks
Dune::BlockPreconditioner< X, Y, C, T >Block parallel preconditioner
Dune::BlockVector< B, A >A vector of blocks with memory management
Dune::BlockVectorWindow< B, A >
Dune::BTDMatrix< B, A >A block-tridiagonal matrix
Dune::Amg::MatrixHierarchy< M, PI, A >::MatrixStats< Matrix, true >::calc
Dune::CGSolver< X >Conjugate gradient method
Dune::CheckIfDiagonalPresent< Matrix, blocklevel, l >Check whether the a matrix has diagonal values on blocklevel recursion levels
Dune::CheckIfDiagonalPresent< Matrix, 0, l >
Dune::CheckIfDiagonalPresent< MultiTypeBlockMatrix< T1, T2, T3, T4, T5, T6, T7, T8, T9 >, blocklevel, l >
Dune::Amg::CoarsenCriterion< T >The criterion describing the stop criteria for the coarsening process
Dune::Amg::CombinedFunctor< T >
Dune::CommMatrixRow< M, I >Utility class for comunicating the matrix entries
Dune::CommMatrixRowSize< M, RI >Utility class to communicate and set the row sizes of a redistributed matrix
Dune::CommMatrixSparsityPattern< M, I >Utility class to communicate and build the sparsity pattern of a redistributed matrix
Dune::CommPolicy< Amg::GlobalAggregatesMap< T, TI > >
Dune::CommPolicy< CommMatrixRow< M, I > >
Dune::CommPolicy< CommMatrixSparsityPattern< M, I > >
Dune::compressed_base_array_unmanaged< B, A >A simple array container with non-consecutive index set
Dune::compressed_block_vector_unmanaged< B, A >
Dune::CompressedBlockVectorWindow< B, A >
Dune::Amg::BaseConnectivityConstructor::ConnectedBuilder< G, S, V >Visitor for identifying connected aggregates during a breadthFirstSearch
Dune::Amg::ConnectivityConstructor< G, T >
Dune::Amg::ConnectivityConstructor< G, SequentialInformation >
Dune::MatrixRowSubset< M, S >::const_iterator
Dune::const_reference< DiagonalRowVector< K, n > >
Dune::const_reference< DiagonalRowVectorConst< K, n > >
Dune::VariableBlockVector< B, A >::ConstIteratorConstIterator class for sequential access
Dune::Amg::ConstructionArgs< T >
Dune::Amg::ConstructionArgs< SeqILUn< M, X, Y > >
Dune::Amg::ConstructionArgs< SeqOverlappingSchwarz< M, X, TM, TS, TA > >
Dune::Amg::ConstructionTraits< T >Traits class for generically constructing non default constructable types
Dune::Amg::ConstructionTraits< BlockPreconditioner< X, Y, C, T > >
Dune::Amg::ConstructionTraits< BlockVector< T > >
Dune::Amg::ConstructionTraits< MatrixAdapter< M, X, Y > >
Dune::Amg::ConstructionTraits< NonoverlappingBlockPreconditioner< C, T > >
Dune::Amg::ConstructionTraits< NonoverlappingSchwarzOperator< M, X, Y, C > >
Dune::Amg::ConstructionTraits< OverlappingSchwarzOperator< M, X, Y, C > >
Dune::Amg::ConstructionTraits< OwnerOverlapCopyCommunication< T1, T2 > >
Dune::Amg::ConstructionTraits< ParSSOR< M, X, Y, C > >Policy for the construction of the ParSSOR smoother
Dune::Amg::ConstructionTraits< SeqILU0< M, X, Y > >Policy for the construction of the SeqILUn smoother
Dune::Amg::ConstructionTraits< SeqILUn< M, X, Y > >Policy for the construction of the SeqJac smoother
Dune::Amg::ConstructionTraits< SeqJac< M, X, Y, l > >Policy for the construction of the SeqJac smoother
Dune::Amg::ConstructionTraits< SeqOverlappingSchwarz< M, X, TM, TS, TA > >
Dune::Amg::ConstructionTraits< SeqSOR< M, X, Y, l > >Policy for the construction of the SeqSOR smoother
Dune::Amg::ConstructionTraits< SeqSSOR< M, X, Y, l > >Policy for the construction of the SeqSSOR smoother
Dune::Amg::ConstructionTraits< SequentialInformation >
Dune::ContainerWrapperIterator< CW, T, R >Iterator class for sparse vector-like containers
Dune::OwnerOverlapCopyCommunication< GlobalIdType, LocalIdType >::CopyGatherScatter< T >Gather/scatter callback for communcation
Dune::VariableBlockVector< B, A >::CreateIteratorIterator class for sequential creation of blocks
Dune::BCRSMatrix< B, A >::CreateIteratorIterator class for sequential creation of blocks
Dune::Amg::DefaultConstructionArgs< T >Construction Arguments for the default smoothers
Dune::Amg::DefaultParallelConstructionArgs< T, C >
Dune::Amg::DefaultSmootherArgs< T >The default class for the smoother arguments
Dune::Amg::Dependency< M, N >Dependency policy for symmetric matrices
Dune::Amg::DependencyParametersParamters needed to check whether a node depends on another
Dune::Amg::Diagonal< N >Norm that uses only the [N][N] entry of the block to determine couplings
Dune::DiagonalMatrix< K, n >A diagonal matrix of static size. This is meant to be a replacement of FieldMatrix for the case that it is a diagonal matrix
Dune::DiagonalMatrixWrapper< DiagonalMatrixType >
Dune::DiagonalRowVector< K, n >
Dune::DiagonalRowVectorConst< K, n >
Dune::Amg::DirichletBoundarySetter< T >
Dune::Amg::DirichletBoundarySetter< SequentialInformation >
Dune::Amg::AggregatesMap< V >::DummyEdgeVisitorA Dummy visitor that does nothing for each visited edge
Dune::DynamicMatrixSubdomainSolver< BCRSMatrix< FieldMatrix< K, n, n >, Al >, X, Y >
Dune::Amg::SubGraph< G, T >::EdgeIndexMapAn index map for mapping the edges to indices
Dune::Amg::SubGraph< G, T >::EdgeIteratorThe edge iterator of the graph
Dune::Amg::MatrixGraph< M >::EdgeIteratorT< C >Iterator over all edges starting from a vertex
Dune::Amg::PropertiesGraph< G, VP, EP, VM, EM >::EdgeIteratorT< C >
Dune::Amg::EdgePropertiesClass representing the properties of an ede in the matrix graph
Dune::Amg::FirstDiagonalNorm that uses only the [0][0] entry of the block to determine couplings
Dune::Amg::FrobeniusNorm
Dune::Amg::GalerkinProduct< T >
Dune::Amg::GalerkinProduct< SequentialInformation >
Dune::GetSuperLUType< T >
Dune::GetSuperLUType< double >
Dune::GetSuperLUType< float >
Dune::GetSuperLUType< std::complex< double > >
Dune::GetSuperLUType< std::complex< float > >
Dune::Amg::GlobalAggregatesMap< T, TI >
Dune::GradientSolver< X >Gradient method
Dune::Amg::GraphEdgePropertiesSelector< G >Wrapper to access the internal vertex properties of a graph via operator[]()
Dune::Amg::GraphVertexPropertiesSelector< G >Wrapper to access the internal edge properties of a graph via operator[]()
Dune::Amg::Hierarchy< T, A >A hierarchy of coantainers (e.g. matrices or vectors)
Dune::ILU0SubdomainSolver< M, X, Y >Exact subdomain solver using ILU(p) with appropriate p
Dune::ILUNSubdomainSolver< M, X, Y >
Dune::ILUSubdomainSolver< M, X, Y >Base class encapsulating common algorithms of ILU0SubdomainSolver and ILUNSubdomainSolver
Dune::IndexInfoFromGrid< G, L >Information about the index distribution
Dune::Amg::IndicesCoarsener< T, E >
Dune::Amg::IndicesCoarsener< OwnerOverlapCopyCommunication< G, L >, E >Coarsen Indices in the parallel case
Dune::Amg::IndicesCoarsener< SequentialInformation, E >Coarsen Indices in the sequential case
Dune::InverseOperator< X, Y >Abstract base class for all solvers
Dune::InverseOperatorResultStatistics about the application of an inverse operator
Dune::ISTLAllocatorDefault allocator for ISTL
Dune::ISTLErrorDerive error class from the base class in common
Dune::VariableBlockVector< B, A >::IteratorIterator class for sequential access
Dune::IteratorDirectionSelector< T1, T2, forward >Helper template meta program for application of overlapping schwarz
Dune::IteratorDirectionSelector< T1, T2, false >
Dune::Amg::KAMG< M, X, S, PI, K, A >Algebraic multigrid method using a Krylov-cycle
Dune::Amg::KAmgTwoGrid< AMG >Two grid operator for AMG with Krylov cycle
Dune::Amg::Hierarchy< T, A >::LevelIterator< C, T1 >Iterator over the levels in the hierarchy
Dune::LinearOperator< X, Y >A linear operator
Dune::LoopSolver< X >Preconditioned loop solver
Dune::MatMultMatResult< M1, M2 >Helper TMP to get the result type of a sparse matrix matrix multiplication ( $C=A*B$)
Dune::MatMultMatResult< BCRSMatrix< FieldMatrix< T, n, k >, A >, BCRSMatrix< FieldMatrix< T, k, m >, A1 > >
Dune::MatMultMatResult< FieldMatrix< T, n, k >, FieldMatrix< T, k, m > >
Dune::Matrix< T, A >A generic dynamic dense matrix
Dune::MatrixAdapter< M, X, Y >Adapter to turn a matrix into a linear operator
Dune::Amg::MatrixAdapterArgs< M, X, Y >
Dune::MatrixBlockError
Dune::MatrixCopyRowSizeGatherScatter< M, I, RI >
Dune::MatrixDimension< M >
Dune::MatrixDimension< BCRSMatrix< B, TA > >
Dune::MatrixDimension< BCRSMatrix< FieldMatrix< B, n, m >, TA > >
Dune::MatrixDimension< FieldMatrix< K, n, m > >
Dune::MatrixDimension< Matrix< FieldMatrix< K, n, m >, TA > >
Dune::Amg::MatrixGraph< M >The (undirected) graph of a matrix
Dune::Amg::MatrixHierarchy< M, PI, A >The hierarchies build by the coarsening process
Dune::MatrixIndexSetStores the nonzero entries in a sparse matrix
Dune::MatrixMarketFormatError
Dune::MatrixRowGatherScatter< M, I >
Dune::MatrixRowSet< M >Provides access to an iterator over all matrix rows
Dune::MatrixRowSizeGatherScatter< M, I, RI >
Dune::MatrixRowSubset< M, S >Provides access to an iterator over an arbitrary subset of matrix rows
Dune::MatrixSparsityPatternGatherScatter< M, I >
Dune::MINRESSolver< X >Minimal Residual Method (MINRES)
Dune::MultiplicativeAdder< S, T >
Dune::MultiplicativeAdder< S, BlockVector< FieldVector< T, n >, A > >
Dune::MultiplicativeSchwarzModeTag that tells the Schwarz method to be multiplicative
Dune::mutable_reference< DiagonalRowVector< K, n > >
Dune::mutable_reference< DiagonalRowVectorConst< K, n > >
Dune::NonoverlappingBlockPreconditioner< C, P >Nonoverlapping parallel preconditioner
Dune::Amg::NonoverlappingOperatorArgs< M, C >
Dune::NonoverlappingSchwarzOperator< M, X, Y, C >A nonoverlapping operator with communication object
Dune::NonoverlappingSchwarzScalarProduct< X, C >Nonoverlapping Scalar Product with communication object
Dune::OverlappingAssigner< T >
Dune::OverlappingAssigner< DynamicMatrixSubdomainSolver< BCRSMatrix< FieldMatrix< K, n, n >, Al >, X, Y > >
Dune::OverlappingAssigner< ILU0SubdomainSolver< M, X, Y > >
Dune::OverlappingAssigner< ILUNSubdomainSolver< M, X, Y > >
Dune::OverlappingAssigner< SuperLU< BCRSMatrix< FieldMatrix< T, n, m >, A > > >
Dune::OverlappingAssignerILUBase< M, X, Y >
Dune::OverlappingSchwarzInitializer< I, S, D >Initializer for SuperLU Matrices representing the subdomains
Dune::OverlappingSchwarzOperator< M, X, Y, C >An overlapping schwarz operator
Dune::Amg::OverlappingSchwarzOperatorArgs< M, C >
Dune::OverlappingSchwarzScalarProduct< X, C >Scalar product for overlapping schwarz methods
Dune::Amg::OverlapVertex< T >
Dune::OwnerOverlapCopyAttributeSetAttribute set for overlapping schwarz
Dune::OwnerOverlapCopyCommunication< GlobalIdType, LocalIdType >A class setting up standard communication for a two-valued attribute set with owner/overlap/copy semantics
Dune::Amg::OwnerOverlapCopyCommunicationArgs
Dune::Amg::ParallelIndicesCoarsener< T, E >
Dune::ParSSOR< M, X, Y, C >A parallel SSOR preconditioner
Dune::Preconditioner< X, Y >Base class for matrix free definition of preconditioners
Dune::Amg::PropertiesGraph< G, VP, EP, VM, EM >Attaches properties to the edges and vertices of a graph
Dune::Amg::PropertiesGraphCreator< M, cat >
Dune::Amg::PropertiesGraphCreator< M, SolverCategory::nonoverlapping >
Dune::Amg::PropertiesGraphCreator< M, SolverCategory::overlapping >
Dune::Amg::PropertiesGraphCreator< M, SolverCategory::sequential >
Dune::Amg::PropertyGraphVertexPropertyMap< G, i >
Dune::PropertyMapTypeSelector< Amg::VertexVisitedTag, Amg::PropertiesGraph< G, Amg::VertexProperties, EP, VM, EM > >
Dune::Amg::GlobalAggregatesMap< T, TI >::Proxy
Dune::Amg::RandomAccessBundledPropertyMap< C, K, i, T, R >A property map that extracts one property out of a bundle using operator[]()
Dune::base_array_unmanaged< B, A >::RealIterator< T >Iterator implementation class
Dune::compressed_base_array_unmanaged< B, A >::RealIterator< T >Iterator class for sequential access
Dune::BCRSMatrix< B, A >::RealRowIterator< T >Iterator access to matrix rows
Dune::RedistributeInformation< T >
Dune::RedistributeInformation< OwnerOverlapCopyCommunication< T, T1 > >
Dune::RedistributeInterface
Dune::RestartedGMResSolver< X, Y, F >Implements the Generalized Minimal Residual (GMRes) method
Dune::Richardson< X, Y >Richardson preconditioner
Dune::Amg::RowSumFunctor using the row sum (infinity) norm to determine strong couplings
Dune::ScalarProduct< X >Base class for scalar product and norm computation
Dune::ScalarProductChooser< X, C, c >Choose the approriate scalar product for a solver category
Dune::ScalarProductChooser< X, C, SolverCategory::nonoverlapping >
Dune::ScalarProductChooser< X, C, SolverCategory::overlapping >
Dune::ScalarProductChooser< X, C, SolverCategory::sequential >
Dune::ScaledIdentityMatrix< K, n >A multiple of the identity matrix of static size
Dune::SeqGS< M, X, Y, l >Sequential Gauss Seidel preconditioner
Dune::SeqILU0< M, X, Y, l >Sequential ILU0 preconditioner
Dune::SeqILUn< M, X, Y, l >Sequential ILU(n) preconditioner
Dune::SeqJac< M, X, Y, l >The sequential jacobian preconditioner
Dune::SeqOverlappingSchwarz< M, X, TM, TD, TA >Sequential overlapping Schwarz preconditioner
Dune::SeqOverlappingSchwarzApplier< T >Helper template meta program for application of overlapping schwarz
Dune::SeqOverlappingSchwarzApplier< SeqOverlappingSchwarz< M, X, SymmetricMultiplicativeSchwarzMode, TD, TA > >
Dune::SeqOverlappingSchwarzAssembler< T >
Dune::SeqOverlappingSchwarzAssembler< DynamicMatrixSubdomainSolver< BCRSMatrix< FieldMatrix< K, n, n >, Al >, X, Y > >
Dune::SeqOverlappingSchwarzAssembler< ILU0SubdomainSolver< M, X, Y > >
Dune::SeqOverlappingSchwarzAssembler< ILUNSubdomainSolver< M, X, Y > >
Dune::SeqOverlappingSchwarzAssembler< SuperLU< T > >
Dune::SeqOverlappingSchwarzAssemblerILUBase< M, X, Y >
Dune::SeqOverlappingSchwarzDomainSize< M >
Dune::SeqOverlappingSchwarzDomainSize< BCRSMatrix< FieldMatrix< T, n, m >, A > >
Dune::Amg::SeqOverlappingSchwarzSmootherArgs< T >
Dune::SeqPardiso< M, X, Y >The sequential Pardiso preconditioner
Dune::SeqScalarProduct< X >Default implementation for the scalar case
Dune::SeqSOR< M, X, Y, l >Sequential SOR preconditioner
Dune::SeqSSOR< M, X, Y, l >Sequential SSOR preconditioner
Dune::Amg::SequentialCommunicationArgs
Dune::Amg::SequentialInformation
Dune::Amg::SmootherApplier< T >Helper class for applying the smoothers
Dune::Amg::SmootherApplier< BlockPreconditioner< X, Y, C, SeqSOR< M, X, Y, l > > >
Dune::Amg::SmootherApplier< NonoverlappingBlockPreconditioner< C, SeqSOR< M, X, Y, l > > >
Dune::Amg::SmootherApplier< SeqOverlappingSchwarz< M, X, MultiplicativeSchwarzMode, MS, TA > >
Dune::Amg::SmootherApplier< SeqSOR< M, X, Y, l > >
Dune::Amg::SmootherTraits< T >Traits class for getting the attribute class of a smoother
Dune::Amg::SmootherTraits< BlockPreconditioner< X, Y, C, T > >
Dune::Amg::SmootherTraits< NonoverlappingBlockPreconditioner< C, T > >
Dune::Amg::SmootherTraits< SeqOverlappingSchwarz< M, X, TM, TS, TA > >
Dune::SolverCategoryCategories for the solvers
Dune::Amg::SparsityBuilder< M >Functor for building the sparsity pattern of the matrix using examineConnectivity
Dune::Amg::SubGraph< G, T >A subgraph of a graph
Dune::SuperLU< Matrix >
Dune::SuperLU< BCRSMatrix< FieldMatrix< T, n, m >, A > >SuperLu Solver
Dune::SuperLUMatrix< M >Utility class for converting an ISTL Matrix into a SsuperLU Matrix
Dune::SuperLUMatrix< BCRSMatrix< FieldMatrix< B, n, m >, TA > >Coverter for BCRSMatrix to SuperLU Matrix
Dune::SuperMatrixInitializer< M >
Dune::SuperMatrixInitializer< BCRSMatrix< FieldMatrix< T, n, m >, A > >
Dune::Amg::SymmetricCriterion< M, Norm >Criterion taking advantage of symmetric matrices
Dune::Amg::SymmetricDependency< M, N >Dependency policy for symmetric matrices
Dune::SymmetricMultiplicativeSchwarzModeTag that tells the Schwarz method to be multiplicative and symmetric
Timer
Dune::Amg::Transfer< V1, V2, T >
Dune::Amg::Transfer< V, V1, OwnerOverlapCopyCommunication< T1, T2 > >
Dune::Amg::Transfer< V, V1, SequentialInformation >
Dune::Amg::UnSymmetricCriterion< M, Norm >Criterion suited for unsymmetric matrices
Dune::VariableBlockVector< B, A >A Vector of blocks with different blocksizes
Dune::Amg::SubGraph< G, T >::VertexIteratorThe vertex iterator of the graph
Dune::Amg::MatrixGraph< M >::VertexIteratorT< C >The vertex iterator type of the graph
Dune::Amg::VertexPropertiesGraph< G, VP, VM >::VertexIteratorT< C >
Dune::Amg::PropertiesGraph< G, VP, EP, VM, EM >::VertexIteratorT< C >
Dune::Amg::VertexPropertiesClass representing a node in the matrix graph
Dune::Amg::VertexPropertiesGraph< G, VP, VM >Attaches properties to the vertices of a graph
Dune::Amg::VertexVisitedTagTag idnetifying the visited property of a vertex

Generated on Fri Apr 29 2011 with Doxygen (ver 1.7.1) [doxygen-log,error-log].