Interface for master problems needed by the adaption loop. A master problem can handle one single or multiple coupled problems. In the latter case, the master problem can determine the execution order of the build, solve, estimate, and adapt steps of the single problems in oneIteration(). More...

#include <ProblemIterationInterface.hpp>

Inherited by NewtonIteration< ProblemType >, and StandardProblemIteration [virtual].

Public Member Functions
virtual void	beginIteration (AdaptInfo &)
	Called before each adaption loop iteration. More...

virtual Flag	oneIteration (AdaptInfo &adaptInfo, Flag toDo=FULL_ITERATION)=0
	Determines the execution order of the single adaption steps. If adapt is true, mesh adaption will be performed. This allows to avoid mesh adaption, e.g. in timestep adaption loops of timestep adaptive strategies. More...

virtual void	endIteration (AdaptInfo &)
	Called after each adaption loop iteration. More...

virtual int	numProblems () const =0
	Returns number of managed problems. More...

virtual ProblemStatBase &	problem (int number=0)=0
	Returns the problem with the given number. If only one problem is managed by this master problem, the number hasn't to be given. More...

virtual ProblemStatBase &	problem (std::string const &name)=0
	Returns the problem with the given name. More...

virtual std::string const &	name () const =0
	Returns the name of the problem. More...

Detailed Description

Interface for master problems needed by the adaption loop. A master problem can handle one single or multiple coupled problems. In the latter case, the master problem can determine the execution order of the build, solve, estimate, and adapt steps of the single problems in oneIteration().

Member Function Documentation

◆ beginIteration()

virtual void beginIteration ( AdaptInfo & )

inlinevirtual

Called before each adaption loop iteration.

Reimplemented in NewtonIteration< ProblemType >, and StandardProblemIteration.

Referenced by AdaptStationary::adapt(), AdaptInstationary::explicitTimeStrategy(), and AdaptInstationary::implicitTimeStrategy().

◆ endIteration()

virtual void endIteration ( AdaptInfo & )

inlinevirtual

Called after each adaption loop iteration.

Reimplemented in NewtonIteration< ProblemType >, and StandardProblemIteration.

Referenced by AdaptStationary::adapt(), AdaptInstationary::explicitTimeStrategy(), and AdaptInstationary::implicitTimeStrategy().

◆ name()

virtual std::string const & name ( ) const

pure virtual

Returns the name of the problem.

Implemented in NewtonIteration< ProblemType >, ProblemStat< Traits >, and StandardProblemIteration.

◆ numProblems()

virtual int numProblems ( ) const

pure virtual

Returns number of managed problems.

Implemented in NewtonIteration< ProblemType >, and StandardProblemIteration.

◆ oneIteration()

virtual Flag oneIteration	(	AdaptInfo &	adaptInfo,
		Flag	toDo = `FULL_ITERATION`
	)

pure virtual

Determines the execution order of the single adaption steps. If adapt is true, mesh adaption will be performed. This allows to avoid mesh adaption, e.g. in timestep adaption loops of timestep adaptive strategies.

Implemented in NewtonIteration< ProblemType >, StandardProblemIteration, and ProblemStat< Traits >.

Referenced by AdaptStationary::adapt(), AdaptInstationary::explicitTimeStrategy(), AdaptInstationary::implicitTimeStrategy(), and AdaptInstationary::simpleAdaptiveTimeStrategy().