1 /// @file 2 /// Test creation, action, and destruction for mass matrix operator at points 3 /// \test Test creation, action, and destruction for mass matrix operator at points 4 #include "t591-operator.h" 5 6 #include <ceed.h> 7 #include <math.h> 8 #include <stdio.h> 9 #include <stdlib.h> 10 11 int main(int argc, char **argv) { 12 Ceed ceed; 13 CeedInt num_elem_1d = 3, num_elem = num_elem_1d * num_elem_1d, dim = 2, p = 3, q = 5; 14 CeedInt num_nodes = (num_elem_1d * (p - 1) + 1) * (num_elem_1d * (p - 1) + 1), num_points_per_elem = 4, num_points = num_elem * num_points_per_elem; 15 CeedVector x_points, x_elem, q_data, u, v; 16 CeedElemRestriction elem_restriction_x_points, elem_restriction_q_data, elem_restriction_x, elem_restriction_u; 17 CeedBasis basis_x, basis_u; 18 CeedQFunction qf_setup, qf_mass; 19 CeedOperator op_setup, op_mass; 20 21 CeedInit(argv[1], &ceed); 22 23 // Point reference coordinates 24 CeedVectorCreate(ceed, dim * num_points, &x_points); 25 { 26 CeedScalar x_array[dim * num_points]; 27 28 for (CeedInt e = 0; e < num_elem; e++) { 29 for (CeedInt d = 0; d < dim; d++) { 30 x_array[num_points_per_elem * (e * dim + d) + 0] = 0.25; 31 x_array[num_points_per_elem * (e * dim + d) + 1] = d == 0 ? -0.25 : 0.25; 32 x_array[num_points_per_elem * (e * dim + d) + 2] = d == 0 ? 0.25 : -0.25; 33 x_array[num_points_per_elem * (e * dim + d) + 3] = 0.25; 34 } 35 } 36 CeedVectorSetArray(x_points, CEED_MEM_HOST, CEED_COPY_VALUES, x_array); 37 } 38 { 39 CeedInt ind_x[num_elem + 1 + num_points]; 40 41 for (CeedInt i = 0; i <= num_elem; i++) ind_x[i] = num_elem + 1 + i * num_points_per_elem; 42 for (CeedInt i = 0; i < num_points; i++) ind_x[num_elem + 1 + i] = i; 43 CeedElemRestrictionCreateAtPoints(ceed, num_elem, num_points, dim, num_points * dim, CEED_MEM_HOST, CEED_COPY_VALUES, ind_x, 44 &elem_restriction_x_points); 45 CeedElemRestrictionCreateAtPoints(ceed, num_elem, num_points, 1, num_points, CEED_MEM_HOST, CEED_COPY_VALUES, ind_x, &elem_restriction_q_data); 46 } 47 48 // Q data 49 CeedVectorCreate(ceed, num_points, &q_data); 50 51 // Cell coordinates 52 { 53 CeedInt p = 2, num_nodes = (num_elem_1d * (p - 1) + 1) * (num_elem_1d * (p - 1) + 1); 54 CeedInt ind_x[num_elem * p * p]; 55 56 for (CeedInt e = 0; e < num_elem; e++) { 57 CeedInt elem_xy[2] = {1, 1}, n_d[2] = {0, 0}; 58 59 for (CeedInt d = 0; d < dim; d++) n_d[d] = num_elem_1d * (p - 1) + 1; 60 { 61 CeedInt r_e = e; 62 63 for (CeedInt d = 0; d < dim; d++) { 64 elem_xy[d] = r_e % num_elem_1d; 65 r_e /= num_elem_1d; 66 } 67 } 68 CeedInt num_nodes_in_elem = p * p, *elem_nodes = ind_x + e * num_nodes_in_elem; 69 70 for (CeedInt n = 0; n < num_nodes_in_elem; n++) { 71 CeedInt g_node = 0, g_node_stride = 1, r_node = n; 72 73 for (CeedInt d = 0; d < dim; d++) { 74 g_node += (elem_xy[d] * (p - 1) + r_node % p) * g_node_stride; 75 g_node_stride *= n_d[d]; 76 r_node /= p; 77 } 78 elem_nodes[n] = p * g_node; 79 } 80 } 81 CeedElemRestrictionCreate(ceed, num_elem, p * p, dim, 1, dim * num_nodes, CEED_MEM_HOST, CEED_COPY_VALUES, ind_x, &elem_restriction_x); 82 CeedVectorCreate(ceed, dim * num_nodes, &x_elem); 83 { 84 CeedScalar x_array[dim * num_nodes]; 85 86 for (CeedInt i = 0; i <= num_elem_1d; i++) { 87 for (CeedInt j = 0; j <= num_elem_1d; j++) { 88 x_array[(i * (num_elem_1d + 1) + j) * dim + 0] = j; 89 x_array[(i * (num_elem_1d + 1) + j) * dim + 1] = i; 90 } 91 } 92 CeedVectorSetArray(x_elem, CEED_MEM_HOST, CEED_COPY_VALUES, x_array); 93 } 94 } 95 96 CeedBasisCreateTensorH1Lagrange(ceed, dim, dim, 2, q, CEED_GAUSS, &basis_x); 97 98 // Cell solution 99 { 100 CeedInt ind_u[num_elem * p * p]; 101 102 for (CeedInt e = 0; e < num_elem; e++) { 103 CeedInt elem_xy[2] = {1, 1}, n_d[2] = {0, 0}; 104 105 for (CeedInt d = 0; d < dim; d++) n_d[d] = num_elem_1d * (p - 1) + 1; 106 { 107 CeedInt r_e = e; 108 109 for (CeedInt d = 0; d < dim; d++) { 110 elem_xy[d] = r_e % num_elem_1d; 111 r_e /= num_elem_1d; 112 } 113 } 114 CeedInt num_nodes_in_elem = p * p, *elem_nodes = ind_u + e * num_nodes_in_elem; 115 116 for (CeedInt n = 0; n < num_nodes_in_elem; n++) { 117 CeedInt g_node = 0, g_node_stride = 1, r_node = n; 118 119 for (CeedInt d = 0; d < dim; d++) { 120 g_node += (elem_xy[d] * (p - 1) + r_node % p) * g_node_stride; 121 g_node_stride *= n_d[d]; 122 r_node /= p; 123 } 124 elem_nodes[n] = g_node; 125 } 126 } 127 CeedElemRestrictionCreate(ceed, num_elem, p * p, 1, 1, num_nodes, CEED_MEM_HOST, CEED_COPY_VALUES, ind_u, &elem_restriction_u); 128 } 129 CeedBasisCreateTensorH1Lagrange(ceed, dim, 1, p, q, CEED_GAUSS, &basis_u); 130 131 // Setup geometric scaling 132 CeedQFunctionCreateInterior(ceed, 1, setup, setup_loc, &qf_setup); 133 CeedQFunctionAddInput(qf_setup, "x", dim * dim, CEED_EVAL_GRAD); 134 CeedQFunctionAddInput(qf_setup, "weight", 1, CEED_EVAL_WEIGHT); 135 CeedQFunctionAddOutput(qf_setup, "rho", 1, CEED_EVAL_NONE); 136 137 CeedOperatorCreateAtPoints(ceed, qf_setup, CEED_QFUNCTION_NONE, CEED_QFUNCTION_NONE, &op_setup); 138 CeedOperatorSetField(op_setup, "x", elem_restriction_x, basis_x, CEED_VECTOR_ACTIVE); 139 CeedOperatorSetField(op_setup, "weight", CEED_ELEMRESTRICTION_NONE, basis_x, CEED_VECTOR_NONE); 140 CeedOperatorSetField(op_setup, "rho", elem_restriction_q_data, CEED_BASIS_NONE, CEED_VECTOR_ACTIVE); 141 CeedOperatorAtPointsSetPoints(op_setup, elem_restriction_x_points, x_points); 142 143 CeedOperatorApply(op_setup, x_elem, q_data, CEED_REQUEST_IMMEDIATE); 144 145 // Mass operator 146 CeedQFunctionCreateInterior(ceed, 1, mass, mass_loc, &qf_mass); 147 CeedQFunctionAddInput(qf_mass, "u", 1, CEED_EVAL_INTERP); 148 CeedQFunctionAddInput(qf_mass, "rho", 1, CEED_EVAL_NONE); 149 CeedQFunctionAddOutput(qf_mass, "v", 1, CEED_EVAL_INTERP); 150 151 CeedOperatorCreateAtPoints(ceed, qf_mass, CEED_QFUNCTION_NONE, CEED_QFUNCTION_NONE, &op_mass); 152 CeedOperatorSetField(op_mass, "u", elem_restriction_u, basis_u, CEED_VECTOR_ACTIVE); 153 CeedOperatorSetField(op_mass, "rho", elem_restriction_q_data, CEED_BASIS_NONE, q_data); 154 CeedOperatorSetField(op_mass, "v", elem_restriction_u, basis_u, CEED_VECTOR_ACTIVE); 155 CeedOperatorAtPointsSetPoints(op_mass, elem_restriction_x_points, x_points); 156 157 CeedVectorCreate(ceed, num_nodes, &u); 158 CeedVectorSetValue(u, 1.0); 159 CeedVectorCreate(ceed, num_nodes, &v); 160 CeedOperatorApply(op_mass, u, v, CEED_REQUEST_IMMEDIATE); 161 162 { 163 CeedScalar sum = 0.0; 164 const CeedScalar *v_array; 165 166 CeedVectorGetArrayRead(v, CEED_MEM_HOST, &v_array); 167 for (CeedInt i = 0; i < num_nodes; i++) sum += v_array[i]; 168 CeedVectorRestoreArrayRead(v, &v_array); 169 // Summing 9 reference elements 170 if (fabs(sum - 1.0 * num_elem) > CEED_EPSILON * 5e3) printf("Incorrect area computed, %f != %f\n", sum, 1.0 * num_elem); 171 } 172 173 CeedVectorDestroy(&x_points); 174 CeedVectorDestroy(&q_data); 175 CeedVectorDestroy(&x_elem); 176 CeedVectorDestroy(&u); 177 CeedVectorDestroy(&v); 178 CeedElemRestrictionDestroy(&elem_restriction_x_points); 179 CeedElemRestrictionDestroy(&elem_restriction_q_data); 180 CeedElemRestrictionDestroy(&elem_restriction_x); 181 CeedElemRestrictionDestroy(&elem_restriction_u); 182 CeedBasisDestroy(&basis_x); 183 CeedBasisDestroy(&basis_u); 184 CeedQFunctionDestroy(&qf_setup); 185 CeedQFunctionDestroy(&qf_mass); 186 CeedOperatorDestroy(&op_setup); 187 CeedOperatorDestroy(&op_mass); 188 CeedDestroy(&ceed); 189 return 0; 190 } 191