Revision 011918364aba1e855ffb647ff66d3922815b9899 authored by Lars Bilke on 11 October 2021, 09:04:49 UTC, committed by Lars Bilke on 11 October 2021, 09:04:49 UTC
[ci skip]
1 parent 187df32
TimeSteppingTestingTools.h
/**
* \author Norihiro Watanabe
* \date 2012-08-03
*
* \copyright
* Copyright (c) 2012-2021, OpenGeoSys Community (http://www.opengeosys.org)
* Distributed under a Modified BSD License.
* See accompanying file LICENSE.txt or
* http://www.opengeosys.org/project/license
*/
#pragma once
#include <tuple>
#include <vector>
#include "BaseLib/Logging.h"
#include "NumLib/TimeStepping/Algorithms/TimeStepAlgorithm.h"
#include "NumLib/TimeStepping/TimeStep.h"
namespace
{
struct Dummy
{
template <class T>
void operator()(T &/*obj*/) {}
};
template <class T_TIME_STEPPING, class T = Dummy>
std::vector<double> timeStepping(T_TIME_STEPPING& algorithm,
std::vector<int> const& number_iterations,
std::vector<double> const& fixed_output_times,
T* obj = nullptr)
{
std::vector<double> vec_t;
vec_t.push_back(algorithm.begin());
const double end_time = algorithm.end();
double const solution_error = 0;
for (auto const& i : number_iterations)
{
auto[step_accepted, timestepper_dt] = algorithm.next(solution_error, i);
if (!step_accepted)
{
break;
}
if (!fixed_output_times.empty())
{
timestepper_dt = NumLib::possiblyClampDtToNextFixedTime(
algorithm.getTimeStep().current(), timestepper_dt,
fixed_output_times);
}
timestepper_dt =
(algorithm.getTimeStep().current() + timestepper_dt > end_time)
? end_time - algorithm.getTimeStep().current()
: timestepper_dt;
algorithm.resetCurrentTimeStep(timestepper_dt);
NumLib::TimeStep t = algorithm.getTimeStep();
// INFO("t: n={:d},t={:g},dt={:g}", t.steps(), t.current(), t.dt());
if (obj)
{
(*obj)(algorithm); // do something
}
if (algorithm.accepted()) {
vec_t.push_back(t.current());
} else {
//INFO("*** rejected.");
}
}
return vec_t;
}
} // namespace
![swh spinner](/static/img/swh-spinner.gif)
Computing file changes ...