RecedeTailMove Class Reference

A derived class which performs a recede move on the tail, causing a worm tail to propagate backwards in imaginary time by adding beads and links. More...

#include <move.h>

Inheritance diagram for RecedeTailMove:

Collaboration diagram for RecedeTailMove:

Public Member Functions
	RecedeTailMove (Path &, ActionBase *, MTRand &, ensemble _operateOnConfig=OFFDIAGONAL, bool _varLength=true)
	Constructor.
	~RecedeTailMove ()
	Destructor.
bool	attemptMove ()
	Perform a recede tail move. More...
string	getName ()
	return the move name
Public Member Functions inherited from MoveBase
	MoveBase (Path &, ActionBase *, MTRand &, ensemble _operateOnConfig=ANY, bool _varLength=false)
	Move naming conventions: More...
virtual	~MoveBase ()
	Destructor.
double	getAcceptanceRatio ()
	Get the acceptance ratio.
double	getTotAcceptanceRatio ()
	Get the total acceptance ratio.
double	getAcceptanceRatioLevel (int n)
	Get the acceptance ratio by level.
int	getNumAttempted ()
	Get the number of moves attempted.
int	getNumAccepted ()
	Get the number of moves accepted.
int	getNumAttemptedLevel (int n)
	Get the number of moves attempted by level.
int	getNumAcceptedLevel (int n)
	Get the number of moves accepted by level.
void	resetTotAccept ()
	Reset the total accepted counter.
void	resetAccept ()
	Reset the number accepted counter.

Static Public Attributes
static const string	name

Additional Inherited Members
Data Fields inherited from MoveBase
ensemble	operateOnConfig
	What configurations do we operate on?
bool	variableLength
	Does the move have a variable length?
string	name1
Protected Member Functions inherited from MoveBase
dVec	newStagingPosition (const beadLocator &, const beadLocator &, const int, const int)
	Returns a new staging position which will exactly sample the kinetic action. More...
dVec	newStagingPosition (const beadLocator &, const beadLocator &, const int, const int, iVec &)
	Returns a new staging position which will exactly sample the kinetic action in different winding sectors. More...
iVec	sampleWindingSector (const beadLocator &, const beadLocator &, const int, double &)
	Obtain a winding sector for a stage-like move. More...
iVec	getWindingNumber (const beadLocator &, const beadLocator &)
	Find the winding number for a path between two beads. More...
dVec	newFreeParticlePosition (const beadLocator &)
	Generates a new position, which exactly samples the free particle density matrix. More...
dVec	newBisectionPosition (const beadLocator &, const int)
	Returns a new bisection position which will exactly sample the kinetic action. More...
void	printMoveState (string)
void	checkMove (int, double)
Protected Attributes inherited from MoveBase
Path &	path
	A reference to the paths.
ActionBase *	actionPtr
	A base pointer to the action.
MTRand &	random
	A reference to the RNG.
bool	success
	Did we sucessfully perform a move?
uint32	numAccepted
	The number of accepted moves.
uint32	numAttempted
	The number of attempted moves.
int	numToMove
	The number of particles moved.
int	numLevels
Array< uint32, 1 >	numAcceptedLevel
	The number of moves accepted at each level.
Array< uint32, 1 >	numAttemptedLevel
	The number of moves attempted at each level.
Array< dVec, 1 >	originalPos
	The original particle positions.
Array< dVec, 1 >	newPos
	New particle positions.
vector< iVec >	winding
	The winding vectors
vector< int >	windingSector
	Used to index different winding sectors.
vector< double >	cumrho0
	Used for tower-sampling winding sectors.
int	maxWind
	The largest winding number.
int	numWind
	The total number of winding vectors.
double	oldAction
	The original potential action.
double	newAction
	The new potential action.
double	deltaAction
	The action difference.
double	sqrt2LambdaTau
	sqrt(2 * Lambda * tau)
double	sqrtLambdaTau
	sqrt(Lambda * tau)
beadLocator	nBeadIndex
	Neighbor bead index.
dVec	neighborPos
	Staging neighbor position.
dVec	newRanPos
	Staing random position.
double	newK
double	oldK
	The old and new kinetic action.
double	newV
double	oldV
	The old and new potential action.
