Home
last modified time | relevance | path

Searched refs:sum_2 (Results 1 – 10 of 10) sorted by relevance

/libCEED/tests/
H A Dt506-operator.c116 CeedScalar sum_1 = 0., sum_2 = 0.; in main() local
121 sum_2 += v_array[num_comp * i + 1]; in main()
125 …if (fabs(sum_2 - 2.) > 1000. * CEED_EPSILON) printf("Small Problem, Component 2: Computed Area %f … in main()
134 CeedScalar sum_1 = 0., sum_2 = 0.; in main() local
139 sum_2 += v_array[num_comp * i + 1]; in main()
144 …if (fabs(sum_2 - 2.) > 1000. * CEED_EPSILON) printf("Large Problem, Component 2: Computed Area %f … in main()
H A Dt502-operator.c95 CeedScalar sum_1 = 0., sum_2 = 0.; in main() local
100 sum_2 += v_array[2 * i + 1]; in main()
104 …if (fabs(sum_2 - 2.) > 1000. * CEED_EPSILON) printf("Computed Area: %f != True Area: 2.0\n", sum_2 in main()
H A Dt365-basis.c35 CeedScalar sum_1 = 0, sum_2 = 0; in main() local
96 for (CeedInt i = 0; i < num_points * dim; i++) sum_2 += u_points_array[i]; in main()
108 …if (fabs(sum_1 - 2.0 * sum_2) > tol) printf("[%" CeedInt_FMT "] %f != %f\n", dim, sum_1, 2.0 * sum… in main()
H A Dt361-basis.c35 CeedScalar sum_1 = 0, sum_2 = 0; in main() local
90 for (CeedInt i = 0; i < dim * q_dim; i++) sum_2 += u_q_array[i]; in main()
102 … if (fabs(sum_1 - sum_2) > tol) printf("[%" CeedInt_FMT "] %0.12f != %0.12f\n", dim, sum_1, sum_2); in main()
H A Dt315-basis.c35 CeedScalar sum_1 = 0, sum_2 = 0; in main() local
88 for (CeedInt i = 0; i < dim * q_dim; i++) sum_2 += u_q_array[i]; in main()
100 if (fabs(sum_1 - sum_2) > tol) printf("[%" CeedInt_FMT "] %f != %f\n", dim, sum_1, sum_2); in main()
H A Dt314-basis.c35 CeedScalar sum_1 = 0, sum_2 = 0; in main() local
88 for (CeedInt i = 0; i < dim * q_dim; i++) sum_2 += u_q_array[i]; in main()
100 … if (fabs(sum_1 - sum_2) > tol) printf("[%" CeedInt_FMT "] %0.12f != %0.12f\n", dim, sum_1, sum_2); in main()
H A Dt507-operator.c96 CeedScalar sum_1 = 0., sum_2 = 0.; in main() local
101 sum_2 += v_array[2 * i + 1]; in main()
105 …if (fabs(sum_2 - 2.) > 1000. * CEED_EPSILON) printf("Computed Area: %f != True Area: 2.0\n", sum_2 in main()
H A Dt357-basis.c35 CeedScalar sum_1 = 0, sum_2 = 0; in main() local
94 for (CeedInt i = 0; i < num_points * dim; i++) sum_2 += u_points_array[i]; in main()
106 if (fabs(sum_1 - sum_2) > tol) printf("[%" CeedInt_FMT "] %f != %f\n", dim, sum_1, sum_2); in main()
H A Dt316-basis.c35 CeedScalar sum_1 = 0, sum_2 = 0; in main() local
88 for (CeedInt i = 0; i < dim * q_dim; i++) sum_2 += u_q_array[i]; in main()
100 if (fabs(sum_1 - sum_2) > tol) printf("[%" CeedInt_FMT "] %f != %f\n", dim, sum_1, sum_2); in main()
/libCEED/examples/python/
H A Dtutorial-3-basis.ipynb265 " sum_1 = sum_2 = 0\n",
308 " sum_2 += uq_array[i]\n",
311 " print('1T * G * u - uT * (GT * 1) =', np.abs(sum_1 - sum_2))"