Commit d87f08fa authored by Praetorius, Simon's avatar Praetorius, Simon
Browse files

Rename get-methods

parent 2795c8e4
...@@ -35,7 +35,7 @@ int main(int argc, char** argv) ...@@ -35,7 +35,7 @@ int main(int argc, char** argv)
prob.addDirichletBC(predicate, 0, 0, dbcValues); prob.addDirichletBC(predicate, 0, 0, dbcValues);
AdaptInfo adaptInfo("adapt"); AdaptInfo adaptInfo("adapt");
prob.buildAfterAdapt(adaptInfo, Flag(0)); prob.assemble(adaptInfo);
prob.solve(adaptInfo); prob.solve(adaptInfo);
prob.writeFiles(adaptInfo, true); prob.writeFiles(adaptInfo, true);
......
...@@ -38,14 +38,14 @@ int main(int argc, char** argv) ...@@ -38,14 +38,14 @@ int main(int argc, char** argv)
prob.initialize(INIT_ALL); prob.initialize(INIT_ALL);
auto opL = makeOperator(tag::gradtest_gradtrial{}, 1.0); auto opL = makeOperator(tag::gradtest_gradtrial{}, 1.0);
prob.addMatrixOperator(opL, _0, _0); prob.addMatrixOperator(opL, 0, 0);
auto opForce = makeOperator(tag::test{}, f, 6); auto opForce = makeOperator(tag::test{}, f, 6);
prob.addVectorOperator(opForce, _0); prob.addVectorOperator(opForce, 0);
// set boundary condition // set boundary condition
auto boundary = [](auto const& x){ return x[0] < 1.e-8 || x[1] < 1.e-8 || x[0] > 1.0-1.e-8 || x[1] > 1.0-1.e-8; }; auto boundary = [](auto const& x){ return x[0] < 1.e-8 || x[1] < 1.e-8 || x[0] > 1.0-1.e-8 || x[1] > 1.0-1.e-8; };
prob.addDirichletBC(boundary, _0, _0, g); prob.addDirichletBC(boundary, 0, 0, g);
AdaptInfo adaptInfo("adapt"); AdaptInfo adaptInfo("adapt");
...@@ -62,17 +62,17 @@ int main(int argc, char** argv) ...@@ -62,17 +62,17 @@ int main(int argc, char** argv)
widths.push_back(h); widths.push_back(h);
prob.globalBasis().update(gridView); prob.globalBasis().update(gridView);
prob.buildAfterAdapt(adaptInfo, Flag(0)); prob.assemble(adaptInfo);
prob.solve(adaptInfo); prob.solve(adaptInfo);
double errorL2 = integrate(sqr(g - prob.getSolution(_0)), gridView, 6); double errorL2 = integrate(sqr(g - prob.solution(0)), gridView, 6);
errL2.push_back(std::sqrt(errorL2)); errL2.push_back(std::sqrt(errorL2));
double errorH1 = errorL2 + integrate(unary_dot(grad_g - gradientAtQP(prob.getSolution(_0))), gridView, 6); double errorH1 = errorL2 + integrate(unary_dot(grad_g - gradientAtQP(prob.solution(0))), gridView, 6);
errH1.push_back(std::sqrt(errorH1)); errH1.push_back(std::sqrt(errorH1));
#if WRITE_FILES #if WRITE_FILES
Dune::VTKWriter<typename ElliptProblem::GridView> vtkWriter(gridView); Dune::VTKWriter<typename ElliptProblem::GridView> vtkWriter(gridView);
vtkWriter.addVertexData(prob.getSolution(_0), Dune::VTK::FieldInfo("u", Dune::VTK::FieldInfo::Type::scalar, 1)); vtkWriter.addVertexData(prob.solution(0), Dune::VTK::FieldInfo("u", Dune::VTK::FieldInfo::Type::scalar, 1));
vtkWriter.write("u_" + std::to_string(i)); vtkWriter.write("u_" + std::to_string(i));
#endif #endif
} }
......
...@@ -31,16 +31,16 @@ int main(int argc, char** argv) ...@@ -31,16 +31,16 @@ int main(int argc, char** argv)
AdaptInfo adaptInfo("adapt"); AdaptInfo adaptInfo("adapt");
auto* invTau = probInstat.getInvTau(); auto invTau = std::ref(probInstat.invTau());
auto opTimeLhs = makeOperator(tag::test_trial{}, std::ref(*invTau)); auto opTimeLhs = makeOperator(tag::test_trial{}, invTau);
prob.addMatrixOperator(opTimeLhs, 0, 0); prob.addMatrixOperator(opTimeLhs, 0, 0);
auto opL = makeOperator(tag::gradtest_gradtrial{}, 1.0); auto opL = makeOperator(tag::gradtest_gradtrial{}, 1.0);
prob.addMatrixOperator(opL, 0, 0); prob.addMatrixOperator(opL, 0, 0);
auto opTimeRhs = makeOperator(tag::test{}, auto opTimeRhs = makeOperator(tag::test{},
invokeAtQP([invTau](double u) { return u * (*invTau); }, prob.getSolution(0)), 2); invokeAtQP([invTau](double u) { return u * invTau.get(); }, prob.solution(0)), 2);
prob.addVectorOperator(opTimeRhs, 0); prob.addVectorOperator(opTimeRhs, 0);
auto opForce = makeOperator(tag::test{}, [](auto const& x) { return -1.0; }, 0); auto opForce = makeOperator(tag::test{}, [](auto const& x) { return -1.0; }, 0);
......
...@@ -48,12 +48,16 @@ int main(int argc, char** argv) ...@@ -48,12 +48,16 @@ int main(int argc, char** argv)
auto _v = Dune::Indices::_0; auto _v = Dune::Indices::_0;
auto _p = Dune::Indices::_1; auto _p = Dune::Indices::_1;
auto invTau = std::ref(probInstat.invTau());
// <1/tau * u, v> // <1/tau * u, v>
auto opTime = makeOperator(tag::testvec_trialvec{}, density); auto opTime = makeOperator(tag::testvec_trialvec{},
density * invTau);
prob.addMatrixOperator(opTime, _v, _v); prob.addMatrixOperator(opTime, _v, _v);
// <1/tau * u^old, v> // <1/tau * u^old, v>
auto opTimeOld = makeOperator(tag::testvec{}, density * prob.getSolution(_v)); auto opTimeOld = makeOperator(tag::testvec{},
density * invTau * prob.solution(_v));
prob.addVectorOperator(opTimeOld, _v); prob.addVectorOperator(opTimeOld, _v);
...@@ -62,17 +66,20 @@ int main(int argc, char** argv) ...@@ -62,17 +66,20 @@ int main(int argc, char** argv)
prob.addMatrixOperator(opStokes, treepath(), treepath()); prob.addMatrixOperator(opStokes, treepath(), treepath());
// <(u * nabla)u_i^old, v_i> // <(u * nabla)u_i^old, v_i>
auto opNonlin1 = makeOperator(tag::testvec_trialvec{}, density * trans(gradientAtQP(prob.getSolution(_v)))); auto opNonlin1 = makeOperator(tag::testvec_trialvec{},
density * trans(gradientAtQP(prob.solution(_v))));
prob.addMatrixOperator(opNonlin1, _v, _v); prob.addMatrixOperator(opNonlin1, _v, _v);
for (std::size_t i = 0; i < AMDIS_DOW; ++i) { for (std::size_t i = 0; i < AMDIS_DOW; ++i) {
// <(u^old * nabla)u_i, v_i> // <(u^old * nabla)u_i, v_i>
auto opNonlin2 = makeOperator(tag::test_gradtrial{}, density * prob.getSolution(_v)); auto opNonlin2 = makeOperator(tag::test_gradtrial{},
density * prob.solution(_v));
prob.addMatrixOperator(opNonlin2, treepath(_v,i), treepath(_v,i)); prob.addMatrixOperator(opNonlin2, treepath(_v,i), treepath(_v,i));
} }
// <(u^old * grad(u_i^old)), v_i> // <(u^old * grad(u_i^old)), v_i>
auto opNonlin3 = makeOperator(tag::testvec{}, trans(gradientAtQP(prob.getSolution(_v))) * prob.getSolution(_v)); auto opNonlin3 = makeOperator(tag::testvec{},
trans(gradientAtQP(prob.solution(_v))) * prob.solution(_v));
prob.addVectorOperator(opNonlin3, _v); prob.addVectorOperator(opNonlin3, _v);
// define boundary regions // define boundary regions
...@@ -98,8 +105,8 @@ int main(int argc, char** argv) ...@@ -98,8 +105,8 @@ int main(int argc, char** argv)
prob.addDirichletBC([](auto const& x) { return x[0] < 1.e-8 && x[1] < 1.e-8; }, _p, _p, 0.0); prob.addDirichletBC([](auto const& x) { return x[0] < 1.e-8 && x[1] < 1.e-8; }, _p, _p, 0.0);
// set initial conditions // set initial conditions
prob.getSolution(_v).interpolate(parabolic_y); prob.solution(_v).interpolate(parabolic_y);
prob.getSolution(_p).interpolate(0.0); prob.solution(_p).interpolate(0.0);
AdaptInstationary adapt("adapt", prob, adaptInfo, probInstat, adaptInfo); AdaptInstationary adapt("adapt", prob, adaptInfo, probInstat, adaptInfo);
adapt.adapt(); adapt.adapt();
......
...@@ -78,13 +78,13 @@ int main(int argc, char** argv) ...@@ -78,13 +78,13 @@ int main(int argc, char** argv)
AdaptInfo adaptInfo("adapt"); AdaptInfo adaptInfo("adapt");
// assemble and solve system // assemble and solve system
prob.buildAfterAdapt(adaptInfo, Flag(0)); prob.assemble(adaptInfo);
#ifdef DEBUG_MTL #ifdef DEBUG_MTL
// write matrix to file // write matrix to file
mtl::io::matrix_market_ostream out("matrix_stokes0.mtx"); mtl::io::matrix_market_ostream out("matrix_stokes0.mtx");
out << prob.getSystemMatrix().matrix(); out << prob.systemMatrix().matrix();
std::cout << prob.getSystemMatrix().matrix() << '\n'; std::cout << prob.systemMatrix().matrix() << '\n';
#endif #endif
prob.solve(adaptInfo); prob.solve(adaptInfo);
......
...@@ -79,13 +79,13 @@ int main(int argc, char** argv) ...@@ -79,13 +79,13 @@ int main(int argc, char** argv)
AdaptInfo adaptInfo("adapt"); AdaptInfo adaptInfo("adapt");
// assemble and solve system // assemble and solve system
prob.buildAfterAdapt(adaptInfo, Flag(0)); prob.assemble(adaptInfo);
#ifdef DEBUG_MTL #ifdef DEBUG_MTL
// write matrix to file // write matrix to file
mtl::io::matrix_market_ostream out("matrix_stokes1.mtx"); mtl::io::matrix_market_ostream out("matrix_stokes1.mtx");
out << prob.getSystemMatrix().matrix(); out << prob.systemMatrix().matrix();
std::cout << prob.getSystemMatrix().matrix() << '\n'; std::cout << prob.systemMatrix().matrix() << '\n';
#endif #endif
prob.solve(adaptInfo); prob.solve(adaptInfo);
......
...@@ -62,8 +62,7 @@ int main(int argc, char** argv) ...@@ -62,8 +62,7 @@ int main(int argc, char** argv)
AdaptInfo adaptInfo("adapt"); AdaptInfo adaptInfo("adapt");
// assemble and solve system // assemble and solve system
prob.buildAfterAdapt(adaptInfo, Flag(0)); prob.assemble(adaptInfo);
prob.solve(adaptInfo); prob.solve(adaptInfo);
// output solution // output solution
......
...@@ -46,9 +46,9 @@ int main(int argc, char** argv) ...@@ -46,9 +46,9 @@ int main(int argc, char** argv)
// write matrix to file // write matrix to file
if (Parameters::get<int>("elliptMesh->global refinements").value_or(0) < 4) { if (Parameters::get<int>("elliptMesh->global refinements").value_or(0) < 4) {
mtl::io::matrix_market_ostream out("matrix.mtx"); mtl::io::matrix_market_ostream out("matrix.mtx");
out << prob.getSystemMatrix().matrix(); out << prob.systemMatrix().matrix();
std::cout << prob.getSystemMatrix().matrix() << '\n'; std::cout << prob.systemMatrix().matrix() << '\n';
} }
#endif #endif
......
...@@ -37,13 +37,13 @@ namespace AMDiS ...@@ -37,13 +37,13 @@ namespace AMDiS
virtual int adapt() = 0; virtual int adapt() = 0;
/// Returns \ref name /// Returns \ref name
std::string const& getName() const std::string const& name() const
{ {
return name_; return name_;
} }
/// Returns \ref problemIteration /// Returns \ref problemIteration
ProblemIterationInterface* getProblemIteration() const ProblemIterationInterface* problemIteration() const
{ {
return problemIteration_; return problemIteration_;
} }
...@@ -55,13 +55,13 @@ namespace AMDiS ...@@ -55,13 +55,13 @@ namespace AMDiS
} }
/// Returns \ref adaptInfo /// Returns \ref adaptInfo
AdaptInfo& getAdaptInfo() const AdaptInfo& adaptInfo() const
{ {
return adaptInfo_; return adaptInfo_;
} }
/// Returns \ref problemTime /// Returns \ref problemTime
ProblemTimeInterface* getProblemTime() const ProblemTimeInterface* problemTime() const
{ {
return problemTime_; return problemTime_;
} }
...@@ -73,7 +73,7 @@ namespace AMDiS ...@@ -73,7 +73,7 @@ namespace AMDiS
} }
/// Returns \ref initialAdaptInfo /// Returns \ref initialAdaptInfo
AdaptInfo& getInitialAdaptInfo() const AdaptInfo& initialAdaptInfo() const
{ {
return *initialAdaptInfo_; return *initialAdaptInfo_;
} }
......
...@@ -29,28 +29,28 @@ namespace AMDiS ...@@ -29,28 +29,28 @@ namespace AMDiS
: name_(name) : name_(name)
{ {
// init(); // init();
Parameters::get(name + "->start time", startTime); Parameters::get(name + "->start time", startTime_);
time = startTime; time_ = startTime_;
Parameters::get(name + "->timestep", timestep); Parameters::get(name + "->timestep", timestep_);
Parameters::get(name + "->end time", endTime); Parameters::get(name + "->end time", endTime_);
Parameters::get(name + "->max iteration", maxSpaceIteration); Parameters::get(name + "->max iteration", maxSpaceIteration_);
Parameters::get(name + "->max timestep iteration", maxTimestepIteration); Parameters::get(name + "->max timestep iteration", maxTimestepIteration_);
Parameters::get(name + "->max time iteration", maxTimeIteration); Parameters::get(name + "->max time iteration", maxTimeIteration_);
Parameters::get(name + "->min timestep", minTimestep); Parameters::get(name + "->min timestep", minTimestep_);
Parameters::get(name + "->max timestep", maxTimestep); Parameters::get(name + "->max timestep", maxTimestep_);
Parameters::get(name + "->number of timesteps", nTimesteps); Parameters::get(name + "->number of timesteps", nTimesteps_);
Parameters::get(name + "->time tolerance", globalTimeTolerance); Parameters::get(name + "->time tolerance", globalTimeTolerance_);
} }
void AdaptInfo::printTimeErrorLowInfo() const void AdaptInfo::printTimeErrorLowInfo() const
{ {
for (auto const& scalContent : scalContents) for (auto const& scalContent : scalContents_)
{ {
auto i = scalContent.first; auto i = scalContent.first;
std::cout << " Time error estimate ["<<i<<"] = " std::cout << " Time error estimate ["<<i<<"] = "
<< getTimeEstCombined(i) << "\n" << timeEstCombined(i) << "\n"
<< " Time error estimate sum ["<<i<<"] = " << " Time error estimate sum ["<<i<<"] = "
<< scalContent.second.est_t_sum << "\n" << scalContent.second.est_t_sum << "\n"
<< " Time error estimate max ["<<i<<"] = " << " Time error estimate max ["<<i<<"] = "
...@@ -64,17 +64,17 @@ namespace AMDiS ...@@ -64,17 +64,17 @@ namespace AMDiS
void AdaptInfo::reset() void AdaptInfo::reset()
{ {
spaceIteration = -1; spaceIteration_ = -1;
timestepIteration = 0; timestepIteration_ = 0;
timeIteration = 0; timeIteration_ = 0;
time = 0.0; time_ = 0.0;
timestep = 0.0; timestep_ = 0.0;
timestepNumber = 0; timestepNumber_ = 0;
solverIterations = 0; solverIterations_ = 0;
solverResidual = 0.0; solverResidual_ = 0.0;
Parameters::get(name_ + "->timestep", timestep); Parameters::get(name_ + "->timestep", timestep_);
lastProcessedTimestep=timestep; lastProcessedTimestep_ = timestep_;
} }
} // end namespace AMDiS } // end namespace AMDiS
This diff is collapsed.
...@@ -22,7 +22,7 @@ namespace AMDiS ...@@ -22,7 +22,7 @@ namespace AMDiS
Parameters::get(name_ + "->time delta 2", timeDelta2_); Parameters::get(name_ + "->time delta 2", timeDelta2_);
Parameters::get(name_ + "->break when stable", breakWhenStable_); Parameters::get(name_ + "->break when stable", breakWhenStable_);
fixedTimestep_ = (adaptInfo_.getMinTimestep() == adaptInfo_.getMaxTimestep()); fixedTimestep_ = (adaptInfo_.minTimestep() == adaptInfo_.maxTimestep());
} }
...@@ -31,16 +31,16 @@ namespace AMDiS ...@@ -31,16 +31,16 @@ namespace AMDiS
AMDIS_FUNCNAME("AdaptInstationary::explicitTimeStrategy()"); AMDIS_FUNCNAME("AdaptInstationary::explicitTimeStrategy()");
// estimate before first adaption // estimate before first adaption
if (adaptInfo_.getTime() <= adaptInfo_.getStartTime()) if (adaptInfo_.time() <= adaptInfo_.startTime())
problemIteration_->oneIteration(adaptInfo_, ESTIMATE); problemIteration_->oneIteration(adaptInfo_, ESTIMATE);
// increment time // increment time
adaptInfo_.setTime(adaptInfo_.getTime() + adaptInfo_.getTimestep()); adaptInfo_.setTime(adaptInfo_.time() + adaptInfo_.timestep());
problemTime_->setTime(adaptInfo_); problemTime_->setTime(adaptInfo_);
msg("time = {}, timestep = {}", adaptInfo_.getTime(), adaptInfo_.getTimestep()); msg("time = {}, timestep = {}", adaptInfo_.time(), adaptInfo_.timestep());
adaptInfo_.setSpaceIteration(0); adaptInfo_.setSpaceIteration(0);
...@@ -48,7 +48,7 @@ namespace AMDiS ...@@ -48,7 +48,7 @@ namespace AMDiS
problemIteration_->beginIteration(adaptInfo_); problemIteration_->beginIteration(adaptInfo_);
problemIteration_->oneIteration(adaptInfo_, FULL_ITERATION); problemIteration_->oneIteration(adaptInfo_, FULL_ITERATION);
problemIteration_->endIteration(adaptInfo_); problemIteration_->endIteration(adaptInfo_);
adaptInfo_.setLastProcessedTimestep(adaptInfo_.getTimestep()); adaptInfo_.setLastProcessedTimestep(adaptInfo_.timestep());
} }
...@@ -58,10 +58,10 @@ namespace AMDiS ...@@ -58,10 +58,10 @@ namespace AMDiS
do do
{ {
adaptInfo_.setTime(adaptInfo_.getTime() + adaptInfo_.getTimestep()); adaptInfo_.setTime(adaptInfo_.time() + adaptInfo_.timestep());
problemTime_->setTime(adaptInfo_); problemTime_->setTime(adaptInfo_);
msg("time = {}, timestep = {}", adaptInfo_.getTime(), adaptInfo_.getTimestep()); msg("time = {}, timestep = {}", adaptInfo_.time(), adaptInfo_.timestep());
problemIteration_->oneIteration(adaptInfo_, NO_ADAPTION); problemIteration_->oneIteration(adaptInfo_, NO_ADAPTION);
...@@ -69,11 +69,11 @@ namespace AMDiS ...@@ -69,11 +69,11 @@ namespace AMDiS
if (!fixedTimestep_ && if (!fixedTimestep_ &&
!adaptInfo_.timeToleranceReached() && !adaptInfo_.timeToleranceReached() &&
adaptInfo_.getTimestepIteration() <= adaptInfo_.getMaxTimestepIteration() && adaptInfo_.timestepIteration() <= adaptInfo_.maxTimestepIteration() &&
!(adaptInfo_.getTimestep() <= adaptInfo_.getMinTimestep())) !(adaptInfo_.timestep() <= adaptInfo_.minTimestep()))
{ {
adaptInfo_.setTime(adaptInfo_.getTime() - adaptInfo_.getTimestep()); adaptInfo_.setTime(adaptInfo_.time() - adaptInfo_.timestep());
adaptInfo_.setTimestep(adaptInfo_.getTimestep() * timeDelta1_); adaptInfo_.setTimestep(adaptInfo_.timestep() * timeDelta1_);
continue; continue;
} }
...@@ -83,7 +83,7 @@ namespace AMDiS ...@@ -83,7 +83,7 @@ namespace AMDiS
// === Do space iterations only if the maximum is higher than 0. === // === Do space iterations only if the maximum is higher than 0. ===
if (adaptInfo_.getMaxSpaceIteration() > 0) if (adaptInfo_.maxSpaceIteration() > 0)
{ {
// === Space iterations. === // === Space iterations. ===
...@@ -96,10 +96,10 @@ namespace AMDiS ...@@ -96,10 +96,10 @@ namespace AMDiS
{ {
if (!fixedTimestep_ && if (!fixedTimestep_ &&
!adaptInfo_.timeToleranceReached() && !adaptInfo_.timeToleranceReached() &&
!(adaptInfo_.getTimestep() <= adaptInfo_.getMinTimestep())) !(adaptInfo_.timestep() <= adaptInfo_.minTimestep()))
{ {
adaptInfo_.setTime(adaptInfo_.getTime() - adaptInfo_.getTimestep()); adaptInfo_.setTime(adaptInfo_.time() - adaptInfo_.timestep());
adaptInfo_.setTimestep(adaptInfo_.getTimestep() * timeDelta2_); adaptInfo_.setTimestep(adaptInfo_.timestep() * timeDelta2_);
problemIteration_->endIteration(adaptInfo_); problemIteration_->endIteration(adaptInfo_);
adaptInfo_.incSpaceIteration(); adaptInfo_.incSpaceIteration();
break; break;
...@@ -111,7 +111,7 @@ namespace AMDiS ...@@ -111,7 +111,7 @@ namespace AMDiS
} }
while (!adaptInfo_.spaceToleranceReached() && while (!adaptInfo_.spaceToleranceReached() &&
adaptInfo_.getSpaceIteration() <= adaptInfo_.getMaxSpaceIteration()); adaptInfo_.spaceIteration() <= adaptInfo_.maxSpaceIteration());
} }
else else
...@@ -122,22 +122,22 @@ namespace AMDiS ...@@ -122,22 +122,22 @@ namespace AMDiS
} }
while(!adaptInfo_.timeToleranceReached() && while(!adaptInfo_.timeToleranceReached() &&
!(adaptInfo_.getTimestep() <= adaptInfo_.getMinTimestep()) && !(adaptInfo_.timestep() <= adaptInfo_.minTimestep()) &&
adaptInfo_.getTimestepIteration() <= adaptInfo_.getMaxTimestepIteration()); adaptInfo_.timestepIteration() <= adaptInfo_.maxTimestepIteration());
adaptInfo_.setLastProcessedTimestep(adaptInfo_.getTimestep()); adaptInfo_.setLastProcessedTimestep(adaptInfo_.timestep());
// After successful iteration/timestep the timestep will be changed according // After successful iteration/timestep the timestep will be changed according
// adaption rules for next timestep. // adaption rules for next timestep.
// First, check for increase of timestep // First, check for increase of timestep
if (!fixedTimestep_ && adaptInfo_.timeErrorLow()) if (!fixedTimestep_ && adaptInfo_.timeErrorLow())
adaptInfo_.setTimestep(adaptInfo_.getTimestep() * timeDelta2_); adaptInfo_.setTimestep(adaptInfo_.timestep() * timeDelta2_);
// Second, check for decrease of timestep // Second, check for decrease of timestep
if (!fixedTimestep_ && if (!fixedTimestep_ &&
!adaptInfo_.timeToleranceReached() && !adaptInfo_.timeToleranceReached() &&
!(adaptInfo_.getTimestep() <= adaptInfo_.getMinTimestep())) !(adaptInfo_.timestep() <= adaptInfo_.minTimestep()))
adaptInfo_.setTimestep(adaptInfo_.getTimestep() * timeDelta1_); adaptInfo_.setTimestep(adaptInfo_.timestep() * timeDelta1_);
} }
...@@ -146,27 +146,27 @@ namespace AMDiS ...@@ -146,27 +146,27 @@ namespace AMDiS
AMDIS_FUNCNAME("AdaptInstationary::simpleAdaptiveTimeStrategy()"); AMDIS_FUNCNAME("AdaptInstationary::simpleAdaptiveTimeStrategy()");
// estimate before first adaption // estimate before first adaption
if (adaptInfo_.getTime() <= adaptInfo_.getStartTime()) if (adaptInfo_.time() <= adaptInfo_.startTime())
problemIteration_->oneIteration(adaptInfo_, ESTIMATE); problemIteration_->oneIteration(adaptInfo_, ESTIMATE);
adaptInfo_.setTime(adaptInfo_.getTime() + adaptInfo_.getTimestep()); adaptInfo_.setTime(adaptInfo_.time() + adaptInfo_.timestep());