portelli/Grid
1
0
Fork 0
mirror of https://github.com/paboyle/Grid.git synced 2026-08-16 15:39:36 +01:00
Code Releases Activity

Updates for thrust

Browse Source
This commit is contained in:
Peter Boyle
2026-08-14 18:21:45 -04:00
parent 3ec90803ac
commit 7c9a6d354e
2 changed files with 10 additions and 4 deletions
Download Patch File Download Diff File Expand all files Collapse all files
Grid/algorithms/multigrid/DenseCoarseMatrix.h
+1 -1
View File
@@ -290,7 +290,7 @@ public:
Msobj m;
peekLocalSite(m, Adbg, myLcoor[ss]);
ComplexD *md = (ComplexD *)&m;
for(int i=0; i<nbasis*nbasis; i++) pk += std::norm(md[i]);
for(int i=0; i<nbasis*nbasis; i++) pk += md[i].real()*md[i].real() + md[i].imag()*md[i].imag();
}
RealD gpk = pk;
grid->GlobalSumVector(&gpk, 1);
Grid/algorithms/multigrid/RecursiveSchurInverse.h
+9 -3
View File
@@ -313,10 +313,14 @@ public:
uint64_t len = (uint64_t)X.rows*w;
std::vector<ComplexD> h(len);
acceleratorCopyFromDevice(X.ColumnWindow(col0), &h[0], len*sizeof(ComplexD));
// Member real()/imag(): portable across std::complex (CPU) and
// thrust::complex (HIP), where std::norm does not resolve.
double s = 0.0;
for(uint64_t i=0; i<len; i++)
{
s += std::norm(h[i]);
double re = h[i].real();
double im = h[i].imag();
s += re*re + im*im;
}
return s;
}
@@ -366,9 +370,11 @@ public:
double mx = 0.0;
for(uint64_t i=0; i<len; i++)
{
mx = std::max(mx, std::abs(h[i]));
double re = h[i].real();
double im = h[i].imag();
mx = std::max(mx, re*re + im*im);
}
telLeafMaxInv = std::max(telLeafMaxInv, mx);
telLeafMaxInv = std::max(telLeafMaxInv, std::sqrt(mx));
}
}