1 /// @file 2 /// Test assembly of mass matrix operator QFunction at points 3 /// \test Test assembly of mass matrix operator QFunction at points 4 #include <ceed.h> 5 #include <math.h> 6 #include <stdio.h> 7 #include <stdlib.h> 8 9 #include "t591-operator.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, qf_assembled; 16 CeedElemRestriction elem_restriction_x_points, elem_restriction_q_data, elem_restriction_x, elem_restriction_u, elem_restriction_assembled; 17 CeedBasis basis_x, basis_u; 18 CeedQFunction qf_setup, qf_mass; 19 CeedOperator op_setup, op_mass; 20 bool is_at_points; 21 22 CeedInit(argv[1], &ceed); 23 24 // Point reference coordinates 25 CeedVectorCreate(ceed, dim * num_points, &x_points); 26 { 27 CeedScalar x_array[dim * num_points]; 28 29 for (CeedInt e = 0; e < num_elem; e++) { 30 for (CeedInt d = 0; d < dim; d++) { 31 x_array[num_points_per_elem * (e * dim + d) + 0] = 0.25; 32 x_array[num_points_per_elem * (e * dim + d) + 1] = d == 0 ? -0.25 : 0.25; 33 x_array[num_points_per_elem * (e * dim + d) + 2] = d == 0 ? 0.25 : -0.25; 34 x_array[num_points_per_elem * (e * dim + d) + 3] = 0.25; 35 } 36 } 37 CeedVectorSetArray(x_points, CEED_MEM_HOST, CEED_COPY_VALUES, x_array); 38 } 39 { 40 CeedInt ind_x[num_elem + 1 + num_points]; 41 42 for (CeedInt i = 0; i <= num_elem; i++) ind_x[i] = num_elem + 1 + i * num_points_per_elem; 43 for (CeedInt i = 0; i < num_points; i++) ind_x[num_elem + 1 + i] = i; 44 CeedElemRestrictionCreateAtPoints(ceed, num_elem, num_points, dim, num_points * dim, CEED_MEM_HOST, CEED_COPY_VALUES, ind_x, 45 &elem_restriction_x_points); 46 CeedElemRestrictionCreateAtPoints(ceed, num_elem, num_points, 1, num_points, CEED_MEM_HOST, CEED_COPY_VALUES, ind_x, &elem_restriction_q_data); 47 } 48 49 // Q data 50 CeedVectorCreate(ceed, num_points, &q_data); 51 52 // Cell coordinates 53 { 54 CeedInt p = 2, num_nodes = (num_elem_1d * (p - 1) + 1) * (num_elem_1d * (p - 1) + 1); 55 CeedInt ind_x[num_elem * p * p]; 56 57 for (CeedInt e = 0; e < num_elem; e++) { 58 CeedInt elem_xy[2] = {1, 1}, n_d[2] = {0, 0}; 59 60 for (CeedInt d = 0; d < dim; d++) n_d[d] = num_elem_1d * (p - 1) + 1; 61 { 62 CeedInt r_e = e; 63 64 for (CeedInt d = 0; d < dim; d++) { 65 elem_xy[d] = r_e % num_elem_1d; 66 r_e /= num_elem_1d; 67 } 68 } 69 CeedInt num_nodes_in_elem = p * p, *elem_nodes = ind_x + e * num_nodes_in_elem; 70 71 for (CeedInt n = 0; n < num_nodes_in_elem; n++) { 72 CeedInt g_node = 0, g_node_stride = 1, r_node = n; 73 74 for (CeedInt d = 0; d < dim; d++) { 75 g_node += (elem_xy[d] * (p - 1) + r_node % p) * g_node_stride; 76 g_node_stride *= n_d[d]; 77 r_node /= p; 78 } 79 elem_nodes[n] = p * g_node; 80 } 81 } 82 CeedElemRestrictionCreate(ceed, num_elem, p * p, dim, 1, dim * num_nodes, CEED_MEM_HOST, CEED_COPY_VALUES, ind_x, &elem_restriction_x); 83 CeedVectorCreate(ceed, dim * num_nodes, &x_elem); 84 { 85 CeedScalar x_array[dim * num_nodes]; 86 87 for (CeedInt i = 0; i <= num_elem_1d; i++) { 88 for (CeedInt j = 0; j <= num_elem_1d; j++) { 89 x_array[(i * (num_elem_1d + 1) + j) * dim + 0] = j; 90 x_array[(i * (num_elem_1d + 1) + j) * dim + 1] = i; 91 } 92 } 93 CeedVectorSetArray(x_elem, CEED_MEM_HOST, CEED_COPY_VALUES, x_array); 94 } 95 } 96 97 CeedBasisCreateTensorH1Lagrange(ceed, dim, dim, 2, q, CEED_GAUSS, &basis_x); 98 99 // Cell solution 100 { 101 CeedInt ind_u[num_elem * p * p]; 102 103 for (CeedInt e = 0; e < num_elem; e++) { 104 CeedInt elem_xy[2] = {1, 1}, n_d[2] = {0, 0}; 105 106 for (CeedInt d = 0; d < dim; d++) n_d[d] = num_elem_1d * (p - 1) + 1; 107 { 108 CeedInt r_e = e; 109 110 for (CeedInt d = 0; d < dim; d++) { 111 elem_xy[d] = r_e % num_elem_1d; 112 r_e /= num_elem_1d; 113 } 114 } 115 CeedInt num_nodes_in_elem = p * p, *elem_nodes = ind_u + e * num_nodes_in_elem; 116 117 for (CeedInt n = 0; n < num_nodes_in_elem; n++) { 118 CeedInt g_node = 0, g_node_stride = 1, r_node = n; 119 120 for (CeedInt d = 0; d < dim; d++) { 121 g_node += (elem_xy[d] * (p - 1) + r_node % p) * g_node_stride; 122 g_node_stride *= n_d[d]; 123 r_node /= p; 124 } 125 elem_nodes[n] = g_node; 126 } 127 } 128 CeedElemRestrictionCreate(ceed, num_elem, p * p, 1, 1, num_nodes, CEED_MEM_HOST, CEED_COPY_VALUES, ind_u, &elem_restriction_u); 129 } 130 CeedBasisCreateTensorH1Lagrange(ceed, dim, 1, p, q, CEED_GAUSS, &basis_u); 131 132 // Setup geometric scaling 133 CeedQFunctionCreateInterior(ceed, 1, setup, setup_loc, &qf_setup); 134 CeedQFunctionAddInput(qf_setup, "x", dim * dim, CEED_EVAL_GRAD); 135 CeedQFunctionAddInput(qf_setup, "weight", 1, CEED_EVAL_WEIGHT); 136 CeedQFunctionAddOutput(qf_setup, "rho", 1, CEED_EVAL_NONE); 137 138 CeedOperatorCreateAtPoints(ceed, qf_setup, CEED_QFUNCTION_NONE, CEED_QFUNCTION_NONE, &op_setup); 139 CeedOperatorSetField(op_setup, "x", elem_restriction_x, basis_x, CEED_VECTOR_ACTIVE); 140 CeedOperatorSetField(op_setup, "weight", CEED_ELEMRESTRICTION_NONE, basis_x, CEED_VECTOR_NONE); 141 CeedOperatorSetField(op_setup, "rho", elem_restriction_q_data, CEED_BASIS_NONE, CEED_VECTOR_ACTIVE); 142 CeedOperatorAtPointsSetPoints(op_setup, elem_restriction_x_points, x_points); 143 144 CeedOperatorApply(op_setup, x_elem, q_data, CEED_REQUEST_IMMEDIATE); 145 146 // Mass operator 147 CeedQFunctionCreateInterior(ceed, 1, mass, mass_loc, &qf_mass); 148 CeedQFunctionAddInput(qf_mass, "u", 1, CEED_EVAL_INTERP); 149 CeedQFunctionAddInput(qf_mass, "rho", 1, CEED_EVAL_NONE); 150 CeedQFunctionAddOutput(qf_mass, "v", 1, CEED_EVAL_INTERP); 151 152 CeedOperatorCreateAtPoints(ceed, qf_mass, CEED_QFUNCTION_NONE, CEED_QFUNCTION_NONE, &op_mass); 153 CeedOperatorSetField(op_mass, "u", elem_restriction_u, basis_u, CEED_VECTOR_ACTIVE); 154 CeedOperatorSetField(op_mass, "rho", elem_restriction_q_data, CEED_BASIS_NONE, q_data); 155 CeedOperatorSetField(op_mass, "v", elem_restriction_u, basis_u, CEED_VECTOR_ACTIVE); 156 CeedOperatorAtPointsSetPoints(op_mass, elem_restriction_x_points, x_points); 157 158 CeedOperatorIsAtPoints(op_mass, &is_at_points); 159 if (!is_at_points) printf("Error: Operator should be at points\n"); 160 161 CeedVectorCreate(ceed, num_nodes, &u); 162 CeedVectorSetValue(u, 1.0); 163 CeedVectorCreate(ceed, num_nodes, &v); 164 165 // Assemble QFunction 166 CeedOperatorSetQFunctionAssemblyReuse(op_mass, true); 167 CeedOperatorSetQFunctionAssemblyDataUpdateNeeded(op_mass, true); 168 CeedOperatorLinearAssembleQFunction(op_mass, &qf_assembled, &elem_restriction_assembled, CEED_REQUEST_IMMEDIATE); 169 170 // Check output 171 { 172 const CeedScalar *assembled_array, *q_data_array; 173 174 CeedVectorGetArrayRead(qf_assembled, CEED_MEM_HOST, &assembled_array); 175 CeedVectorGetArrayRead(q_data, CEED_MEM_HOST, &q_data_array); 176 for (CeedInt i = 0; i < num_points; i++) 177 if (fabs(q_data_array[i] - assembled_array[i]) > 1e-9) { 178 // LCOV_EXCL_START 179 printf("Error: qf_assembled[%" CeedInt_FMT "] = %f != %f\n", i, assembled_array[i], q_data_array[i]); 180 // LCOV_EXCL_STOP 181 } 182 CeedVectorRestoreArrayRead(qf_assembled, &assembled_array); 183 CeedVectorRestoreArrayRead(q_data, &q_data_array); 184 } 185 186 // Apply original Mass Operator 187 CeedVectorSetValue(u, 1.0); 188 CeedOperatorApply(op_mass, u, v, CEED_REQUEST_IMMEDIATE); 189 190 // Check output 191 { 192 const CeedScalar *v_array; 193 CeedScalar area = 0.0; 194 195 CeedVectorGetArrayRead(v, CEED_MEM_HOST, &v_array); 196 for (CeedInt i = 0; i < num_nodes; i++) area += v_array[i]; 197 if (fabs(area - 1.0 * num_elem) > CEED_EPSILON * 5e3) printf("Error: True operator computed area = %f != 1.0\n", area); 198 CeedVectorRestoreArrayRead(v, &v_array); 199 } 200 201 // Switch to new q_data 202 { 203 const CeedScalar *assembled_array; 204 205 CeedVectorGetArrayRead(qf_assembled, CEED_MEM_HOST, &assembled_array); 206 CeedVectorSetArray(q_data, CEED_MEM_HOST, CEED_COPY_VALUES, (CeedScalar *)assembled_array); 207 CeedVectorRestoreArrayRead(qf_assembled, &assembled_array); 208 } 209 210 // Apply new Mass Operator 211 CeedOperatorApply(op_mass, u, v, CEED_REQUEST_IMMEDIATE); 212 213 // Check output 214 { 215 const CeedScalar *v_array; 216 CeedScalar area = 0.0; 217 218 CeedVectorGetArrayRead(v, CEED_MEM_HOST, &v_array); 219 for (CeedInt i = 0; i < num_nodes; i++) area += v_array[i]; 220 CeedVectorRestoreArrayRead(v, &v_array); 221 if (fabs(area - 1.0 * num_elem) > CEED_EPSILON * 5e3) printf("Error: Linearized operator computed area = %f != 1.0\n", area); 222 } 223 224 // Cleanup 225 CeedVectorDestroy(&qf_assembled); 226 CeedVectorDestroy(&q_data); 227 CeedVectorDestroy(&u); 228 CeedVectorDestroy(&v); 229 CeedVectorDestroy(&x_points); 230 CeedVectorDestroy(&q_data); 231 CeedVectorDestroy(&x_elem); 232 CeedElemRestrictionDestroy(&elem_restriction_q_data); 233 CeedElemRestrictionDestroy(&elem_restriction_x); 234 CeedElemRestrictionDestroy(&elem_restriction_x_points); 235 CeedElemRestrictionDestroy(&elem_restriction_u); 236 CeedElemRestrictionDestroy(&elem_restriction_assembled); 237 CeedBasisDestroy(&basis_x); 238 CeedBasisDestroy(&basis_u); 239 CeedQFunctionDestroy(&qf_setup); 240 CeedQFunctionDestroy(&qf_mass); 241 CeedOperatorDestroy(&op_setup); 242 CeedOperatorDestroy(&op_mass); 243 CeedDestroy(&ceed); 244 return 0; 245 } 246