BEGIN:VCALENDAR
VERSION:2.0
PRODID:Data::ICal 0.22
BEGIN:VEVENT
DESCRIPTION:Shailesh Chandrasekharan \, Duke University\n\nThe solution to
the fermion sign problem forces one to sum over a class of fermion configu
rations before a Monte Carlo algorithm can be designed. Conventionally thi
s makes it necessary to compute the determinant of an N x N matrix at ever
y step where N is large. Thus\, it is important to optimize the value of N
. Conventional approaches based on the Hubbard Stratanovich transformation
set N = Volume or N = number of particles. We suggest a new approach in w
hich N is optimized by the nature of the interactions. Effectively\, the c
oupling is used to isolate a set of fermion degrees of freedom that interf
ere with each other and thus create a fermion bag. Thus\, N is determined
by the size of this bag. Using a simple example of the massless Lattice Th
irring model we show that at both weak and strong couplings the bag size c
an be small. Thus\, we can design algorithms that are far more efficient t
han the conventional algorithms in these regions of the coupling.
DTSTART:20110202T203000Z
LOCATION:Physics Building\, Room 204
SUMMARY:Fermion Bag Approach to Lattice Field Theories
END:VEVENT
END:VCALENDAR