portelli/Grid
1
0
Fork 0
mirror of https://github.com/paboyle/Grid.git synced 2026-05-24 11:04:17 +01:00
Code Releases Activity

modified debug output slightly

Browse Source
This commit is contained in:
Patrick Oare
2025-08-14 14:06:32 -04:00
parent 99644f5d0a
commit 3b9fc72451
1 changed files with 3 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files
Grid/algorithms/iterative/KrylovSchur.h
+3 -2
View File
@@ -288,6 +288,8 @@ class KrylovSchur {
std::cout << GridLogMessage << "*** TRUNCATING FOR RESTART *** " << std::endl; std::cout << GridLogMessage << "*** TRUNCATING FOR RESTART *** " << std::endl;
std::cout << GridLogDebug << "Rayleigh before truncation: " << std::endl << Rayleigh << std::endl;
Rayleigh = Rayleigh(Eigen::seqN(0, Nk), Eigen::seqN(0, Nk)); Rayleigh = Rayleigh(Eigen::seqN(0, Nk), Eigen::seqN(0, Nk));
basis = std::vector<Field> (basis.begin(), basis.begin() + Nk); basis = std::vector<Field> (basis.begin(), basis.begin() + Nk);
// evecs = std::vector<Field> (evecs.begin(), evecs.begin() + Nk); // evecs = std::vector<Field> (evecs.begin(), evecs.begin() + Nk);
@@ -298,8 +300,7 @@ class KrylovSchur {
checkKSDecomposition(); checkKSDecomposition();
// Compute eigensystem of Rayleigh. Note the eigenvectors correspond to the sorted eigenvalues. // Compute eigensystem of Rayleigh. Note the eigenvectors correspond to the sorted eigenvalues.
std::cout << GridLogDebug << "S: " << std::endl << S << std::endl; std::cout << GridLogDebug << "Rayleigh after truncation: " << std::endl << Rayleigh << std::endl;
// computeEigensystem(S);
computeEigensystem(Rayleigh); computeEigensystem(Rayleigh);
std::cout << GridLogMessage << "Eigenvalues (first Nk sorted): " << std::endl << evals << std::endl; std::cout << GridLogMessage << "Eigenvalues (first Nk sorted): " << std::endl << evals << std::endl;