2020-06-23 15:24:21 +01:00
|
|
|
/*************************************************************************************
|
|
|
|
|
|
|
|
Grid physics library, www.github.com/paboyle/Grid
|
|
|
|
|
|
|
|
Source file: ./tests/Test_dwf_hdcr.cc
|
|
|
|
|
|
|
|
Copyright (C) 2015
|
|
|
|
|
|
|
|
Author: Peter Boyle <paboyle@ph.ed.ac.uk>
|
|
|
|
|
|
|
|
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 <Grid/Grid.h>
|
|
|
|
#include <Grid/algorithms/iterative/PrecGeneralisedConjugateResidual.h>
|
|
|
|
//#include <Grid/algorithms/iterative/PrecGeneralisedConjugateResidualNonHermitian.h>
|
|
|
|
#include <Grid/algorithms/iterative/BiCGSTAB.h>
|
|
|
|
|
|
|
|
using namespace std;
|
|
|
|
using namespace Grid;
|
|
|
|
/* Params
|
|
|
|
* Grid:
|
|
|
|
* block1(4)
|
|
|
|
* block2(4)
|
|
|
|
*
|
|
|
|
* Subspace
|
|
|
|
* * Fine : Subspace(nbasis,hi,lo,order,first,step) -- 32, 60,0.02,500,100,100
|
|
|
|
* * Coarse: Subspace(nbasis,hi,lo,order,first,step) -- 32, 18,0.02,500,100,100
|
|
|
|
|
|
|
|
* Smoother:
|
|
|
|
* * Fine: Cheby(hi, lo, order) -- 60,0.5,10
|
|
|
|
* * Coarse: Cheby(hi, lo, order) -- 12,0.1,4
|
|
|
|
|
|
|
|
* Lanczos:
|
|
|
|
* CoarseCoarse IRL( Nk, Nm, Nstop, poly(lo,hi,order)) 24,36,24,0.002,4.0,61
|
|
|
|
*/
|
|
|
|
|
|
|
|
template<class Field> class SolverWrapper : public LinearFunction<Field> {
|
|
|
|
private:
|
|
|
|
LinearOperatorBase<Field> & _Matrix;
|
|
|
|
OperatorFunction<Field> & _Solver;
|
|
|
|
LinearFunction<Field> & _Guess;
|
|
|
|
public:
|
|
|
|
|
|
|
|
/////////////////////////////////////////////////////
|
|
|
|
// Wrap the usual normal equations trick
|
|
|
|
/////////////////////////////////////////////////////
|
|
|
|
SolverWrapper(LinearOperatorBase<Field> &Matrix,
|
|
|
|
OperatorFunction<Field> &Solver,
|
|
|
|
LinearFunction<Field> &Guess)
|
|
|
|
: _Matrix(Matrix), _Solver(Solver), _Guess(Guess) {};
|
|
|
|
|
|
|
|
void operator() (const Field &in, Field &out){
|
|
|
|
|
|
|
|
_Guess(in,out);
|
|
|
|
_Solver(_Matrix,in,out); // Mdag M out = Mdag in
|
|
|
|
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
|
|
// Must use a non-hermitian solver
|
|
|
|
template<class Matrix,class Field>
|
|
|
|
class PVdagMLinearOperator : public LinearOperatorBase<Field> {
|
|
|
|
Matrix &_Mat;
|
|
|
|
Matrix &_PV;
|
|
|
|
public:
|
|
|
|
PVdagMLinearOperator(Matrix &Mat,Matrix &PV): _Mat(Mat),_PV(PV){};
|
|
|
|
|
|
|
|
void OpDiag (const Field &in, Field &out) {
|
|
|
|
assert(0);
|
|
|
|
}
|
|
|
|
void OpDir (const Field &in, Field &out,int dir,int disp) {
|
|
|
|
assert(0);
|
|
|
|
}
|
|
|
|
void OpDirAll (const Field &in, std::vector<Field> &out){
|
|
|
|
assert(0);
|
|
|
|
};
|
|
|
|
void Op (const Field &in, Field &out){
|
|
|
|
Field tmp(in.Grid());
|
|
|
|
_Mat.M(in,tmp);
|
|
|
|
_PV.Mdag(tmp,out);
|
|
|
|
}
|
|
|
|
void AdjOp (const Field &in, Field &out){
|
|
|
|
Field tmp(in.Grid());
|
|
|
|
_PV.M(tmp,out);
|
|
|
|
_Mat.Mdag(in,tmp);
|
|
|
|
}
|
|
|
|
void HermOpAndNorm(const Field &in, Field &out,RealD &n1,RealD &n2){
|
|
|
|
assert(0);
|
|
|
|
}
|
|
|
|
void HermOp(const Field &in, Field &out){
|
|
|
|
assert(0);
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
|
|
RealD InverseApproximation(RealD x){
|
|
|
|
return 1.0/x;
|
|
|
|
}
|
|
|
|
|
|
|
|
template<class Field,class Matrix> class ChebyshevSmoother : public LinearFunction<Field>
|
|
|
|
{
|
|
|
|
public:
|
|
|
|
typedef LinearOperatorBase<Field> FineOperator;
|
|
|
|
Matrix & _SmootherMatrix;
|
|
|
|
FineOperator & _SmootherOperator;
|
|
|
|
|
|
|
|
Chebyshev<Field> Cheby;
|
|
|
|
|
|
|
|
ChebyshevSmoother(RealD _lo,RealD _hi,int _ord, FineOperator &SmootherOperator,Matrix &SmootherMatrix) :
|
|
|
|
_SmootherOperator(SmootherOperator),
|
|
|
|
_SmootherMatrix(SmootherMatrix),
|
|
|
|
Cheby(_lo,_hi,_ord,InverseApproximation)
|
|
|
|
{};
|
|
|
|
|
|
|
|
void operator() (const Field &in, Field &out)
|
|
|
|
{
|
|
|
|
Field tmp(in.Grid());
|
|
|
|
MdagMLinearOperator<Matrix,Field> MdagMOp(_SmootherMatrix);
|
|
|
|
_SmootherOperator.AdjOp(in,tmp);
|
|
|
|
Cheby(MdagMOp,tmp,out);
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
|
|
|
template<class Field,class Matrix> class MirsSmoother : public LinearFunction<Field>
|
|
|
|
{
|
|
|
|
public:
|
|
|
|
typedef LinearOperatorBase<Field> FineOperator;
|
|
|
|
Matrix & SmootherMatrix;
|
|
|
|
FineOperator & SmootherOperator;
|
|
|
|
RealD tol;
|
|
|
|
RealD shift;
|
|
|
|
int maxit;
|
|
|
|
|
|
|
|
MirsSmoother(RealD _shift,RealD _tol,int _maxit,FineOperator &_SmootherOperator,Matrix &_SmootherMatrix) :
|
|
|
|
shift(_shift),tol(_tol),maxit(_maxit),
|
|
|
|
SmootherOperator(_SmootherOperator),
|
|
|
|
SmootherMatrix(_SmootherMatrix)
|
|
|
|
{};
|
|
|
|
|
|
|
|
void operator() (const Field &in, Field &out)
|
|
|
|
{
|
|
|
|
ZeroGuesser<Field> Guess;
|
|
|
|
ConjugateGradient<Field> CG(tol,maxit,false);
|
|
|
|
|
|
|
|
Field src(in.Grid());
|
|
|
|
|
|
|
|
ShiftedMdagMLinearOperator<SparseMatrixBase<Field>,Field> MdagMOp(SmootherMatrix,shift);
|
|
|
|
SmootherOperator.AdjOp(in,src);
|
|
|
|
Guess(src,out);
|
|
|
|
CG(MdagMOp,src,out);
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
|
|
|
#define GridLogLevel std::cout << GridLogMessage <<std::string(level,'\t')<< " Level "<<level <<" "
|
|
|
|
|
|
|
|
template<class Fobj,class CComplex,int nbasis, class CoarseSolver>
|
|
|
|
class HDCRPreconditioner : public LinearFunction< Lattice<Fobj> > {
|
|
|
|
public:
|
|
|
|
|
|
|
|
typedef Aggregation<Fobj,CComplex,nbasis> Aggregates;
|
|
|
|
typedef CoarsenedMatrix<Fobj,CComplex,nbasis> CoarseOperator;
|
|
|
|
typedef typename Aggregation<Fobj,CComplex,nbasis>::CoarseVector CoarseVector;
|
|
|
|
typedef typename Aggregation<Fobj,CComplex,nbasis>::CoarseMatrix CoarseMatrix;
|
|
|
|
typedef typename Aggregation<Fobj,CComplex,nbasis>::FineField FineField;
|
|
|
|
typedef LinearOperatorBase<FineField> FineOperator;
|
|
|
|
typedef LinearFunction <FineField> FineSmoother;
|
|
|
|
|
|
|
|
Aggregates & _Aggregates;
|
|
|
|
FineOperator & _FineOperator;
|
|
|
|
FineSmoother & _Smoother;
|
|
|
|
CoarseSolver & _CoarseSolve;
|
|
|
|
|
|
|
|
int level; void Level(int lv) {level = lv; };
|
|
|
|
|
|
|
|
|
|
|
|
HDCRPreconditioner(Aggregates &Agg,
|
|
|
|
FineOperator &Fine,
|
|
|
|
FineSmoother &Smoother,
|
|
|
|
CoarseSolver &CoarseSolve_)
|
|
|
|
: _Aggregates(Agg),
|
|
|
|
_FineOperator(Fine),
|
|
|
|
_Smoother(Smoother),
|
|
|
|
_CoarseSolve(CoarseSolve_),
|
|
|
|
level(1) { }
|
|
|
|
|
|
|
|
virtual void operator()(const FineField &in, FineField & out)
|
|
|
|
{
|
|
|
|
auto CoarseGrid = _Aggregates.CoarseGrid;
|
|
|
|
CoarseVector Csrc(CoarseGrid);
|
|
|
|
CoarseVector Csol(CoarseGrid);
|
|
|
|
FineField vec1(in.Grid());
|
|
|
|
FineField vec2(in.Grid());
|
|
|
|
|
|
|
|
double t;
|
|
|
|
// Fine Smoother
|
|
|
|
t=-usecond();
|
|
|
|
_Smoother(in,out);
|
|
|
|
t+=usecond();
|
|
|
|
GridLogLevel << "Smoother took "<< t/1000.0<< "ms" <<std::endl;
|
|
|
|
|
|
|
|
// Update the residual
|
|
|
|
_FineOperator.Op(out,vec1); sub(vec1, in ,vec1);
|
|
|
|
|
|
|
|
// Fine to Coarse
|
|
|
|
t=-usecond();
|
|
|
|
_Aggregates.ProjectToSubspace (Csrc,vec1);
|
|
|
|
t+=usecond();
|
|
|
|
GridLogLevel << "Project to coarse took "<< t/1000.0<< "ms" <<std::endl;
|
|
|
|
|
|
|
|
// Coarse correction
|
|
|
|
t=-usecond();
|
|
|
|
_CoarseSolve(Csrc,Csol);
|
|
|
|
t+=usecond();
|
|
|
|
GridLogLevel << "Coarse solve took "<< t/1000.0<< "ms" <<std::endl;
|
|
|
|
|
|
|
|
// Coarse to Fine
|
|
|
|
t=-usecond();
|
|
|
|
_Aggregates.PromoteFromSubspace(Csol,vec1);
|
|
|
|
add(out,out,vec1);
|
|
|
|
t+=usecond();
|
|
|
|
GridLogLevel << "Promote to this level took "<< t/1000.0<< "ms" <<std::endl;
|
|
|
|
|
|
|
|
// Residual
|
|
|
|
_FineOperator.Op(out,vec1); sub(vec1 ,in , vec1);
|
|
|
|
|
|
|
|
// Fine Smoother
|
|
|
|
t=-usecond();
|
|
|
|
_Smoother(vec1,vec2);
|
|
|
|
t+=usecond();
|
|
|
|
GridLogLevel << "Smoother took "<< t/1000.0<< "ms" <<std::endl;
|
|
|
|
|
|
|
|
add( out,out,vec2);
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
|
|
|
int main (int argc, char ** argv)
|
|
|
|
{
|
|
|
|
Grid_init(&argc,&argv);
|
|
|
|
|
|
|
|
const int Ls=16;
|
|
|
|
|
|
|
|
GridCartesian * UGrid = SpaceTimeGrid::makeFourDimGrid(GridDefaultLatt(), GridDefaultSimd(Nd,vComplex::Nsimd()),GridDefaultMpi());
|
|
|
|
GridRedBlackCartesian * UrbGrid = SpaceTimeGrid::makeFourDimRedBlackGrid(UGrid);
|
|
|
|
|
|
|
|
GridCartesian * FGrid = SpaceTimeGrid::makeFiveDimGrid(Ls,UGrid);
|
|
|
|
GridRedBlackCartesian * FrbGrid = SpaceTimeGrid::makeFiveDimRedBlackGrid(Ls,UGrid);
|
|
|
|
|
|
|
|
///////////////////////////////////////////////////
|
|
|
|
// Construct a coarsened grid; utility for this?
|
|
|
|
///////////////////////////////////////////////////
|
|
|
|
std::vector<int> block ({2,2,2,2});
|
2020-06-29 17:59:52 +01:00
|
|
|
const int nbasis= 8;
|
2020-06-23 15:24:21 +01:00
|
|
|
|
|
|
|
auto clatt = GridDefaultLatt();
|
|
|
|
for(int d=0;d<clatt.size();d++){
|
|
|
|
clatt[d] = clatt[d]/block[d];
|
|
|
|
}
|
|
|
|
|
|
|
|
GridCartesian *Coarse4d = SpaceTimeGrid::makeFourDimGrid(clatt, GridDefaultSimd(Nd,vComplex::Nsimd()),GridDefaultMpi());;
|
|
|
|
GridCartesian *Coarse5d = SpaceTimeGrid::makeFiveDimGrid(Ls,Coarse4d);
|
|
|
|
|
|
|
|
std::vector<int> seeds({1,2,3,4});
|
|
|
|
GridParallelRNG RNG5(FGrid); RNG5.SeedFixedIntegers(seeds);
|
|
|
|
GridParallelRNG RNG4(UGrid); RNG4.SeedFixedIntegers(seeds);
|
|
|
|
GridParallelRNG CRNG(Coarse5d);CRNG.SeedFixedIntegers(seeds);
|
|
|
|
|
|
|
|
LatticeGaugeField Umu(UGrid);
|
|
|
|
FieldMetaData header;
|
|
|
|
std::string file("./ckpoint_lat.4000");
|
|
|
|
NerscIO::readConfiguration(Umu,header,file);
|
|
|
|
|
|
|
|
std::cout<<GridLogMessage << "**************************************************"<< std::endl;
|
|
|
|
std::cout<<GridLogMessage << "Building g5R5 hermitian DWF operator" <<std::endl;
|
|
|
|
std::cout<<GridLogMessage << "**************************************************"<< std::endl;
|
|
|
|
RealD mass=0.001;
|
|
|
|
RealD M5=1.8;
|
|
|
|
WilsonFermionR Dw(Umu,*UGrid,*UrbGrid,-M5);
|
|
|
|
DomainWallFermionR Ddwf(Umu,*FGrid,*FrbGrid,*UGrid,*UrbGrid,mass,M5);
|
|
|
|
DomainWallFermionR Dpv (Umu,*FGrid,*FrbGrid,*UGrid,*UrbGrid,1.0,M5);
|
|
|
|
|
|
|
|
typedef Aggregation<vSpinColourVector,vTComplex,nbasis> Subspace;
|
|
|
|
typedef CoarsenedMatrix<vSpinColourVector,vTComplex,nbasis> CoarseOperator;
|
|
|
|
typedef CoarseOperator::CoarseVector CoarseVector;
|
|
|
|
typedef CoarseOperator::siteVector siteVector;
|
|
|
|
|
|
|
|
std::cout<<GridLogMessage << "**************************************************"<< std::endl;
|
|
|
|
std::cout<<GridLogMessage << "Calling Aggregation class to build subspace" <<std::endl;
|
|
|
|
std::cout<<GridLogMessage << "**************************************************"<< std::endl;
|
|
|
|
MdagMLinearOperator<WilsonFermionR,LatticeFermion> SubspaceOp(Dw);
|
|
|
|
|
|
|
|
Subspace Aggregates4D(Coarse4d,UGrid,0);
|
|
|
|
Subspace Aggregates5D(Coarse5d,FGrid,0);
|
|
|
|
|
|
|
|
assert ( (nbasis & 0x1)==0);
|
|
|
|
std::cout<<GridLogMessage << "**************************************************"<< std::endl;
|
|
|
|
std::cout<<GridLogMessage << " 4D subspace build " <<std::endl;
|
|
|
|
std::cout<<GridLogMessage << "**************************************************"<< std::endl;
|
|
|
|
int nb=nbasis/2;
|
|
|
|
Gamma g5(Gamma::Algebra::Gamma5);
|
2020-06-29 17:59:52 +01:00
|
|
|
Aggregates4D.CreateSubspaceChebyshev(RNG4,SubspaceOp,nb,60.0,0.02,500,100,100,0.0);
|
2020-06-23 15:24:21 +01:00
|
|
|
for(int n=0;n<nb;n++){
|
|
|
|
Aggregates4D.subspace[n+nb]= Aggregates4D.subspace[n] - g5 * Aggregates4D.subspace[n];
|
|
|
|
Aggregates4D.subspace[n] = Aggregates4D.subspace[n] + g5 * Aggregates4D.subspace[n];
|
|
|
|
}
|
|
|
|
|
|
|
|
std::cout<<GridLogMessage << "**************************************************"<< std::endl;
|
|
|
|
std::cout<<GridLogMessage << " Promote to 5D basis " <<std::endl;
|
|
|
|
std::cout<<GridLogMessage << "**************************************************"<< std::endl;
|
|
|
|
for(int n=0;n<nbasis;n++){
|
|
|
|
for(int s=0;s<Ls;s++){
|
|
|
|
InsertSlice(Aggregates4D.subspace[n],Aggregates5D.subspace[n],s,0);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
std::cout<<GridLogMessage << "**************************************************"<< std::endl;
|
|
|
|
std::cout<<GridLogMessage << " Coarsen the operator " <<std::endl;
|
|
|
|
std::cout<<GridLogMessage << "**************************************************"<< std::endl;
|
|
|
|
typedef CoarsenedMatrix<vSpinColourVector,vTComplex,nbasis> Level1Op;
|
|
|
|
|
|
|
|
NonHermitianLinearOperator<DomainWallFermionR,LatticeFermion> LinOpDwf(Ddwf);
|
|
|
|
|
2020-06-29 17:59:52 +01:00
|
|
|
Level1Op LDOp (*Coarse5d,0);
|
|
|
|
|
|
|
|
std::cout<<GridLogMessage << " Callinig Coarsen the operator " <<std::endl;
|
2020-06-23 15:24:21 +01:00
|
|
|
LDOp.CoarsenOperator(FGrid,LinOpDwf,Aggregates5D);
|
|
|
|
|
2020-06-29 17:59:52 +01:00
|
|
|
std::cout<<GridLogMessage << "**************************************************"<< std::endl;
|
|
|
|
std::cout<<GridLogMessage << "Coarse CG unprec "<< std::endl;
|
|
|
|
std::cout<<GridLogMessage << "**************************************************"<< std::endl;
|
|
|
|
|
|
|
|
CoarseVector c_src(Coarse5d); c_src=1.0;
|
|
|
|
CoarseVector c_res(Coarse5d);
|
|
|
|
|
|
|
|
LatticeFermion f_src(FGrid); f_src=1.0;
|
|
|
|
LatticeFermion f_res(FGrid);
|
|
|
|
|
|
|
|
RealD tol=1.0e-8;
|
|
|
|
int MaxIt = 10000;
|
|
|
|
|
|
|
|
MdagMLinearOperator<Level1Op,CoarseVector> CoarseMdagM(LDOp);
|
|
|
|
BiCGSTAB<CoarseVector> CoarseBiCGSTAB(tol,MaxIt);
|
|
|
|
ConjugateGradient<CoarseVector> CoarseCG(tol,MaxIt);
|
|
|
|
|
|
|
|
c_res=Zero();
|
|
|
|
CoarseCG(CoarseMdagM,c_src,c_res);
|
|
|
|
|
2020-06-23 15:24:21 +01:00
|
|
|
std::cout<<GridLogMessage << "**************************************************"<< std::endl;
|
|
|
|
std::cout<<GridLogMessage << " Solve " <<std::endl;
|
|
|
|
std::cout<<GridLogMessage << "**************************************************"<< std::endl;
|
|
|
|
|
|
|
|
LatticeFermion src(FGrid); gaussian(RNG5,src);
|
|
|
|
LatticeFermion result(FGrid);
|
|
|
|
|
|
|
|
std::cout<<GridLogMessage << "**************************************************"<< std::endl;
|
|
|
|
std::cout<<GridLogMessage << "Done "<< std::endl;
|
|
|
|
std::cout<<GridLogMessage << "**************************************************"<< std::endl;
|
|
|
|
Grid_finalize();
|
|
|
|
|
|
|
|
}
|