portelli/Grid
1
0
Fork 0
mirror of https://github.com/paboyle/Grid.git synced 2025-04-18 09:45:55 +01:00
Code Releases Activity

include missing staple orientations; invert path direction, which was backwards

Browse Source
This commit is contained in:
david clarke 2023-06-22 14:57:10 -06:00
parent d536c67b9d
commit df99f227c1
1 changed files with 95 additions and 90 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

123
Grid/qcd/smearing/HISQSmearing.h
View File

@ -112,29 +112,30 @@ public:
// This is where the 3-link constructs will be stored // This is where the 3-link constructs will be stored
LGF Ughost_fat(Ughost.Grid()); LGF Ughost_fat(Ughost.Grid());
// Create 3-link stencil (class will build its own stencils) // Create 3-link stencil. Writing your own stencil, you're hard-coding the
// writing your own stencil, you're hard-coding the periodic BCs, so you don't need // periodic BCs, so you don't need the policy-based stuff, at least for now.
// the policy-based stuff, at least for now // Loop over all orientations, i.e. demand mu != nu.
std::vector<Coordinate> shifts; std::vector<Coordinate> shifts;
for(int mu=0;mu<Nd;mu++){ for(int mu=0;mu<Nd;mu++)
for(int nu=mu+1;nu<Nd;nu++){ for(int nu=0;nu<Nd;nu++) {
// forward shifts if(mu==nu) continue;
Coordinate shift_0(Nd,0); // forward shifts
Coordinate shift_mu(Nd,0); shift_mu[mu]=1; Coordinate shift_0(Nd,0);
Coordinate shift_nu(Nd,0); shift_nu[nu]=1; Coordinate shift_mu(Nd,0); shift_mu[mu]=1;
// push_back creates an element at the end of shifts and Coordinate shift_nu(Nd,0); shift_nu[nu]=1;
// assigns the data in the argument to it. // push_back creates an element at the end of shifts and
shifts.push_back(shift_mu); // assigns the data in the argument to it.
shifts.push_back(shift_nu); shifts.push_back(shift_mu);
shifts.push_back(shift_0); shifts.push_back(shift_nu);
// reverse shifts shifts.push_back(shift_0);
shift_nu[nu]=-1; // reverse shifts
Coordinate shift_munu(Nd,0); shift_munu[mu]=1; shift_munu[nu]=-1; shift_nu[nu]=-1;
shifts.push_back(shift_munu); Coordinate shift_munu(Nd,0); shift_munu[mu]=1; shift_munu[nu]=-1;
shifts.push_back(shift_nu); // in principle you don't need both of these grid points, shifts.push_back(shift_munu);
shifts.push_back(shift_nu); // but it helps the reader keep track of offsets shifts.push_back(shift_nu); // in principle you don't need both of these grid points,
} shifts.push_back(shift_nu); // but it helps the reader keep track of offsets
} }
GeneralLocalStencil gStencil(GhostGrid,shifts); GeneralLocalStencil gStencil(GhostGrid,shifts);
Ughost_fat=Zero(); Ughost_fat=Zero();
@ -150,52 +151,56 @@ public:
// plaquette orientations, and as we travel around a plaquette. // plaquette orientations, and as we travel around a plaquette.
int s=0; int s=0;
for(int mu=0;mu<Nd;mu++){ for(int mu=0;mu<Nd;mu++)
for(int nu=mu+1;nu<Nd;nu++){ for(int nu=0;nu<Nd;nu++) {
if(mu==nu) continue;
// shift_mu; shift_mu[mu]=1 // shift_mu; shift_mu[mu]=1
// shift_nu; shift_nu[nu]=1 // shift_nu; shift_nu[nu]=1
// shift_0 // shift_0
// shift_munu; shift_munu[mu]= 1; shift_munu[nu]=-1; // shift_munu; shift_munu[mu]= 1; shift_munu[nu]=-1;
// shift_nu ; shift_nu[nu]=-1; // shift_nu ; shift_nu[nu]=-1;
// shift_nu ; shift_nu[nu]=-1; // shift_nu ; shift_nu[nu]=-1;
auto SE0 = gStencil.GetEntry(s+0,ss); auto SE0 = gStencil.GetEntry(s+0,ss);
auto SE1 = gStencil.GetEntry(s+1,ss); auto SE1 = gStencil.GetEntry(s+1,ss);
auto SE2 = gStencil.GetEntry(s+2,ss); auto SE2 = gStencil.GetEntry(s+2,ss);
auto SE3 = gStencil.GetEntry(s+3,ss); auto SE3 = gStencil.GetEntry(s+3,ss);
auto SE4 = gStencil.GetEntry(s+4,ss); auto SE4 = gStencil.GetEntry(s+4,ss);
auto SE5 = gStencil.GetEntry(s+5,ss); auto SE5 = gStencil.GetEntry(s+5,ss);
// Each offset corresponds to a site around the plaquette. // Each offset corresponds to a site around the plaquette.
int o0 = SE0->_offset; int o0 = SE0->_offset;
int o1 = SE1->_offset; int o1 = SE1->_offset;
int o2 = SE2->_offset; int o2 = SE2->_offset;
int o3 = SE3->_offset; int o3 = SE3->_offset;
int o4 = SE4->_offset; int o4 = SE4->_offset;
int o5 = SE5->_offset; int o5 = SE5->_offset;
auto U0 = U_v[o0](nu); // When you're deciding whether to take an adjoint, the question is: how is the
auto U1 = adj(U_v[o1](mu)); // stored link oriented compared to the one you want? If I imagine myself travelling
auto U2 = adj(U_v[o2](nu)); // with the to-be-updated link, I have two possible, alternative 3-link paths I can
// take, one starting by going to the left, the other starting by going to the right.
auto U0 = adj(U_v[o0](nu));
auto U1 = U_v[o1](mu);
auto U2 = U_v[o2](nu);
gpermute(U0,SE0->_permute); gpermute(U0,SE0->_permute);
gpermute(U1,SE1->_permute); gpermute(U1,SE1->_permute);
gpermute(U2,SE2->_permute); gpermute(U2,SE2->_permute);
auto U3 = adj(U_v[o3](nu)); auto U3 = U_v[o3](nu);
auto U4 = adj(U_v[o4](mu)); auto U4 = U_v[o4](mu);
auto U5 = U_v[o5](nu); auto U5 = adj(U_v[o5](nu));
gpermute(U3,SE3->_permute); gpermute(U3,SE3->_permute);
gpermute(U4,SE4->_permute); gpermute(U4,SE4->_permute);
gpermute(U5,SE5->_permute); gpermute(U5,SE5->_permute);
// forward backward // "left" "right"
auto W = U0*U1*U2 + U3*U4*U5; auto W = U2*U1*U0 + U5*U4*U3;
U_fat_v[ss](mu) = U_fat_v[ss](mu) + W; U_fat_v[ss](mu) = U_fat_v[ss](mu) + W;
s=s+6; s=s+6;
}
} }
} }