mirror of
https://github.com/paboyle/Grid.git
synced 2024-11-15 02:05:37 +00:00
change GparityDomainWallFermion to ZMobius and add command line options to read boundary phase and omega
This commit is contained in:
Yong-Chull Jang
parent
44b218a595
commit
dc6f637e70
@ -203,15 +203,6 @@ until convergence
|
||||
// additional (Nblock_m - Nblock_k) steps
|
||||
for(int b=Nblock_k; b<Nblock_m; ++b) blockwiseStep(lmd,lme,evec,f,f_copy,b);
|
||||
|
||||
//for(int k=0; k<Nm; ++k) {
|
||||
// clog << "ckpt A1: lme[" << k << "] = " << lme[0][k] << '\n';
|
||||
//}
|
||||
//for(int k=0; k<Nm; ++k) {
|
||||
// clog << "ckpt A2: lmd[" << k << "] = " << lmd[0][k] << '\n';
|
||||
//}
|
||||
|
||||
|
||||
|
||||
// getting eigenvalues
|
||||
for(int u=0; u<Nu; ++u){
|
||||
for(int k=0; k<Nm; ++k){
|
||||
@ -222,19 +213,9 @@ until convergence
|
||||
Qt = Eigen::MatrixXcd::Identity(Nm,Nm);
|
||||
diagonalize(eval2,lmd2,lme2,Nu,Nm,Nm,Qt,grid);
|
||||
|
||||
//for(int k=0; k<Nm; ++k){
|
||||
// clog << "ckpt D " << '\n';
|
||||
// clog << "eval2 [" << k << "] = " << eval2[k] << std::endl;
|
||||
//}
|
||||
|
||||
// sorting
|
||||
_sort.push(eval2,Nm);
|
||||
|
||||
//for(int k=0; k<Nm; ++k){
|
||||
// clog << "ckpt E " << '\n';
|
||||
// clog << "eval2 [" << k << "] = " << eval2[k] << std::endl;
|
||||
//}
|
||||
|
||||
// Implicitly shifted QR transformations
|
||||
Eigen::MatrixXcd BTDM = Eigen::MatrixXcd::Identity(Nm,Nm);
|
||||
Q = Eigen::MatrixXcd::Identity(Nm,Nm);
|
||||
@ -242,85 +223,21 @@ until convergence
|
||||
unpackHermitBlockTriDiagMatToEigen(lmd,lme,Nu,Nblock_m,Nm,Nm,BTDM);
|
||||
|
||||
for(int ip=Nk; ip<Nm; ++ip){
|
||||
//clog << "ckpt B1: shift[" << ip << "] = " << eval2[ip] << endl;
|
||||
//for (int i=0; i<Nm; ++i) {
|
||||
// for (int j=0; j<Nm; ++j) {
|
||||
// clog << "ckpt B2: M(" << ip << ")[" << i << "," << j << "] = " << BTDM(i,j) << '\n';
|
||||
// }
|
||||
//}
|
||||
//for (int i=0; i<Nm; ++i) {
|
||||
// for (int j=0; j<Nm; ++j) {
|
||||
// clog << "ckpt B3: Q(" << ip << ")[" << i << "," << j << "] = " << Q(i,j) << '\n';
|
||||
// }
|
||||
//}
|
||||
shiftedQRDecompEigen(BTDM,Nu,Nm,eval2[ip],Q);
|
||||
}
|
||||
//BTDM = Q.adjoint()*(BTDM*Q);
|
||||
//for (int i=0; i<Nm; ++i ) {
|
||||
// for (int j=i+1; j<Nm; ++j ) {
|
||||
// BTDM(i,j) = conj(BTDM(j,i));
|
||||
// }
|
||||
// //BTDM(i,i) = real(BTDM(i,i));
|
||||
//}
|
||||
//for (int i=0; i<Nm; ++i) {
|
||||
// for (int j=0; j<Nm; ++j) {
|
||||
// clog << "ckpt B2: M(" << Nm-Nk << ")[" << i << "," << j << "] = " << BTDM(i,j) << '\n';
|
||||
// }
|
||||
//}
|
||||
//for (int i=0; i<Nm; ++i) {
|
||||
// for (int j=0; j<Nm; ++j) {
|
||||
// clog << "ckpt B3: Q(" << Nm-Nk << ")[" << i << "," << j << "] = " << Q(i,j) << '\n';
|
||||
// }
|
||||
//}
|
||||
|
||||
packHermitBlockTriDiagMatfromEigen(lmd,lme,Nu,Nblock_m,Nm,Nm,BTDM);
|
||||
|
||||
//for (int i=0; i<Nm; ++i) {
|
||||
// clog << "ckpt C1: lme[" << i << "] = " << lme[0][i] << '\n';
|
||||
//}
|
||||
//for (int i=0; i<Nm; ++i) {
|
||||
// clog << "ckpt C2: lmd[" << i << "] = " << lmd[0][i] << '\n';
|
||||
//}
|
||||
|
||||
for(int i=0; i<Nk+Nu; ++i) B[i] = 0.0;
|
||||
for(int j=0; j<Nk+Nu; ++j){
|
||||
|
||||
//int k2 = Nk+Nu;
|
||||
int k2 = Nk;
|
||||
for(int i=0; i<k2; ++i) B[i] = 0.0;
|
||||
for(int j=0; j<k2; ++j){
|
||||
for(int k=0; k<Nm; ++k){
|
||||
B[j].checkerboard = evec[k].checkerboard;
|
||||
B[j] += evec[k]*Q(k,j);
|
||||
}
|
||||
}
|
||||
for(int i=0; i<Nk+Nu; ++i) {
|
||||
evec[i] = B[i];
|
||||
//clog << "ckpt F: norm2_evec[= " << i << "]" << norm2(evec[i]) << std::endl;
|
||||
}
|
||||
|
||||
// residual vector
|
||||
#if 0 // ypj[fixme] temporary to check a case when block has one vector
|
||||
for ( int i=0; i<Nu; ++i) f_copy[i] = f[i];
|
||||
for ( int i=0; i<Nu; ++i) {
|
||||
f[i] = f_copy[0]*lme[0][Nm-Nu+i];
|
||||
for ( int j=1; j<Nu; ++j) {
|
||||
f[i] += f_copy[j]*lme[j][Nm-Nu+i];
|
||||
}
|
||||
//clog << "ckpt C (i= " << i << ")" << '\n';
|
||||
//clog << "norm2(f) = " << norm2(f[i]) << std::endl;
|
||||
}
|
||||
|
||||
// ypj[fixme] temporary to check a case when block has one vector
|
||||
// Compressed vector f and beta(k2)
|
||||
f[0] *= Q(Nm-1,Nk-1);
|
||||
f[0] += lme[0][Nk-1] * evec[Nk]; // was commented out
|
||||
std::cout<< GridLogMessage<<"ckpt D1: Q[Nm-1,Nk-1] = "<<Q(Nm-1,Nk-1)<<std::endl;
|
||||
beta_k = norm2(f[0]);
|
||||
beta_k = sqrt(beta_k);
|
||||
std::cout<< GridLogMessage<<"ckpt D2: beta(k) = "<<beta_k<<std::endl;
|
||||
|
||||
RealD betar = 1.0/beta_k;
|
||||
evec[Nk] = betar * f[0];
|
||||
lme[0][Nk-1] = beta_k;
|
||||
#else
|
||||
blockwiseStep(lmd,lme,evec,f,f_copy,Nblock_k-1);
|
||||
#endif
|
||||
for(int i=0; i<k2; ++i) evec[i] = B[i];
|
||||
|
||||
// Convergence test
|
||||
for(int u=0; u<Nu; ++u){
|
||||
@ -339,23 +256,7 @@ until convergence
|
||||
B[j] += evec[k]*Qt(k,j);
|
||||
}
|
||||
}
|
||||
//for (int k=0; k<Nk; ++k) {
|
||||
// orthogonalize(B[k],B,k);
|
||||
//}
|
||||
|
||||
//for (int i=0; i<Nk; ++i) {
|
||||
// for (int j=0; j<Nk; ++j) {
|
||||
// clog << "ckpt H1: R[" << i << "," << j << "] = " << Qt(i,j) << '\n';
|
||||
// }
|
||||
//}
|
||||
//for (int i=0; i<Nk; ++i) {
|
||||
// clog << "ckpt H2: eval2[" << i << "] = " << eval2[i] << '\n';
|
||||
//}
|
||||
|
||||
//for(int j=0; j<Nk; ++j) {
|
||||
// clog << "ckpt I: norm2_B[ " << j << "]" << norm2(B[j]) << std::endl;
|
||||
//}
|
||||
|
||||
Nconv = 0;
|
||||
for(int i=0; i<Nk; ++i){
|
||||
|
||||
@ -374,7 +275,6 @@ until convergence
|
||||
|
||||
// change the criteria as evals are supposed to be sorted, all evals smaller(larger) than Nstop should have converged
|
||||
if( (vv<eresid*eresid) && (i == Nconv) ){
|
||||
//if( (vv<eresid*eresid) ){
|
||||
Iconv[Nconv] = i;
|
||||
++Nconv;
|
||||
}
|
||||
@ -386,6 +286,22 @@ until convergence
|
||||
if( Nconv>=Nstop ){
|
||||
goto converged;
|
||||
}
|
||||
|
||||
if ( iter < MaxIter-1 ) {
|
||||
if ( Nu == 1 ) {
|
||||
// reconstruct initial vector for additional pole space
|
||||
blockwiseStep(lmd,lme,evec,f,f_copy,Nblock_k-1);
|
||||
}
|
||||
else {
|
||||
// update the first block
|
||||
for (int i=0; i<Nu; ++i) {
|
||||
//evec[i] = B[i];
|
||||
orthogonalize(evec[i],evec,i);
|
||||
}
|
||||
// restart Nblock_k steps from the first block
|
||||
for(int b=0; b<Nblock_k; ++b) blockwiseStep(lmd,lme,evec,f,f_copy,b);
|
||||
}
|
||||
}
|
||||
|
||||
} // end of iter loop
|
||||
|
||||
@ -453,11 +369,7 @@ private:
|
||||
//for (int k=L-Nu; k<L; ++k) {
|
||||
for (int k=L-Nu+u; k<L; ++k) {
|
||||
w[u] = w[u] - evec[k] * conjugate(lme[u][k]);
|
||||
//clog << "ckpt A (k= " << k+1 << ")" << '\n';
|
||||
//clog << "lme = " << lme[u][k] << '\n';
|
||||
//clog << "lme = " << conjugate(lme[u][k]) << '\n';
|
||||
}
|
||||
//clog << "norm(w) = " << norm2(w[u]) << std::endl;
|
||||
}
|
||||
}
|
||||
|
||||
@ -475,12 +387,6 @@ private:
|
||||
}
|
||||
lmd[u][L+u] = real(lmd[u][L+u]); // force diagonal to be real
|
||||
}
|
||||
//for (int u=0; u<Nu; ++u) {
|
||||
// for (int k=L; k<L+u+1; ++k) {
|
||||
// clog << "ckpt B: alphaT[" << u+L << "," << k << "] = " << lmd[u][k]
|
||||
// << ", alphaT - conj(alphaT) = " << lmd[u][k] - conjugate(lmd[k-L][u+L]) << std::endl;
|
||||
// }
|
||||
//}
|
||||
|
||||
// 5. wk:=wk−αkvk
|
||||
for (int u=0; u<Nu; ++u) {
|
||||
@ -500,11 +406,22 @@ private:
|
||||
}
|
||||
}
|
||||
|
||||
#if 0
|
||||
beta = normalize(w[0]);
|
||||
for (int u=1; u<Nu; ++u) {
|
||||
//orthogonalize(w[u],w_copy,u);
|
||||
orthogonalize(w[u],w,u);
|
||||
}
|
||||
#else
|
||||
// re-orthogonalization for numerical stability
|
||||
for (int u=0; u<Nu; ++u) {
|
||||
orthogonalize(w[u],evec,R);
|
||||
}
|
||||
// QR part
|
||||
for (int u=1; u<Nu; ++u) {
|
||||
orthogonalize(w[u],w,u);
|
||||
}
|
||||
#endif
|
||||
|
||||
for (int u=0; u<Nu; ++u) {
|
||||
//for (int v=0; v<Nu; ++v) {
|
||||
@ -523,7 +440,7 @@ private:
|
||||
std::cout << lme[u][k] << std::endl;
|
||||
}
|
||||
}
|
||||
|
||||
#if 0
|
||||
// re-orthogonalization for numerical stability
|
||||
if (b>0) {
|
||||
for (int u=0; u<Nu; ++u) {
|
||||
@ -539,6 +456,7 @@ private:
|
||||
// orthogonalize(w[u],w,u);
|
||||
// }
|
||||
//}
|
||||
#endif
|
||||
|
||||
if (b < Nm/Nu-1) {
|
||||
for (int u=0; u<Nu; ++u) {
|
||||
@ -548,7 +466,7 @@ private:
|
||||
|
||||
}
|
||||
|
||||
|
||||
|
||||
void diagonalize_Eigen(std::vector<RealD>& eval,
|
||||
std::vector<std::vector<ComplexD>>& lmd,
|
||||
std::vector<std::vector<ComplexD>>& lme,
|
||||
@ -658,43 +576,7 @@ private:
|
||||
//clog << "packHermitBlockTriDiagMatfromEigen() end" << endl;
|
||||
}
|
||||
|
||||
#if 0
|
||||
void shiftedQRDecompEigen(Eigen::MatrixXcd& M, int Nu, int Nm,
|
||||
RealD Dsh,
|
||||
Eigen::MatrixXcd& Qprod)
|
||||
{
|
||||
//clog << "shiftedQRDecompEigen() begin" << '\n';
|
||||
Eigen::MatrixXcd Mtmp = Eigen::MatrixXcd::Zero(Nm,Nm);
|
||||
Eigen::MatrixXcd Q = Eigen::MatrixXcd::Zero(Nm,Nm);
|
||||
|
||||
Mtmp = M;
|
||||
for (int i=0; i<Nm; ++i ) {
|
||||
Mtmp(i,i) = M(i,i) - Dsh;
|
||||
}
|
||||
|
||||
Eigen::HouseholderQR<Eigen::MatrixXcd> QRD(Mtmp);
|
||||
Q = QRD.householderQ();
|
||||
for (int j=0; j<Nm-2*Nu; ++j ) {
|
||||
for (int i=2*Nu+j; i<Nm; ++i ) {
|
||||
Q(i,j) = 0.;
|
||||
}
|
||||
}
|
||||
|
||||
M = Q.adjoint()*(M*Q);
|
||||
for (int i=0; i<Nm; ++i ) {
|
||||
for (int j=i+Nu; j<Nm; ++j ) {
|
||||
M(i,j) = conj(M(j,i));
|
||||
}
|
||||
}
|
||||
for (int i=0; i<Nm; ++i ) {
|
||||
M(i,i) = real(M(i,i));
|
||||
}
|
||||
|
||||
Qprod *= Q;
|
||||
//clog << "shiftedQRDecompEigen() end" << endl;
|
||||
}
|
||||
#endif
|
||||
#if 1
|
||||
// assume the input matrix M is a band matrix
|
||||
void shiftedQRDecompEigen(Eigen::MatrixXcd& M, int Nu, int Nm,
|
||||
RealD Dsh,
|
||||
@ -750,136 +632,49 @@ private:
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
//static int ntimes = 2;
|
||||
//for (int j=0; j<Nm-(ntimes*Nu); ++j) {
|
||||
// for (int i=ntimes*Nu+j; i<Nm; ++i) {
|
||||
// Mtmp(i,j) = 0.0;
|
||||
// }
|
||||
//}
|
||||
//ntimes++;
|
||||
|
||||
Qprod = Mtmp;
|
||||
|
||||
// equivalent operation of M = Q.adjoint()*(M*Q)
|
||||
//M = Eigen::MatrixXcd::Zero(Nm,Nm);
|
||||
//
|
||||
//for (int a=0, i=0, kmax=0; a<Nu+1; ++a) {
|
||||
// for (int j=0; j<Nm-a; ++j) {
|
||||
// i = j+a;
|
||||
// kmax = (Nu+1)+j;
|
||||
// if (kmax > Nm) kmax = Nm;
|
||||
// for (int k=i; k<kmax; ++k) {
|
||||
// M(i,j) += R(i,k)*Q(k,j);
|
||||
// }
|
||||
// M(j,i) = conj(M(i,j));
|
||||
// }
|
||||
//}
|
||||
|
||||
//for (int i=0; i<Nm; ++i) {
|
||||
// M(i,i) = real(M(i,i));
|
||||
//}
|
||||
Mtmp = Eigen::MatrixXcd::Zero(Nm,Nm);
|
||||
|
||||
M = Q.adjoint()*(M*Q);
|
||||
for (int a=0, i=0, kmax=0; a<Nu+1; ++a) {
|
||||
for (int j=0; j<Nm-a; ++j) {
|
||||
i = j+a;
|
||||
kmax = (Nu+1)+j;
|
||||
if (kmax > Nm) kmax = Nm;
|
||||
for (int k=i; k<kmax; ++k) {
|
||||
Mtmp(i,j) += R(i,k)*Q(k,j);
|
||||
}
|
||||
Mtmp(j,i) = conj(Mtmp(i,j));
|
||||
}
|
||||
}
|
||||
|
||||
for (int i=0; i<Nm; ++i) {
|
||||
for (int j=0; j<Nm; ++j) {
|
||||
if (i==j) M(i,i) = real(M(i,i));
|
||||
if (j>i) M(i,j) = conj(M(j,i));
|
||||
if (i-j > Nu || j-i > Nu) M(i,j) = 0.;
|
||||
}
|
||||
Mtmp(i,i) = real(Mtmp(i,i)) + Dsh;
|
||||
}
|
||||
|
||||
//clog << "shiftedQRDecompEigen() end" << endl;
|
||||
}
|
||||
#endif
|
||||
#if 0
|
||||
void shiftedQRDecompEigen(Eigen::MatrixXcd& M, int Nu, int Nm,
|
||||
RealD Dsh,
|
||||
Eigen::MatrixXcd& Qprod)
|
||||
{
|
||||
//clog << "shiftedQRDecompEigen() begin" << '\n';
|
||||
Eigen::MatrixXcd Mtmp = Eigen::MatrixXcd::Zero(Nm,Nm);
|
||||
Eigen::MatrixXcd Q = Eigen::MatrixXcd::Zero(Nm,Nm);
|
||||
|
||||
Mtmp = M;
|
||||
for (int i=0; i<Nm; ++i ) {
|
||||
Mtmp(i,i) = M(i,i) - Dsh;
|
||||
}
|
||||
|
||||
Eigen::HouseholderQR<Eigen::MatrixXcd> QRD(Mtmp);
|
||||
Q = QRD.householderQ();
|
||||
M = Mtmp;
|
||||
|
||||
M = Q.adjoint()*(M*Q);
|
||||
for (int i=0; i<Nm; ++i ) {
|
||||
for (int j=i+1; j<Nm; ++j ) {
|
||||
M(i,j) = conj(M(j,i));
|
||||
}
|
||||
}
|
||||
for (int i=0; i<Nm; ++i ) {
|
||||
M(i,i) = real(M(i,i));
|
||||
}
|
||||
|
||||
#if 1
|
||||
Qprod *= Q;
|
||||
#else
|
||||
Mtmp = Qprod*Q;
|
||||
|
||||
Eigen::HouseholderQR<Eigen::MatrixXcd> QRD2(Mtmp);
|
||||
Qprod = QRD2.householderQ();
|
||||
|
||||
Mtmp -= Qprod;
|
||||
clog << "Frobenius norm ||Qprod(after) - Qprod|| = " << Mtmp.norm() << std::endl;
|
||||
#endif
|
||||
//clog << "shiftedQRDecompEigen() end" << endl;
|
||||
}
|
||||
#endif
|
||||
#if 0
|
||||
void shiftedQRDecompEigen(Eigen::MatrixXcd& M, int Nm,
|
||||
RealD Dsh,
|
||||
Eigen::MatrixXcd& Qprod)
|
||||
{
|
||||
//clog << "shiftedQRDecompEigen() begin" << '\n';
|
||||
Eigen::MatrixXcd Mtmp = Eigen::MatrixXcd::Zero(Nm,Nm);
|
||||
//Eigen::MatrixXcd Qtmp = Eigen::MatrixXcd::Zero(Nm,Nm);
|
||||
|
||||
Mtmp = Qprod.adjoint()*(M*Qprod);
|
||||
for (int i=0; i<Nm; ++i ) {
|
||||
for (int j=i+1; j<Nm; ++j ) {
|
||||
Mtmp(i,j) = Mtmp(j,i);
|
||||
}
|
||||
}
|
||||
|
||||
for (int i=0; i<Nm; ++i ) {
|
||||
Mtmp(i,i) -= Dsh;
|
||||
//Mtmp(i,i) = real(Mtmp(i,i)-Dsh);
|
||||
}
|
||||
|
||||
Eigen::HouseholderQR<Eigen::MatrixXcd> QRD(Mtmp);
|
||||
//Qtmp = Qprod*QRD.householderQ();
|
||||
|
||||
//Eigen::HouseholderQR<Eigen::MatrixXcd> QRD2(Qtmp);
|
||||
//Qprod = QRD2.householderQ();
|
||||
|
||||
Qprod *= QRD.householderQ();
|
||||
//ComplexD p;
|
||||
//RealD r;
|
||||
|
||||
//r = 0.;
|
||||
//for (int k=0; k<Nm; ++k) r += real(conj(Qprod(k,0))*Qprod(k,0));
|
||||
//r = sqrt(r);
|
||||
//for (int k=0; k<Nm; ++k) Qprod(k,0) /= r;
|
||||
//
|
||||
//for (int i=1; i<Nm; ++i) {
|
||||
// for (int j=0; j<i; ++j) {
|
||||
// p = 0.;
|
||||
// for (int k=0; k<Nm; ++k) {
|
||||
// p += conj(Qprod(k,j))*Qprod(k,i);
|
||||
// }
|
||||
// for (int k=0; k<Nm; ++k) {
|
||||
// Qprod(k,i) -= p*Qprod(k,j);
|
||||
// }
|
||||
//M = Q.adjoint()*(M*Q);
|
||||
//for (int i=0; i<Nm; ++i) {
|
||||
// for (int j=0; j<Nm; ++j) {
|
||||
// if (i==j) M(i,i) = real(M(i,i));
|
||||
// if (j>i) M(i,j) = conj(M(j,i));
|
||||
// if (i-j > Nu || j-i > Nu) M(i,j) = 0.;
|
||||
// }
|
||||
// r = 0.;
|
||||
// for (int k=0; k<Nm; ++k) r += real(conj(Qprod(k,i))*Qprod(k,i));
|
||||
// r = sqrt(r);
|
||||
// for (int k=0; k<Nm; ++k) Qprod(k,i) /= r;
|
||||
//}
|
||||
|
||||
|
||||
//clog << "shiftedQRDecompEigen() end" << endl;
|
||||
}
|
||||
#endif
|
||||
|
||||
void exampleQRDecompEigen(void)
|
||||
{
|
||||
|
||||
1041
lib/algorithms/iterative/ImplicitlyRestartedBlockLanczos.h.bak2
Normal file
1041
lib/algorithms/iterative/ImplicitlyRestartedBlockLanczos.h.bak2
Normal file
File diff suppressed because it is too large
Load Diff
@ -31,7 +31,8 @@ using namespace std;
|
||||
using namespace Grid;
|
||||
using namespace Grid::QCD;
|
||||
|
||||
typedef typename GparityDomainWallFermionR::FermionField FermionField;
|
||||
//typedef typename GparityDomainWallFermionR::FermionField FermionField;
|
||||
typedef typename ZMobiusFermionR::FermionField FermionField;
|
||||
|
||||
RealD AllZero(RealD x){ return 0.;}
|
||||
|
||||
@ -44,6 +45,8 @@ class CmdJobParams
|
||||
double mass;
|
||||
double M5;
|
||||
double mob_b;
|
||||
std::vector<ComplexD> omega;
|
||||
std::vector<ComplexD> boundary_phase;
|
||||
|
||||
int Nu;
|
||||
int Nk;
|
||||
@ -57,7 +60,7 @@ class CmdJobParams
|
||||
int order;
|
||||
|
||||
CmdJobParams()
|
||||
: gaugefile("Hot"),
|
||||
: gaugefile("Hot"),
|
||||
Ls(8), mass(0.01), M5(1.8), mob_b(1.5),
|
||||
Nu(4), Nk(200), Np(200), Nstop(100), MaxIter(10), resid(1.0e-8),
|
||||
low(0.2), high(5.5), order(11)
|
||||
@ -71,14 +74,62 @@ void CmdJobParams::Parse(char **argv,int argc)
|
||||
{
|
||||
std::string arg;
|
||||
std::vector<int> vi;
|
||||
double re,im;
|
||||
int expect, idx;
|
||||
std::string vstr;
|
||||
std::ifstream pfile;
|
||||
|
||||
if( GridCmdOptionExists(argv,argv+argc,"--gconf") ){
|
||||
gaugefile = GridCmdOptionPayload(argv,argv+argc,"--gconf");
|
||||
}
|
||||
|
||||
if( GridCmdOptionExists(argv,argv+argc,"--Ls") ){
|
||||
arg = GridCmdOptionPayload(argv,argv+argc,"--Ls");
|
||||
GridCmdOptionInt(arg,Ls);
|
||||
if( GridCmdOptionExists(argv,argv+argc,"--phase") ){
|
||||
arg = GridCmdOptionPayload(argv,argv+argc,"--phase");
|
||||
pfile.open(arg);
|
||||
assert(pfile);
|
||||
expect = 0;
|
||||
while( pfile >> vstr ) {
|
||||
if ( vstr.compare("boundary_phase") == 0 ) {
|
||||
pfile >> vstr;
|
||||
GridCmdOptionInt(vstr,idx);
|
||||
assert(expect==idx);
|
||||
pfile >> vstr;
|
||||
GridCmdOptionFloat(vstr,re);
|
||||
pfile >> vstr;
|
||||
GridCmdOptionFloat(vstr,im);
|
||||
boundary_phase.push_back({re,im});
|
||||
expect++;
|
||||
}
|
||||
}
|
||||
pfile.close();
|
||||
} else {
|
||||
for (int i=0; i<4; ++i) boundary_phase.push_back({1.,0.});
|
||||
}
|
||||
|
||||
if( GridCmdOptionExists(argv,argv+argc,"--omega") ){
|
||||
arg = GridCmdOptionPayload(argv,argv+argc,"--omega");
|
||||
pfile.open(arg);
|
||||
assert(pfile);
|
||||
Ls = 0;
|
||||
while( pfile >> vstr ) {
|
||||
if ( vstr.compare("omega") == 0 ) {
|
||||
pfile >> vstr;
|
||||
GridCmdOptionInt(vstr,idx);
|
||||
assert(Ls==idx);
|
||||
pfile >> vstr;
|
||||
GridCmdOptionFloat(vstr,re);
|
||||
pfile >> vstr;
|
||||
GridCmdOptionFloat(vstr,im);
|
||||
omega.push_back({re,im});
|
||||
Ls++;
|
||||
}
|
||||
}
|
||||
pfile.close();
|
||||
} else {
|
||||
if( GridCmdOptionExists(argv,argv+argc,"--Ls") ){
|
||||
arg = GridCmdOptionPayload(argv,argv+argc,"--Ls");
|
||||
GridCmdOptionInt(arg,Ls);
|
||||
}
|
||||
}
|
||||
|
||||
if( GridCmdOptionExists(argv,argv+argc,"--mass") ){
|
||||
@ -127,18 +178,25 @@ void CmdJobParams::Parse(char **argv,int argc)
|
||||
}
|
||||
|
||||
if ( CartesianCommunicator::RankWorld() == 0 ) {
|
||||
clog <<" Gauge Configuration "<< gaugefile << '\n';
|
||||
clog <<" Ls "<< Ls << '\n';
|
||||
clog <<" mass "<< mass << '\n';
|
||||
clog <<" M5 "<< M5 << '\n';
|
||||
clog <<" mob_b "<< mob_b << '\n';
|
||||
clog <<" Nu "<< Nu << '\n';
|
||||
clog <<" Nk "<< Nk << '\n';
|
||||
clog <<" Np "<< Np << '\n';
|
||||
clog <<" Nstop "<< Nstop << '\n';
|
||||
clog <<" MaxIter "<< MaxIter << '\n';
|
||||
clog <<" resid "<< resid << '\n';
|
||||
clog <<" Cheby Poly "<< low << "," << high << "," << order << std::endl;
|
||||
std::streamsize ss = std::cout.precision();
|
||||
std::cout << GridLogMessage <<" Gauge Configuration "<< gaugefile << '\n';
|
||||
std::cout.precision(15);
|
||||
for ( int i=0; i<4; ++i ) std::cout << GridLogMessage <<" boundary_phase["<< i << "] = " << boundary_phase[i] << '\n';
|
||||
std::cout.precision(ss);
|
||||
std::cout << GridLogMessage <<" Ls "<< Ls << '\n';
|
||||
std::cout << GridLogMessage <<" mass "<< mass << '\n';
|
||||
std::cout << GridLogMessage <<" M5 "<< M5 << '\n';
|
||||
std::cout << GridLogMessage <<" mob_b "<< mob_b << '\n';
|
||||
std::cout.precision(15);
|
||||
for ( int i=0; i<Ls; ++i ) std::cout << GridLogMessage <<" omega["<< i << "] = " << omega[i] << '\n';
|
||||
std::cout.precision(ss);
|
||||
std::cout << GridLogMessage <<" Nu "<< Nu << '\n';
|
||||
std::cout << GridLogMessage <<" Nk "<< Nk << '\n';
|
||||
std::cout << GridLogMessage <<" Np "<< Np << '\n';
|
||||
std::cout << GridLogMessage <<" Nstop "<< Nstop << '\n';
|
||||
std::cout << GridLogMessage <<" MaxIter "<< MaxIter << '\n';
|
||||
std::cout << GridLogMessage <<" resid "<< resid << '\n';
|
||||
std::cout << GridLogMessage <<" Cheby Poly "<< low << "," << high << "," << order << std::endl;
|
||||
}
|
||||
}
|
||||
|
||||
@ -180,17 +238,21 @@ int main (int argc, char ** argv)
|
||||
|
||||
RealD mass = JP.mass;
|
||||
RealD M5 = JP.M5;
|
||||
RealD mob_b = JP.mob_b;
|
||||
// DomainWallFermionR Ddwf(Umu,*FGrid,*FrbGrid,*UGrid,*UrbGrid,mass,M5);
|
||||
GparityMobiusFermionD ::ImplParams params;
|
||||
std::vector<int> twists({1,1,1,0});
|
||||
params.twists = twists;
|
||||
GparityMobiusFermionR Ddwf(Umu,*FGrid,*FrbGrid,*UGrid,*UrbGrid,mass,M5,mob_b,mob_b-1.,params);
|
||||
// RealD mob_b = JP.mob_b; // Gparity
|
||||
// std::vector<ComplexD> omega; // ZMobius
|
||||
|
||||
// GparityMobiusFermionD ::ImplParams params;
|
||||
// std::vector<int> twists({1,1,1,0});
|
||||
// params.twists = twists;
|
||||
// GparityMobiusFermionR Ddwf(Umu,*FGrid,*FrbGrid,*UGrid,*UrbGrid,mass,M5,mob_b,mob_b-1.,params);
|
||||
// SchurDiagTwoOperator<GparityMobiusFermionR,FermionField> HermOp(Ddwf);
|
||||
|
||||
// MdagMLinearOperator<DomainWallFermionR,LatticeFermion> HermOp(Ddwf);
|
||||
// SchurDiagTwoOperator<DomainWallFermionR,LatticeFermion> HermOp(Ddwf);
|
||||
SchurDiagTwoOperator<GparityMobiusFermionR,FermionField> HermOp(Ddwf);
|
||||
// SchurDiagMooeeOperator<DomainWallFermionR,LatticeFermion> HermOp(Ddwf);
|
||||
//WilsonFermionR::ImplParams params;
|
||||
ZMobiusFermionR::ImplParams params;
|
||||
params.overlapCommsCompute = true;
|
||||
params.boundary_phases = JP.boundary_phase;
|
||||
ZMobiusFermionR Ddwf(Umu,*FGrid,*FrbGrid,*UGrid,*UrbGrid,mass,M5,JP.omega,1.,0.,params);
|
||||
SchurDiagTwoOperator<ZMobiusFermionR,FermionField> HermOp(Ddwf);
|
||||
|
||||
int Nu = JP.Nu;
|
||||
int Nk = JP.Nk;
|
||||
@ -217,7 +279,7 @@ int main (int argc, char ** argv)
|
||||
|
||||
std::vector<FermionField> evec(Nm,FrbGrid);
|
||||
for(int i=0;i<1;++i){
|
||||
clog << i <<" / "<< Nm <<" grid pointer "<< evec[i]._grid << std::endl;
|
||||
std::cout << GridLogMessage << i <<" / "<< Nm <<" grid pointer "<< evec[i]._grid << std::endl;
|
||||
};
|
||||
|
||||
int Nconv;
|
||||
|
||||
Loading…
Reference in New Issue
Block a user