Skip to content
Snippets Groups Projects
Commit 461c9f40 authored by Elias Pipping's avatar Elias Pipping
Browse files

[Cleanup] multigridStep: Rename: Solver -> Step

parent 9859588d
No related branches found
No related tags found
No related merge requests found
...@@ -38,7 +38,7 @@ FixedPointIterator<Factory, StateUpdater, VelocityUpdater, ErrorNorm>::run( ...@@ -38,7 +38,7 @@ FixedPointIterator<Factory, StateUpdater, VelocityUpdater, ErrorNorm>::run(
std::shared_ptr<VelocityUpdater> velocityUpdater, std::shared_ptr<VelocityUpdater> velocityUpdater,
Matrix const &velocityMatrix, Vector const &velocityRHS, Matrix const &velocityMatrix, Vector const &velocityRHS,
Vector &velocityIterate) { Vector &velocityIterate) {
auto multigridStep = factory_.getSolver(); auto multigridStep = factory_.getStep();
EnergyNorm<Matrix, Vector> energyNorm(velocityMatrix); EnergyNorm<Matrix, Vector> energyNorm(velocityMatrix);
LoopSolver<Vector> velocityProblemSolver( LoopSolver<Vector> velocityProblemSolver(
......
...@@ -235,7 +235,7 @@ int main(int argc, char *argv[]) { ...@@ -235,7 +235,7 @@ int main(int argc, char *argv[]) {
1.0, _matrix, zeroNonlinearity, _rhs, _x); 1.0, _matrix, zeroNonlinearity, _rhs, _x);
typename LinearFactory::BlockProblem problem(parset, convexProblem); typename LinearFactory::BlockProblem problem(parset, convexProblem);
auto multigridStep = factory.getSolver(); auto multigridStep = factory.getStep();
multigridStep->setProblem(_x, problem); multigridStep->setProblem(_x, problem);
LoopSolver<Vector> solver( LoopSolver<Vector> solver(
multigridStep.get(), _localParset.get<size_t>("maximumIterations"), multigridStep.get(), _localParset.get<size_t>("maximumIterations"),
......
...@@ -22,7 +22,7 @@ SolverFactory<dim, BlockProblem, Grid>::SolverFactory( ...@@ -22,7 +22,7 @@ SolverFactory<dim, BlockProblem, Grid>::SolverFactory(
Solver::QUIET), Solver::QUIET),
transferOperators(refinements), transferOperators(refinements),
multigridStep( multigridStep(
std::make_shared<Solver>(linearIterationStep, nonlinearSmoother)) { std::make_shared<Step>(linearIterationStep, nonlinearSmoother)) {
// linear iteration step // linear iteration step
linearIterationStep.setMGType(parset.get<int>("linear.cycle"), linearIterationStep.setMGType(parset.get<int>("linear.cycle"),
parset.get<int>("linear.pre"), parset.get<int>("linear.pre"),
...@@ -51,8 +51,8 @@ SolverFactory<dim, BlockProblem, Grid>::~SolverFactory() { ...@@ -51,8 +51,8 @@ SolverFactory<dim, BlockProblem, Grid>::~SolverFactory() {
} }
template <size_t dim, class BlockProblem, class Grid> template <size_t dim, class BlockProblem, class Grid>
auto SolverFactory<dim, BlockProblem, Grid>::getSolver() auto SolverFactory<dim, BlockProblem, Grid>::getStep()
-> std::shared_ptr<Solver> { -> std::shared_ptr<Step> {
return multigridStep; return multigridStep;
} }
......
...@@ -26,7 +26,7 @@ class SolverFactory { ...@@ -26,7 +26,7 @@ class SolverFactory {
private: private:
using NonlinearSmoother = GenericNonlinearGS<BlockProblem>; using NonlinearSmoother = GenericNonlinearGS<BlockProblem>;
using Solver = using Step =
TruncatedNonsmoothNewtonMultigrid<BlockProblem, NonlinearSmoother>; TruncatedNonsmoothNewtonMultigrid<BlockProblem, NonlinearSmoother>;
public: public:
...@@ -35,7 +35,7 @@ class SolverFactory { ...@@ -35,7 +35,7 @@ class SolverFactory {
~SolverFactory(); ~SolverFactory();
std::shared_ptr<Solver> getSolver(); std::shared_ptr<Step> getStep();
private: private:
TruncatedBlockGSStep<Matrix, Vector> linearBaseSolverStep; TruncatedBlockGSStep<Matrix, Vector> linearBaseSolverStep;
...@@ -46,6 +46,6 @@ class SolverFactory { ...@@ -46,6 +46,6 @@ class SolverFactory {
MultigridStep<Matrix, Vector> linearIterationStep; MultigridStep<Matrix, Vector> linearIterationStep;
std::vector<CompressedMultigridTransfer<Vector> *> transferOperators; std::vector<CompressedMultigridTransfer<Vector> *> transferOperators;
NonlinearSmoother nonlinearSmoother; NonlinearSmoother nonlinearSmoother;
std::shared_ptr<Solver> multigridStep; std::shared_ptr<Step> multigridStep;
}; };
#endif #endif
0% Loading or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment