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 
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_AMALGAMATIONINFO_SHORT
40 #endif
41 #ifdef MUELU_COUPLEDAGGREGATIONCOMMHELPER_SHORT
43 #endif
44 #ifdef MUELU_COUPLEDAGGREGATIONFACTORY_SHORT
46 #endif
47 #ifdef MUELU_GLOBALLEXICOGRAPHICINDEXMANAGER_SHORT
49 #endif
50 #ifdef MUELU_GRAPH_SHORT
52 #endif
53 #ifdef MUELU_GRAPHBASE_SHORT
55 #endif
56 #ifdef MUELU_HYBRIDAGGREGATIONFACTORY_SHORT
58 #endif
59 #ifdef MUELU_INDEXMANAGER_SHORT
61 #endif
62 #ifdef MUELU_INTERFACEAGGREGATIONALGORITHM_SHORT
64 #endif
65 #ifdef MUELU_ISOLATEDNODEAGGREGATIONALGORITHM_SHORT
67 #endif
68 #ifdef MUELU_ISOLATEDNODEAGGREGATIONALGORITHM_KOKKOS_SHORT
69 typedef MueLu::IsolatedNodeAggregationAlgorithm_kokkos<LocalOrdinal,GlobalOrdinal,Node> IsolatedNodeAggregationAlgorithm_kokkos;
70 #endif
71 #ifdef MUELU_ISORROPIAINTERFACE_SHORT
73 #endif
74 #ifdef MUELU_LWGRAPH_SHORT
76 #endif
77 #ifdef MUELU_LWGRAPH_KOKKOS_SHORT
78 typedef MueLu::LWGraph_kokkos<LocalOrdinal,GlobalOrdinal,Node> LWGraph_kokkos;
79 #endif
80 #ifdef MUELU_LEFTOVERAGGREGATIONALGORITHM_SHORT
82 #endif
83 #ifdef MUELU_LOCALAGGREGATIONALGORITHM_SHORT
85 #endif
86 #ifdef MUELU_LOCALLEXICOGRAPHICINDEXMANAGER_SHORT
88 #endif
89 #ifdef MUELU_ONEPTAGGREGATIONALGORITHM_SHORT
91 #endif
92 #ifdef MUELU_ONEPTAGGREGATIONALGORITHM_KOKKOS_SHORT
93 typedef MueLu::OnePtAggregationAlgorithm_kokkos<LocalOrdinal,GlobalOrdinal,Node> OnePtAggregationAlgorithm_kokkos;
94 #endif
95 #ifdef MUELU_PRESERVEDIRICHLETAGGREGATIONALGORITHM_SHORT
96 typedef MueLu::PreserveDirichletAggregationAlgorithm<LocalOrdinal,GlobalOrdinal,Node> PreserveDirichletAggregationAlgorithm;
97 #endif
98 #ifdef MUELU_PRESERVEDIRICHLETAGGREGATIONALGORITHM_KOKKOS_SHORT
99 typedef MueLu::PreserveDirichletAggregationAlgorithm_kokkos<LocalOrdinal,GlobalOrdinal,Node> PreserveDirichletAggregationAlgorithm_kokkos;
100 #endif
101 #ifdef MUELU_PRFACTORY_SHORT
103 #endif
104 #ifdef MUELU_REBALANCEMAPFACTORY_SHORT
106 #endif
107 #ifdef MUELU_REPARTITIONINTERFACE_SHORT
109 #endif
110 #ifdef MUELU_UNCOUPLEDAGGREGATIONFACTORY_SHORT
112 #endif
113 #ifdef MUELU_UNCOUPLEDAGGREGATIONFACTORY_KOKKOS_SHORT
114 typedef MueLu::UncoupledAggregationFactory_kokkos<LocalOrdinal,GlobalOrdinal,Node> UncoupledAggregationFactory_kokkos;
115 #endif
116 #ifdef MUELU_UNCOUPLEDINDEXMANAGER_SHORT
118 #endif
119 #ifdef MUELU_USERAGGREGATIONFACTORY_SHORT
121 #endif
122 #ifdef MUELU_FACTORY_SHORT
123 typedef MueLu::Factory Factory;
124 #endif
125 
126 #ifdef MUELU_FACTORYBASE_SHORT
127 typedef MueLu::FactoryBase FactoryBase;
128 #endif
129 
130 #ifdef MUELU_FACTORYMANAGERBASE_SHORT
131 typedef MueLu::FactoryManagerBase FactoryManagerBase;
132 #endif
133 
134 #ifdef MUELU_LEVEL_SHORT
135 typedef MueLu::Level Level;
136 #endif
137 
138 #ifdef MUELU_PFACTORY_SHORT
139 typedef MueLu::PFactory PFactory;
140 #endif
141 
142 #ifdef MUELU_RFACTORY_SHORT
143 typedef MueLu::RFactory RFactory;
144 #endif
145 
146 #ifdef MUELU_SINGLELEVELFACTORYBASE_SHORT
147 typedef MueLu::SingleLevelFactoryBase SingleLevelFactoryBase;
148 #endif
149 
150 #ifdef MUELU_TWOLEVELFACTORYBASE_SHORT
151 typedef MueLu::TwoLevelFactoryBase TwoLevelFactoryBase;
152 #endif
153 
154 #ifdef MUELU_VARIABLECONTAINER_SHORT
155 typedef MueLu::VariableContainer VariableContainer;
156 #endif
157 
158 #ifdef MUELU_SMOOTHERFACTORYBASE_SHORT
159 typedef MueLu::SmootherFactoryBase SmootherFactoryBase;
160 #endif
161 
162 #ifdef MUELU_AMESOSSMOOTHER_SHORT
163 typedef MueLu::AmesosSmoother<Node> AmesosSmoother;
164 #endif
165 #ifdef MUELU_IFPACKSMOOTHER_SHORT
166 typedef MueLu::IfpackSmoother<Node> IfpackSmoother;
167 #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.
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...
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.