1 #ifndef MUELU_EMINPFACTORY_DEF_HPP
2 #define MUELU_EMINPFACTORY_DEF_HPP
5 #include <Xpetra_StridedMapFactory.hpp>
9 #include "MueLu_CGSolver.hpp"
10 #include "MueLu_Constraint.hpp"
11 #include "MueLu_GMRESSolver.hpp"
14 #include "MueLu_PerfUtils.hpp"
16 #include "MueLu_SteepestDescentSolver.hpp"
20 template <
class Scalar,
class LocalOrdinal,
class GlobalOrdinal,
class Node>
24 #define SET_VALID_ENTRY(name) validParamList->setEntry(name, MasterList::getEntry(name))
31 #undef SET_VALID_ENTRY
33 validParamList->
set<
RCP<const FactoryBase> >(
"A", Teuchos::null,
"Generating factory for the matrix A used during internal iterations");
37 validParamList->
set<
RCP<Matrix> >(
"P0", Teuchos::null,
"Initial guess at P");
38 validParamList->
set<
bool>(
"Keep P0",
false,
"Keep an initial P0 (for reuse)");
40 validParamList->
set<
RCP<Constraint> >(
"Constraint0", Teuchos::null,
"Initial Constraint");
41 validParamList->
set<
bool>(
"Keep Constraint0",
false,
"Keep an initial Constraint (for reuse)");
43 return validParamList;
46 template <
class Scalar,
class LocalOrdinal,
class GlobalOrdinal,
class Node>
48 Input(fineLevel,
"A");
50 static bool isAvailableP0 =
false;
51 static bool isAvailableConstraint0 =
false;
65 isAvailableP0 = coarseLevel.
IsAvailable(
"P0",
this);
66 isAvailableConstraint0 = coarseLevel.
IsAvailable(
"Constraint0",
this);
69 if (isAvailableP0 ==
false)
70 Input(coarseLevel,
"P");
72 if (isAvailableConstraint0 ==
false)
73 Input(coarseLevel,
"Constraint");
76 template <
class Scalar,
class LocalOrdinal,
class GlobalOrdinal,
class Node>
78 BuildP(fineLevel, coarseLevel);
81 template <
class Scalar,
class LocalOrdinal,
class GlobalOrdinal,
class Node>
90 if (restrictionMode_) {
102 numIts = pL.
get<
int>(
"emin: num reuse iterations");
103 GetOStream(
Runtime0) <<
"Reusing P0" << std::endl;
107 P0 = Get<RCP<Matrix> >(coarseLevel,
"P");
108 numIts = pL.
get<
int>(
"emin: num iterations");
116 if (coarseLevel.
IsAvailable(
"Constraint0",
this)) {
119 GetOStream(
Runtime0) <<
"Reusing Constraint0" << std::endl;
123 X = Get<RCP<Constraint> >(coarseLevel,
"Constraint");
125 GetOStream(
Runtime0) <<
"Number of emin iterations = " << numIts << std::endl;
127 std::string solverType = pL.
get<std::string>(
"emin: iterative method");
129 if (solverType ==
"cg")
131 else if (solverType ==
"sd")
133 else if (solverType ==
"gmres")
137 solver->Iterate(*A, *X, *P0, P);
140 if (!P->IsView(
"stridedMaps")) {
141 if (A->IsView(
"stridedMaps") ==
true) {
142 GetOStream(
Runtime1) <<
"Using A to fillComplete P" << std::endl;
148 std::vector<size_t> stridingInfo(1, 1);
151 P->CreateView(
"stridedMaps", A->getRowMap(
"stridedMaps"), dMap);
154 P->CreateView(
"stridedMaps", P->getRangeMap(), P->getDomainMap());
159 if (!restrictionMode_) {
161 Set(coarseLevel,
"P", P);
163 if (pL.
get<
bool>(
"Keep P0")) {
167 coarseLevel.
Keep(
"P0",
this);
168 Set(coarseLevel,
"P0", P);
170 if (pL.
get<
bool>(
"Keep Constraint0")) {
174 coarseLevel.
Keep(
"Constraint0",
this);
175 Set(coarseLevel,
"Constraint0", X);
180 params->
set(
"printLoadBalancingInfo",
true);
181 params->
set(
"printCommInfo",
true);
194 Set(coarseLevel,
"R", R);
198 params->
set(
"printLoadBalancingInfo",
true);
199 params->
set(
"printCommInfo",
true);
207 #endif // MUELU_EMINPFACTORY_DEF_HPP
void Keep(const std::string &ename, const FactoryBase *factory)
Request to keep variable 'ename' generated by 'factory' after the setup phase.
#define SET_VALID_ENTRY(name)
T & Get(const std::string &ename, const FactoryBase *factory=NoFactory::get())
Get data without decrementing associated storage counter (i.e., read-only access). Usage: Level->Get< RCP<Matrix> >("A", factory) if factory == NULL => use default factory.
void Build(Level &fineLevel, Level &coarseLevel) const
Build method.
void setValidator(RCP< const ParameterEntryValidator > const &validator)
T & get(const std::string &name, T def_value)
ParameterList & set(std::string const &name, T const &value, std::string const &docString="", RCP< const ParameterEntryValidator > const &validator=null)
Implements conjugate gradient algorithm for energy-minimization.
void BuildP(Level &fineLevel, Level &coarseLevel) const
Abstract Build method.
Timer to be used in factories. Similar to Monitor but with additional timers.
One-liner description of what is happening.
RCP< const CrsGraph > GetPattern() const
Print even more statistics.
RequestMode GetRequestMode() const
Implements conjugate gradient algorithm for energy-minimization.
TEUCHOS_DEPRECATED RCP< T > rcp(T *p, Dealloc_T dealloc, bool owns_mem)
Class that holds all level-specific information.
Timer to be used in factories. Similar to SubMonitor but adds a timer level by level.
static RCP< Xpetra::Matrix< Scalar, LocalOrdinal, GlobalOrdinal, Node > > Transpose(Xpetra::Matrix< Scalar, LocalOrdinal, GlobalOrdinal, Node > &Op, bool optimizeTranspose=false, const std::string &label=std::string(), const Teuchos::RCP< Teuchos::ParameterList > ¶ms=Teuchos::null)
static std::string PrintMatrixInfo(const Matrix &A, const std::string &msgTag, RCP< const Teuchos::ParameterList > params=Teuchos::null)
void DeclareInput(Level &fineLevel, Level &coarseLevel) const
Input.
Implements steepest descent algorithm for energy-minimization.
Description of what is happening (more verbose)
ParameterEntry & getEntry(const std::string &name)
bool IsAvailable(const std::string &ename, const FactoryBase *factory=NoFactory::get()) const
Test whether a need's value has been saved.
RCP< const ParameterList > GetValidParameterList() const
Return a const parameter list of valid parameters that setParameterList() will accept.