xref: /libCEED/tests/t502-operator.c (revision b0d170e7bc2e5c930ee481a47eb73044935a48a4)
1 /// @file
2 /// Test creation, action, and destruction for mass matrix operator with multiple components
3 /// \test Test creation, action, and destruction for mass matrix operator with multiple components
4 #include "t502-operator.h"
5 
6 #include <ceed.h>
7 #include <math.h>
8 #include <stdlib.h>
9 
10 int main(int argc, char **argv) {
11   Ceed                ceed;
12   CeedElemRestriction elem_restr_x, elem_restr_u, elem_restr_qd_i;
13   CeedBasis           basis_x, basis_u;
14   CeedQFunction       qf_setup, qf_mass;
15   CeedOperator        op_setup, op_mass;
16   CeedVector          q_data, X, U, V;
17   CeedScalar         *hu;
18   const CeedScalar   *hv;
19   CeedInt             num_elem = 15, P = 5, Q = 8;
20   CeedInt             num_nodes_x = num_elem + 1, num_nodes_u = num_elem * (P - 1) + 1;
21   CeedInt             ind_x[num_elem * 2], ind_u[num_elem * P];
22   CeedScalar          x[num_nodes_x];
23   CeedScalar          sum_1, sum_2;
24 
25   CeedInit(argv[1], &ceed);
26 
27   for (CeedInt i = 0; i < num_nodes_x; i++) x[i] = (CeedScalar)i / (num_nodes_x - 1);
28   for (CeedInt i = 0; i < num_elem; i++) {
29     ind_x[2 * i + 0] = i;
30     ind_x[2 * i + 1] = i + 1;
31   }
32   // Restrictions
33   CeedElemRestrictionCreate(ceed, num_elem, 2, 1, 1, num_nodes_x, CEED_MEM_HOST, CEED_USE_POINTER, ind_x, &elem_restr_x);
34 
35   for (CeedInt i = 0; i < num_elem; i++) {
36     for (CeedInt j = 0; j < P; j++) {
37       ind_u[P * i + j] = 2 * (i * (P - 1) + j);
38     }
39   }
40   CeedElemRestrictionCreate(ceed, num_elem, P, 2, 1, 2 * num_nodes_u, CEED_MEM_HOST, CEED_USE_POINTER, ind_u, &elem_restr_u);
41   CeedInt strides_qd[3] = {1, Q, Q};
42   CeedElemRestrictionCreateStrided(ceed, num_elem, Q, 1, Q * num_elem, strides_qd, &elem_restr_qd_i);
43 
44   // Bases
45   CeedBasisCreateTensorH1Lagrange(ceed, 1, 1, 2, Q, CEED_GAUSS, &basis_x);
46   CeedBasisCreateTensorH1Lagrange(ceed, 1, 2, P, Q, CEED_GAUSS, &basis_u);
47 
48   // QFunctions
49   CeedQFunctionCreateInterior(ceed, 1, setup, setup_loc, &qf_setup);
50   CeedQFunctionAddInput(qf_setup, "weight", 1, CEED_EVAL_WEIGHT);
51   CeedQFunctionAddInput(qf_setup, "dx", 1 * 1, CEED_EVAL_GRAD);
52   CeedQFunctionAddOutput(qf_setup, "rho", 1, CEED_EVAL_NONE);
53 
54   CeedQFunctionCreateInterior(ceed, 1, mass, mass_loc, &qf_mass);
55   CeedQFunctionAddInput(qf_mass, "rho", 1, CEED_EVAL_NONE);
56   CeedQFunctionAddInput(qf_mass, "u", 2, CEED_EVAL_INTERP);
57   CeedQFunctionAddOutput(qf_mass, "v", 2, CEED_EVAL_INTERP);
58 
59   // Operators
60   CeedOperatorCreate(ceed, qf_setup, CEED_QFUNCTION_NONE, CEED_QFUNCTION_NONE, &op_setup);
61 
62   CeedOperatorCreate(ceed, qf_mass, CEED_QFUNCTION_NONE, CEED_QFUNCTION_NONE, &op_mass);
63 
64   CeedVectorCreate(ceed, num_nodes_x, &X);
65   CeedVectorSetArray(X, CEED_MEM_HOST, CEED_USE_POINTER, x);
66   CeedVectorCreate(ceed, num_elem * Q, &q_data);
67 
68   CeedOperatorSetField(op_setup, "weight", CEED_ELEMRESTRICTION_NONE, basis_x, CEED_VECTOR_NONE);
69   CeedOperatorSetField(op_setup, "dx", elem_restr_x, basis_x, CEED_VECTOR_ACTIVE);
70   CeedOperatorSetField(op_setup, "rho", elem_restr_qd_i, CEED_BASIS_COLLOCATED, CEED_VECTOR_ACTIVE);
71 
72   CeedOperatorSetField(op_mass, "rho", elem_restr_qd_i, CEED_BASIS_COLLOCATED, q_data);
73   CeedOperatorSetField(op_mass, "u", elem_restr_u, basis_u, CEED_VECTOR_ACTIVE);
74   CeedOperatorSetField(op_mass, "v", elem_restr_u, basis_u, CEED_VECTOR_ACTIVE);
75 
76   CeedOperatorApply(op_setup, X, q_data, CEED_REQUEST_IMMEDIATE);
77 
78   CeedVectorCreate(ceed, 2 * num_nodes_u, &U);
79   CeedVectorGetArrayWrite(U, CEED_MEM_HOST, &hu);
80   for (int i = 0; i < num_nodes_u; i++) {
81     hu[2 * i]     = 1.0;
82     hu[2 * i + 1] = 2.0;
83   }
84   CeedVectorRestoreArray(U, &hu);
85   CeedVectorCreate(ceed, 2 * num_nodes_u, &V);
86   CeedOperatorApply(op_mass, U, V, CEED_REQUEST_IMMEDIATE);
87 
88   // Check output
89   CeedVectorGetArrayRead(V, CEED_MEM_HOST, &hv);
90   sum_1 = 0.;
91   sum_2 = 0.;
92   for (CeedInt i = 0; i < num_nodes_u; i++) {
93     sum_1 += hv[2 * i];
94     sum_2 += hv[2 * i + 1];
95   }
96   if (fabs(sum_1 - 1.) > 1000. * CEED_EPSILON) printf("Computed Area: %f != True Area: 1.0\n", sum_1);
97   if (fabs(sum_2 - 2.) > 1000. * CEED_EPSILON) printf("Computed Area: %f != True Area: 2.0\n", sum_2);
98   CeedVectorRestoreArrayRead(V, &hv);
99 
100   CeedQFunctionDestroy(&qf_setup);
101   CeedQFunctionDestroy(&qf_mass);
102   CeedOperatorDestroy(&op_setup);
103   CeedOperatorDestroy(&op_mass);
104   CeedElemRestrictionDestroy(&elem_restr_u);
105   CeedElemRestrictionDestroy(&elem_restr_x);
106   CeedElemRestrictionDestroy(&elem_restr_qd_i);
107   CeedBasisDestroy(&basis_u);
108   CeedBasisDestroy(&basis_x);
109   CeedVectorDestroy(&X);
110   CeedVectorDestroy(&U);
111   CeedVectorDestroy(&V);
112   CeedVectorDestroy(&q_data);
113   CeedDestroy(&ceed);
114   return 0;
115 }
116