RJaBi
commented
6 months ago Some of this is now implemented in the branch ryan_gauge.
Specifically, I realised that I don't need to feed in the a vector of pre-calculated positions, so it just feeds in two sets of paths, a forward and a backward path.
// Only forward paths/links are printed. Obviously the calculation does the backwards as well.
Path 1:
x, y, z, mu, 0 0 0 0 1
link 1:
x, y, z, mu, 0 1 0 0 2
Path 2:
x, y, z, mu, 0 0 0 0 1
link 1:
x, y, z, mu, 0 1 0 0 3
Path 3:
x, y, z, mu, 0 0 0 0 2
link 1:
x, y, z, mu, 0 0 1 0 3
Path 4:
x, y, z, mu, 0 0 0 0 0
link 1:
x, y, z, mu, 1 0 0 0 1
Path 5:
x, y, z, mu, 0 0 0 0 0
link 1:
x, y, z, mu, 1 0 0 0 2
Path 6:
x, y, z, mu, 0 0 0 0 0
link 1:
x, y, z, mu, 1 0 0 0 3
alt plaq calc 10.331249
Type: sumReTrP: nP: Avg:
whole 10.331249 6 1.721875
spatial 3.430829 3 1.143610
temporal 6.900420 3 2.300140
Total execution time: 0.000059sSo you can see that the summed plaquette value in alt plaq calc matches the one in whole
There is now a makefile in the main directory. This makes the driver program bin/project.c. For the generic wilson loop above, I added additional functionality to src/wilsonLoops.c
jadot-bp
My thought is that transitioning to takes a list of positions, and a list of directions and then multiplies those together is likely to make doing arbitrary wilson loops easier. I.e. feed the function the path and then it goes and calculates.
One would pre-calculate the path, and then i.e. each thread on a GPU/CPU would calculate the wilson line along the path.
This would also be useful for staples if we wanted those for some reason.
Two main requirements:
To do a Wilson Loop, one would probably call a Wilson Line function twice on forward and backward paths (conjugate at end).
Do either of you have any thoughts on this approach?