Home
last modified time | relevance | path

Searched refs:d (Results 1 – 25 of 115) sorted by relevance

12345

/libCEED/tests/
H A Dt356-basis.c10 for (CeedInt d = 0; d < dim; d++) { in Eval() local
11 result *= tanh(x[d] - center); in Eval()
19 for (CeedInt d = 0; d < dim; d++) { in EvalGrad() local
20 if (d == direction) result *= 1.0 / cosh(x[d] - center) / cosh(x[d] - center); in EvalGrad()
21 else result *= tanh(x[d] - center); in EvalGrad()
48 for (CeedInt d = 0; d < dim; d++) { in main() local
49 …for (CeedInt i = 0; i < x_dim; i++) x_array[d * x_dim + i] = (i % CeedIntPow(2, d + 1)) / CeedIntP… in main()
64 for (CeedInt d = 0; d < dim; d++) coord[d] = x_array[d * p_dim + i]; in main() local
88 for (CeedInt d = 0; d < dim; d++) coord[d] = x_array[d * num_points + i]; in main() local
89 for (CeedInt d = 0; d < dim; d++) { in main() local
[all …]
H A Dt351-basis.c10 for (CeedInt d = 0; d < dim; d++) { in Eval() local
11 result *= tanh(x[d] - center); in Eval()
38 for (CeedInt d = 0; d < dim; d++) { in main() local
39 …for (CeedInt i = 0; i < x_dim; i++) x_array[d * x_dim + i] = (i % CeedIntPow(2, d + 1)) / CeedIntP… in main()
54 for (CeedInt d = 0; d < dim; d++) coord[d] = x_array[d * p_dim + i]; in main() local
78 for (CeedInt d = 0; d < dim; d++) coord[d] = x_array[d * num_points + i]; in main() local
83 for (CeedInt d = 1; d < dim; d++) printf(", %f", coord[d]); in main() local
H A Dt313-basis.c10 for (CeedInt d = 0; d < dim; d++) { in Eval() local
11 result *= tanh(x[d] - center); in Eval()
31 for (CeedInt d = 0; d < dim; d++) { in main() local
32 …for (CeedInt i = 0; i < x_dim; i++) x_array[d * x_dim + i] = (i % CeedIntPow(2, d + 1)) / CeedIntP… in main()
54 for (CeedInt d = 0; d < dim; d++) coord[d] = x_q_array[d * q_dim + i]; in main() local
77 for (CeedInt d = 0; d < dim; d++) coord[d] = x_q_array[d * q_dim + i]; in main() local
82 for (CeedInt d = 1; d < dim; d++) printf(", %f", coord[d]); in main() local
H A Dt318-basis.c10 for (CeedInt d = 0; d < dim; d++) { in Eval() local
11 result *= tanh(x[d] - center); in Eval()
30 for (CeedInt d = 0; d < dim; d++) { in main() local
31 …for (CeedInt i = 0; i < x_dim; i++) x_array[d * x_dim + i] = (i % CeedIntPow(2, d + 1)) / CeedIntP… in main()
53 for (CeedInt d = 0; d < dim; d++) coord[d] = x_q_array[d * q_dim + i]; in main() local
76 for (CeedInt d = 0; d < dim; d++) coord[d] = x_q_array[d * q_dim + i]; in main() local
81 for (CeedInt d = 1; d < dim; d++) printf(",%f", coord[d]); in main() local
H A Dt522-operator-f.f9023 integer nelemtet,nelemhex,ptet,phex,qtet,qhex,d
31 parameter(d=2)
43 real*8 arrx(d*ndofs)
46 real*8 qref(d*qtet)
49 real*8 grad(d*ptet*qtet)
70 call ceedvectorcreate(ceed,d*ndofs,x,err)
75 call ceedvectorcreate(ceed,nqptstet*d*(d+1)/2,qdatatet,err)
76 call ceedvectorcreate(ceed,nqptshex*d*(d+1)/2,qdatahex,err)
100 call ceedelemrestrictioncreate(ceed,nelemtet,ptet,d,ndofs,d*ndofs,&
105 stridesqdtet=[1,qtet,qtet*d*(d+1)/2]
[all …]
H A Dt352-basis.c10 for (CeedInt d = 0; d < dim; d++) { in Eval() local
11 result *= tanh(x[d] - center); in Eval()
38 for (CeedInt d = 0; d < dim; d++) { in main() local
39 …for (CeedInt i = 0; i < x_dim; i++) x_array[d * x_dim + i] = (i % CeedIntPow(2, d + 1)) / CeedIntP… in main()
54 for (CeedInt d = 0; d < dim; d++) coord[d] = x_array[d * p_dim + i]; in main() local
78 for (CeedInt d = 0; d < dim; d++) coord[d] = x_array[d * num_points + i]; in main() local
84 for (CeedInt d = 1; d < dim; d++) printf(", %f", coord[d]); in main() local
H A Dt598-operator.c31 for (CeedInt d = 0; d < dim; d++) { in main() local
32 x_array[num_points_per_elem * (e * dim + d) + 0] = 0.25; in main()
33 x_array[num_points_per_elem * (e * dim + d) + 1] = d == 0 ? -0.25 : 0.25; in main()
34 x_array[num_points_per_elem * (e * dim + d) + 2] = d == 0 ? 0.25 : -0.25; in main()
35 x_array[num_points_per_elem * (e * dim + d) + 3] = 0.25; in main()
61 for (CeedInt d = 0; d < dim; d++) n_d[d] = num_elem_1d * (p - 1) + 1; in main() local
65 for (CeedInt d = 0; d < dim; d++) { in main() local
66 elem_xy[d] = r_e % num_elem_1d; in main()
75 for (CeedInt d = 0; d < dim; d++) { in main() local
76 g_node += (elem_xy[d] * (p - 1) + r_node % p) * g_node_stride; in main()
[all …]
H A Dt591-operator.c30 for (CeedInt d = 0; d < dim; d++) { in main() local
31 x_array[num_points_per_elem * (e * dim + d) + 0] = 0.25; in main()
32 x_array[num_points_per_elem * (e * dim + d) + 1] = d == 0 ? -0.25 : 0.25; in main()
33 x_array[num_points_per_elem * (e * dim + d) + 2] = d == 0 ? 0.25 : -0.25; in main()
34 x_array[num_points_per_elem * (e * dim + d) + 3] = 0.25; in main()
60 for (CeedInt d = 0; d < dim; d++) n_d[d] = num_elem_1d * (p - 1) + 1; in main() local
64 for (CeedInt d = 0; d < dim; d++) { in main() local
65 elem_xy[d] = r_e % num_elem_1d; in main()
74 for (CeedInt d = 0; d < dim; d++) { in main() local
75 g_node += (elem_xy[d] * (p - 1) + r_node % p) * g_node_stride; in main()
[all …]
H A Dt354-basis.c10 for (CeedInt d = 0; d < dim; d++) { in Eval() local
11 result *= tanh(x[d] - center); in Eval()
42 for (CeedInt d = 0; d < dim; d++) { in main() local
43 …for (CeedInt i = 0; i < x_dim; i++) x_array[d * x_dim + i] = (i % CeedIntPow(2, d + 1)) / CeedIntP… in main()
58 for (CeedInt d = 0; d < dim; d++) coord[d] = x_array[d * p_dim + i]; in main() local
83 for (CeedInt d = 0; d < dim; d++) coord[d] = x_array[d * num_points + i]; in main() local
91 for (CeedInt d = 1; d < dim; d++) printf(", %f", coord[d]); in main() local
H A Dt595-operator.c31 for (CeedInt d = 0; d < dim; d++) { in main() local
32 x_array[num_points_per_elem * (e * dim + d) + 0] = 0.25; in main()
33 x_array[num_points_per_elem * (e * dim + d) + 1] = d == 0 ? -0.25 : 0.25; in main()
34 x_array[num_points_per_elem * (e * dim + d) + 2] = d == 0 ? 0.25 : -0.25; in main()
35 x_array[num_points_per_elem * (e * dim + d) + 3] = 0.25; in main()
62 for (CeedInt d = 0; d < dim; d++) n_d[d] = num_elem_1d * (p - 1) + 1; in main() local
66 for (CeedInt d = 0; d < dim; d++) { in main() local
67 elem_xy[d] = r_e % num_elem_1d; in main()
76 for (CeedInt d = 0; d < dim; d++) { in main() local
77 g_node += (elem_xy[d] * (p - 1) + r_node % p) * g_node_stride; in main()
[all …]
H A Dt590-operator.c29 for (CeedInt d = 0; d < dim; d++) { in main() local
30 x_array[num_points_per_elem * (e * dim + d) + 0] = 0.25; in main()
31 x_array[num_points_per_elem * (e * dim + d) + 1] = d == 0 ? -0.25 : 0.25; in main()
32 x_array[num_points_per_elem * (e * dim + d) + 2] = d == 0 ? 0.25 : -0.25; in main()
33 x_array[num_points_per_elem * (e * dim + d) + 3] = 0.25; in main()
53 for (CeedInt d = 0; d < dim; d++) n_d[d] = num_elem_1d * (p - 1) + 1; in main() local
57 for (CeedInt d = 0; d < dim; d++) { in main() local
58 elem_xy[d] = r_e % num_elem_1d; in main()
67 for (CeedInt d = 0; d < dim; d++) { in main() local
68 g_node += (elem_xy[d] * (p - 1) + r_node % p) * g_node_stride; in main()
[all …]
H A Dt323-basis-f.f9027 integer p,q,d variable
30 parameter(d=2)
32 real*8 qref(d*q)
35 real*8 grad(d*p*q)
36 real*8 xq(d*q)
37 real*8 xr(d*p)
39 real*8 ooutput(d*q)
48 xq=(/2.d-1,6.d-1,1.d0/3.d0,2.d-1,2.d-1,2.d-1, 1.d0/3.d0,6.d-1/)
49 xr=(/0.d0,5.d-1,1.d0,0.d0,5.d-1,0.d0,0.d0,0.d0, 0.d0,5.d-1,5.d-1,1.d0/)
71 call ceedvectorcreate(ceed,q*d,output,err)
H A Dt592-operator.c30 for (CeedInt d = 0; d < dim; d++) { in main() local
31 x_array[num_points_per_elem * (e * dim + d) + 0] = 0.25; in main()
32 x_array[num_points_per_elem * (e * dim + d) + 1] = d == 0 ? -0.25 : 0.25; in main()
33 x_array[num_points_per_elem * (e * dim + d) + 2] = d == 0 ? 0.25 : -0.25; in main()
34 x_array[num_points_per_elem * (e * dim + d) + 3] = 0.25; in main()
60 for (CeedInt d = 0; d < dim; d++) n_d[d] = num_elem_1d * (p - 1) + 1; in main() local
64 for (CeedInt d = 0; d < dim; d++) { in main() local
65 elem_xy[d] = r_e % num_elem_1d; in main()
74 for (CeedInt d = 0; d < dim; d++) { in main() local
75 g_node += (elem_xy[d] * (p - 1) + r_node % p) * g_node_stride; in main()
[all …]
H A Dt531-operator-f.f9019 integer nelem,p,q,d
24 parameter(d=2)
31 real*8 arrx(d*ndofs),uu(ndofs),vv(ndofs),vvlin(ndofs)
49 call ceedvectorcreate(ceed,d*ndofs,x,err)
66 call ceedvectorcreate(ceed,nqpts*d*(d+1)/2,qdata,err)
81 call ceedelemrestrictioncreate(ceed,nelem,p*p,d,ndofs,d*ndofs,&
90 stridesqd=[1,q*q,q*q*d*(d+1)/2]
91 call ceedelemrestrictioncreatestrided(ceed,nelem,q*q,d*(d+1)/2,&
92 & d*(d+1)/2*nqpts,stridesqd,erestrictqi,err)
95 call ceedbasiscreatetensorh1lagrange(ceed,d,d,p,q,ceed_gauss,&
[all …]
H A Dt534-operator-f.f9018 integer nelem,p,q,d
23 parameter(d=2)
30 real*8 arrx(d*ndofs),aa(nqpts),uu(ndofs),vv(ndofs),atrue(ndofs)
48 call ceedvectorcreate(ceed,d*ndofs,x,err)
53 call ceedvectorcreate(ceed,nqpts*d*(d+1)/2,qdata,err)
68 call ceedelemrestrictioncreate(ceed,nelem,p*p,d,ndofs,d*ndofs,&
77 stridesqd=[1,q*q,q*q*d*(d+1)/2]
78 call ceedelemrestrictioncreatestrided(ceed,nelem,q*q,d*(d+1)/2,&
79 & d*(d+1)/2*nqpts,stridesqd,erestrictqi,err)
82 call ceedbasiscreatetensorh1lagrange(ceed,d,d,p,q,ceed_gauss,&
[all …]
H A Dt599-operator.c28 for (CeedInt d = 0; d < dim; d++) { in main() local
29 x_array[num_points_per_elem * (e * dim + d) + 0] = 0.25; in main()
30 x_array[num_points_per_elem * (e * dim + d) + 1] = d == 0 ? -0.25 : 0.25; in main()
31 x_array[num_points_per_elem * (e * dim + d) + 2] = d == 0 ? 0.25 : -0.25; in main()
32 x_array[num_points_per_elem * (e * dim + d) + 3] = 0.25; in main()
55 for (CeedInt d = 0; d < dim; d++) n_d[d] = num_elem_1d * (p - 1) + 1; in main() local
59 for (CeedInt d = 0; d < dim; d++) { in main() local
60 elem_xy[d] = r_e % num_elem_1d; in main()
69 for (CeedInt d = 0; d < dim; d++) { in main() local
70 g_node += (elem_xy[d] * (p - 1) + r_node % p) * g_node_stride; in main()
[all …]
H A Dt532-operator-f.f9019 integer nelem,p,q,d
24 parameter(d=2)
31 real*8 arrx(d*ndofs),vv(ndofs)
50 call ceedvectorcreate(ceed,d*ndofs,x,err)
56 call ceedvectorcreate(ceed,nqpts*d*(d+1)/2,qdata_diff,err)
71 call ceedelemrestrictioncreate(ceed,nelem,p*p,d,ndofs,d*ndofs,&
80 stridesqd=[1,q*q,q*q*d*(d+1)/2]
81 call ceedelemrestrictioncreatestrided(ceed,nelem,q*q,d*(d+1)/2,&
82 & d*(d+1)/2*nqpts,stridesqd,erestrictqi,err)
85 call ceedbasiscreatetensorh1lagrange(ceed,d,d,p,q,ceed_gauss,bx,err)
[all …]
H A Dt535-operator-f.f9018 integer nelem,p,q,d
23 parameter(d=2)
30 real*8 arrx(d*ndofs),aa(nqpts),uu(ndofs),vv(ndofs),atrue(ndofs)
48 call ceedvectorcreate(ceed,d*ndofs,x,err)
54 call ceedvectorcreate(ceed,nqpts*d*(d+1)/2,qdata_diff,err)
69 call ceedelemrestrictioncreate(ceed,nelem,p*p,d,ndofs,d*ndofs,&
78 stridesqd=[1,q*q,q*q*d*(d+1)/2]
79 call ceedelemrestrictioncreatestrided(ceed,nelem,q*q,d*(d+1)/2,&
80 & d*(d+1)/2*nqpts,stridesqd,erestrictqi,err)
83 call ceedbasiscreatetensorh1lagrange(ceed,d,d,p,q,ceed_gauss,bx,err)
[all …]
/libCEED/benchmarks/
H A Dpostprocess_plot.py102 d = [[run['degree'], run['num_elem'], 1. * run['num_unknowns'] / num_nodes / vdim, variable
107 d = [[e[2], e[3]] for e in d if e[0] == sol_p] variable
109 d = [[nun, variable
110 min([e[1] for e in d if e[0] == nun]),
111 max([e[1] for e in d if e[0] == nun])]
112 for nun in set([e[0] for e in d])]
113 d = asarray(sorted(d)) variable
115 plot(d[:, 0], d[:, 2], 'o-', color=colors[i % cm_size],
117 if list(d[:, 1]) != list(d[:, 2]):
118 plot(d[:, 0], d[:, 1], 'o-', color=colors[i])
[all …]
/libCEED/include/ceed/jit-source/hip/
H A Dhip-ref-basis-nontensor-templates.h27 for (CeedInt d = 0; d < Q_COMP; d++) r_V[d] = 0.0; in Contract() local
31 for (CeedInt d = 0; d < Q_COMP; d++) r_V[d] += d_B[i + t_id * P + d * P * Q] * val; in Contract() local
33 for (CeedInt d = 0; d < Q_COMP; d++) { in Contract() local
34 d_V[elem * strides_elem_V + comp * strides_comp_V + d * strides_q_comp_V + t_id] = r_V[d]; in Contract()
54 for (CeedInt d = 0; d < Q_COMP; d++) { in ContractTranspose() local
55 U = &d_U[elem * strides_elem_U + comp * strides_comp_U + d * strides_q_comp_U]; in ContractTranspose()
56 for (CeedInt i = 0; i < Q; i++) r_V += d_B[t_id + i * P + d * P * Q] * U[i]; in ContractTranspose()
/libCEED/include/ceed/jit-source/cuda/
H A Dcuda-ref-basis-nontensor-templates.h27 for (CeedInt d = 0; d < Q_COMP; d++) r_V[d] = 0.0; in Contract() local
31 for (CeedInt d = 0; d < Q_COMP; d++) r_V[d] += d_B[i + t_id * P + d * P * Q] * val; in Contract() local
33 for (CeedInt d = 0; d < Q_COMP; d++) { in Contract() local
34 d_V[elem * strides_elem_V + comp * strides_comp_V + d * strides_q_comp_V + t_id] = r_V[d]; in Contract()
54 for (CeedInt d = 0; d < Q_COMP; d++) { in ContractTranspose() local
55 U = &d_U[elem * strides_elem_U + comp * strides_comp_U + d * strides_q_comp_U]; in ContractTranspose()
56 for (CeedInt i = 0; i < Q; i++) r_V += d_B[t_id + i * P + d * P * Q] * U[i]; in ContractTranspose()
/libCEED/examples/rust/mesh/src/
H A Dlib.rs60 for d in 0..dim {
61 num_elem *= num_xyz[d];
62 num_d[d] = num_xyz[d] * (p - 1) + 1;
63 scalar_size *= num_d[d];
73 for d in 0..dim {
74 e_xyz[d] = re % num_xyz[d];
75 re /= num_xyz[d];
82 for d in 0..dim {
83 global_nodes += (e_xyz[d] * (p - 1) + r_nodes % p) * global_nodes_stride;
84 global_nodes_stride *= num_d[d];
[all …]
/libCEED/examples/mfem/
H A Dbp3.cpp47 for (int d = 1; d < pt.Size(); d++) val *= sin(M_PI * (x[d] + k[d] * pt(d))); in solution() local
60 for (int d = 1; d < pt.Size(); d++) { in rhs() local
61 f[d] = sin(M_PI * (x[d] + k[d] * pt(d))); in rhs()
62 l[d] = M_PI * M_PI * k[d] * k[d] * f[d]; in rhs()
63 lap = lap * f[d] + val * l[d]; in rhs()
64 val = val * f[d]; in rhs()
/libCEED/examples/ceed/
H A Dex2-surface.c208 for (CeedInt d = 0; d < dim; d++) num_elem *= num_xyz[d]; in main() local
252 for (CeedInt d = 0; d < dim; d++) u_array[i] += x_array[i + d * sol_size]; in main() local
326 for (CeedInt d = 0; d < dim; d++) { in GetCartesianMeshSize() local
333 num_xyz[d] = 1 << sd; in GetCartesianMeshSize()
345 for (CeedInt d = 0; d < dim; d++) { in BuildCartesianRestriction() local
346 num_elem *= num_xyz[d]; in BuildCartesianRestriction()
347 nd[d] = num_xyz[d] * (p - 1) + 1; in BuildCartesianRestriction()
348 scalar_size *= nd[d]; in BuildCartesianRestriction()
359 for (CeedInt d = 0; d < dim; d++) { in BuildCartesianRestriction() local
360 e_xyz[d] = re % num_xyz[d]; in BuildCartesianRestriction()
[all …]
/libCEED/backends/ref/
H A Dceed-ref-basis.c72 for (CeedInt d = 0; d < dim; d++) { in CeedBasisApplyCore_Ref() local
73 …Apply(contract, pre, P, post, Q, interp_1d, t_mode, add && (d == dim - 1), d == 0 ? u : tmp[d % 2], in CeedBasisApplyCore_Ref()
74 d == dim - 1 ? v : tmp[(d + 1) % 2])); in CeedBasisApplyCore_Ref()
102 for (CeedInt d = 0; d < dim; d++) { in CeedBasisApplyCore_Ref() local
104 (t_mode == CEED_TRANSPOSE) && (d > 0), in CeedBasisApplyCore_Ref()
105 … (t_mode == CEED_NOTRANSPOSE ? (d == 0 ? u : tmp[d % 2]) : &u[d * num_qpts * num_comp * num_elem]), in CeedBasisApplyCore_Ref()
106 … (t_mode == CEED_NOTRANSPOSE ? (d == dim - 1 ? interp : tmp[(d + 1) % 2]) : interp))); in CeedBasisApplyCore_Ref()
118 for (CeedInt d = 0; d < dim; d++) { in CeedBasisApplyCore_Ref() local
120 … (t_mode == CEED_NOTRANSPOSE && apply_add) || (t_mode == CEED_TRANSPOSE && (d == dim - 1)), in CeedBasisApplyCore_Ref()
121 … (t_mode == CEED_NOTRANSPOSE ? interp : (d == 0 ? interp : tmp[d % 2])), in CeedBasisApplyCore_Ref()
[all …]

12345