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_AMALGAMATIONINFO_SHORT
37 #endif
38 #ifdef MUELU_COUPLEDAGGREGATIONCOMMHELPER_SHORT
40 #endif
41 #ifdef MUELU_COUPLEDAGGREGATIONFACTORY_SHORT
43 #endif
44 #ifdef MUELU_DEMOFACTORY_SHORT
46 #endif
47 #ifdef MUELU_GRAPH_SHORT
49 #endif
50 #ifdef MUELU_GRAPHBASE_SHORT
52 #endif
53 #ifdef MUELU_ISOLATEDNODEAGGREGATIONALGORITHM_SHORT
55 #endif
56 #ifdef MUELU_ISOLATEDNODEAGGREGATIONALGORITHM_KOKKOS_SHORT
57 typedef MueLu::IsolatedNodeAggregationAlgorithm_kokkos<LocalOrdinal,GlobalOrdinal,Node> IsolatedNodeAggregationAlgorithm_kokkos;
58 #endif
59 #ifdef MUELU_ISORROPIAINTERFACE_SHORT
61 #endif
62 #ifdef MUELU_LWGRAPH_SHORT
64 #endif
65 #ifdef MUELU_LWGRAPH_KOKKOS_SHORT
66 typedef MueLu::LWGraph_kokkos<LocalOrdinal,GlobalOrdinal,Node> LWGraph_kokkos;
67 #endif
68 #ifdef MUELU_LEFTOVERAGGREGATIONALGORITHM_SHORT
70 #endif
71 #ifdef MUELU_LOCALAGGREGATIONALGORITHM_SHORT
73 #endif
74 #ifdef MUELU_ONEPTAGGREGATIONALGORITHM_SHORT
76 #endif
77 #ifdef MUELU_ONEPTAGGREGATIONALGORITHM_KOKKOS_SHORT
78 typedef MueLu::OnePtAggregationAlgorithm_kokkos<LocalOrdinal,GlobalOrdinal,Node> OnePtAggregationAlgorithm_kokkos;
79 #endif
80 #ifdef MUELU_PRESERVEDIRICHLETAGGREGATIONALGORITHM_SHORT
81 typedef MueLu::PreserveDirichletAggregationAlgorithm<LocalOrdinal,GlobalOrdinal,Node> PreserveDirichletAggregationAlgorithm;
82 #endif
83 #ifdef MUELU_PRESERVEDIRICHLETAGGREGATIONALGORITHM_KOKKOS_SHORT
84 typedef MueLu::PreserveDirichletAggregationAlgorithm_kokkos<LocalOrdinal,GlobalOrdinal,Node> PreserveDirichletAggregationAlgorithm_kokkos;
85 #endif
86 #ifdef MUELU_PRFACTORY_SHORT
88 #endif
89 #ifdef MUELU_REBALANCEMAPFACTORY_SHORT
91 #endif
92 #ifdef MUELU_REPARTITIONINTERFACE_SHORT
94 #endif
95 #ifdef MUELU_UNCOUPLEDAGGREGATIONFACTORY_SHORT
97 #endif
98 #ifdef MUELU_UNCOUPLEDAGGREGATIONFACTORY_KOKKOS_SHORT
99 typedef MueLu::UncoupledAggregationFactory_kokkos<LocalOrdinal,GlobalOrdinal,Node> UncoupledAggregationFactory_kokkos;
100 #endif
101 #ifdef MUELU_USERAGGREGATIONFACTORY_SHORT
103 #endif
104 #ifdef MUELU_AMESOSSMOOTHER_SHORT
105 typedef MueLu::AmesosSmoother<Node> AmesosSmoother;
106 #endif
107 
108 #ifdef MUELU_FACTORY_SHORT
109 typedef MueLu::Factory Factory;
110 #endif
111 
112 #ifdef MUELU_FACTORYBASE_SHORT
113 typedef MueLu::FactoryBase FactoryBase;
114 #endif
115 
116 #ifdef MUELU_FACTORYMANAGERBASE_SHORT
117 typedef MueLu::FactoryManagerBase FactoryManagerBase;
118 #endif
119 
120 #ifdef MUELU_IFPACKSMOOTHER_SHORT
121 typedef MueLu::IfpackSmoother<Node> IfpackSmoother;
122 #endif
123 
124 #ifdef MUELU_LEVEL_SHORT
125 typedef MueLu::Level Level;
126 #endif
127 
128 #ifdef MUELU_PFACTORY_SHORT
129 typedef MueLu::PFactory PFactory;
130 #endif
131 
132 #ifdef MUELU_RFACTORY_SHORT
133 typedef MueLu::RFactory RFactory;
134 #endif
135 
136 #ifdef MUELU_SINGLELEVELFACTORYBASE_SHORT
137 typedef MueLu::SingleLevelFactoryBase SingleLevelFactoryBase;
138 #endif
139 
140 #ifdef MUELU_TWOLEVELFACTORYBASE_SHORT
141 typedef MueLu::TwoLevelFactoryBase TwoLevelFactoryBase;
142 #endif
143 
144 #ifdef MUELU_VARIABLECONTAINER_SHORT
145 typedef MueLu::VariableContainer VariableContainer;
146 #endif
147 
148 #ifdef MUELU_SMOOTHERFACTORYBASE_SHORT
149 typedef MueLu::SmootherFactoryBase SmootherFactoryBase;
150 #endif
151 
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 Isorropia package.
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).
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.
empty factory for demonstration
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).
Class that encapsulates Ifpack smoothers.
Class that encapsulates Amesos direct solvers.