26 double StartIncrement,
27 std::size_t MaxNumOfCycles = 10,
28 double ReductionFactor = 0.5,
29 double IncreaseFactor = 2.0,
30 double MaxTimeStepFactor = 1000.0,
31 std::size_t MinNumOfIterations = 3,
32 std::size_t MaxNumOfIterations = 15);
42 std::size_t mMaxNumOfCycles;
43 double mReductionFactor;
44 double mIncreaseFactor;
46 std::size_t mMinNumOfIterations;
47 std::size_t mMaxNumOfIterations;
Definition: adaptive_time_incrementor.h:22
bool WantRetryStep(std::size_t CycleNumber, const TimeStepEndState &rPreviousState) const override
Definition: adaptive_time_incrementor.cpp:63
void PostTimeStepExecution(const TimeStepEndState &rResultantState) override
Definition: adaptive_time_incrementor.cpp:74
bool WantNextStep(const TimeStepEndState &rPreviousState) const override
Definition: adaptive_time_incrementor.cpp:58
double GetIncrement() const override
Definition: adaptive_time_incrementor.cpp:72
AdaptiveTimeIncrementor(double StartTime, double EndTime, double StartIncrement, std::size_t MaxNumOfCycles=10, double ReductionFactor=0.5, double IncreaseFactor=2.0, double MaxTimeStepFactor=1000.0, std::size_t MinNumOfIterations=3, std::size_t MaxNumOfIterations=15)
Definition: adaptive_time_incrementor.cpp:22
Definition: time_incrementor.h:24
REF: G. R. Cowper, GAUSSIAN QUADRATURE FORMULAS FOR TRIANGLES.
Definition: mesh_condition.cpp:21
Definition: time_step_end_state.hpp:23