Home
last modified time | relevance | path

Searched refs:n_x (Results 1 – 23 of 23) sorted by relevance

/libCEED/tests/
H A Dt580-operator.c21 CeedInt n_x = 1, n_y = 1; // Currently only implemented for single element in main() local
23 CeedInt num_elem = n_x * n_y, num_faces = (n_x + 1) * n_y + (n_y + 1) * n_x; in main()
24 …CeedInt num_dofs_x = (n_x + 1) * (n_y + 1), num_dofs_u = num_faces * 2, num_qpts = q *… in main()
38 for (CeedInt i = 0; i < n_x + 1; i++) { in main()
40 x_array[i + j * (n_x + 1) + 0 * num_dofs_x] = i / (CeedScalar)n_x; in main()
41 x_array[i + j * (n_x + 1) + 1 * num_dofs_x] = j / (CeedScalar)n_y; in main()
51 column = i % n_x; in main()
52 row = i / n_x; in main()
53 offset = column * (px - 1) + row * (n_x + 1) * (px - 1); in main()
57 ind_x[px * (px * i + k) + j] = offset + k * (n_x + 1) + j; in main()
[all …]
H A Dt534-operator.c19 CeedInt n_x = 3, n_y = 2; in main() local
20 CeedInt num_dofs = (n_x * 2 + 1) * (n_y * 2 + 1), num_qpts = num_elem * q * q; in main()
31 for (CeedInt i = 0; i < n_x * 2 + 1; i++) { in main()
33 x_array[i + j * (n_x * 2 + 1) + 0 * num_dofs] = (CeedScalar)i / (2 * n_x); in main()
34 x_array[i + j * (n_x * 2 + 1) + 1 * num_dofs] = (CeedScalar)j / (2 * n_y); in main()
46 col = i % n_x; in main()
47 row = i / n_x; in main()
48 offset = col * (p - 1) + row * (n_x * 2 + 1) * (p - 1); in main()
50 for (CeedInt k = 0; k < p; k++) ind_x[p * (p * i + k) + j] = offset + k * (n_x * 2 + 1) + j; in main()
H A Dt539-operator.c19 CeedInt n_x = 3, n_y = 2; in main() local
20 …CeedInt num_dofs_0 = (n_x * (p_0 - 1) + 1) * (n_y * (p_0 - 1) + 1), num_dofs_1 = (n_x in main()
32 for (CeedInt i = 0; i < n_x * (p_0 - 1) + 1; i++) { in main()
34 x_array[i + j * (n_x * (p_0 - 1) + 1) + 0 * num_dofs_0] = (CeedScalar)i / ((p_0 - 1) * n_x); in main()
35 x_array[i + j * (n_x * (p_0 - 1) + 1) + 1 * num_dofs_0] = (CeedScalar)j / ((p_0 - 1) * n_y); in main()
48 col = i % n_x; in main()
49 row = i / n_x; in main()
50 offset = col * (p_0 - 1) + row * (n_x * (p_0 - 1) + 1) * (p_0 - 1); in main()
52 …for (CeedInt k = 0; k < p_0; k++) ind_u_0[p_0 * (p_0 * i + k) + j] = offset + k * (n_x * (p_0 - 1)… in main()
54 offset = col * (p_1 - 1) + row * (n_x * (p_1 - 1) + 1) * (p_1 - 1) + num_dofs_0 * num_comp_0; in main()
[all …]
H A Dt560-operator.c19 CeedInt n_x = 3, n_y = 2; in main() local
20 CeedInt num_elem = n_x * n_y; in main()
21 CeedInt num_dofs = (n_x * 2 + 1) * (n_y * 2 + 1), num_qpts = num_elem * q * q; in main()
33 for (CeedInt i = 0; i < n_x * 2 + 1; i++) { in main()
35 x_array[i + j * (n_x * 2 + 1) + 0 * num_dofs] = (CeedScalar)i / (2 * n_x); in main()
36 x_array[i + j * (n_x * 2 + 1) + 1 * num_dofs] = (CeedScalar)j / (2 * n_y); in main()
48 col = i % n_x; in main()
49 row = i / n_x; in main()
50 offset = col * (p - 1) + row * (n_x * 2 + 1) * (p - 1); in main()
52 for (CeedInt k = 0; k < p; k++) ind_x[p * (p * i + k) + j] = offset + k * (n_x * 2 + 1) + j; in main()
H A Dt561-operator.c19 CeedInt n_x = 3, n_y = 2; in main() local
20 CeedInt num_elem = n_x * n_y; in main()
21 CeedInt num_dofs = (n_x * 2 + 1) * (n_y * 2 + 1), num_qpts = num_elem * q * q; in main()
33 for (CeedInt i = 0; i < n_x * 2 + 1; i++) { in main()
35 x_array[i + j * (n_x * 2 + 1) + 0 * num_dofs] = (CeedScalar)i / (2 * n_x); in main()
36 x_array[i + j * (n_x * 2 + 1) + 1 * num_dofs] = (CeedScalar)j / (2 * n_y); in main()
48 col = i % n_x; in main()
49 row = i / n_x; in main()
50 offset = col * (p - 1) + row * (n_x * 2 + 1) * (p - 1); in main()
52 for (CeedInt k = 0; k < p; k++) ind_x[p * (p * i + k) + j] = offset + k * (n_x * 2 + 1) + j; in main()
H A Dt564-operator.c19 CeedInt n_x = 1, n_y = 1; in main() local
20 CeedInt num_elem = n_x * n_y; in main()
21 CeedInt num_dofs = (n_x * 2 + 1) * (n_y * 2 + 1), num_qpts = num_elem * q * q; in main()
33 for (CeedInt i = 0; i < n_x * 2 + 1; i++) { in main()
35 x_array[i + j * (n_x * 2 + 1) + 0 * num_dofs] = (CeedScalar)i / (2 * n_x); in main()
36 x_array[i + j * (n_x * 2 + 1) + 1 * num_dofs] = (CeedScalar)j / (2 * n_y); in main()
48 col = i % n_x; in main()
49 row = i / n_x; in main()
50 offset = col * (p - 1) + row * (n_x * 2 + 1) * (p - 1); in main()
52 for (CeedInt k = 0; k < p; k++) ind_x[p * (p * i + k) + j] = offset + k * (n_x * 2 + 1) + j; in main()
H A Dt538-operator.c17 CeedInt n_x = 3, n_y = 2; in main() local
18 CeedInt num_dofs = (n_x * 2 + 1) * (n_y * 2 + 1), num_qpts = num_elem * q * q; in main()
29 for (CeedInt i = 0; i < n_x * (p - 1) + 1; i++) { in main()
31 x_array[i + j * (n_x * (p - 1) + 1) + 0 * num_dofs] = (CeedScalar)i / ((p - 1) * n_x); in main()
32 x_array[i + j * (n_x * (p - 1) + 1) + 1 * num_dofs] = (CeedScalar)j / ((p - 1) * n_y); in main()
45 col = i % n_x; in main()
46 row = i / n_x; in main()
47 offset = col * (p - 1) + row * (n_x * 2 + 1) * (p - 1); in main()
49 for (CeedInt k = 0; k < p; k++) ind_x[p * (p * i + k) + j] = offset + k * (n_x * 2 + 1) + j; in main()
H A Dt565-operator.c17 CeedInt n_x = 3, n_y = 2; in main() local
18 CeedInt num_elem = n_x * n_y; in main()
19 CeedInt num_dofs = (n_x * 2 + 1) * (n_y * 2 + 1), num_qpts = num_elem * q * q; in main()
31 for (CeedInt i = 0; i < n_x * 2 + 1; i++) { in main()
33 x_array[i + j * (n_x * 2 + 1) + 0 * num_dofs] = (CeedScalar)i / (2 * n_x); in main()
34 x_array[i + j * (n_x * 2 + 1) + 1 * num_dofs] = (CeedScalar)j / (2 * n_y); in main()
48 col = i % n_x; in main()
49 row = i / n_x; in main()
50 offset = col * (p - 1) + row * (n_x * 2 + 1) * (p - 1); in main()
52 for (CeedInt k = 0; k < p; k++) ind_x[p * (p * i + k) + j] = offset + k * (n_x * 2 + 1) + j; in main()
H A Dt535-operator.c19 CeedInt n_x = 3, n_y = 2; in main() local
20 CeedInt num_dofs = (n_x * 2 + 1) * (n_y * 2 + 1), num_qpts = num_elem * q * q; in main()
31 for (CeedInt i = 0; i < n_x * 2 + 1; i++) { in main()
33 x_array[i + j * (n_x * 2 + 1) + 0 * num_dofs] = (CeedScalar)i / (2 * n_x); in main()
34 x_array[i + j * (n_x * 2 + 1) + 1 * num_dofs] = (CeedScalar)j / (2 * n_y); in main()
47 col = i % n_x; in main()
48 row = i / n_x; in main()
49 offset = col * (p - 1) + row * (n_x * 2 + 1) * (p - 1); in main()
51 for (CeedInt k = 0; k < p; k++) ind_x[p * (p * i + k) + j] = offset + k * (n_x * 2 + 1) + j; in main()
H A Dt597-operator.c23 CeedInt n_x = 3, n_y = 2; in main() local
24 CeedInt num_elem = n_x * n_y; in main()
25 …CeedInt num_dofs = (n_x * 2 + 1) * (n_y * 2 + 1), num_points_per_elem = 4, num_points … in main()
61 for (CeedInt i = 0; i < n_x * 2 + 1; i++) { in main()
63 x_array[i + j * (n_x * 2 + 1) + 0 * num_dofs] = (CeedScalar)i / (2 * n_x); in main()
64 x_array[i + j * (n_x * 2 + 1) + 1 * num_dofs] = (CeedScalar)j / (2 * n_y); in main()
76 col = i % n_x; in main()
77 row = i / n_x; in main()
78 offset = col * (p - 1) + row * (n_x * 2 + 1) * (p - 1); in main()
80 for (CeedInt k = 0; k < p; k++) ind_x[p * (p * i + k) + j] = offset + k * (n_x * 2 + 1) + j; in main()
H A Dt596-operator.c23 CeedInt n_x = 3, n_y = 2; in main() local
24 CeedInt num_elem = n_x * n_y; in main()
25 …CeedInt num_dofs = (n_x * 2 + 1) * (n_y * 2 + 1), num_points_per_elem = 4, num_points … in main()
60 for (CeedInt i = 0; i < n_x * 2 + 1; i++) { in main()
62 x_array[i + j * (n_x * 2 + 1) + 0 * num_dofs] = (CeedScalar)i / (2 * n_x); in main()
63 x_array[i + j * (n_x * 2 + 1) + 1 * num_dofs] = (CeedScalar)j / (2 * n_y); in main()
75 col = i % n_x; in main()
76 row = i / n_x; in main()
77 offset = col * (p - 1) + row * (n_x * 2 + 1) * (p - 1); in main()
79 for (CeedInt k = 0; k < p; k++) ind_x[p * (p * i + k) + j] = offset + k * (n_x * 2 + 1) + j; in main()
H A Dt562-operator.c19 CeedInt n_x = 3, n_y = 2; in main() local
20 CeedInt num_elem = n_x * n_y; in main()
21 CeedInt num_dofs = (n_x * 2 + 1) * (n_y * 2 + 1), num_qpts = num_elem * q * q; in main()
33 for (CeedInt i = 0; i < n_x * 2 + 1; i++) { in main()
35 x_array[i + j * (n_x * 2 + 1) + 0 * num_dofs] = (CeedScalar)i / (2 * n_x); in main()
36 x_array[i + j * (n_x * 2 + 1) + 1 * num_dofs] = (CeedScalar)j / (2 * n_y); in main()
50 column = i % n_x; in main()
51 row = i / n_x; in main()
52 offset = column * (p - 1) + row * (n_x * 2 + 1) * (p - 1); in main()
54 for (CeedInt k = 0; k < p; k++) ind_x[p * (p * i + k) + j] = offset + k * (n_x * 2 + 1) + j; in main()
H A Dt566-operator.c19 CeedInt n_x = 1, n_y = 1; in main() local
20 CeedInt num_elem = n_x * n_y; in main()
21 …CeedInt num_dofs = (n_x * (p - 1) + 1) * (n_y * (p - 1) + 1), num_qpts = num_elem * q … in main()
33 for (CeedInt i = 0; i < n_x * (p - 1) + 1; i++) { in main()
35 x_array[i + j * (n_x * 2 + 1) + 0 * num_dofs] = (CeedScalar)i / (n_x * (p - 1)); in main()
36 x_array[i + j * (n_x * 2 + 1) + 1 * num_dofs] = (CeedScalar)j / (n_y * (p - 1)); in main()
49 col = i % n_x; in main()
50 row = i / n_x; in main()
51 offset = col * (p - 1) + row * (n_x * (p - 1) + 1) * (p - 1); in main()
H A Dt568-operator.c19 CeedInt n_x = 1, n_y = 1; in main() local
20 CeedInt num_elem = n_x * n_y; in main()
21 …CeedInt num_dofs = (n_x * (p - 1) + 1) * (n_y * (p - 1) + 1), num_qpts = num_elem * q … in main()
33 for (CeedInt i = 0; i < n_x * (p - 1) + 1; i++) { in main()
35 x_array[i + j * (n_x * 2 + 1) + 0 * num_dofs] = (CeedScalar)i / (n_x * (p - 1)); in main()
36 x_array[i + j * (n_x * 2 + 1) + 1 * num_dofs] = (CeedScalar)j / (n_y * (p - 1)); in main()
49 col = i % n_x; in main()
50 row = i / n_x; in main()
51 offset = col * (p - 1) + row * (n_x * (p - 1) + 1) * (p - 1); in main()
H A Dt537-operator.c19 CeedInt n_x = 3, n_y = 2; in main() local
20 CeedInt num_dofs = (n_x * 2 + 1) * (n_y * 2 + 1), num_qpts = num_elem * q * q; in main()
34 for (CeedInt i = 0; i < n_x * (p - 1) + 1; i++) { in main()
36 x_array[i + j * (n_x * (p - 1) + 1) + 0 * num_dofs] = (CeedScalar)i / ((p - 1) * n_x); in main()
37 x_array[i + j * (n_x * (p - 1) + 1) + 1 * num_dofs] = (CeedScalar)j / ((p - 1) * n_y); in main()
47 col = i % n_x; in main()
48 row = i / n_x; in main()
49 offset = col * (p - 1) + row * (n_x * 2 + 1) * (p - 1); in main()
51 for (CeedInt k = 0; k < p; k++) ind_x[p * (p * i + k) + j] = offset + k * (n_x * 2 + 1) + j; in main()
H A Dt567-operator.c19 CeedInt n_x = 1, n_y = 1; in main() local
20 CeedInt num_elem = n_x * n_y; in main()
21 …CeedInt num_dofs = (n_x * (p - 1) + 1) * (n_y * (p - 1) + 1), num_qpts = num_elem * q … in main()
33 for (CeedInt i = 0; i < n_x * (p - 1) + 1; i++) { in main()
35 x_array[i + j * (n_x * 2 + 1) + 0 * num_dofs] = (CeedScalar)i / (n_x * (p - 1)); in main()
36 x_array[i + j * (n_x * 2 + 1) + 1 * num_dofs] = (CeedScalar)j / (n_y * (p - 1)); in main()
48 col = i % n_x; in main()
49 row = i / n_x; in main()
50 offset = col * (p - 1) + row * (n_x * (p - 1) + 1) * (p - 1); in main()
H A Dt583-operator.c20 CeedInt n_x = 3, n_y = 2; in main() local
21 CeedInt num_elem = n_x * n_y; in main()
22 CeedInt num_dofs = (n_x * 2 + 1) * (n_y * 2 + 1), num_qpts = num_elem * q * q; in main()
37 for (CeedInt i = 0; i < n_x * 2 + 1; i++) { in main()
39 x_array[i + j * (n_x * 2 + 1) + 0 * num_dofs] = (CeedScalar)i / (2 * n_x); in main()
40 x_array[i + j * (n_x * 2 + 1) + 1 * num_dofs] = (CeedScalar)j / (2 * n_y); in main()
50 col = i % n_x; in main()
51 row = i / n_x; in main()
52 offset = col * (p - 1) + row * (n_x * 2 + 1) * (p - 1); in main()
55 ind_x[p * (p * i + k) + j] = offset + k * (n_x * 2 + 1) + j; in main()
H A Dt536-operator.c20 CeedInt n_x = 3, n_y = 2; in main() local
22 CeedInt num_dofs = (n_x * 2 + 1) * (n_y * 2 + 1), num_qpts = num_elem * q; in main()
36 x_array[i] = (1. / (n_x * 2)) * (CeedScalar)(i % (n_x * 2 + 1)); in main()
37 x_array[i + num_dofs] = (1. / (n_y * 2)) * (CeedScalar)(i / (n_x * 2 + 1)); in main()
48 column = i % n_x; in main()
49 row = i / n_x; in main()
50 offset = column * 2 + row * (n_x * 2 + 1) * 2; in main()
H A Dt563-operator.c20 CeedInt n_x = 3, n_y = 2; in main() local
22 CeedInt num_dofs = (n_x * 2 + 1) * (n_y * 2 + 1), num_qpts = num_elem * q; in main()
37 x_array[i] = (1. / (n_x * 2)) * (CeedScalar)(i % (n_x * 2 + 1)); in main()
38 x_array[i + num_dofs] = (1. / (n_y * 2)) * (CeedScalar)(i / (n_x * 2 + 1)); in main()
49 col = i % n_x; in main()
50 row = i / n_x; in main()
51 offset = col * 2 + row * (n_x * 2 + 1) * 2; in main()
H A Dt520-operator.c30 CeedInt n_x = 3, n_y = 3, n_x_tet = 3, n_y_tet = 1, n_x_hex = 3; in main() local
32 …CeedInt num_dofs = (n_x * 2 + 1) * (n_y * 2 + 1), num_qpts_tet = num_elem_tet * q_tet, num_q… in main()
45 for (CeedInt j = 0; j < n_x * 2 + 1; j++) { in main()
47 x_array[i + j * (n_y * 2 + 1) + 1 * num_dofs] = (CeedScalar)j / (2 * n_x); in main()
H A Dt521-operator.c30 CeedInt n_x = 3, n_y = 3, n_x_tet = 3, n_y_tet = 1, n_x_hex = 3; in main() local
32 …CeedInt num_dofs = (n_x * 2 + 1) * (n_y * 2 + 1), num_qpts_tet = num_elem_tet * q_tet, num_q… in main()
45 for (CeedInt j = 0; j < n_x * 2 + 1; j++) { in main()
47 x_array[i + j * (n_y * 2 + 1) + 1 * num_dofs] = (CeedScalar)j / (2 * n_x); in main()
H A Dt522-operator.c31 CeedInt n_x = 3, n_y = 3, n_x_tet = 3, n_y_tet = 1, n_x_hex = 3; in main() local
33 …CeedInt num_dofs = (n_x * 2 + 1) * (n_y * 2 + 1), num_qpts_tet = num_elem_tet * q_tet, num_q… in main()
46 for (CeedInt j = 0; j < n_x * 2 + 1; j++) { in main()
48 x_array[i + j * (n_y * 2 + 1) + 1 * num_dofs] = (CeedScalar)j / (2 * n_x); in main()
H A Dt526-operator.c30 CeedInt n_x = 3, n_y = 3, n_x_tet = 3, n_y_tet = 1, n_x_hex = 3; in main() local
32 …CeedInt num_dofs = (n_x * 2 + 1) * (n_y * 2 + 1), num_qpts_tet = num_elem_tet * q_tet, num_q… in main()