MueLu  Version of the Day
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 
3 #include <Xpetra_UseShortNamesOrdinal.hpp>
4 
5 #ifdef MUELU_AGGREGATES_SHORT
7 #endif
8 #ifdef MUELU_AGGREGATES_KOKKOS_SHORT
9 typedef MueLu::Aggregates_kokkos<LocalOrdinal,GlobalOrdinal,Node> Aggregates_kokkos;
10 #endif
11 #ifdef MUELU_AGGREGATIONPHASE1ALGORITHM_SHORT
13 #endif
14 #ifdef MUELU_AGGREGATIONPHASE1ALGORITHM_KOKKOS_SHORT
15 typedef MueLu::AggregationPhase1Algorithm_kokkos<LocalOrdinal,GlobalOrdinal,Node> AggregationPhase1Algorithm_kokkos;
16 #endif
17 #ifdef MUELU_AGGREGATIONPHASE2AALGORITHM_SHORT
19 #endif
20 #ifdef MUELU_AGGREGATIONPHASE2AALGORITHM_KOKKOS_SHORT
21 typedef MueLu::AggregationPhase2aAlgorithm_kokkos<LocalOrdinal,GlobalOrdinal,Node> AggregationPhase2aAlgorithm_kokkos;
22 #endif
23 #ifdef MUELU_AGGREGATIONPHASE2BALGORITHM_SHORT
25 #endif
26 #ifdef MUELU_AGGREGATIONPHASE2BALGORITHM_KOKKOS_SHORT
27 typedef MueLu::AggregationPhase2bAlgorithm_kokkos<LocalOrdinal,GlobalOrdinal,Node> AggregationPhase2bAlgorithm_kokkos;
28 #endif
29 #ifdef MUELU_AGGREGATIONPHASE3ALGORITHM_SHORT
31 #endif
32 #ifdef MUELU_AGGREGATIONPHASE3ALGORITHM_KOKKOS_SHORT
33 typedef MueLu::AggregationPhase3Algorithm_kokkos<LocalOrdinal,GlobalOrdinal,Node> AggregationPhase3Algorithm_kokkos;
34 #endif
35 #ifdef MUELU_AGGREGATIONSTRUCTUREDALGORITHM_SHORT
37 #endif
38 #ifdef MUELU_AGGREGATIONSTRUCTUREDALGORITHM_KOKKOS_SHORT
39 typedef MueLu::AggregationStructuredAlgorithm_kokkos<LocalOrdinal,GlobalOrdinal,Node> AggregationStructuredAlgorithm_kokkos;
40 #endif
41 #ifdef MUELU_AMALGAMATIONINFO_SHORT
43 #endif
44 #ifdef MUELU_AMALGAMATIONINFO_KOKKOS_SHORT
45 typedef MueLu::AmalgamationInfo_kokkos<LocalOrdinal,GlobalOrdinal,Node> AmalgamationInfo_kokkos;
46 #endif
47 #ifdef MUELU_COUPLEDAGGREGATIONCOMMHELPER_SHORT
49 #endif
50 #ifdef MUELU_COUPLEDAGGREGATIONFACTORY_SHORT
52 #endif
53 #ifdef MUELU_GLOBALLEXICOGRAPHICINDEXMANAGER_SHORT
55 #endif
56 #ifdef MUELU_GRAPH_SHORT
58 #endif
59 #ifdef MUELU_GRAPHBASE_SHORT
61 #endif
62 #ifdef MUELU_HYBRIDAGGREGATIONFACTORY_SHORT
64 #endif
65 #ifdef MUELU_INDEXMANAGER_SHORT
67 #endif
68 #ifdef MUELU_INDEXMANAGER_KOKKOS_SHORT
69 typedef MueLu::IndexManager_kokkos<LocalOrdinal,GlobalOrdinal,Node> IndexManager_kokkos;
70 #endif
71 #ifdef MUELU_INTERFACEAGGREGATIONALGORITHM_SHORT
73 #endif
74 #ifdef MUELU_INTERFACEMAPPINGTRANSFERFACTORY_SHORT
76 #endif
77 #ifdef MUELU_ISOLATEDNODEAGGREGATIONALGORITHM_SHORT
79 #endif
80 #ifdef MUELU_ISOLATEDNODEAGGREGATIONALGORITHM_KOKKOS_SHORT
81 typedef MueLu::IsolatedNodeAggregationAlgorithm_kokkos<LocalOrdinal,GlobalOrdinal,Node> IsolatedNodeAggregationAlgorithm_kokkos;
82 #endif
83 #ifdef MUELU_ISORROPIAINTERFACE_SHORT
85 #endif
86 #ifdef MUELU_LWGRAPH_SHORT
88 #endif
89 #ifdef MUELU_LWGRAPH_KOKKOS_SHORT
90 typedef MueLu::LWGraph_kokkos<LocalOrdinal,GlobalOrdinal,Node> LWGraph_kokkos;
91 #endif
92 #ifdef MUELU_LEFTOVERAGGREGATIONALGORITHM_SHORT
94 #endif
95 #ifdef MUELU_LOCALAGGREGATIONALGORITHM_SHORT
97 #endif
98 #ifdef MUELU_LOCALLEXICOGRAPHICINDEXMANAGER_SHORT
100 #endif
101 #ifdef MUELU_LOCALORDINALTRANSFERFACTORY_SHORT
103 #endif
104 #ifdef MUELU_ONEPTAGGREGATIONALGORITHM_SHORT
106 #endif
107 #ifdef MUELU_ONEPTAGGREGATIONALGORITHM_KOKKOS_SHORT
108 typedef MueLu::OnePtAggregationAlgorithm_kokkos<LocalOrdinal,GlobalOrdinal,Node> OnePtAggregationAlgorithm_kokkos;
109 #endif
110 #ifdef MUELU_PRESERVEDIRICHLETAGGREGATIONALGORITHM_SHORT
111 typedef MueLu::PreserveDirichletAggregationAlgorithm<LocalOrdinal,GlobalOrdinal,Node> PreserveDirichletAggregationAlgorithm;
112 #endif
113 #ifdef MUELU_PRESERVEDIRICHLETAGGREGATIONALGORITHM_KOKKOS_SHORT
114 typedef MueLu::PreserveDirichletAggregationAlgorithm_kokkos<LocalOrdinal,GlobalOrdinal,Node> PreserveDirichletAggregationAlgorithm_kokkos;
115 #endif
116 #ifdef MUELU_PRFACTORY_SHORT
118 #endif
119 #ifdef MUELU_REBALANCEMAPFACTORY_SHORT
121 #endif
122 #ifdef MUELU_REPARTITIONINTERFACE_SHORT
124 #endif
125 #ifdef MUELU_STRUCTUREDAGGREGATIONFACTORY_KOKKOS_SHORT
126 typedef MueLu::StructuredAggregationFactory_kokkos<LocalOrdinal,GlobalOrdinal,Node> StructuredAggregationFactory_kokkos;
127 #endif
128 #ifdef MUELU_UNCOUPLEDAGGREGATIONFACTORY_SHORT
130 #endif
131 #ifdef MUELU_UNCOUPLEDAGGREGATIONFACTORY_KOKKOS_SHORT
132 typedef MueLu::UncoupledAggregationFactory_kokkos<LocalOrdinal,GlobalOrdinal,Node> UncoupledAggregationFactory_kokkos;
133 #endif
134 #ifdef MUELU_UNCOUPLEDINDEXMANAGER_SHORT
136 #endif
137 #ifdef MUELU_USERAGGREGATIONFACTORY_SHORT
139 #endif
140 #ifdef MUELU_FACTORY_SHORT
141 typedef MueLu::Factory Factory;
142 #endif
143 
144 #ifdef MUELU_FACTORYBASE_SHORT
145 typedef MueLu::FactoryBase FactoryBase;
146 #endif
147 
148 #ifdef MUELU_FACTORYMANAGERBASE_SHORT
149 typedef MueLu::FactoryManagerBase FactoryManagerBase;
150 #endif
151 
152 #ifdef MUELU_LEVEL_SHORT
153 typedef MueLu::Level Level;
154 #endif
155 
156 #ifdef MUELU_PFACTORY_SHORT
157 typedef MueLu::PFactory PFactory;
158 #endif
159 
160 #ifdef MUELU_RFACTORY_SHORT
161 typedef MueLu::RFactory RFactory;
162 #endif
163 
164 #ifdef MUELU_SINGLELEVELFACTORYBASE_SHORT
165 typedef MueLu::SingleLevelFactoryBase SingleLevelFactoryBase;
166 #endif
167 
168 #ifdef MUELU_TWOLEVELFACTORYBASE_SHORT
169 typedef MueLu::TwoLevelFactoryBase TwoLevelFactoryBase;
170 #endif
171 
172 #ifdef MUELU_VARIABLECONTAINER_SHORT
173 typedef MueLu::VariableContainer VariableContainer;
174 #endif
175 
176 #ifdef MUELU_SMOOTHERFACTORYBASE_SHORT
177 typedef MueLu::SmootherFactoryBase SmootherFactoryBase;
178 #endif
179 
180 #ifdef MUELU_AMESOSSMOOTHER_SHORT
181 typedef MueLu::AmesosSmoother<Node> AmesosSmoother;
182 #endif
183 #ifdef MUELU_IFPACKSMOOTHER_SHORT
184 typedef MueLu::IfpackSmoother<Node> IfpackSmoother;
185 #endif
Algorithm for coarsening a graph with uncoupled aggregation. keep special marked nodes as singleton n...
Container class for aggregation information.
MueLu representation of a compressed row storage graph.
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...
Algorithm for coarsening a graph with uncoupled aggregation.
Base class for factories that use two levels (fineLevel and coarseLevel).
Factory for coarsening a graph with uncoupled aggregation.
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...
Helper class for providing arbitrated communication across processors.
Class that holds all level-specific information.
Definition: MueLu_Level.hpp:99
Class that provides default factories within Needs class.
Ignores isolated nodes during aggregation. Marks the node to be "aggregated" without adding real aggr...
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...
MueLu representation of a graph.
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 "AmalgamatedPartition" array to an unamalgamated "Partition"...
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.
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 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.