xref: /libCEED/tests/t321-basis.c (revision 4fee36f0a30516a0b5ad51bf7eb3b32d83efd623)
152bfb9bbSJeremy L Thompson /// @file
252bfb9bbSJeremy L Thompson /// Test interpolation with a 2D Simplex non-tensor H1 basis
352bfb9bbSJeremy L Thompson /// \test Test interpolaton with a 2D Simplex non-tensor H1 basis
452bfb9bbSJeremy L Thompson #include <ceed.h>
552bfb9bbSJeremy L Thompson #include <math.h>
62b730f8bSJeremy L Thompson 
752bfb9bbSJeremy L Thompson #include "t320-basis.h"
852bfb9bbSJeremy L Thompson 
92b730f8bSJeremy L Thompson // polynomial eval helper
10*4fee36f0SJeremy L Thompson static CeedScalar Eval(CeedScalar x1, CeedScalar x2) { return x1 * x1 + x2 * x2 + x1 * x2 + 1; }
1152bfb9bbSJeremy L Thompson 
122b730f8bSJeremy L Thompson // main test
1352bfb9bbSJeremy L Thompson int main(int argc, char **argv) {
1452bfb9bbSJeremy L Thompson   Ceed          ceed;
15*4fee36f0SJeremy L Thompson   CeedVector    u, v;
16*4fee36f0SJeremy L Thompson   const CeedInt p = 6, q = 4, dim = 2;
17*4fee36f0SJeremy L Thompson   CeedBasis     basis;
18*4fee36f0SJeremy L Thompson   CeedScalar    q_ref[dim * q], q_weight[q];
19*4fee36f0SJeremy L Thompson   CeedScalar    interp[p * q], grad[dim * p * q];
20*4fee36f0SJeremy L Thompson   CeedScalar    x_q[]   = {0.2, 0.6, 1. / 3., 0.2, 0.2, 0.2, 1. / 3., 0.6};
21*4fee36f0SJeremy 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 
25*4fee36f0SJeremy L Thompson   CeedVectorCreate(ceed, p, &u);
26*4fee36f0SJeremy L Thompson   {
27*4fee36f0SJeremy L Thompson     CeedScalar u_array[p];
2852bfb9bbSJeremy L Thompson 
2952bfb9bbSJeremy L Thompson     // Interpolate function to quadrature points
30*4fee36f0SJeremy L Thompson     for (int i = 0; i < p; i++) u_array[i] = Eval(x_ref[0 * p + i], x_ref[1 * p + i]);
31*4fee36f0SJeremy L Thompson     CeedVectorSetArray(u, CEED_MEM_HOST, CEED_COPY_VALUES, u_array);
32*4fee36f0SJeremy L Thompson   }
33*4fee36f0SJeremy L Thompson   CeedVectorCreate(ceed, q, &v);
34*4fee36f0SJeremy L Thompson   CeedVectorSetValue(v, 0);
3552bfb9bbSJeremy L Thompson 
36*4fee36f0SJeremy L Thompson   Build2DSimplex(q_ref, q_weight, interp, grad);
37*4fee36f0SJeremy L Thompson   CeedBasisCreateH1(ceed, CEED_TOPOLOGY_TRIANGLE, 1, p, q, interp, grad, q_ref, q_weight, &basis);
3852bfb9bbSJeremy L Thompson 
39*4fee36f0SJeremy L Thompson   CeedBasisApply(basis, 1, CEED_NOTRANSPOSE, CEED_EVAL_INTERP, u, v);
4052bfb9bbSJeremy L Thompson 
4152bfb9bbSJeremy L Thompson   // Check values at quadrature points
42*4fee36f0SJeremy L Thompson   {
43*4fee36f0SJeremy L Thompson     const CeedScalar *v_array;
4452bfb9bbSJeremy L Thompson 
45*4fee36f0SJeremy L Thompson     CeedVectorGetArrayRead(v, CEED_MEM_HOST, &v_array);
46*4fee36f0SJeremy L Thompson     for (int i = 0; i < q; i++) {
47*4fee36f0SJeremy L Thompson       CeedScalar fx = Eval(x_q[0 * q + i], x_q[1 * q + i]);
48*4fee36f0SJeremy L Thompson       if (fabs(v_array[i] - fx) > 100. * CEED_EPSILON) printf("[%" CeedInt_FMT "] %f != %f\n", i, v_array[i], fx);
49*4fee36f0SJeremy L Thompson     }
50*4fee36f0SJeremy L Thompson     CeedVectorRestoreArrayRead(v, &v_array);
51*4fee36f0SJeremy L Thompson   }
52*4fee36f0SJeremy L Thompson 
53*4fee36f0SJeremy L Thompson   CeedVectorDestroy(&u);
54*4fee36f0SJeremy L Thompson   CeedVectorDestroy(&v);
55*4fee36f0SJeremy L Thompson   CeedBasisDestroy(&basis);
5652bfb9bbSJeremy L Thompson   CeedDestroy(&ceed);
5752bfb9bbSJeremy L Thompson   return 0;
5852bfb9bbSJeremy L Thompson }
59