Home
last modified time | relevance | path

Searched refs:num_elem_1d (Results 1 – 6 of 6) sorted by relevance

/libCEED/tests/
H A Dt591-operator.c13 CeedInt num_elem_1d = 3, num_elem = num_elem_1d * num_elem_1d, dim = 2, p = 3, q = 5; in main() local
14 …CeedInt num_nodes = (num_elem_1d * (p - 1) + 1) * (num_elem_1d * (p - 1) + 1), num_points_per_elem… in main()
54 CeedInt p = 2, num_nodes = (num_elem_1d * (p - 1) + 1) * (num_elem_1d * (p - 1) + 1); in main()
60 for (CeedInt d = 0; d < dim; d++) n_d[d] = num_elem_1d * (p - 1) + 1; in main()
65 elem_xy[d] = r_e % num_elem_1d; in main()
66 r_e /= num_elem_1d; in main()
87 for (CeedInt i = 0; i <= num_elem_1d; i++) { in main()
88 for (CeedInt j = 0; j <= num_elem_1d; j++) { in main()
89 x_array[(i * (num_elem_1d + 1) + j) * dim + 0] = j; in main()
90 x_array[(i * (num_elem_1d + 1) + j) * dim + 1] = i; in main()
[all …]
H A Dt598-operator.c13 …CeedInt num_elem_1d = 3, num_elem = num_elem_1d * num_elem_1d, dim = 2, p_coarse = 2, … in main() local
15 …CeedInt num_nodes_coarse = (num_elem_1d * (p_coarse - 1) + 1) * (num_elem_1d * (p_coar… in main()
16 …CeedInt num_nodes_fine = (num_elem_1d * (p_fine - 1) + 1) * (num_elem_1d * (p_fine -… in main()
55 CeedInt p = 2, num_nodes = (num_elem_1d * (p - 1) + 1) * (num_elem_1d * (p - 1) + 1); in main()
61 for (CeedInt d = 0; d < dim; d++) n_d[d] = num_elem_1d * (p - 1) + 1; in main()
66 elem_xy[d] = r_e % num_elem_1d; in main()
67 r_e /= num_elem_1d; in main()
88 for (CeedInt i = 0; i <= num_elem_1d; i++) { in main()
89 for (CeedInt j = 0; j <= num_elem_1d; j++) { in main()
90 x_array[(i * (num_elem_1d + 1) + j) * dim + 0] = j; in main()
[all …]
H A Dt592-operator.c13 CeedInt num_elem_1d = 3, num_elem = num_elem_1d * num_elem_1d, dim = 2, p = 3, q = 5; in main() local
14 …CeedInt num_nodes = (num_elem_1d * (p - 1) + 1) * (num_elem_1d * (p - 1) + 1), num_points_per_elem… in main()
54 CeedInt p = 2, num_nodes = (num_elem_1d * (p - 1) + 1) * (num_elem_1d * (p - 1) + 1); in main()
60 for (CeedInt d = 0; d < dim; d++) n_d[d] = num_elem_1d * (p - 1) + 1; in main()
65 elem_xy[d] = r_e % num_elem_1d; in main()
66 r_e /= num_elem_1d; in main()
87 for (CeedInt i = 0; i <= num_elem_1d; i++) { in main()
88 for (CeedInt j = 0; j <= num_elem_1d; j++) { in main()
89 x_array[(i * (num_elem_1d + 1) + j) * dim + 0] = j; in main()
90 x_array[(i * (num_elem_1d + 1) + j) * dim + 1] = i; in main()
[all …]
H A Dt595-operator.c13 CeedInt num_elem_1d = 3, num_elem = num_elem_1d * num_elem_1d, dim = 2, p = 3, q = 5; in main() local
14 …CeedInt num_nodes = (num_elem_1d * (p - 1) + 1) * (num_elem_1d * (p - 1) + 1), num_points_per_elem… in main()
62 for (CeedInt d = 0; d < dim; d++) n_d[d] = num_elem_1d * (p - 1) + 1; in main()
67 elem_xy[d] = r_e % num_elem_1d; in main()
68 r_e /= num_elem_1d; in main()
H A Dt590-operator.c13 CeedInt num_elem_1d = 3, num_elem = num_elem_1d * num_elem_1d, dim = 2, p = 3, q = 5; in main() local
14 …CeedInt num_nodes = (num_elem_1d * (p - 1) + 1) * (num_elem_1d * (p - 1) + 1), num_points_per_elem… in main()
53 for (CeedInt d = 0; d < dim; d++) n_d[d] = num_elem_1d * (p - 1) + 1; in main()
58 elem_xy[d] = r_e % num_elem_1d; in main()
59 r_e /= num_elem_1d; in main()
H A Dt599-operator.c12 CeedInt num_elem_1d = 3, num_elem = num_elem_1d * num_elem_1d, dim = 2, p = 3, q = 5; in main() local
13 …CeedInt num_nodes = (num_elem_1d * (p - 1) + 1) * (num_elem_1d * (p - 1) + 1), num_points_per_elem… in main()
55 for (CeedInt d = 0; d < dim; d++) n_d[d] = num_elem_1d * (p - 1) + 1; in main()
60 elem_xy[d] = r_e % num_elem_1d; in main()
61 r_e /= num_elem_1d; in main()