152bfb9bbSJeremy L Thompson /// @file 252bfb9bbSJeremy L Thompson /// Test integration with a 2D Simplex non-tensor H1 basis 352bfb9bbSJeremy L Thompson /// \test Test integration with a 2D Simplex non-tensor H1 basis 452bfb9bbSJeremy L Thompson #include <ceed.h> 552bfb9bbSJeremy L Thompson #include <math.h> 6*49aac155SJeremy L Thompson #include <stdio.h> 72b730f8bSJeremy L Thompson 852bfb9bbSJeremy L Thompson #include "t320-basis.h" 952bfb9bbSJeremy L Thompson 102b730f8bSJeremy L Thompson // polynomial eval helper 114fee36f0SJeremy L Thompson static CeedScalar Eval(CeedScalar x1, CeedScalar x2) { return x1 * x1 + x2 * x2 + x1 * x2 + 1; } 1252bfb9bbSJeremy L Thompson 132b730f8bSJeremy L Thompson // main test 1452bfb9bbSJeremy L Thompson int main(int argc, char **argv) { 1552bfb9bbSJeremy L Thompson Ceed ceed; 164fee36f0SJeremy L Thompson CeedVector u, v, w; 174fee36f0SJeremy L Thompson const CeedInt p = 6, q = 4, dim = 2; 184fee36f0SJeremy L Thompson CeedBasis basis; 194fee36f0SJeremy L Thompson CeedScalar q_ref[dim * q], q_weight[q]; 204fee36f0SJeremy L Thompson CeedScalar interp[p * q], grad[dim * p * q]; 214fee36f0SJeremy L Thompson CeedScalar x_ref[] = {0., 0.5, 1., 0., 0.5, 0., 0., 0., 0., 0.5, 0.5, 1.}; 2252bfb9bbSJeremy L Thompson 2352bfb9bbSJeremy L Thompson CeedInit(argv[1], &ceed); 2452bfb9bbSJeremy L Thompson 254fee36f0SJeremy L Thompson CeedVectorCreate(ceed, p, &u); 264fee36f0SJeremy L Thompson { 274fee36f0SJeremy L Thompson CeedScalar u_array[p]; 2852bfb9bbSJeremy L Thompson 2952bfb9bbSJeremy L Thompson // Interpolate function to quadrature points 304fee36f0SJeremy L Thompson for (int i = 0; i < p; i++) u_array[i] = Eval(x_ref[0 * p + i], x_ref[1 * p + i]); 314fee36f0SJeremy L Thompson CeedVectorSetArray(u, CEED_MEM_HOST, CEED_COPY_VALUES, u_array); 324fee36f0SJeremy L Thompson } 334fee36f0SJeremy L Thompson CeedVectorCreate(ceed, q, &v); 344fee36f0SJeremy L Thompson CeedVectorSetValue(v, 0); 354fee36f0SJeremy L Thompson CeedVectorCreate(ceed, q, &w); 364fee36f0SJeremy L Thompson CeedVectorSetValue(w, 0); 3752bfb9bbSJeremy L Thompson 384fee36f0SJeremy L Thompson Build2DSimplex(q_ref, q_weight, interp, grad); 394fee36f0SJeremy L Thompson CeedBasisCreateH1(ceed, CEED_TOPOLOGY_TRIANGLE, 1, p, q, interp, grad, q_ref, q_weight, &basis); 4052bfb9bbSJeremy L Thompson 414fee36f0SJeremy L Thompson CeedBasisApply(basis, 1, CEED_NOTRANSPOSE, CEED_EVAL_INTERP, u, v); 424fee36f0SJeremy L Thompson CeedBasisApply(basis, 1, CEED_NOTRANSPOSE, CEED_EVAL_WEIGHT, CEED_VECTOR_NONE, w); 4352bfb9bbSJeremy L Thompson 4452bfb9bbSJeremy L Thompson // Check values at quadrature points 454fee36f0SJeremy L Thompson { 464fee36f0SJeremy L Thompson const CeedScalar *v_array, *w_array; 474fee36f0SJeremy L Thompson CeedScalar sum = 0; 4852bfb9bbSJeremy L Thompson 494fee36f0SJeremy L Thompson CeedVectorGetArrayRead(v, CEED_MEM_HOST, &v_array); 504fee36f0SJeremy L Thompson CeedVectorGetArrayRead(w, CEED_MEM_HOST, &w_array); 514fee36f0SJeremy L Thompson for (int i = 0; i < q; i++) sum += v_array[i] * w_array[i]; 524fee36f0SJeremy L Thompson if (fabs(sum - 17. / 24.) > 100. * CEED_EPSILON) printf("%f != %f\n", sum, 17. / 24.); 534fee36f0SJeremy L Thompson CeedVectorRestoreArrayRead(v, &v_array); 544fee36f0SJeremy L Thompson CeedVectorRestoreArrayRead(w, &w_array); 554fee36f0SJeremy L Thompson } 564fee36f0SJeremy L Thompson 574fee36f0SJeremy L Thompson CeedVectorDestroy(&u); 584fee36f0SJeremy L Thompson CeedVectorDestroy(&v); 594fee36f0SJeremy L Thompson CeedVectorDestroy(&w); 604fee36f0SJeremy L Thompson CeedBasisDestroy(&basis); 6152bfb9bbSJeremy L Thompson CeedDestroy(&ceed); 6252bfb9bbSJeremy L Thompson return 0; 6352bfb9bbSJeremy L Thompson } 64