Reference documentation for deal.II version 9.4.0
\(\newcommand{\dealvcentcolon}{\mathrel{\mathop{:}}}\) \(\newcommand{\dealcoloneq}{\dealvcentcolon\mathrel{\mkern-1.2mu}=}\) \(\newcommand{\jump}[1]{\left[\!\left[ #1 \right]\!\right]}\) \(\newcommand{\average}[1]{\left\{\!\left\{ #1 \right\}\!\right\}}\)
Public Member Functions | Static Public Member Functions | Private Attributes | List of all members
Algorithms::TimestepControl Class Reference

#include <deal.II/algorithms/timestep_control.h>

Inheritance diagram for Algorithms::TimestepControl:

Public Member Functions

 TimestepControl (double start=0., double final=1., double tolerance=1.e-2, double start_step=1.e-2, double print_step=-1., double max_step=1.)
void parse_parameters (ParameterHandler &param)
double start () const
double final () const
double tolerance () const
double step () const
double now () const
bool advance ()
void start (double)
void final (double)
void tolerance (double)
void start_step (const double step)
void max_step (double)
void restart ()
bool print ()

Static Public Member Functions

static void declare_parameters (ParameterHandler &param)

Private Attributes

double start_val
double final_val
double tolerance_val
double start_step_val
double max_step_val
double min_step_val
double current_step_val
double step_val
double now_val
double print_step
double next_print_val

Subscriptor functionality

Classes derived from Subscriptor provide a facility to subscribe to this object. This is mostly used by the SmartPointer class.

std::atomic< unsigned intcounter
std::map< std::string, unsigned intcounter_map
std::vector< std::atomic< bool > * > validity_pointers
const std::type_info * object_info
void subscribe (std::atomic< bool > *const validity, const std::string &identifier="") const
void unsubscribe (std::atomic< bool > *const validity, const std::string &identifier="") const
unsigned int n_subscriptions () const
template<typename StreamType >
void list_subscribers (StreamType &stream) const
void list_subscribers () const
template<class Archive >
void serialize (Archive &ar, const unsigned int version)
static ::ExceptionBaseExcInUse (int arg1, std::string arg2, std::string arg3)
static ::ExceptionBaseExcNoSubscriber (std::string arg1, std::string arg2)
using map_value_type = decltype(counter_map)::value_type
using map_iterator = decltype(counter_map)::iterator
static std::mutex mutex
void check_no_subscribers () const noexcept

Detailed Description

Control class for timestepping schemes. Its main task is determining the size of the next time step and the according point in the time interval. Additionally, it controls writing the solution to a file.

The size of the next time step is determined as follows:

  1. According to the strategy, the step size is tentatively added to the current time.
  2. If the resulting time exceeds the final time of the interval, the step size is reduced in order to meet this time.
  3. If the resulting time is below the final time by just a fraction of the step size, the step size is increased in order to meet this time.
  4. The resulting step size is used from the current time.

The variable print_step can be used to control the amount of output generated by the timestepping scheme.

Many of the features of this class are available in DiscreteTime with a more modern interface and better programming guarantees. Consider using DiscreteTime instead of TimestepControl.

Definition at line 61 of file timestep_control.h.

Constructor & Destructor Documentation

◆ TimestepControl()

Algorithms::TimestepControl::TimestepControl ( double  start = 0.,
double  final = 1.,
double  tolerance = 1.e-2,
double  start_step = 1.e-2,
double  print_step = -1.,
double  max_step = 1. 

Constructor setting default values

Definition at line 25 of file

Member Function Documentation

◆ declare_parameters()

void Algorithms::TimestepControl::declare_parameters ( ParameterHandler param)

Declare the control parameters for parameter handler.

Definition at line 51 of file

◆ parse_parameters()

void Algorithms::TimestepControl::parse_parameters ( ParameterHandler param)

Read the control parameters from a parameter handler.

This function also calls restart() to reset all other internal parameters of this class to their appropriate values based on the parameters just read.

Definition at line 64 of file

◆ start() [1/2]

double Algorithms::TimestepControl::start ( ) const

Return the left end of the time interval.

Definition at line 232 of file timestep_control.h.

◆ final() [1/2]

double Algorithms::TimestepControl::final ( ) const

Return the right end of the time interval. The control mechanism ensures that the final time step ends at this point.

Definition at line 239 of file timestep_control.h.

◆ tolerance() [1/2]

double Algorithms::TimestepControl::tolerance ( ) const

Return the tolerance value controlling the time steps.

Definition at line 253 of file timestep_control.h.

◆ step()

double Algorithms::TimestepControl::step ( ) const

Return the size of the current time step.

Definition at line 246 of file timestep_control.h.

◆ now()

double Algorithms::TimestepControl::now ( ) const

Return the current time.

Definition at line 260 of file timestep_control.h.

◆ advance()

bool Algorithms::TimestepControl::advance ( )

Compute the size of the next step and return true if it differs from the current step size. Advance the current time by the new step size.

Definition at line 77 of file

◆ start() [2/2]

void Algorithms::TimestepControl::start ( double  t)

Set start value.

Definition at line 267 of file timestep_control.h.

◆ final() [2/2]

void Algorithms::TimestepControl::final ( double  t)

Set final time value.

Definition at line 274 of file timestep_control.h.

◆ tolerance() [2/2]

void Algorithms::TimestepControl::tolerance ( double  t)

Set tolerance

Definition at line 281 of file timestep_control.h.

◆ start_step()

void Algorithms::TimestepControl::start_step ( const double  step)

Set size of the first step. This may be overwritten by the time stepping strategy.

[in]stepThe size of the first step, which may be overwritten by the time stepping strategy.

Definition at line 288 of file timestep_control.h.

◆ max_step()

void Algorithms::TimestepControl::max_step ( double  t)

Set size of the maximum step size.

Definition at line 295 of file timestep_control.h.

◆ restart()

void Algorithms::TimestepControl::restart ( )

Set now() equal to start(). Initialize step() and print() to their initial values.

Definition at line 302 of file timestep_control.h.

◆ print()

bool Algorithms::TimestepControl::print ( )

Return true if this timestep should be written to disk.

Definition at line 102 of file

Member Data Documentation

◆ start_val

double Algorithms::TimestepControl::start_val

The beginning of the time interval.

Definition at line 174 of file timestep_control.h.

◆ final_val

double Algorithms::TimestepControl::final_val

The end of the time interval.

Definition at line 179 of file timestep_control.h.

◆ tolerance_val

double Algorithms::TimestepControl::tolerance_val

The tolerance value controlling the time steps.

Definition at line 184 of file timestep_control.h.

◆ start_step_val

double Algorithms::TimestepControl::start_step_val

The size of the first step.

Definition at line 189 of file timestep_control.h.

◆ max_step_val

double Algorithms::TimestepControl::max_step_val

The maximum step size.

Definition at line 194 of file timestep_control.h.

◆ min_step_val

double Algorithms::TimestepControl::min_step_val

The minimum step size.

Definition at line 199 of file timestep_control.h.

◆ current_step_val

double Algorithms::TimestepControl::current_step_val

The size of the current time step. This may differ from step_val, if we aim at final_val.

Definition at line 205 of file timestep_control.h.

◆ step_val

double Algorithms::TimestepControl::step_val

The size of the current time step determined by the strategy. This may differ from current_step_val, if we aim at final_val.

Definition at line 211 of file timestep_control.h.

◆ now_val

double Algorithms::TimestepControl::now_val

The current time.

Definition at line 216 of file timestep_control.h.

◆ print_step

double Algorithms::TimestepControl::print_step

Determines the approximate time interval between generated outputs. If negative, output will be generated at all time steps.

Definition at line 222 of file timestep_control.h.

◆ next_print_val

double Algorithms::TimestepControl::next_print_val

If current time exceeds this value, it is time to generate the output.

Definition at line 227 of file timestep_control.h.

The documentation for this class was generated from the following files: