Loading src/libnptm/matrix_inverse_kernel.cu +3 −3 Changes for src/libnptm/matrix_inverse_kernel.cu: 3 added lines, 3 removed lines. Original line number Diff line number Diff line Loading @@ -80,10 +80,10 @@ __global__ void lu_decompose_kernel(dd_complex* A, long long* piv, long long n) piv[max_idx] = tmp_p; } // Check that the pivot is not zero (within a threshold) #if USE_FP32 #if defined(USE_FP32) // For FLOATs: higher tolerance threshold (1e-6) if (dd_abs_squared(A[k * n + k]) < 1e-6f) { #elif USE_FP64 #elif defined(USE_FP64) // For DOUBLE: standard threshold (1e-15) if (dd_abs_squared(A[k * n + k]) < 1e-15) { #else Loading Loading @@ -430,7 +430,7 @@ void write_complex_matrix( for (long long j = 0; j < n; j++) { const dd_complex& v = A[i * n + j]; #if USE_FP32 || USE_FP64 #if defined(USE_FP32) || defined(USE_FP64) //If it is float or double standard, we directly print the variables re and im fprintf(f, "%6lld %6lld ( %16.8E, %16.8E)\n", Loading Loading
src/libnptm/matrix_inverse_kernel.cu +3 −3 Changes for src/libnptm/matrix_inverse_kernel.cu: 3 added lines, 3 removed lines. Original line number Diff line number Diff line Loading @@ -80,10 +80,10 @@ __global__ void lu_decompose_kernel(dd_complex* A, long long* piv, long long n) piv[max_idx] = tmp_p; } // Check that the pivot is not zero (within a threshold) #if USE_FP32 #if defined(USE_FP32) // For FLOATs: higher tolerance threshold (1e-6) if (dd_abs_squared(A[k * n + k]) < 1e-6f) { #elif USE_FP64 #elif defined(USE_FP64) // For DOUBLE: standard threshold (1e-15) if (dd_abs_squared(A[k * n + k]) < 1e-15) { #else Loading Loading @@ -430,7 +430,7 @@ void write_complex_matrix( for (long long j = 0; j < n; j++) { const dd_complex& v = A[i * n + j]; #if USE_FP32 || USE_FP64 #if defined(USE_FP32) || defined(USE_FP64) //If it is float or double standard, we directly print the variables re and im fprintf(f, "%6lld %6lld ( %16.8E, %16.8E)\n", Loading