ell::BS_UpDown Class Reference
#include <BarrierSampling.hh>
Inheritance diagram for ell::BS_UpDown:
Detailed Description
A barrier estimation approach using iterations of up-down-walks to estimate barriers between minima. An "up-down-walk" is a pair of walks that are run successively. The "up-walk" starts in a minimum of the landscape. The end of this walk is the starting point of the following "down-walk" that is intended to reach a minimum of the landscape. Thus typically one will choose a WalkAdaptive or WalkGradient as the "down-walk". The "up-walk" is intended to leave the minimum and to "climb up" (energetically) in the landscape to reach a good starting position for the down walk to find another minimum. If it is too low the down walk might end in the minimum the up walk started from and no barrier was found. Nevertheless this will count as an iteration of the BarrierSampling! The minima to start from are choosen using the given minimum selector and the sampling is aborted by the abortion criterion.NOTE: The down-walk is not ensuring to end in a known minimum! Thus new minima might be added to the topology according to the constructor setup! Even if new minima are ignored the iteration will be count.
This BarrierSampling MIGHT FIND new minima.
Definition at line 123 of file BarrierSampling.hh.
Public Member Functions | |
| BS_UpDown (const Walk *const upWalk, const Walk *const downWalk, const bool addNewMinima) | |
| virtual size_t | findBarriers (LandscapeTopology *const lt, MinimumSelector *const ms, SamplingAbortionCriterion *const sac) |
| virtual | ~BS_UpDown () |
Protected Attributes | |
| const bool | addNewMinima |
| const Walk *const | downWalk |
| const Walk *const | upWalk |
Constructor & Destructor Documentation
| ell::BS_UpDown::BS_UpDown | ( | const Walk *const | upWalk, | |
| const Walk *const | downWalk, | |||
| const bool | addNewMinima | |||
| ) |
Construction
- Parameters:
-
upWalk the up-walk to perform starting from a selected minimum downWalk the down-walk to perform starting with the final state visited by the up-walk. NOTE: this walk MUST END IN A MINIMUM !!! addNewMinima whether or not new minima should be added to the lt or ignored.
Definition at line 98 of file BarrierSampling.cc.
| ell::BS_UpDown::~BS_UpDown | ( | ) | [virtual] |
Member Function Documentation
| size_t ell::BS_UpDown::findBarriers | ( | LandscapeTopology *const | lt, | |
| MinimumSelector *const | ms, | |||
| SamplingAbortionCriterion *const | sac | |||
| ) | [virtual] |
Performs an iteration of barrier estimations using successive up- and down-walks starting from a minimum of the landscape until the sac decides that no further estimations are neccessary.
- Parameters:
-
lt the landscape topology to add the barriers to and to get the minima from between the barrier should be estimated. ms selects minima between which the next barrier should be estimated. sac decides if another estimation iteration should be done.
- Returns:
- the number of barrier sampling iterations performed.
Implements ell::BarrierSampling.
Definition at line 120 of file BarrierSampling.cc.
Field Documentation
const bool ell::BS_UpDown::addNewMinima [protected] |
whether or not new minima should be ignored or added to the topology
Definition at line 174 of file BarrierSampling.hh.
const Walk* const ell::BS_UpDown::downWalk [protected] |
const Walk* const ell::BS_UpDown::upWalk [protected] |
the up walk to perform starting from a selected minimum
Definition at line 169 of file BarrierSampling.hh.
The documentation for this class was generated from the following files:
- src/ell/BarrierSampling.hh
- src/ell/BarrierSampling.cc