10b454692Sjeremylt /// @file 20b454692Sjeremylt /// Test creation, action, and destruction for identity operator 30b454692Sjeremylt /// \test Test creation, action, and destruction for identity operator 40b454692Sjeremylt #include <ceed.h> 50b454692Sjeremylt #include <math.h> 649aac155SJeremy L Thompson #include <stdio.h> 72b730f8bSJeremy L Thompson #include <stdlib.h> 80b454692Sjeremylt 90b454692Sjeremylt int main(int argc, char **argv) { 100b454692Sjeremylt Ceed ceed; 114fee36f0SJeremy L Thompson CeedElemRestriction elem_restriction_u, elem_restriction_u_i; 120b454692Sjeremylt CeedBasis basis_u; 130b454692Sjeremylt CeedQFunction qf_identity; 140b454692Sjeremylt CeedOperator op_identity; 154fee36f0SJeremy L Thompson CeedVector u, v; 164fee36f0SJeremy L Thompson CeedInt num_elem = 15, p = 5, q = 8; 17*506b1a0cSSebastian Grimberg CeedInt num_nodes = num_elem * (p - 1) + 1; 184fee36f0SJeremy L Thompson CeedInt ind_u[num_elem * p]; 190b454692Sjeremylt 200b454692Sjeremylt CeedInit(argv[1], &ceed); 210b454692Sjeremylt 224fee36f0SJeremy L Thompson CeedVectorCreate(ceed, num_nodes, &u); 23*506b1a0cSSebastian Grimberg CeedVectorCreate(ceed, q * num_elem, &v); 244fee36f0SJeremy L Thompson 250b454692Sjeremylt // Restrictions 260b454692Sjeremylt for (CeedInt i = 0; i < num_elem; i++) { 274fee36f0SJeremy L Thompson for (CeedInt j = 0; j < p; j++) { 284fee36f0SJeremy L Thompson ind_u[p * i + j] = i * (p - 1) + j; 290b454692Sjeremylt } 300b454692Sjeremylt } 31*506b1a0cSSebastian Grimberg CeedElemRestrictionCreate(ceed, num_elem, p, 1, 1, num_nodes, CEED_MEM_HOST, CEED_USE_POINTER, ind_u, &elem_restriction_u); 324fee36f0SJeremy L Thompson 33*506b1a0cSSebastian Grimberg CeedInt strides_u_i[3] = {1, q, q}; 34*506b1a0cSSebastian Grimberg CeedElemRestrictionCreateStrided(ceed, num_elem, q, 1, q * num_elem, strides_u_i, &elem_restriction_u_i); 350b454692Sjeremylt 360b454692Sjeremylt // Bases 374fee36f0SJeremy L Thompson CeedBasisCreateTensorH1Lagrange(ceed, 1, 1, p, q, CEED_GAUSS, &basis_u); 380b454692Sjeremylt 390b454692Sjeremylt // QFunction 40*506b1a0cSSebastian Grimberg CeedQFunctionCreateIdentity(ceed, 1, CEED_EVAL_INTERP, CEED_EVAL_NONE, &qf_identity); 410b454692Sjeremylt 420b454692Sjeremylt // Operators 432b730f8bSJeremy L Thompson CeedOperatorCreate(ceed, qf_identity, CEED_QFUNCTION_NONE, CEED_QFUNCTION_NONE, &op_identity); 44*506b1a0cSSebastian Grimberg CeedOperatorSetField(op_identity, "input", elem_restriction_u, basis_u, CEED_VECTOR_ACTIVE); 45356036faSJeremy L Thompson CeedOperatorSetField(op_identity, "output", elem_restriction_u_i, CEED_BASIS_NONE, CEED_VECTOR_ACTIVE); 460b454692Sjeremylt 474fee36f0SJeremy L Thompson CeedVectorSetValue(u, 3.0); 484fee36f0SJeremy L Thompson CeedOperatorApply(op_identity, u, v, CEED_REQUEST_IMMEDIATE); 490b454692Sjeremylt 500b454692Sjeremylt // Check output 514fee36f0SJeremy L Thompson { 524fee36f0SJeremy L Thompson const CeedScalar *v_array; 530b454692Sjeremylt 544fee36f0SJeremy L Thompson CeedVectorGetArrayRead(v, CEED_MEM_HOST, &v_array); 55*506b1a0cSSebastian Grimberg for (CeedInt i = 0; i < q * num_elem; i++) { 56*506b1a0cSSebastian Grimberg if (fabs(v_array[i] - 3.) > 100. * CEED_EPSILON) printf("[%" CeedInt_FMT "] Computed Value: %f != True Value: 3.0\n", i, v_array[i]); 574fee36f0SJeremy L Thompson } 584fee36f0SJeremy L Thompson CeedVectorRestoreArrayRead(v, &v_array); 594fee36f0SJeremy L Thompson } 604fee36f0SJeremy L Thompson 614fee36f0SJeremy L Thompson CeedVectorDestroy(&u); 624fee36f0SJeremy L Thompson CeedVectorDestroy(&v); 634fee36f0SJeremy L Thompson CeedElemRestrictionDestroy(&elem_restriction_u); 644fee36f0SJeremy L Thompson CeedElemRestrictionDestroy(&elem_restriction_u_i); 654fee36f0SJeremy L Thompson CeedBasisDestroy(&basis_u); 660b454692Sjeremylt CeedQFunctionDestroy(&qf_identity); 670b454692Sjeremylt CeedOperatorDestroy(&op_identity); 680b454692Sjeremylt CeedDestroy(&ceed); 690b454692Sjeremylt return 0; 700b454692Sjeremylt } 71