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_AGGREGATIONPHASE2AALGORITHM_SHORT
16 #endif
17 #ifdef MUELU_AGGREGATIONPHASE2BALGORITHM_SHORT
19 #endif
20 #ifdef MUELU_AGGREGATIONPHASE3ALGORITHM_SHORT
22 #endif
23 #ifdef MUELU_AMALGAMATIONINFO_SHORT
25 #endif
26 #ifdef MUELU_COUPLEDAGGREGATIONCOMMHELPER_SHORT
28 #endif
29 #ifdef MUELU_COUPLEDAGGREGATIONFACTORY_SHORT
31 #endif
32 #ifdef MUELU_DEMOFACTORY_SHORT
34 #endif
35 #ifdef MUELU_GRAPH_SHORT
37 #endif
38 #ifdef MUELU_GRAPHBASE_SHORT
40 #endif
41 #ifdef MUELU_ISOLATEDNODEAGGREGATIONALGORITHM_SHORT
43 #endif
44 #ifdef MUELU_ISORROPIAINTERFACE_SHORT
46 #endif
47 #ifdef MUELU_LWGRAPH_SHORT
49 #endif
50 #ifdef MUELU_LWGRAPH_KOKKOS_SHORT
51 typedef MueLu::LWGraph_kokkos<LocalOrdinal,GlobalOrdinal,Node> LWGraph_kokkos;
52 #endif
53 #ifdef MUELU_LEFTOVERAGGREGATIONALGORITHM_SHORT
55 #endif
56 #ifdef MUELU_LOCALAGGREGATIONALGORITHM_SHORT
58 #endif
59 #ifdef MUELU_ONEPTAGGREGATIONALGORITHM_SHORT
61 #endif
62 #ifdef MUELU_PRESERVEDIRICHLETAGGREGATIONALGORITHM_SHORT
63 typedef MueLu::PreserveDirichletAggregationAlgorithm<LocalOrdinal,GlobalOrdinal,Node> PreserveDirichletAggregationAlgorithm;
64 #endif
65 #ifdef MUELU_PRFACTORY_SHORT
67 #endif
68 #ifdef MUELU_REBALANCEMAPFACTORY_SHORT
70 #endif
71 #ifdef MUELU_REPARTITIONINTERFACE_SHORT
73 #endif
74 #ifdef MUELU_UNCOUPLEDAGGREGATIONFACTORY_SHORT
76 #endif
77 #ifdef MUELU_USERAGGREGATIONFACTORY_SHORT
79 #endif
80 #ifdef MUELU_ZOLTANINTERFACE_SHORT
82 #endif
83 #ifdef MUELU_AMESOSSMOOTHER_SHORT
84 typedef MueLu::AmesosSmoother AmesosSmoother;
85 #endif
86 
87 #ifdef MUELU_FACTORY_SHORT
88 typedef MueLu::Factory Factory;
89 #endif
90 
91 #ifdef MUELU_FACTORYBASE_SHORT
92 typedef MueLu::FactoryBase FactoryBase;
93 #endif
94 
95 #ifdef MUELU_FACTORYMANAGERBASE_SHORT
96 typedef MueLu::FactoryManagerBase FactoryManagerBase;
97 #endif
98 
99 #ifdef MUELU_IFPACKSMOOTHER_SHORT
100 typedef MueLu::IfpackSmoother IfpackSmoother;
101 #endif
102 
103 #ifdef MUELU_LEVEL_SHORT
104 typedef MueLu::Level Level;
105 #endif
106 
107 #ifdef MUELU_PFACTORY_SHORT
108 typedef MueLu::PFactory PFactory;
109 #endif
110 
111 #ifdef MUELU_RFACTORY_SHORT
112 typedef MueLu::RFactory RFactory;
113 #endif
114 
115 #ifdef MUELU_SINGLELEVELFACTORYBASE_SHORT
116 typedef MueLu::SingleLevelFactoryBase SingleLevelFactoryBase;
117 #endif
118 
119 #ifdef MUELU_TWOLEVELFACTORYBASE_SHORT
120 typedef MueLu::TwoLevelFactoryBase TwoLevelFactoryBase;
121 #endif
122 
123 #ifdef MUELU_VARIABLECONTAINER_SHORT
124 typedef MueLu::VariableContainer VariableContainer;
125 #endif
126 
127 #ifdef MUELU_SMOOTHERFACTORYBASE_SHORT
128 typedef MueLu::SmootherFactoryBase SmootherFactoryBase;
129 #endif
130 
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).
Interface to Zoltan library.
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.