12#include <Xpetra_UseShortNamesOrdinal.hpp>
14#ifdef MUELU_AGGREGATES_SHORT
17#ifdef MUELU_AGGREGATIONPHASE1ALGORITHM_SHORT
20#ifdef MUELU_AGGREGATIONPHASE2AALGORITHM_SHORT
23#ifdef MUELU_AGGREGATIONPHASE2BALGORITHM_SHORT
26#ifdef MUELU_AGGREGATIONPHASE3ALGORITHM_SHORT
29#ifdef MUELU_AGGREGATIONSTRUCTUREDALGORITHM_SHORT
32#ifdef MUELU_AMALGAMATIONINFO_SHORT
35#ifdef MUELU_GLOBALLEXICOGRAPHICINDEXMANAGER_SHORT
38#ifdef MUELU_HYBRIDAGGREGATIONFACTORY_SHORT
41#ifdef MUELU_INDEXMANAGER_SHORT
44#ifdef MUELU_INDEXMANAGER_KOKKOS_SHORT
47#ifdef MUELU_INTERFACEAGGREGATIONALGORITHM_SHORT
50#ifdef MUELU_INTERFACEMAPPINGTRANSFERFACTORY_SHORT
53#ifdef MUELU_ISORROPIAINTERFACE_SHORT
56#ifdef MUELU_LWGRAPH_SHORT
59#ifdef MUELU_LWGRAPH_KOKKOS_SHORT
62#ifdef MUELU_LOCALLEXICOGRAPHICINDEXMANAGER_SHORT
65#ifdef MUELU_LOCALORDINALTRANSFERFACTORY_SHORT
68#ifdef MUELU_ONEPTAGGREGATIONALGORITHM_SHORT
71#ifdef MUELU_PRESERVEDIRICHLETAGGREGATIONALGORITHM_SHORT
74#ifdef MUELU_PRFACTORY_SHORT
77#ifdef MUELU_REBALANCEMAPFACTORY_SHORT
80#ifdef MUELU_REPARTITIONINTERFACE_SHORT
83#ifdef MUELU_STRUCTUREDAGGREGATIONFACTORY_KOKKOS_SHORT
86#ifdef MUELU_UNCOUPLEDAGGREGATIONFACTORY_SHORT
89#ifdef MUELU_UNCOUPLEDINDEXMANAGER_SHORT
92#ifdef MUELU_USERAGGREGATIONFACTORY_SHORT
95#ifdef MUELU_FACTORY_SHORT
98#ifdef MUELU_FACTORYBASE_SHORT
101#ifdef MUELU_FACTORYMANAGERBASE_SHORT
104#ifdef MUELU_LEVEL_SHORT
107#ifdef MUELU_PFACTORY_SHORT
110#ifdef MUELU_RFACTORY_SHORT
111using RFactory [[maybe_unused]] = MueLu::RFactory;
113#ifdef MUELU_SINGLELEVELFACTORYBASE_SHORT
116#ifdef MUELU_TWOLEVELFACTORYBASE_SHORT
119#ifdef MUELU_VARIABLECONTAINER_SHORT
122#ifdef MUELU_SMOOTHERFACTORYBASE_SHORT
125#ifdef MUELU_AMESOSSMOOTHER_SHORT
128#ifdef MUELU_IFPACKSMOOTHER_SHORT
Container class for aggregation information.
Algorithm for coarsening a graph with uncoupled aggregation.
Among unaggregated points, see if we can make a reasonable size aggregate out of it.
Add leftovers to existing aggregates.
Handle leftover nodes. Try to avoid singleton nodes.
Algorithm for coarsening a graph with structured aggregation.
minimal container class for storing amalgamation information
Class that encapsulates Amesos direct solvers.
Base class for factories (e.g., R, P, and A_coarse).
Class that provides default factories within Needs class.
Factory for building aggregates on meshes partly structured and partly unstructured.
Class that encapsulates Ifpack smoothers.
Container class for mesh layout and indices calculation.
Container class for mesh layout and indices calculation.
Algorithm for coarsening a graph with uncoupled aggregation. creates aggregates along an interface us...
Transfer mapping data for interface aggregation to the coarse level.
Lightweight MueLu representation of a compressed row storage graph.
Lightweight MueLu representation of a compressed row storage graph.
Class that holds all level-specific information.
Class for transferring a vector of local ordinals from a finer level to a coarser one,...
Algorithm for coarsening a graph with uncoupled aggregation. keep special marked nodes as singleton n...
Factory that provides an interface for a concrete implementation of a prolongation operator.
Builds one-to-one aggregates for all Dirichlet boundary nodes. For some applications this might be ne...
Factory which rebalances a map on current level using the Importer object generated by the Repartitio...
Helper class which transforms an "AmalgamatedPartition" array to an unamalgamated "Partition".
Base class for factories that use one level (currentLevel).
Factory for building structured aggregates or CrsGraph for interpolation base prolongator.
Base class for factories that use two levels (fineLevel and coarseLevel).
Factory for building uncoupled aggregates.
Class that stores all relevant data for a variable.