1 /// @file 2 /// Test grad transpose with a 2D Simplex non-tensor H^1 basis 3 /// \test Test grad transpose with a 2D Simplex non-tensor H^1 basis 4 #include <ceed.h> 5 #include <math.h> 6 #include <stdio.h> 7 8 #include "t320-basis.h" 9 10 int main(int argc, char **argv) { 11 Ceed ceed; 12 CeedVector u, v; 13 const CeedInt p = 6, q = 4, dim = 2, num_comp = 3; 14 CeedBasis basis; 15 CeedScalar q_ref[dim * q], q_weight[q]; 16 CeedScalar interp[p * q], grad[dim * p * q]; 17 CeedScalar column_sum[p]; 18 19 CeedInit(argv[1], &ceed); 20 21 Build2DSimplex(q_ref, q_weight, interp, grad); 22 CeedBasisCreateH1(ceed, CEED_TOPOLOGY_TRIANGLE, num_comp, p, q, interp, grad, q_ref, q_weight, &basis); 23 24 CeedVectorCreate(ceed, q * dim * num_comp, &u); 25 { 26 CeedScalar *u_array; 27 28 CeedVectorGetArrayWrite(u, CEED_MEM_HOST, &u_array); 29 for (int d = 0; d < dim; d++) { 30 for (int i = 0; i < num_comp; i++) { 31 for (int j = 0; j < q; j++) u_array[j + (i + d * num_comp) * q] = i * 1.0; 32 } 33 } 34 CeedVectorRestoreArray(u, &u_array); 35 } 36 CeedVectorCreate(ceed, p * num_comp, &v); 37 CeedVectorSetValue(v, 0); 38 39 CeedBasisApply(basis, 1, CEED_TRANSPOSE, CEED_EVAL_GRAD, u, v); 40 41 // Check values at quadrature points 42 for (int i = 0; i < p; i++) { 43 column_sum[i] = 0; 44 for (int j = 0; j < q * dim; j++) { 45 column_sum[i] += grad[i + j * p]; 46 } 47 } 48 { 49 const CeedScalar *v_array; 50 51 CeedVectorGetArrayRead(v, CEED_MEM_HOST, &v_array); 52 for (int i = 0; i < p; i++) { 53 for (int j = 0; j < num_comp; j++) { 54 if (fabs(j * column_sum[i] - v_array[i + j * p]) > 100. * CEED_EPSILON) { 55 // LCOV_EXCL_START 56 printf("[%" CeedInt_FMT "] %f != %f\n", i, v_array[i + j * p], j * column_sum[i]); 57 // LCOV_EXCL_STOP 58 } 59 } 60 } 61 CeedVectorRestoreArrayRead(v, &v_array); 62 } 63 64 CeedVectorDestroy(&u); 65 CeedVectorDestroy(&v); 66 CeedBasisDestroy(&basis); 67 CeedDestroy(&ceed); 68 return 0; 69 } 70