Static Protected Attributes inherited from MoveBase
static uint32	totAccepted = 0
	The total number of moves accepted.
static uint32	totAttempted = 0
	The total number of moves attempted.

Detailed Description

A derived class which performs a recede move on the tail, causing a worm tail to propagate backwards in imaginary time by adding beads and links.

Definition at line 527 of file move.h.

Member Function Documentation

attemptMove()

bool RecedeTailMove::attemptMove ( )

virtual

Perform a recede tail move.

Attempt to propagate a worm tail backwards in imaginary time by randomly selecting a number of links then attempting to generate new positions which exactly sample the free particle density matrix.

Implements MoveBase.

Definition at line 2947 of file move.cpp.

                                 {
 
    success = false;
 
    /* Only perform a move if we have beads */
    if (path.worm.getNumBeadsOn() == 0) 
        return success;
 
    /* Get the length of the proposed advancement by computing
     * a random number of levels to be used in the bisection algorithm. */
    recedeLength = 2*(1 + random.randInt(constants()->Mbar()/2-1));
    numLevels = int (ceil(log(1.0*recedeLength) / log(2.0)-EPS));
 
    checkMove(0,0.0);
 
    /* Increment the number of advance moves and the total number of moves */
    numAttempted++;
    numAttemptedLevel(numLevels)++;
    totAttempted++;
 
    double muShift = recedeLength*constants()->tau()*constants()->mu();
    double norm = constants()->attemptProb("advance tail") / 
        constants()->attemptProb("recede tail");
 
    /* Weight for ensemble */
    norm *= actionPtr->ensembleWeight(recedeLength);
 
    /* Make the current tail special, and undefine the tail */
    path.worm.special1 = path.worm.tail;
    path.worm.tail = XXX;
 
    /* If we have a local action, perform a single slice rejection move */
    if (actionPtr->local) {
 
        double actionShift = (log(norm) + muShift)/recedeLength;
 
        /* Compute the action for the proposed path, and assign the new tail */
        beadLocator beadIndex;
        beadIndex = path.worm.special1;
 
        deltaAction = actionPtr->barePotentialAction(beadIndex) - 0.5*actionShift;
 
        /* We perform a metropolis test on the tail bead */
        if ( random.rand() >= exp(-deltaAction) ) {
            undoMove();
            return success;
        }
 
        for (int k = 0; k < (recedeLength-1); k++) {
            beadIndex = path.addPrevBead(beadIndex,newFreeParticlePosition(beadIndex));
            deltaAction = actionPtr->barePotentialAction(beadIndex) - actionShift;
 
            /* We perform a metropolis test on the single bead */
            if ( random.rand() >= exp(-deltaAction) ) {
                undoMove();
                return success;
            }
        }
        tailBead = path.addPrevBead(beadIndex,newFreeParticlePosition(beadIndex));
 
        /* Assign the new tail bead and compute its action */
        path.worm.tail = tailBead;
        deltaAction = actionPtr->barePotentialAction(tailBead) - 0.5*actionShift;
        deltaAction += actionPtr->potentialActionCorrection(tailBead,path.worm.special1);
 
        /* Perform the metropolis test */
        if ( random.rand() < (exp(-deltaAction))) {
            keepMove();
            checkMove(1,deltaAction + recedeLength*actionShift);
        }
        else {
            undoMove();
            checkMove(2,0.0);
        }
    }
    /* Otherwise, we perform a full trajectory updates */
    else {
        /* Generate the new path, assigning the new tail */
        beadLocator beadIndex;
        beadIndex = path.worm.special1;
        for (int k = 0; k < recedeLength; k++)
            beadIndex = path.addPrevBead(beadIndex,newFreeParticlePosition(beadIndex));
        tailBead = beadIndex;
        path.worm.tail = tailBead;
 
        /* Get the action for the proposed path */
        newAction = actionPtr->potentialAction(tailBead,path.worm.special1);
 
        /* Perform the metropolis test */
        if ( random.rand() < norm*exp(-newAction + muShift)) {
            keepMove();
            checkMove(1,newAction);
        }
        else {
            undoMove();
            checkMove(2,0.0);
        }
    }
 
    return success;
}

Here is the call graph for this function:

---

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

• include/move.h
• src/move.cpp