MueLu  Version of the Day
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Groups Pages
MueLu_UseShortNamesOrdinal.hpp
Go to the documentation of this file.
1 // Type definitions for templated classes (generally graph-related) that do not require a scalar.
2 
4 
5 #ifdef MUELU_AGGREGATES_SHORT
6 using Aggregates [[maybe_unused]] = MueLu::Aggregates<LocalOrdinal, GlobalOrdinal, Node>;
7 #endif
8 #ifdef MUELU_AGGREGATIONPHASE1ALGORITHM_SHORT
9 using AggregationPhase1Algorithm [[maybe_unused]] = MueLu::AggregationPhase1Algorithm<LocalOrdinal, GlobalOrdinal, Node>;
10 #endif
11 #ifdef MUELU_AGGREGATIONPHASE2AALGORITHM_SHORT
12 using AggregationPhase2aAlgorithm [[maybe_unused]] = MueLu::AggregationPhase2aAlgorithm<LocalOrdinal, GlobalOrdinal, Node>;
13 #endif
14 #ifdef MUELU_AGGREGATIONPHASE2BALGORITHM_SHORT
15 using AggregationPhase2bAlgorithm [[maybe_unused]] = MueLu::AggregationPhase2bAlgorithm<LocalOrdinal, GlobalOrdinal, Node>;
16 #endif
17 #ifdef MUELU_AGGREGATIONPHASE3ALGORITHM_SHORT
18 using AggregationPhase3Algorithm [[maybe_unused]] = MueLu::AggregationPhase3Algorithm<LocalOrdinal, GlobalOrdinal, Node>;
19 #endif
20 #ifdef MUELU_AGGREGATIONSTRUCTUREDALGORITHM_SHORT
21 using AggregationStructuredAlgorithm [[maybe_unused]] = MueLu::AggregationStructuredAlgorithm<LocalOrdinal, GlobalOrdinal, Node>;
22 #endif
23 #ifdef MUELU_AMALGAMATIONINFO_SHORT
24 using AmalgamationInfo [[maybe_unused]] = MueLu::AmalgamationInfo<LocalOrdinal, GlobalOrdinal, Node>;
25 #endif
26 #ifdef MUELU_GLOBALLEXICOGRAPHICINDEXMANAGER_SHORT
27 using GlobalLexicographicIndexManager [[maybe_unused]] = MueLu::GlobalLexicographicIndexManager<LocalOrdinal, GlobalOrdinal, Node>;
28 #endif
29 #ifdef MUELU_HYBRIDAGGREGATIONFACTORY_SHORT
30 using HybridAggregationFactory [[maybe_unused]] = MueLu::HybridAggregationFactory<LocalOrdinal, GlobalOrdinal, Node>;
31 #endif
32 #ifdef MUELU_INDEXMANAGER_SHORT
33 using IndexManager [[maybe_unused]] = MueLu::IndexManager<LocalOrdinal, GlobalOrdinal, Node>;
34 #endif
35 #ifdef MUELU_INDEXMANAGER_KOKKOS_SHORT
36 using IndexManager_kokkos [[maybe_unused]] = MueLu::IndexManager_kokkos<LocalOrdinal, GlobalOrdinal, Node>;
37 #endif
38 #ifdef MUELU_INTERFACEAGGREGATIONALGORITHM_SHORT
39 using InterfaceAggregationAlgorithm [[maybe_unused]] = MueLu::InterfaceAggregationAlgorithm<LocalOrdinal, GlobalOrdinal, Node>;
40 #endif
41 #ifdef MUELU_INTERFACEMAPPINGTRANSFERFACTORY_SHORT
42 using InterfaceMappingTransferFactory [[maybe_unused]] = MueLu::InterfaceMappingTransferFactory<LocalOrdinal, GlobalOrdinal, Node>;
43 #endif
44 #ifdef MUELU_ISORROPIAINTERFACE_SHORT
45 using IsorropiaInterface [[maybe_unused]] = MueLu::IsorropiaInterface<LocalOrdinal, GlobalOrdinal, Node>;
46 #endif
47 #ifdef MUELU_LWGRAPH_SHORT
48 using LWGraph [[maybe_unused]] = MueLu::LWGraph<LocalOrdinal, GlobalOrdinal, Node>;
49 #endif
50 #ifdef MUELU_LWGRAPH_KOKKOS_SHORT
51 using LWGraph_kokkos [[maybe_unused]] = MueLu::LWGraph_kokkos<LocalOrdinal, GlobalOrdinal, Node>;
52 #endif
53 #ifdef MUELU_LOCALLEXICOGRAPHICINDEXMANAGER_SHORT
54 using LocalLexicographicIndexManager [[maybe_unused]] = MueLu::LocalLexicographicIndexManager<LocalOrdinal, GlobalOrdinal, Node>;
55 #endif
56 #ifdef MUELU_LOCALORDINALTRANSFERFACTORY_SHORT
57 using LocalOrdinalTransferFactory [[maybe_unused]] = MueLu::LocalOrdinalTransferFactory<LocalOrdinal, GlobalOrdinal, Node>;
58 #endif
59 #ifdef MUELU_ONEPTAGGREGATIONALGORITHM_SHORT
60 using OnePtAggregationAlgorithm [[maybe_unused]] = MueLu::OnePtAggregationAlgorithm<LocalOrdinal, GlobalOrdinal, Node>;
61 #endif
62 #ifdef MUELU_PRESERVEDIRICHLETAGGREGATIONALGORITHM_SHORT
63 using PreserveDirichletAggregationAlgorithm [[maybe_unused]] = MueLu::PreserveDirichletAggregationAlgorithm<LocalOrdinal, GlobalOrdinal, Node>;
64 #endif
65 #ifdef MUELU_PRFACTORY_SHORT
66 using PRFactory [[maybe_unused]] = MueLu::PRFactory<LocalOrdinal, GlobalOrdinal, Node>;
67 #endif
68 #ifdef MUELU_REBALANCEMAPFACTORY_SHORT
69 using RebalanceMapFactory [[maybe_unused]] = MueLu::RebalanceMapFactory<LocalOrdinal, GlobalOrdinal, Node>;
70 #endif
71 #ifdef MUELU_REPARTITIONINTERFACE_SHORT
72 using RepartitionInterface [[maybe_unused]] = MueLu::RepartitionInterface<LocalOrdinal, GlobalOrdinal, Node>;
73 #endif
74 #ifdef MUELU_STRUCTUREDAGGREGATIONFACTORY_KOKKOS_SHORT
75 using StructuredAggregationFactory_kokkos [[maybe_unused]] = MueLu::StructuredAggregationFactory_kokkos<LocalOrdinal, GlobalOrdinal, Node>;
76 #endif
77 #ifdef MUELU_UNCOUPLEDAGGREGATIONFACTORY_SHORT
78 using UncoupledAggregationFactory [[maybe_unused]] = MueLu::UncoupledAggregationFactory<LocalOrdinal, GlobalOrdinal, Node>;
79 #endif
80 #ifdef MUELU_UNCOUPLEDINDEXMANAGER_SHORT
81 using UncoupledIndexManager [[maybe_unused]] = MueLu::UncoupledIndexManager<LocalOrdinal, GlobalOrdinal, Node>;
82 #endif
83 #ifdef MUELU_USERAGGREGATIONFACTORY_SHORT
84 using UserAggregationFactory [[maybe_unused]] = MueLu::UserAggregationFactory<LocalOrdinal, GlobalOrdinal, Node>;
85 #endif
86 #ifdef MUELU_FACTORY_SHORT
87 using Factory [[maybe_unused]] = MueLu::Factory;
88 #endif
89 #ifdef MUELU_FACTORYBASE_SHORT
90 using FactoryBase [[maybe_unused]] = MueLu::FactoryBase;
91 #endif
92 #ifdef MUELU_FACTORYMANAGERBASE_SHORT
93 using FactoryManagerBase [[maybe_unused]] = MueLu::FactoryManagerBase;
94 #endif
95 #ifdef MUELU_LEVEL_SHORT
96 using Level [[maybe_unused]] = MueLu::Level;
97 #endif
98 #ifdef MUELU_PFACTORY_SHORT
99 using PFactory [[maybe_unused]] = MueLu::PFactory;
100 #endif
101 #ifdef MUELU_RFACTORY_SHORT
102 using RFactory [[maybe_unused]] = MueLu::RFactory;
103 #endif
104 #ifdef MUELU_SINGLELEVELFACTORYBASE_SHORT
105 using SingleLevelFactoryBase [[maybe_unused]] = MueLu::SingleLevelFactoryBase;
106 #endif
107 #ifdef MUELU_TWOLEVELFACTORYBASE_SHORT
108 using TwoLevelFactoryBase [[maybe_unused]] = MueLu::TwoLevelFactoryBase;
109 #endif
110 #ifdef MUELU_VARIABLECONTAINER_SHORT
111 using VariableContainer [[maybe_unused]] = MueLu::VariableContainer;
112 #endif
113 #ifdef MUELU_SMOOTHERFACTORYBASE_SHORT
114 using SmootherFactoryBase [[maybe_unused]] = MueLu::SmootherFactoryBase;
115 #endif
116 #ifdef MUELU_AMESOSSMOOTHER_SHORT
117 typedef MueLu::AmesosSmoother<Node> AmesosSmoother;
118 #endif
119 #ifdef MUELU_IFPACKSMOOTHER_SHORT
120 typedef MueLu::IfpackSmoother<Node> IfpackSmoother;
121 #endif
Algorithm for coarsening a graph with uncoupled aggregation. keep special marked nodes as singleton n...
Lightweight MueLu representation of a compressed row storage graph.
Container class for aggregation information.
Interface to IsorropiaInterface to Isorropia allowing to access other rebalancing/repartitioning algo...
Algorithm for coarsening a graph with structured aggregation.
Factory for building aggregates on meshes partly structured and partly unstructured.
Class for transferring a vector of local ordinals from a finer level to a coarser one...
Base class for factories that use two levels (fineLevel and coarseLevel).
Base class for factories (e.g., R, P, and A_coarse).
Algorithm for coarsening a graph with uncoupled aggregation. creates aggregates along an interface us...
Builds one-to-one aggregates for all Dirichlet boundary nodes. For some applications this might be ne...
Class that holds all level-specific information.
Definition: MueLu_Level.hpp:99
Class that provides default factories within Needs class.
Transfer mapping data for interface aggregation to the coarse level.
Factory which rebalances a map on current level using the Importer object generated by the Repartitio...
Among unaggregated points, see if we can make a reasonable size aggregate out of it.IdeaAmong unaggregated points, see if we can make a reasonable size aggregate out of it. We do this by looking at neighbors and seeing how many are unaggregated and on my processor. Loosely, base the number of new aggregates created on the percentage of unaggregated nodes.
Helper class which transforms an &quot;AmalgamatedPartition&quot; array to an unamalgamated &quot;Partition&quot;...
Add leftovers to existing aggregatesIdeaIn phase 2b non-aggregated nodes are added to existing aggreg...
Lightweight MueLu representation of a compressed row storage graph.
Algorithm for coarsening a graph with uncoupled aggregation.
Container class for mesh layout and indices calculation.
Class that stores all relevant data for a variable.
Factory that provides an interface for a concrete implementation of a prolongation operator...
Handle leftover nodes. Try to avoid singleton nodesIdeaIn phase 3 we try to stick unaggregated nodes ...
Factory for building structured aggregates or CrsGraph for interpolation base prolongator.
Factory for building uncoupled aggregates.
minimal container class for storing amalgamation information
Base class for factories that use one level (currentLevel).
Container class for mesh layout and indices calculation.
Class that encapsulates Ifpack smoothers.
Class that encapsulates Amesos direct solvers.