/************************************************************************************* grid` physics library, www.github.com/paboyle/Grid Source file: ./tests/Test_cshift.cc Copyright (C) 2015 Author: Azusa Yamaguchi Author: Peter Boyle This program is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2 of the License, or (at your option) any later version. This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with this program; if not, write to the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA. See the full license in the file "LICENSE" in the top level distribution directory *************************************************************************************/ /* END LEGAL */ #include using namespace Grid; using namespace Grid::QCD; template class FourierAcceleratedGaugeFixer : public Gimpl { public: INHERIT_GIMPL_TYPES(Gimpl); typedef typename Gimpl::GaugeLinkField GaugeMat; typedef typename Gimpl::GaugeField GaugeLorentz; static void GaugeLinkToLieAlgebraField(const std::vector &U,std::vector &A) { for(int mu=0;mu &A,GaugeMat &dmuAmu) { dmuAmu=zero; for(int mu=0;mu::avgPlaquette(Umu); Real org_link_trace=WilsonLoops::linkTrace(Umu); Real old_trace = org_link_trace; Real trG; std::vector U(Nd,grid); GaugeMat dmuAmu(grid); for(int i=0;i(Umu,mu); //trG = SteepestDescentStep(U,alpha,dmuAmu); trG = FourierAccelSteepestDescentStep(U,alpha,dmuAmu); for(int mu=0;mu(Umu,U[mu],mu); // Monitor progress and convergence test // infrequently to minimise cost overhead if ( i %20 == 0 ) { Real plaq =WilsonLoops::avgPlaquette(Umu); Real link_trace=WilsonLoops::linkTrace(Umu); std::cout << GridLogMessage << " Iteration "< &U,Real & alpha, GaugeMat & dmuAmu) { GridBase *grid = U[0]._grid; std::vector A(Nd,grid); GaugeMat g(grid); GaugeLinkToLieAlgebraField(U,A); ExpiAlphaDmuAmu(A,g,alpha,dmuAmu); Real vol = grid->gSites(); Real trG = TensorRemove(sum(trace(g))).real()/vol/Nc; SU::GaugeTransform(U,g); return trG; } static Real FourierAccelSteepestDescentStep(std::vector &U,Real & alpha, GaugeMat & dmuAmu) { GridBase *grid = U[0]._grid; Real vol = grid->gSites(); FFT theFFT((GridCartesian *)grid); LatticeComplex Fp(grid); LatticeComplex psq(grid); psq=zero; LatticeComplex pmu(grid); LatticeComplex one(grid); one = Complex(1.0,0.0); GaugeMat g(grid); GaugeMat dmuAmu_p(grid); std::vector A(Nd,grid); GaugeLinkToLieAlgebraField(U,A); DmuAmu(A,dmuAmu); theFFT.FFT_all_dim(dmuAmu_p,dmuAmu,FFT::forward); ////////////////////////////////// // Work out Fp = psq_max/ psq... ////////////////////////////////// std::vector latt_size = grid->GlobalDimensions(); std::vector coor(grid->_ndimension,0); for(int mu=0;mu::taExp(ciadmam,g); Real trG = TensorRemove(sum(trace(g))).real()/vol/Nc; SU::GaugeTransform(U,g); return trG; } static void ExpiAlphaDmuAmu(const std::vector &A,GaugeMat &g,Real & alpha, GaugeMat &dmuAmu) { GridBase *grid = g._grid; Complex cialpha(0.0,-alpha); GaugeMat ciadmam(grid); DmuAmu(A,dmuAmu); ciadmam = dmuAmu*cialpha; SU::taExp(ciadmam,g); } /* //////////////////////////////////////////////////////////////// // NB The FT for fields living on links has an extra phase in it // Could add these to the FFT class as a later task since this code // might be reused elsewhere ???? //////////////////////////////////////////////////////////////// static void InverseFourierTransformAmu(FFT &theFFT,const std::vector &Ap,std::vector &Ax) { GridBase * grid = theFFT.Grid(); std::vector latt_size = grid->GlobalDimensions(); ComplexField pmu(grid); ComplexField pha(grid); GaugeMat Apha(grid); Complex ci(0.0,1.0); for(int mu=0;mu &Ax,std::vector &Ap) { GridBase * grid = theFFT.Grid(); std::vector latt_size = grid->GlobalDimensions(); ComplexField pmu(grid); ComplexField pha(grid); Complex ci(0.0,1.0); // Sign convention for FFTW calls: // A(x)= Sum_p e^ipx A(p) / V // A(p)= Sum_p e^-ipx A(x) for(int mu=0;mu seeds({1,2,3,4}); Grid_init(&argc,&argv); int threads = GridThread::GetThreads(); std::vector latt_size = GridDefaultLatt(); std::vector simd_layout( { vComplex::Nsimd(),1,1,1}); std::vector mpi_layout = GridDefaultMpi(); int vol = 1; for(int d=0;d::avgPlaquette(Umu); std::cout << " Initial plaquette "<::SteepestDescentGaugeFix(Umu,alpha,10000,1.0e-10, 1.0e-10); plaq=WilsonLoops::avgPlaquette(Umu); std::cout << " Final plaquette "<