xref: /libCEED/tests/t567-operator.c (revision 5fb68f377259d3910de46d787b7c5d1587fd01e1)
1 /// @file
2 /// Test assembly of non-symmetric Poisson operator (multi-component)
3 /// \test Test assembly of non-symmetric Poisson operator (multi-component)
4 #include "t567-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_restriction_x, elem_restriction_u, elem_restriction_q_data;
13   CeedBasis           basis_x, basis_u;
14   CeedQFunction       qf_setup, qf_diff;
15   CeedOperator        op_setup, op_diff;
16   CeedVector          q_data, x, u, v;
17   CeedInt             p = 3, q = 3, dim = 2, num_comp = 2;
18   CeedInt             n_x = 1, n_y = 1;
19   CeedInt             num_elem = n_x * n_y;
20   CeedInt             num_dofs = (n_x * (p - 1) + 1) * (n_y * (p - 1) + 1), num_qpts = num_elem * q * q;
21   CeedInt             ind_x[num_elem * p * p];
22   CeedScalar          assembled_values[num_comp * num_comp * num_dofs * num_dofs];
23   CeedScalar          assembled_true[num_comp * num_comp * num_dofs * num_dofs];
24 
25   CeedInit(argv[1], &ceed);
26 
27   // Vectors
28   CeedVectorCreate(ceed, dim * num_dofs, &x);
29   {
30     CeedScalar x_array[dim * num_dofs];
31 
32     for (CeedInt i = 0; i < n_x * (p - 1) + 1; i++) {
33       for (CeedInt j = 0; j < n_y * (p - 1) + 1; j++) {
34         x_array[i + j * (n_x * 2 + 1) + 0 * num_dofs] = (CeedScalar)i / (n_x * (p - 1));
35         x_array[i + j * (n_x * 2 + 1) + 1 * num_dofs] = (CeedScalar)j / (n_y * (p - 1));
36       }
37     }
38     CeedVectorSetArray(x, CEED_MEM_HOST, CEED_COPY_VALUES, x_array);
39   }
40   CeedVectorCreate(ceed, num_comp * num_dofs, &u);
41   CeedVectorCreate(ceed, num_comp * num_dofs, &v);
42   CeedVectorCreate(ceed, num_qpts * dim * (dim + 1) / 2, &q_data);
43 
44   // Restrictions
45   for (CeedInt i = 0; i < num_elem; i++) {
46     CeedInt col, row, offset;
47     col    = i % n_x;
48     row    = i / n_x;
49     offset = col * (p - 1) + row * (n_x * (p - 1) + 1) * (p - 1);
50     for (CeedInt j = 0; j < p; j++) {
51       for (CeedInt k = 0; k < p; k++) ind_x[p * (p * i + k) + j] = offset + k * p + j;
52     }
53   }
54   CeedElemRestrictionCreate(ceed, num_elem, p * p, dim, num_dofs, dim * num_dofs, CEED_MEM_HOST, CEED_USE_POINTER, ind_x, &elem_restriction_x);
55   CeedElemRestrictionCreate(ceed, num_elem, p * p, num_comp, num_dofs, num_comp * num_dofs, CEED_MEM_HOST, CEED_USE_POINTER, ind_x,
56                             &elem_restriction_u);
57 
58   CeedInt strides_q_data[3] = {1, q * q * num_elem, q * q};
59   CeedElemRestrictionCreateStrided(ceed, num_elem, q * q, dim * (dim + 1) / 2, num_qpts * dim * (dim + 1) / 2, strides_q_data,
60                                    &elem_restriction_q_data);
61 
62   // Bases
63   CeedBasisCreateTensorH1Lagrange(ceed, dim, dim, p, q, CEED_GAUSS, &basis_x);
64   CeedBasisCreateTensorH1Lagrange(ceed, dim, num_comp, p, q, CEED_GAUSS, &basis_u);
65 
66   // QFunctions
67   CeedQFunctionCreateInterior(ceed, 1, setup, setup_loc, &qf_setup);
68   CeedQFunctionAddInput(qf_setup, "weight", 1, CEED_EVAL_WEIGHT);
69   CeedQFunctionAddInput(qf_setup, "dx", dim * dim, CEED_EVAL_GRAD);
70   CeedQFunctionAddOutput(qf_setup, "qdata", dim * (dim + 1) / 2, CEED_EVAL_NONE);
71 
72   CeedQFunctionCreateInterior(ceed, 1, diff, diff_loc, &qf_diff);
73   CeedQFunctionAddInput(qf_diff, "qdata", dim * (dim + 1) / 2, CEED_EVAL_NONE);
74   CeedQFunctionAddInput(qf_diff, "u", num_comp * dim, CEED_EVAL_GRAD);
75   CeedQFunctionAddOutput(qf_diff, "v", num_comp * dim, CEED_EVAL_GRAD);
76 
77   // Operators
78   CeedOperatorCreate(ceed, qf_setup, CEED_QFUNCTION_NONE, CEED_QFUNCTION_NONE, &op_setup);
79   CeedOperatorSetField(op_setup, "weight", CEED_ELEMRESTRICTION_NONE, basis_x, CEED_VECTOR_NONE);
80   CeedOperatorSetField(op_setup, "dx", elem_restriction_x, basis_x, CEED_VECTOR_ACTIVE);
81   CeedOperatorSetField(op_setup, "qdata", elem_restriction_q_data, CEED_BASIS_COLLOCATED, CEED_VECTOR_ACTIVE);
82 
83   CeedOperatorCreate(ceed, qf_diff, CEED_QFUNCTION_NONE, CEED_QFUNCTION_NONE, &op_diff);
84   CeedOperatorSetField(op_diff, "qdata", elem_restriction_q_data, CEED_BASIS_COLLOCATED, q_data);
85   CeedOperatorSetField(op_diff, "u", elem_restriction_u, basis_u, CEED_VECTOR_ACTIVE);
86   CeedOperatorSetField(op_diff, "v", elem_restriction_u, basis_u, CEED_VECTOR_ACTIVE);
87 
88   // Apply Setup Operator
89   CeedOperatorApply(op_setup, x, q_data, CEED_REQUEST_IMMEDIATE);
90 
91   // Fuly assemble operator
92   CeedSize   num_entries;
93   CeedInt   *rows;
94   CeedInt   *cols;
95   CeedVector assembled;
96 
97   for (CeedInt k = 0; k < num_comp * num_comp * num_dofs * num_dofs; k++) {
98     assembled_values[k] = 0.0;
99     assembled_true[k]   = 0.0;
100   }
101   CeedOperatorLinearAssembleSymbolic(op_diff, &num_entries, &rows, &cols);
102   CeedVectorCreate(ceed, num_entries, &assembled);
103   CeedOperatorLinearAssemble(op_diff, assembled);
104   {
105     const CeedScalar *assembled_array;
106 
107     CeedVectorGetArrayRead(assembled, CEED_MEM_HOST, &assembled_array);
108     for (CeedInt k = 0; k < num_entries; k++) assembled_values[rows[k] * num_comp * num_dofs + cols[k]] += assembled_array[k];
109     CeedVectorRestoreArrayRead(assembled, &assembled_array);
110   }
111 
112   // Manually assemble operator
113   CeedInt old_index = -1;
114 
115   CeedVectorSetValue(u, 0.0);
116   for (CeedInt comp_in = 0; comp_in < num_comp; comp_in++) {
117     for (CeedInt node_in = 0; node_in < num_dofs; node_in++) {
118       CeedScalar       *u_array;
119       const CeedScalar *v_array;
120 
121       // Set input
122       CeedVectorGetArray(u, CEED_MEM_HOST, &u_array);
123       CeedInt ind  = node_in + comp_in * num_dofs;
124       u_array[ind] = 1.0;
125       if (ind > 0) u_array[old_index] = 0.0;
126       old_index = ind;
127       CeedVectorRestoreArray(u, &u_array);
128 
129       // Compute effect of DoF j
130       CeedOperatorApply(op_diff, u, v, CEED_REQUEST_IMMEDIATE);
131 
132       CeedVectorGetArrayRead(v, CEED_MEM_HOST, &v_array);
133       for (CeedInt k = 0; k < num_dofs * num_comp; k++) assembled_true[k * num_dofs * num_comp + ind] = v_array[k];
134       CeedVectorRestoreArrayRead(v, &v_array);
135     }
136   }
137 
138   // Check output
139   for (CeedInt node_in = 0; node_in < num_dofs; node_in++) {
140     for (CeedInt comp_in = 0; comp_in < num_comp; comp_in++) {
141       for (CeedInt node_out = 0; node_out < num_dofs; node_out++) {
142         for (CeedInt comp_out = 0; comp_out < num_comp; comp_out++) {
143           const CeedInt    index                = (node_out + comp_out * num_dofs) * num_comp + node_in + comp_in * num_dofs;
144           const CeedScalar assembled_value      = assembled_values[index];
145           const CeedScalar assembled_true_value = assembled_true[index];
146           if (fabs(assembled_value - assembled_true_value) > 100. * CEED_EPSILON) {
147             // LCOV_EXCL_START
148             printf("[(%" CeedInt_FMT ", %" CeedInt_FMT "), (%" CeedInt_FMT ", %" CeedInt_FMT ")] Error in assembly: %f != %f\n", node_out, comp_out,
149                    node_in, comp_in, assembled_value, assembled_true_value);
150             // LCOV_EXCL_STOP
151           }
152         }
153       }
154     }
155   }
156 
157   // Cleanup
158   free(rows);
159   free(cols);
160   CeedVectorDestroy(&x);
161   CeedVectorDestroy(&q_data);
162   CeedVectorDestroy(&u);
163   CeedVectorDestroy(&v);
164   CeedVectorDestroy(&assembled);
165   CeedElemRestrictionDestroy(&elem_restriction_u);
166   CeedElemRestrictionDestroy(&elem_restriction_x);
167   CeedElemRestrictionDestroy(&elem_restriction_q_data);
168   CeedBasisDestroy(&basis_u);
169   CeedBasisDestroy(&basis_x);
170   CeedQFunctionDestroy(&qf_setup);
171   CeedQFunctionDestroy(&qf_diff);
172   CeedOperatorDestroy(&op_setup);
173   CeedOperatorDestroy(&op_diff);
174   CeedDestroy(&ceed);
175   return 0;
176 }
177