IterationNumberBasedTimeStepping.h

Go to the documentation of this file.

 
#pragma once
 
#include <vector>
 
#include "TimeStepAlgorithm.h"
 
namespace NumLib
{
class IterationNumberBasedTimeStepping final : public TimeStepAlgorithm
{
public:
    IterationNumberBasedTimeStepping(
        double const t_initial,
        double const t_end,
        double const min_dt,
        double const max_dt,
        double const initial_dt,
        std::vector<int>&& iter_times_vector,
        std::vector<double>&& multiplier_vector,
        std::vector<double> const& fixed_times_for_output);
 
    ~IterationNumberBasedTimeStepping() override = default;
 
    std::tuple<bool, double> next(double solution_error, int number_iterations,
                                  NumLib::TimeStep& ts_previous,
                                  NumLib::TimeStep& ts_current) override;
 
    bool isSolutionErrorComputationNeeded() const override { return true; }
 
    bool canReduceTimestepSize(
        NumLib::TimeStep const& timestep_previous,
        NumLib::TimeStep const& timestep_current) const override;
 
private:
    double getNextTimeStepSize(NumLib::TimeStep const& ts_previous,
                               NumLib::TimeStep const& ts_current) const;
 
    double findMultiplier(int const number_iterations,
                          NumLib::TimeStep const& ts_current) const;
 
    const std::vector<int> _iter_times_vector;
    const std::vector<double> _multiplier_vector;
    const double _min_dt;
    const double _max_dt;
    const double _initial_dt;
    const int _max_iter;
    int _iter_times = 0;
 
    bool _previous_time_step_accepted = true;
    std::vector<double> const _fixed_times_for_output;
};
 
}  // namespace NumLib