1*11a80696SZach Atkins /// @file 2*11a80696SZach Atkins /// Test creation, action, and destruction for mass matrix operator at points using sequential composite operator 3*11a80696SZach Atkins /// \test Test creation, action, and destruction for mass matrix operator at points using sequential composite operator 4*11a80696SZach Atkins #include "t599-operator.h" 5*11a80696SZach Atkins 6*11a80696SZach Atkins #include <ceed.h> 7*11a80696SZach Atkins #include <math.h> 8*11a80696SZach Atkins #include <stdio.h> 9*11a80696SZach Atkins 10*11a80696SZach Atkins int main(int argc, char **argv) { 11*11a80696SZach Atkins Ceed ceed; 12*11a80696SZach Atkins CeedInt num_elem_1d = 3, num_elem = num_elem_1d * num_elem_1d, dim = 2, p = 3, q = 5; 13*11a80696SZach Atkins 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; 14*11a80696SZach Atkins CeedVector x_points, u, v, u_points; 15*11a80696SZach Atkins CeedElemRestriction elem_restriction_x_points, elem_restriction_u_points, elem_restriction_u; 16*11a80696SZach Atkins CeedBasis basis_u; 17*11a80696SZach Atkins CeedQFunction qf_to_points, qf_from_points; 18*11a80696SZach Atkins CeedOperator op_to_points, op_from_points, op_mass; 19*11a80696SZach Atkins bool is_at_points, is_sequential; 20*11a80696SZach Atkins 21*11a80696SZach Atkins CeedInit(argv[1], &ceed); 22*11a80696SZach Atkins 23*11a80696SZach Atkins CeedVectorCreate(ceed, dim * num_points, &x_points); 24*11a80696SZach Atkins { 25*11a80696SZach Atkins CeedScalar x_array[dim * num_points]; 26*11a80696SZach Atkins 27*11a80696SZach Atkins for (CeedInt e = 0; e < num_elem; e++) { 28*11a80696SZach Atkins for (CeedInt d = 0; d < dim; d++) { 29*11a80696SZach Atkins x_array[num_points_per_elem * (e * dim + d) + 0] = 0.25; 30*11a80696SZach Atkins x_array[num_points_per_elem * (e * dim + d) + 1] = d == 0 ? -0.25 : 0.25; 31*11a80696SZach Atkins x_array[num_points_per_elem * (e * dim + d) + 2] = d == 0 ? 0.25 : -0.25; 32*11a80696SZach Atkins x_array[num_points_per_elem * (e * dim + d) + 3] = 0.25; 33*11a80696SZach Atkins } 34*11a80696SZach Atkins } 35*11a80696SZach Atkins CeedVectorSetArray(x_points, CEED_MEM_HOST, CEED_COPY_VALUES, x_array); 36*11a80696SZach Atkins } 37*11a80696SZach Atkins { 38*11a80696SZach Atkins CeedInt ind_x[num_elem + 1 + num_points]; 39*11a80696SZach Atkins 40*11a80696SZach Atkins for (CeedInt i = 0; i <= num_elem; i++) ind_x[i] = num_elem + 1 + i * num_points_per_elem; 41*11a80696SZach Atkins for (CeedInt i = 0; i < num_points; i++) ind_x[num_elem + 1 + i] = i; 42*11a80696SZach Atkins CeedElemRestrictionCreateAtPoints(ceed, num_elem, num_points, dim, num_points * dim, CEED_MEM_HOST, CEED_COPY_VALUES, ind_x, 43*11a80696SZach Atkins &elem_restriction_x_points); 44*11a80696SZach Atkins CeedElemRestrictionCreateAtPoints(ceed, num_elem, num_points, 1, num_points, CEED_MEM_HOST, CEED_COPY_VALUES, ind_x, &elem_restriction_u_points); 45*11a80696SZach Atkins CeedElemRestrictionCreateVector(elem_restriction_u_points, &u_points, NULL); 46*11a80696SZach Atkins CeedVectorSetValue(u_points, 0); 47*11a80696SZach Atkins } 48*11a80696SZach Atkins 49*11a80696SZach Atkins { 50*11a80696SZach Atkins CeedInt ind_u[num_elem * p * p]; 51*11a80696SZach Atkins 52*11a80696SZach Atkins for (CeedInt e = 0; e < num_elem; e++) { 53*11a80696SZach Atkins CeedInt elem_xy[2] = {1, 1}, n_d[2] = {0, 0}; 54*11a80696SZach Atkins 55*11a80696SZach Atkins for (CeedInt d = 0; d < dim; d++) n_d[d] = num_elem_1d * (p - 1) + 1; 56*11a80696SZach Atkins { 57*11a80696SZach Atkins CeedInt r_e = e; 58*11a80696SZach Atkins 59*11a80696SZach Atkins for (CeedInt d = 0; d < dim; d++) { 60*11a80696SZach Atkins elem_xy[d] = r_e % num_elem_1d; 61*11a80696SZach Atkins r_e /= num_elem_1d; 62*11a80696SZach Atkins } 63*11a80696SZach Atkins } 64*11a80696SZach Atkins CeedInt num_nodes_in_elem = p * p, *elem_nodes = ind_u + e * num_nodes_in_elem; 65*11a80696SZach Atkins 66*11a80696SZach Atkins for (CeedInt n = 0; n < num_nodes_in_elem; n++) { 67*11a80696SZach Atkins CeedInt g_node = 0, g_node_stride = 1, r_node = n; 68*11a80696SZach Atkins 69*11a80696SZach Atkins for (CeedInt d = 0; d < dim; d++) { 70*11a80696SZach Atkins g_node += (elem_xy[d] * (p - 1) + r_node % p) * g_node_stride; 71*11a80696SZach Atkins g_node_stride *= n_d[d]; 72*11a80696SZach Atkins r_node /= p; 73*11a80696SZach Atkins } 74*11a80696SZach Atkins elem_nodes[n] = g_node; 75*11a80696SZach Atkins } 76*11a80696SZach Atkins } 77*11a80696SZach Atkins CeedElemRestrictionCreate(ceed, num_elem, p * p, 1, 1, num_nodes, CEED_MEM_HOST, CEED_COPY_VALUES, ind_u, &elem_restriction_u); 78*11a80696SZach Atkins } 79*11a80696SZach Atkins CeedBasisCreateTensorH1Lagrange(ceed, dim, 1, p, q, CEED_GAUSS, &basis_u); 80*11a80696SZach Atkins 81*11a80696SZach Atkins CeedQFunctionCreateInterior(ceed, 1, mass, mass_loc, &qf_to_points); 82*11a80696SZach Atkins CeedQFunctionAddInput(qf_to_points, "u", 1, CEED_EVAL_INTERP); 83*11a80696SZach Atkins CeedQFunctionAddOutput(qf_to_points, "u_points", 1, CEED_EVAL_NONE); 84*11a80696SZach Atkins 85*11a80696SZach Atkins CeedOperatorCreateAtPoints(ceed, qf_to_points, CEED_QFUNCTION_NONE, CEED_QFUNCTION_NONE, &op_to_points); 86*11a80696SZach Atkins CeedOperatorSetField(op_to_points, "u", elem_restriction_u, basis_u, CEED_VECTOR_ACTIVE); 87*11a80696SZach Atkins CeedOperatorSetField(op_to_points, "u_points", elem_restriction_u_points, CEED_BASIS_NONE, u_points); 88*11a80696SZach Atkins CeedOperatorAtPointsSetPoints(op_to_points, elem_restriction_x_points, x_points); 89*11a80696SZach Atkins 90*11a80696SZach Atkins CeedOperatorIsAtPoints(op_to_points, &is_at_points); 91*11a80696SZach Atkins if (!is_at_points) printf("Error: Operator should be at points\n"); 92*11a80696SZach Atkins 93*11a80696SZach Atkins CeedQFunctionCreateInterior(ceed, 1, mass, mass_loc, &qf_from_points); 94*11a80696SZach Atkins CeedQFunctionAddInput(qf_from_points, "u_points", 1, CEED_EVAL_NONE); 95*11a80696SZach Atkins CeedQFunctionAddOutput(qf_from_points, "v", 1, CEED_EVAL_INTERP); 96*11a80696SZach Atkins 97*11a80696SZach Atkins CeedOperatorCreateAtPoints(ceed, qf_from_points, CEED_QFUNCTION_NONE, CEED_QFUNCTION_NONE, &op_from_points); 98*11a80696SZach Atkins CeedOperatorSetField(op_from_points, "u_points", elem_restriction_u_points, CEED_BASIS_NONE, u_points); 99*11a80696SZach Atkins CeedOperatorSetField(op_from_points, "v", elem_restriction_u, basis_u, CEED_VECTOR_ACTIVE); 100*11a80696SZach Atkins CeedOperatorAtPointsSetPoints(op_from_points, elem_restriction_x_points, x_points); 101*11a80696SZach Atkins 102*11a80696SZach Atkins CeedOperatorIsAtPoints(op_from_points, &is_at_points); 103*11a80696SZach Atkins if (!is_at_points) printf("Error: Operator should be at points\n"); 104*11a80696SZach Atkins 105*11a80696SZach Atkins CeedOperatorCreateComposite(ceed, &op_mass); 106*11a80696SZach Atkins CeedOperatorCompositeSetSequential(op_mass, true); 107*11a80696SZach Atkins CeedOperatorCompositeAddSub(op_mass, op_to_points); 108*11a80696SZach Atkins CeedOperatorCompositeAddSub(op_mass, op_from_points); 109*11a80696SZach Atkins 110*11a80696SZach Atkins CeedVectorCreate(ceed, num_nodes, &u); 111*11a80696SZach Atkins CeedVectorSetValue(u, 1.0); 112*11a80696SZach Atkins CeedVectorCreate(ceed, num_nodes, &v); 113*11a80696SZach Atkins CeedOperatorApply(op_mass, u, v, CEED_REQUEST_IMMEDIATE); 114*11a80696SZach Atkins 115*11a80696SZach Atkins CeedOperatorCompositeIsSequential(op_mass, &is_sequential); 116*11a80696SZach Atkins if (!is_sequential) printf("Error: Composite operator should be sequential\n"); 117*11a80696SZach Atkins 118*11a80696SZach Atkins { 119*11a80696SZach Atkins CeedScalar sum = 0.0; 120*11a80696SZach Atkins const CeedScalar *v_array; 121*11a80696SZach Atkins 122*11a80696SZach Atkins CeedVectorGetArrayRead(v, CEED_MEM_HOST, &v_array); 123*11a80696SZach Atkins for (CeedInt i = 0; i < num_nodes; i++) sum += v_array[i]; 124*11a80696SZach Atkins CeedVectorRestoreArrayRead(v, &v_array); 125*11a80696SZach Atkins // Summing 9 reference elements, each 2x2 => 36 sq units area 126*11a80696SZach Atkins if (fabs(sum - 4.0 * num_elem) > CEED_EPSILON * 5e3) { 127*11a80696SZach Atkins printf("Incorrect area computed, %g != %g (abs error %g)\n", sum, 4.0 * num_elem, fabs(sum - 4.0 * num_elem)); 128*11a80696SZach Atkins } 129*11a80696SZach Atkins } 130*11a80696SZach Atkins 131*11a80696SZach Atkins CeedVectorDestroy(&x_points); 132*11a80696SZach Atkins CeedVectorDestroy(&u_points); 133*11a80696SZach Atkins CeedVectorDestroy(&u); 134*11a80696SZach Atkins CeedVectorDestroy(&v); 135*11a80696SZach Atkins CeedElemRestrictionDestroy(&elem_restriction_x_points); 136*11a80696SZach Atkins CeedElemRestrictionDestroy(&elem_restriction_u_points); 137*11a80696SZach Atkins CeedElemRestrictionDestroy(&elem_restriction_u); 138*11a80696SZach Atkins CeedBasisDestroy(&basis_u); 139*11a80696SZach Atkins CeedQFunctionDestroy(&qf_to_points); 140*11a80696SZach Atkins CeedQFunctionDestroy(&qf_from_points); 141*11a80696SZach Atkins CeedOperatorDestroy(&op_to_points); 142*11a80696SZach Atkins CeedOperatorDestroy(&op_from_points); 143*11a80696SZach Atkins CeedOperatorDestroy(&op_mass); 144*11a80696SZach Atkins CeedDestroy(&ceed); 145*11a80696SZach Atkins return 0; 146*11a80696SZach Atkins } 147