1*db2becc9SJeremy L Thompson /// @file
2*db2becc9SJeremy L Thompson /// Test integration ApplyAdd with a 2D Simplex non-tensor H^1 basis
3*db2becc9SJeremy L Thompson /// \test Test integration ApplyAdd with a 2D Simplex non-tensor H^1 basis
4*db2becc9SJeremy L Thompson #include <ceed.h>
5*db2becc9SJeremy L Thompson #include <math.h>
6*db2becc9SJeremy L Thompson #include <stdio.h>
7*db2becc9SJeremy L Thompson
8*db2becc9SJeremy L Thompson #include "t320-basis.h"
9*db2becc9SJeremy L Thompson
10*db2becc9SJeremy L Thompson // main test
main(int argc,char ** argv)11*db2becc9SJeremy L Thompson int main(int argc, char **argv) {
12*db2becc9SJeremy L Thompson Ceed ceed;
13*db2becc9SJeremy L Thompson CeedVector u, v, u_q, v_q, w_q;
14*db2becc9SJeremy L Thompson const CeedInt p = 6, q = 4, dim = 2;
15*db2becc9SJeremy L Thompson CeedBasis basis;
16*db2becc9SJeremy L Thompson CeedScalar q_ref[dim * q], q_weight[q];
17*db2becc9SJeremy L Thompson CeedScalar interp[p * q], grad[dim * p * q];
18*db2becc9SJeremy L Thompson
19*db2becc9SJeremy L Thompson CeedInit(argv[1], &ceed);
20*db2becc9SJeremy L Thompson
21*db2becc9SJeremy L Thompson CeedVectorCreate(ceed, p, &u);
22*db2becc9SJeremy L Thompson CeedVectorCreate(ceed, p, &v);
23*db2becc9SJeremy L Thompson CeedVectorSetValue(u, 1.0);
24*db2becc9SJeremy L Thompson CeedVectorSetValue(v, 0.0);
25*db2becc9SJeremy L Thompson CeedVectorCreate(ceed, q, &u_q);
26*db2becc9SJeremy L Thompson CeedVectorCreate(ceed, q, &v_q);
27*db2becc9SJeremy L Thompson CeedVectorCreate(ceed, q, &w_q);
28*db2becc9SJeremy L Thompson
29*db2becc9SJeremy L Thompson Build2DSimplex(q_ref, q_weight, interp, grad);
30*db2becc9SJeremy L Thompson CeedBasisCreateH1(ceed, CEED_TOPOLOGY_TRIANGLE, 1, p, q, interp, grad, q_ref, q_weight, &basis);
31*db2becc9SJeremy L Thompson
32*db2becc9SJeremy L Thompson // Compute area
33*db2becc9SJeremy L Thompson CeedBasisApply(basis, 1, CEED_NOTRANSPOSE, CEED_EVAL_INTERP, u, u_q);
34*db2becc9SJeremy L Thompson CeedBasisApply(basis, 1, CEED_NOTRANSPOSE, CEED_EVAL_WEIGHT, CEED_VECTOR_NONE, w_q);
35*db2becc9SJeremy L Thompson CeedVectorPointwiseMult(v_q, u_q, w_q);
36*db2becc9SJeremy L Thompson CeedBasisApply(basis, 1, CEED_TRANSPOSE, CEED_EVAL_INTERP, v_q, v);
37*db2becc9SJeremy L Thompson // Double area computed
38*db2becc9SJeremy L Thompson CeedBasisApplyAdd(basis, 1, CEED_TRANSPOSE, CEED_EVAL_INTERP, v_q, v);
39*db2becc9SJeremy L Thompson
40*db2becc9SJeremy L Thompson // Check area
41*db2becc9SJeremy L Thompson {
42*db2becc9SJeremy L Thompson const CeedScalar *v_array;
43*db2becc9SJeremy L Thompson CeedScalar area = 0.0;
44*db2becc9SJeremy L Thompson
45*db2becc9SJeremy L Thompson CeedVectorGetArrayRead(v, CEED_MEM_HOST, &v_array);
46*db2becc9SJeremy L Thompson for (CeedInt i = 0; i < p; i++) area += v_array[i];
47*db2becc9SJeremy L Thompson if (fabs(area - 1.0) > 1E-6) printf("Incorrect area computed %f != %f\n", area, 1.0);
48*db2becc9SJeremy L Thompson CeedVectorRestoreArrayRead(v, &v_array);
49*db2becc9SJeremy L Thompson }
50*db2becc9SJeremy L Thompson
51*db2becc9SJeremy L Thompson CeedVectorDestroy(&u);
52*db2becc9SJeremy L Thompson CeedVectorDestroy(&v);
53*db2becc9SJeremy L Thompson CeedVectorDestroy(&u_q);
54*db2becc9SJeremy L Thompson CeedVectorDestroy(&v_q);
55*db2becc9SJeremy L Thompson CeedVectorDestroy(&w_q);
56*db2becc9SJeremy L Thompson CeedBasisDestroy(&basis);
57*db2becc9SJeremy L Thompson CeedDestroy(&ceed);
58*db2becc9SJeremy L Thompson return 0;
59*db2becc9SJeremy L Thompson }
60