3import exahype2.solvers.FixedTimeSteppingCodeSnippets
8 Code snippet generator for fixed time stepping in the Runge-Kutta schemes
15 The outcome is used before we actually roll over the accumulation variables
20 tarch::mpi::Rank::getInstance().isGlobalMaster()
22 (_maxVolumeH > 0.0 or _maxVolumeHThisTimeStep > 0.0)
24 isFirstGridSweepOfTimeStep()
26 logInfo("startTimeStep(...)", "Solver {{SOLVER_NAME}}:");
27 logInfo("startTimeStep(...)", "t = " << _minTimeStampThisTimeStep);
28 logInfo("startTimeStep(...)", "dt = " << getTimeStepSize());
29 logInfo("startTimeStep(...)", "h_{min} = " << _minVolumeHThisTimeStep << " (volume size)");
30 logInfo("startTimeStep(...)", "h_{max} = " << _maxVolumeHThisTimeStep << " (volume size)");
36 if (isLastGridSweepOfTimeStep()) {
37 assertion(_minVolumeH >= 0.0);
38 assertion(MaxAdmissibleVolumeH > 0.0);
39 if (_minVolumeHThisTimeStep <= MaxAdmissibleVolumeH) {
Code snippet generator for fixed time stepping in the Runge-Kutta schemes.
__init__(self, normalised_time_step_size)
create_start_time_step_implementation(self)
The outcome is used before we actually roll over the accumulation variables and other stuff.
_normalised_time_step_size
create_finish_time_step_implementation(self)