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

Still tweaking memory saving routines in Lanczos

Browse Source
This commit is contained in:
Chulwoo Jung 2017-08-07 00:01:04 -04:00
parent 522c9248ae
commit caa6605b43
1 changed files with 2 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
lib/algorithms/iterative/ImplicitlyRestartedLanczosCJ.h
View File

@ -954,7 +954,7 @@ until convergence
// Uses more temorary // Uses more temorary
// Rotate0(Qt,evec,k1,k2,Nm); // Rotate0(Qt,evec,k1,k2,Nm);
// Uses minimal temporary, possibly with less speed // Uses minimal temporary, possibly with less speed
Rotate(Qt,evec,k1-1,k2+1,Nm); Rotate0(Qt,evec,k1-1,k2+1,Nm);
// Try if Rotate() doesn't work // Try if Rotate() doesn't work
// Rotate2(Qt,evec,k1,k2); // Rotate2(Qt,evec,k1,k2);
t1=usecond()/1e6; t1=usecond()/1e6;
@ -1010,10 +1010,8 @@ until convergence
evec[i] = B[Iconv[i]]; evec[i] = B[Iconv[i]];
} }
#else #else
Rotate(Qt,evec,0,Nk,Nm); Rotate0(Qt,evec,0,Nk,Nm);
FinalCheck( Nk, eval,evec); FinalCheck( Nk, eval,evec);
//exit(-1);
// ConvRotate2( Nk, Nm, Qt, evec, eval,eval2,Iconv,Nconv);
#endif #endif
// Skip sorting, as it doubles the memory usage(!) and can be avoided by diagonalizing "right away" // Skip sorting, as it doubles the memory usage(!) and can be avoided by diagonalizing "right away"