Critical Slowing-Down in $SU(2)$ Landau Gauge-Fixing Algorithms

Physics – High Energy Physics – High Energy Physics - Lattice

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

40 pages (including 10 figures). A few modifications, incorporating referee's suggestions, without the length reduction requir

Scientific paper

10.1016/0550-3213(96)00177-0

We study the problem of critical slowing-down for gauge-fixing algorithms (Landau gauge) in $SU(2)$ lattice gauge theory on a $2$-dimensional lattice. We consider five such algorithms, and lattice sizes ranging from $8^{2}$ to $36^{2}$ (up to $64^2$ in the case of Fourier acceleration). We measure four different observables and we find that for each given algorithm they all have the same relaxation time within error bars. We obtain that: the so-called {\em Los Alamos} method has dynamic critical exponent $z \approx 2$, the {\em overrelaxation} method and the {\em stochastic overrelaxation} method have $z \approx 1$, the so-called {\em Cornell} method has $z$ slightly smaller than $1$ and the {\em Fourier acceleration} method completely eliminates critical slowing-down. A detailed discussion and analysis of the tuning of these algorithms is also presented.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Critical Slowing-Down in $SU(2)$ Landau Gauge-Fixing Algorithms does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Critical Slowing-Down in $SU(2)$ Landau Gauge-Fixing Algorithms, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Critical Slowing-Down in $SU(2)$ Landau Gauge-Fixing Algorithms will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-283434

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.