* Since assembling matrices, depending on the implementation, tends
* to be costly, this method applies an adaptive reassembling
* strategy. Only if the reduction factor for the residual is more
- * than #threshold, the event #bad_derivative is submitted to
+ * than #threshold, the event Algorithms::bad_derivative is submitted to
* #inverse_derivative. It is up to this object to implement
* reassembling accordingly.
*
{
/**
* The abstract base class of all algorithms in this library. An
- * operator is an object with an #operator(), which transforms a set
+ * operator is an object with an operator(), which transforms a set
* of named vectors into another set of named vectors.
*
* Furthermore, an operator can be notified of parameter changes by
* of the step. For an implicit scheme, it is usually the time at the
* end.
*/
- struct TimeStepData
+ struct TimestepData
{
/// The current time
double time;
* implicit Euler step with modified step size (right hand side
* given). Thus, the implementation of the theta scheme will use two
* Operator objects, one for the explicit, one for the implicit
- * part. Each of these will use its own TimeStepData to account for
+ * part. Each of these will use its own TimestepData to account for
* the modified step sizes (and different times if the problem is not
* autonomous).
*
/**
* The data handed to the
- * #explicit time stepping
+ * #op_explicit time stepping
* operator.
*
* The time in here is the time
* is (1-#theta) times the
* actual time step.
*/
- const TimeStepData& explicit_data() const;
+ const TimestepData& explicit_data() const;
/**
* The data handed to the
- * #implicit time stepping
+ * #op_implicit time stepping
* operator.
*
* The time in here is the time
* is #theta times the
* actual time step.
*/
- const TimeStepData& implicit_data() const;
+ const TimestepData& implicit_data() const;
/**
* Allow access to the control object.
* The data for the explicit
* part of the scheme.
*/
- TimeStepData d_explicit;
+ TimestepData d_explicit;
/**
* The data for the implicit
* part of the scheme.
*/
- TimeStepData d_implicit;
+ TimestepData d_implicit;
/**
*/
SmartPointer<OutputOperator<VECTOR> > output;
};
+
+
+ template <class VECTOR>
+ inline
+ const TimestepData&
+ ThetaTimestepping<VECTOR>::explicit_data () const
+ {
+ return d_explicit;
+ }
+
+
+ template <class VECTOR>
+ inline
+ const TimestepData&
+ ThetaTimestepping<VECTOR>::implicit_data () const
+ {
+ return d_implicit;
+ }
+
}
DEAL_II_NAMESPACE_CLOSE