Lines Matching full:k
14 CeedScalar M[p * p], K[p * p], X[p * p], lambda[p]; in main() local
28 for (int k = 0; k < q; k++) { in main() local
29 sum_m += interpolation[p * k + i] * quadrature_weights[k] * interpolation[p * k + j]; in main()
30 sum_k += gradient[p * k + i] * quadrature_weights[k] * gradient[p * k + j]; in main()
33 K[p * i + j] = sum_k; in main()
37 CeedSimultaneousDiagonalization(ceed, K, M, X, lambda, p); in main()
44 for (int k = 0; k < p; k++) sum += M[p * i + k] * X[p * k + j]; in main() local
51 for (int k = 0; k < p; k++) sum += X[p * k + i] * work_array[p * k + j]; in main() local
65 // Check X^T K X = Lambda in main()
69 for (int k = 0; k < p; k++) sum += K[p * i + k] * X[p * k + j]; in main() local
76 for (int k = 0; k < p; k++) sum += X[p * k + i] * work_array[p * k + j]; in main() local
77 K[p * i + j] = sum; in main()
82 if (fabs(K[p * i + j] - (i == j ? lambda[i] : 0.0)) > 1e3 * CEED_EPSILON) { in main()
84 …printf("Error in diagonalization of K [%" CeedInt_FMT ", %" CeedInt_FMT "]: %f != %f\n", i, j, K[p… in main()