5 #ifdef MUELU_AGGREGATES_SHORT 8 #ifdef MUELU_AGGREGATES_KOKKOS_SHORT 9 typedef MueLu::Aggregates_kokkos<LocalOrdinal,GlobalOrdinal,Node> Aggregates_kokkos;
11 #ifdef MUELU_AGGREGATIONPHASE1ALGORITHM_SHORT 14 #ifdef MUELU_AGGREGATIONPHASE1ALGORITHM_KOKKOS_SHORT 15 typedef MueLu::AggregationPhase1Algorithm_kokkos<LocalOrdinal,GlobalOrdinal,Node> AggregationPhase1Algorithm_kokkos;
17 #ifdef MUELU_AGGREGATIONPHASE2AALGORITHM_SHORT 20 #ifdef MUELU_AGGREGATIONPHASE2AALGORITHM_KOKKOS_SHORT 21 typedef MueLu::AggregationPhase2aAlgorithm_kokkos<LocalOrdinal,GlobalOrdinal,Node> AggregationPhase2aAlgorithm_kokkos;
23 #ifdef MUELU_AGGREGATIONPHASE2BALGORITHM_SHORT 26 #ifdef MUELU_AGGREGATIONPHASE2BALGORITHM_KOKKOS_SHORT 27 typedef MueLu::AggregationPhase2bAlgorithm_kokkos<LocalOrdinal,GlobalOrdinal,Node> AggregationPhase2bAlgorithm_kokkos;
29 #ifdef MUELU_AGGREGATIONPHASE3ALGORITHM_SHORT 32 #ifdef MUELU_AGGREGATIONPHASE3ALGORITHM_KOKKOS_SHORT 33 typedef MueLu::AggregationPhase3Algorithm_kokkos<LocalOrdinal,GlobalOrdinal,Node> AggregationPhase3Algorithm_kokkos;
35 #ifdef MUELU_AMALGAMATIONINFO_SHORT 38 #ifdef MUELU_COUPLEDAGGREGATIONCOMMHELPER_SHORT 41 #ifdef MUELU_COUPLEDAGGREGATIONFACTORY_SHORT 44 #ifdef MUELU_DEMOFACTORY_SHORT 47 #ifdef MUELU_GRAPH_SHORT 50 #ifdef MUELU_GRAPHBASE_SHORT 53 #ifdef MUELU_ISOLATEDNODEAGGREGATIONALGORITHM_SHORT 56 #ifdef MUELU_ISOLATEDNODEAGGREGATIONALGORITHM_KOKKOS_SHORT 57 typedef MueLu::IsolatedNodeAggregationAlgorithm_kokkos<LocalOrdinal,GlobalOrdinal,Node> IsolatedNodeAggregationAlgorithm_kokkos;
59 #ifdef MUELU_ISORROPIAINTERFACE_SHORT 62 #ifdef MUELU_LWGRAPH_SHORT 65 #ifdef MUELU_LWGRAPH_KOKKOS_SHORT 66 typedef MueLu::LWGraph_kokkos<LocalOrdinal,GlobalOrdinal,Node> LWGraph_kokkos;
68 #ifdef MUELU_LEFTOVERAGGREGATIONALGORITHM_SHORT 71 #ifdef MUELU_LOCALAGGREGATIONALGORITHM_SHORT 74 #ifdef MUELU_ONEPTAGGREGATIONALGORITHM_SHORT 77 #ifdef MUELU_ONEPTAGGREGATIONALGORITHM_KOKKOS_SHORT 78 typedef MueLu::OnePtAggregationAlgorithm_kokkos<LocalOrdinal,GlobalOrdinal,Node> OnePtAggregationAlgorithm_kokkos;
80 #ifdef MUELU_PRESERVEDIRICHLETAGGREGATIONALGORITHM_SHORT 83 #ifdef MUELU_PRESERVEDIRICHLETAGGREGATIONALGORITHM_KOKKOS_SHORT 84 typedef MueLu::PreserveDirichletAggregationAlgorithm_kokkos<LocalOrdinal,GlobalOrdinal,Node> PreserveDirichletAggregationAlgorithm_kokkos;
86 #ifdef MUELU_PRFACTORY_SHORT 89 #ifdef MUELU_REBALANCEMAPFACTORY_SHORT 92 #ifdef MUELU_REPARTITIONINTERFACE_SHORT 95 #ifdef MUELU_UNCOUPLEDAGGREGATIONFACTORY_SHORT 98 #ifdef MUELU_UNCOUPLEDAGGREGATIONFACTORY_KOKKOS_SHORT 99 typedef MueLu::UncoupledAggregationFactory_kokkos<LocalOrdinal,GlobalOrdinal,Node> UncoupledAggregationFactory_kokkos;
101 #ifdef MUELU_USERAGGREGATIONFACTORY_SHORT 104 #ifdef MUELU_FACTORY_SHORT 108 #ifdef MUELU_FACTORYBASE_SHORT 112 #ifdef MUELU_FACTORYMANAGERBASE_SHORT 116 #ifdef MUELU_LEVEL_SHORT 120 #ifdef MUELU_PFACTORY_SHORT 124 #ifdef MUELU_RFACTORY_SHORT 125 typedef MueLu::RFactory RFactory;
128 #ifdef MUELU_SINGLELEVELFACTORYBASE_SHORT 132 #ifdef MUELU_TWOLEVELFACTORYBASE_SHORT 136 #ifdef MUELU_VARIABLECONTAINER_SHORT 140 #ifdef MUELU_SMOOTHERFACTORYBASE_SHORT 144 #ifdef MUELU_AMESOSSMOOTHER_SHORT 147 #ifdef MUELU_IFPACKSMOOTHER_SHORT
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 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.
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.