Home
last modified time | relevance | path

Searched refs:j (Results 1 – 25 of 253) sorted by relevance

1234567891011

/libCEED/examples/fluids/qfunctions/
H A Deulervortex.h186 for (CeedInt j = 0; j < 3; j++) { // Rows of each Jacobian matrix in ConvectiveFluxJacobian_Euler() local
187 dF[i][j + 1][0] = ((i == j) ? ((gamma - 1.) * (u_sq / 2.)) : 0.) - u[i] * u[j]; in ConvectiveFluxJacobian_Euler()
190 …dF[i][j + 1][k + 1] = ((j == k) ? u[i] : 0.) + ((i == k) ? u[j] : 0.) - ((i == j) ? u[k] : 0.) * (… in ConvectiveFluxJacobian_Euler()
193 dF[i][j + 1][4] = ((i == j) ? (gamma - 1.) : 0.); in ConvectiveFluxJacobian_Euler()
240 for (CeedInt j = 0; j < 5; j++) q0[j][i] = q[j]; in ICsEuler() local
300 for (CeedInt j = 0; j < 3; j++) { in Euler() local
302 drhodx[j] += drho[k] * dXdx[k][j]; in Euler()
303 dEdx[j] += dE[k] * dXdx[k][j]; in Euler()
305 dUdx[j][k] += dU[j][l] * dXdx[l][k]; in Euler()
306 dXdxdXdxT[j][k] += dXdx[j][l] * dXdx[k][l]; // dXdx_j,k * dXdx_k,j in Euler()
[all …]
H A Dshocktube.h118 for (CeedInt j = 0; j < 3; j++) { // Rows of each Jacobian matrix in ConvectiveFluxJacobian_Euler() local
119 dF[i][j + 1][0] = ((i == j) ? ((gamma - 1.) * (u_sq / 2.)) : 0.) - u[i] * u[j]; in ConvectiveFluxJacobian_Euler()
122 …dF[i][j + 1][k + 1] = ((j == k) ? u[i] : 0.) + ((i == k) ? u[j] : 0.) - ((i == j) ? u[k] : 0.) * (… in ConvectiveFluxJacobian_Euler()
125 dF[i][j + 1][4] = ((i == j) ? (gamma - 1.) : 0.); in ConvectiveFluxJacobian_Euler()
143 for (CeedInt j = 0; j < 3; j++) { in Covariant_length_along_vector() local
144 vec_dot_jacobian[i] += dXdx[j][i] * vec[i]; in Covariant_length_along_vector()
192 for (CeedInt j = 0; j < 5; j++) q0[j][i] = q[j]; in ICsShockTube() local
256 for (CeedInt j = 0; j < 3; j++) { in EulerShockTube() local
258 du[j][k] = (dU[j][k] - drho[k] * u[j]) / rho; in EulerShockTube()
259 drhodx[j] += drho[k] * dXdx[k][j]; in EulerShockTube()
[all …]
H A Dutils_eigensolver_jacobi.h36 for (CeedInt j = i + 2; j < N; j++) in MaxEntryRow() local
37 if (fabs(A[i * N + j]) > fabs(A[i * N + j_max])) j_max = j; in MaxEntryRow()
53 CeedInt j = max_idx_row[i]; in MaxEntry() local
54 if (fabs(A[i * N + j]) > max_entry) { in MaxEntry()
55 max_entry = fabs(A[i * N + j]); in MaxEntry()
57 *j_max = j; in MaxEntry()
71 CEED_QFUNCTION_HELPER void CalcRot(const CeedScalar *A, CeedInt N, CeedInt i, CeedInt j, CeedScalar… in CalcRot() argument
73 CeedScalar A_jj_ii = (A[j * N + j] - A[i * N + i]); in CalcRot()
78 CeedScalar A_ij = A[i * N + j]; in CalcRot()
159 CEED_QFUNCTION_HELPER void ApplyRot(CeedScalar *A, CeedInt N, CeedInt i, CeedInt j, CeedInt *max_id… in ApplyRot() argument
[all …]
H A Dnewtonian.h43 for (CeedInt j = 0; j < 5; j++) q0[j][i] = q[j]; in ICsNewtonianIG() local
91 for (CeedInt j = 0; j < 5; j++) { in MassFunction_Newtonian() local
93 …Grad_v[k][j][i] = wdetJ * (stab[j][0] * dXdx[k][0] + stab[j][1] * dXdx[k][1] + stab[j][2] * dXdx[k… in MassFunction_Newtonian()
165 for (int j = 0; j < 5; j++) U[j] = q[j][i]; in RHSFunction_Newtonian() local
185 for (CeedInt j = 0; j < 5; j++) { in RHSFunction_Newtonian() local
186 …nt k = 0; k < 3; k++) Grad_v[k][j][i] = wdetJ * (dXdx[k][0] * Flux[j][0] + dXdx[k][1] * Flux[j][1]… in RHSFunction_Newtonian()
190 for (int j = 0; j < 5; j++) v[j][i] = wdetJ * body_force[j]; in RHSFunction_Newtonian() local
196 for (int j = 0; j < 5; j++) v[j][i] -= wdetJ * idl_residual[j]; in RHSFunction_Newtonian() local
204 for (CeedInt j = 0; j < 5; j++) { in RHSFunction_Newtonian() local
205 …(CeedInt k = 0; k < 3; k++) Grad_v[k][j][i] -= wdetJ * (stab[j][0] * dXdx[k][0] + stab[j][1] * dXd… in RHSFunction_Newtonian()
[all …]
H A Dbc_slip.h32 for (CeedInt j = 0; j < 3; j++) vel_reflect[j] = s.Y.velocity[j] - 2. * norm[j] * vel_normal; in Slip() local
40 for (CeedInt j = 0; j < 5; j++) v[j][i] = -wdetJb * Flux[j]; in Slip() local
79 for (int j = 0; j < 5; j++) dqi[j] = dq[j][i]; in Slip_Jacobian() local
85 for (CeedInt j = 0; j < 3; j++) vel_reflect[j] = s.Y.velocity[j] - 2. * norm[j] * vel_normal; in Slip_Jacobian() local
91 for (CeedInt j = 0; j < 3; j++) dvel_reflect[j] = ds.Y.velocity[j] - 2. * norm[j] * dvel_normal; in Slip_Jacobian() local
99 for (CeedInt j = 0; j < 5; j++) v[j][i] = -wdetJb * dFlux[j]; in Slip_Jacobian() local
H A Dutils.h78 …dInt i = 0; i < M; i++) { CeedPragmaSIMD for (CeedInt j = 0; j < N; j++) b[i] += A[j * M + i] * x[… in MatVecNM() local
94 … i = 0; i < N; i++) { CeedPragmaSIMD for (CeedInt j = 0; j < M; j++) B[i * M + j] += D[i] * A[i * … in MatDiagNM() local
97 …dInt i = 0; i < M; i++) { CeedPragmaSIMD for (CeedInt j = 0; j < N; j++) B[i * N + j] += D[i] * A[… in MatDiagNM() local
115 CeedPragmaSIMD for (CeedInt j = 0; j < N; j++) { in MatMatN() local
116 … CeedPragmaSIMD for (CeedInt k = 0; k < N; k++) C[i * N + j] += A[i * N + k] * B[k * N + j]; in MatMatN()
122 CeedPragmaSIMD for (CeedInt j = 0; j < N; j++) { in MatMatN() local
123 … CeedPragmaSIMD for (CeedInt k = 0; k < N; k++) C[i * N + j] += A[i * N + k] * B[j * N + k]; in MatMatN()
133 CeedPragmaSIMD for (CeedInt j = 0; j < N; j++) { in MatMatN() local
134 … CeedPragmaSIMD for (CeedInt k = 0; k < N; k++) C[i * N + j] += A[k * N + i] * B[k * N + j]; in MatMatN()
140 CeedPragmaSIMD for (CeedInt j = 0; j < N; j++) { in MatMatN() local
[all …]
H A Dchannel.h78 for (CeedInt j = 0; j < 5; j++) q0[j][i] = q[j]; in ICsChannel() local
116 for (CeedInt j = 0; j < 5; j++) q_inside[j] = q[j][i]; in Channel_Inflow() local
128 for (CeedInt j = 0; j < 5; j++) v[j][i] = 0.; in Channel_Inflow() local
137 …for (CeedInt j = 0; j < 3; j++) v[j + 1][i] -= wdetJb * (rho_in * u_normal * s_exact.Y.velocity[j]… in Channel_Inflow() local
167 for (CeedInt j = 0; j < 5; j++) v[j][i] = 0.; in Channel_Outflow() local
177 for (CeedInt j = 0; j < 3; j++) v[j + 1][i] -= wdetJb * (rho * u_normal * u[j] + norm[j] * P); in Channel_Outflow() local
H A Dadvection.h173 for (CeedInt j = 0; j < 5; j++) q0[j][i] = q[j]; in ICsAdvection() local
191 for (CeedInt j = 0; j < 5; j++) q0[j][i] = q[j]; in ICsAdvection2d() local
234 for (CeedInt j = 0; j < 5; j++) { in StatePhysicalGradientFromReference_ND() local
235 …dqi[j] = grad_q[(Q * 5) * 0 + Q * j + i] * dXdx[0 * N + k] + grad_q[(Q * 5) * 1 + Q * j + i] * dXd… in StatePhysicalGradientFromReference_ND()
246 for (CeedInt j = 0; j < 5; j++) { in StatePhysicalGradientFromReference_ND() local
247 …dqi[j] = grad_q[(Q * 5) * 0 + Q * j + i] * dXdx[0 * N + k] + grad_q[(Q * 5) * 1 + Q * j + i] * dXd… in StatePhysicalGradientFromReference_ND()
248 grad_q[(Q * 5) * 2 + Q * j + i] * dXdx[2 * N + k]; in StatePhysicalGradientFromReference_ND()
308 for (CeedInt j = 0; j < dim; j++) grad_v[j][f][i] = 0; // No Change in density or momentum in IFunction_AdvectionGeneric() local
313 for (CeedInt j = 0; j < dim; j++) { in IFunction_AdvectionGeneric() local
315 div_u += grad_s[k].Y.velocity[j]; in IFunction_AdvectionGeneric()
[all …]
/libCEED/tests/
H A Dt305-basis.c26 for (int j = 0; j < p; j++) { in main() local
29 sum_m += interpolation[p * k + i] * quadrature_weights[k] * interpolation[p * k + j]; in main()
30 sum_k += gradient[p * k + i] * quadrature_weights[k] * gradient[p * k + j]; in main()
32 M[p * i + j] = sum_m; in main()
33 K[p * i + j] = sum_k; in main()
42 for (int j = 0; j < p; j++) { in main() local
44 for (int k = 0; k < p; k++) sum += M[p * i + k] * X[p * k + j]; in main()
45 work_array[p * i + j] = sum; in main()
49 for (int j = 0; j < p; j++) { in main() local
51 for (int k = 0; k < p; k++) sum += X[p * k + i] * work_array[p * k + j]; in main()
[all …]
H A Dt304-basis.c25 for (int j = 0; j < p; j++) { in main() local
27 … 0; k < p; k++) sum += interpolation[p * k + i] * quadrature_weights[k] * interpolation[p * k + j]; in main()
28 M[p * i + j] = sum; in main()
29 Q[p * i + j] = sum; in main()
37 for (int j = 0; j < p; j++) { in main() local
39 for (int k = 0; k < p; k++) sum += Q[p * i + k] * lambda[k] * Q[p * j + k]; in main()
40 Q_lambda_Qt[p * i + j] = sum; in main()
44 for (int j = 0; j < p; j++) { in main() local
45 if (fabs(M[p * i + j] - Q_lambda_Qt[p * i + j]) > 100. * CEED_EPSILON) { in main()
47 …ion [%" CeedInt_FMT ", %" CeedInt_FMT "]: %f != %f\n", i, j, M[p * i + j], Q_lambda_Qt[p * i + j]); in main()
H A Dt302-basis.c25 for (CeedInt j = 0; j < p; j++) { in main() local
26 if (fabs(collocated_gradient_1d[j + p * i] - gradient_1d[j + p * i]) > 100 * CEED_EPSILON) { in main()
28 …rror in collocated gradient %f != %f\n", collocated_gradient_1d[j + p * i], gradient_1d[j + p * i]… in main()
45 for (CeedInt j = 0; j < p; j++) sum += collocated_gradient_1d[j + p * i] * x_2[j]; in main() local
60 for (CeedInt j = 0; j < p + 2; j++) sum += collocated_gradient_1d[j + (p + 2) * i] * x_2[j]; in main() local
H A Dt325-basis.c31 for (int j = 0; j < q; j++) u_array[j + (i + d * num_comp) * q] = i * 1.0; in main() local
44 for (int j = 0; j < q * dim; j++) { in main() local
45 column_sum[i] += grad[i + j * p]; in main()
53 for (int j = 0; j < num_comp; j++) { in main() local
54 if (fabs(j * column_sum[i] - v_array[i + j * p]) > 100. * CEED_EPSILON) { in main()
56 printf("[%" CeedInt_FMT "] %f != %f\n", i, v_array[i + j * p], j * column_sum[i]); in main()
H A Dt570-operator.c29 for (CeedInt j = 0; j < p; j++) { in main() local
30 ind_u[p * i + j] = i * (p - 1) + j; in main()
74 for (CeedInt j = 0; j < num_nodes; j++) { in main() local
80 u_array[j] = 1.0; in main()
81 if (j) u_array[j - 1] = 0.0; in main()
88 for (CeedInt i = 0; i < q * num_elem; i++) assembled_true[i * num_nodes + j] = v_array[i]; in main()
94 for (CeedInt j = 0; j < num_nodes; j++) { in main() local
95 …if (fabs(assembled_values[i * num_nodes + j] - assembled_true[i * num_nodes + j]) > 100. * CEED_EP… in main()
97 …FMT ", %" CeedInt_FMT "] Error in assembly: %f != %f\n", i, j, assembled_values[i * num_nodes + j], in main()
98 assembled_true[i * num_nodes + j]); in main()
H A Dt569-operator.c43 for (CeedInt j = 0; j < p_coarse; j++) { in main() local
44 ind_u_coarse[p_coarse * i + j] = i * (p_coarse - 1) + j; in main()
51 for (CeedInt j = 0; j < p_fine; j++) { in main() local
52 ind_u_fine[p_fine * i + j] = i * (p_fine - 1) + j; in main()
108 for (CeedInt j = 0; j < num_dofs_u_coarse; j++) { in main() local
114 u_array[j] = 1.0; in main()
115 if (j) u_array[j - 1] = 0.0; in main()
122 …for (CeedInt i = 0; i < num_dofs_u_fine; i++) assembled_true[i * num_dofs_u_coarse + j] = v_array[… in main()
128 for (CeedInt j = 0; j < num_dofs_u_coarse; j++) { in main() local
129 …if (fabs(assembled_values[i * num_dofs_u_coarse + j] - assembled_true[i * num_dofs_u_coarse + j]) … in main()
[all …]
H A Dt560-operator.c34 for (CeedInt j = 0; j < n_y * 2 + 1; j++) { in main() local
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()
51 for (CeedInt j = 0; j < p; j++) { in main() local
52 for (CeedInt k = 0; k < p; k++) ind_x[p * (p * i + k) + j] = offset + k * (n_x * 2 + 1) + j; in main()
115 for (CeedInt j = 0; j < num_dofs; j++) { in main() local
121 u_array[j] = 1.0; in main()
122 if (j) u_array[j - 1] = 0.0; in main()
129 for (CeedInt i = 0; i < num_dofs; i++) assembled_true[i * num_dofs + j] = v_array[i]; in main()
135 for (CeedInt j = 0; j < num_dofs; j++) { in main() local
[all …]
/libCEED/backends/memcheck/
H A Dceed-memcheck-restriction.c62 CeedPragmaSIMD for (CeedSize j = 0; j < block_size; j++) { in CeedElemRestrictionApplyStridedNoTranspose_Memcheck_Core() local
63 vv[e * elem_size * num_comp + (k * elem_size + n) * block_size + j - v_offset] = in CeedElemRestrictionApplyStridedNoTranspose_Memcheck_Core()
64 … uu[n * strides[0] + k * strides[1] + CeedIntMin(e + j, num_elem - 1) * (CeedSize)strides[2]]; in CeedElemRestrictionApplyStridedNoTranspose_Memcheck_Core()
121 CeedPragmaSIMD for (CeedSize j = 0; j < block_size; j++) { in CeedElemRestrictionApplyCurlOrientedNoTranspose_Memcheck_Core() local
122 vv[e * elem_size * num_comp + (k * elem_size + n) * block_size + j - v_offset] = in CeedElemRestrictionApplyCurlOrientedNoTranspose_Memcheck_Core()
123 uu[impl->offsets[j + n * block_size + e * elem_size] + k * comp_stride] * in CeedElemRestrictionApplyCurlOrientedNoTranspose_Memcheck_Core()
124 impl->curl_orients[j + (3 * n + 1) * block_size + e * 3 * elem_size] + in CeedElemRestrictionApplyCurlOrientedNoTranspose_Memcheck_Core()
125 uu[impl->offsets[j + (n + 1) * block_size + e * elem_size] + k * comp_stride] * in CeedElemRestrictionApplyCurlOrientedNoTranspose_Memcheck_Core()
126 impl->curl_orients[j + (3 * n + 2) * block_size + e * 3 * elem_size]; in CeedElemRestrictionApplyCurlOrientedNoTranspose_Memcheck_Core()
129 CeedPragmaSIMD for (CeedSize j = 0; j < block_size; j++) { in CeedElemRestrictionApplyCurlOrientedNoTranspose_Memcheck_Core() local
[all …]
/libCEED/include/ceed/jit-source/magma/
H A Dmagma-common-nontensor.h34 for (int j = 0; j < Q; j++) { in read_A_notrans_g2r_1D_nosync() local
35 rA[j] = sA[j * P + tx]; in read_A_notrans_g2r_1D_nosync()
59 for (int j = 0; j < Q; j++) { in read_A_trans_g2r_1D_nosync() local
60 rA[j] = sA[tx * Q + j]; in read_A_trans_g2r_1D_nosync()
139 for (int j = 0; j < Q; j++) { in mul_rAsBrC_1D_nosync() local
140 rB[j] = sB[i * Q + j]; in mul_rAsBrC_1D_nosync()
144 for (int j = 0; j < Q; j++) { in mul_rAsBrC_1D_nosync() local
145 rC[i] += rA[j] * rB[j]; in mul_rAsBrC_1D_nosync()
163 for (int j = 0; j < Q; j++) { in addmul_rAsBrC_1D_nosync() local
164 rB[j] = sB[i * Q + j]; in addmul_rAsBrC_1D_nosync()
[all …]
H A Dmagma-common-tensor.h98 for (int j = 0; j < Q; j++) { in read_V_2d() local
99 rV[i_DIM][comp][j] = dV[comp * compstride + j * Q + tx]; in read_V_2d()
115 for (int j = 0; j < Q; j++) { in write_V_2d() local
116 dV[comp * compstride + j * Q + tx] = rV[i_DIM][comp][j]; in write_V_2d()
132 for (int j = 0; j < Q; j++) { in sum_V_2d() local
133 dV[comp * compstride + j * Q + tx] += rV[i_DIM][comp][j]; in sum_V_2d()
186 for (int j = 0; j < Q; j++) { in read_V_3d() local
187 rV[i_DIM][comp][j] = dV[comp * compstride + j * (Q * Q) + tx]; in read_V_3d()
203 for (int j = 0; j < Q; j++) { in write_V_3d() local
204 dV[comp * compstride + j * (Q * Q) + tx] = rV[i_DIM][comp][j]; in write_V_3d()
[all …]
/libCEED/examples/ceed/
H A Dex1-volume-f.h2 subroutine build_mass(ctx, q, j, w, u3, u4, u5, u6, u7, u8, u9, u10, u11, u12, u13, u14, u15, u16,&
6 ! j is Jacobians with shape [dim, dim, Q]
8 real*8 j(1)
20 qdata(i) = j(i) * w(i)
25 qdata(i) = (j(0*q + i)*j(3*q + i) - j(1*q + i)*j(2*q + i)) * w(i)
30 qdata(i) = (j(0*q + i) * (j(4*q + i)*j(8*q + i) - j(5*q + i)*j(7*q + i)) -&
31 &j(1*q + i) * (j(3*q + i)*j(8*q + i) - j(5*q + i)*j(6*q + i)) +&
32 &j(2*q + i) * (j(3*q + i)*j(7*q + i) - j(4*q + i)*j(6*q + i))) * w(i)
/libCEED/examples/solids/qfunctions/
H A Dfinite-strain-mooney-rivlin.h200 for (CeedInt j = 0; j < 3; j++) { // Component in ElasFSResidual_MR() local
202 grad_u[j][k][i] = 0; in ElasFSResidual_MR()
203 for (CeedInt m = 0; m < 3; m++) grad_u[j][k][i] += dXdx[m][k] * du[j][m]; in ElasFSResidual_MR()
234 for (CeedInt j = 0; j < 3; j++) { in ElasFSResidual_MR() local
236 P[j][k] = 0; in ElasFSResidual_MR()
237 for (CeedInt m = 0; m < 3; m++) P[j][k] += F[j][m] * S[m][k]; in ElasFSResidual_MR()
242 for (CeedInt j = 0; j < 3; j++) { // Component in ElasFSResidual_MR() local
244 dvdX[k][j][i] = 0; in ElasFSResidual_MR()
245 for (CeedInt m = 0; m < 3; m++) dvdX[k][j][i] += dXdx[k][m] * P[j][m] * wdetJ; in ElasFSResidual_MR()
293 for (CeedInt j = 0; j < 3; j++) { // Component in ElasFSJacobian_MR() local
[all …]
H A Dfinite-strain-neo-hookean.h198 for (CeedInt j = 0; j < 3; j++) { // Component in ElasFSResidual_NH() local
200 grad_u[j][k][i] = 0; in ElasFSResidual_NH()
201 for (CeedInt m = 0; m < 3; m++) grad_u[j][k][i] += dXdx[m][k] * du[j][m]; in ElasFSResidual_NH()
231 for (CeedInt j = 0; j < 3; j++) { in ElasFSResidual_NH() local
233 P[j][k] = 0; in ElasFSResidual_NH()
234 for (CeedInt m = 0; m < 3; m++) P[j][k] += F[j][m] * S[m][k]; in ElasFSResidual_NH()
239 for (CeedInt j = 0; j < 3; j++) { // Component in ElasFSResidual_NH() local
241 dvdX[k][j][i] = 0; in ElasFSResidual_NH()
242 for (CeedInt m = 0; m < 3; m++) dvdX[k][j][i] += dXdx[k][m] * P[j][m] * wdetJ; in ElasFSResidual_NH()
294 for (CeedInt j = 0; j < 3; j++) { // Component in ElasFSJacobian_NH() local
[all …]
/libCEED/backends/avx/
H A Dceed-avx-tensor.c54 for (CeedInt j = 0; j < (J / JJ) * JJ; j += JJ) { in CeedTensorContract_Avx_Blocked() local
58 … for (CeedInt cc = 0; cc < CC / 4; cc++) vv[jj][cc] = loadu(&v[(a * J + j + jj) * C + c + cc * 4]); in CeedTensorContract_Avx_Blocked()
62 rtype tqv = set1(t[(j + jj) * t_stride_0 + b * t_stride_1]); in CeedTensorContract_Avx_Blocked()
69 … for (CeedInt cc = 0; cc < CC / 4; cc++) storeu(&v[(a * J + j + jj) * C + c + cc * 4], vv[jj][cc]); in CeedTensorContract_Avx_Blocked()
74 const CeedInt j = (J / JJ) * JJ; in CeedTensorContract_Avx_Blocked() local
76 if (j < J) { in CeedTensorContract_Avx_Blocked()
80 for (CeedInt jj = 0; jj < J - j; jj++) { in CeedTensorContract_Avx_Blocked()
81 … for (CeedInt cc = 0; cc < CC / 4; cc++) vv[jj][cc] = loadu(&v[(a * J + j + jj) * C + c + cc * 4]); in CeedTensorContract_Avx_Blocked()
84 for (CeedInt jj = 0; jj < J - j; jj++) { // doesn't unroll in CeedTensorContract_Avx_Blocked()
85 rtype tqv = set1(t[(j + jj) * t_stride_0 + b * t_stride_1]); in CeedTensorContract_Avx_Blocked()
[all …]
/libCEED/examples/rust-qfunctions/ex1-volume-rs/src/
H A Dlib.rs58 let j = ArrayView::from_shape_ptr((ctx.dim as usize, ctx.dim as usize, q as usize), j_ptr); in build_mass_rs() localVariable
69 q_data[i] = j[[0, 0, i]] * w[i]; in build_mass_rs()
75 q_data[i] = (j[[0, 0, i]] * j[[1, 1, i]] - j[[0, 1, i]] * j[[1, 0, i]]) * w[i]; in build_mass_rs()
81 q_data[i] = (j[[0, 0, i]] in build_mass_rs()
82 * (j[[1, 1, i]] * j[[2, 2, i]] - j[[1, 2, i]] * j[[2, 1, i]]) in build_mass_rs()
83 - j[[0, 1, i]] * (j[[1, 0, i]] * j[[2, 2, i]] - j[[1, 2, i]] * j[[2, 0, i]]) in build_mass_rs()
84 + j[[0, 2, i]] * (j[[1, 0, i]] * j[[2, 1, i]] - j[[1, 1, i]] * j[[2, 0, i]])) in build_mass_rs()
/libCEED/backends/ref/
H A Dceed-ref-restriction.c33 CeedPragmaSIMD for (CeedSize j = 0; j < block_size; j++) { in CeedElemRestrictionApplyStridedNoTranspose_Ref_Core() local
34 vv[e * elem_size * num_comp + (k * elem_size + n) * block_size + j - v_offset] = in CeedElemRestrictionApplyStridedNoTranspose_Ref_Core()
35 … uu[n + k * elem_size + CeedIntMin(e + j, num_elem - 1) * elem_size * (CeedSize)num_comp]; in CeedElemRestrictionApplyStridedNoTranspose_Ref_Core()
48 CeedPragmaSIMD for (CeedSize j = 0; j < block_size; j++) { in CeedElemRestrictionApplyStridedNoTranspose_Ref_Core() local
49 vv[e * elem_size * num_comp + (k * elem_size + n) * block_size + j - v_offset] = in CeedElemRestrictionApplyStridedNoTranspose_Ref_Core()
50 … uu[n * strides[0] + k * strides[1] + CeedIntMin(e + j, num_elem - 1) * (CeedSize)strides[2]]; in CeedElemRestrictionApplyStridedNoTranspose_Ref_Core()
108 CeedPragmaSIMD for (CeedSize j = 0; j < block_size; j++) { in CeedElemRestrictionApplyCurlOrientedNoTranspose_Ref_Core() local
109 vv[e * elem_size * num_comp + (k * elem_size + n) * block_size + j - v_offset] = in CeedElemRestrictionApplyCurlOrientedNoTranspose_Ref_Core()
110 uu[impl->offsets[j + n * block_size + e * elem_size] + k * comp_stride] * in CeedElemRestrictionApplyCurlOrientedNoTranspose_Ref_Core()
111 impl->curl_orients[j + (3 * n + 1) * block_size + e * 3 * elem_size] + in CeedElemRestrictionApplyCurlOrientedNoTranspose_Ref_Core()
[all …]
/libCEED/examples/petsc/qfunctions/bps/
H A Dbp3sphere.h83 for (int j = 0; j < 3; j++) { in SetupDiffGeo() local
84 for (int k = 0; k < 3; k++) xx_sq[j][k] = xx[j] * xx[k] / (sqrt(mod_xx_sq) * mod_xx_sq); in SetupDiffGeo()
94 for (int j = 0; j < 3; j++) { in SetupDiffGeo() local
96 dxdX[j][k] = 0; in SetupDiffGeo()
97 for (int l = 0; l < 3; l++) dxdX[j][k] += dxdxx[j][l] * dxxdX[l][k]; in SetupDiffGeo()
113 for (int j = 0; j < 2; j++) { in SetupDiffGeo() local
115 dxdXTdxdX[j][k] = 0; in SetupDiffGeo()
116 for (int l = 0; l < 3; l++) dxdXTdxdX[j][k] += dxdX[l][j] * dxdX[l][k]; in SetupDiffGeo()
202 for (int j = 0; j < 2; j++) { // j = direction of vg in Diff() local
203 vg[i + j * Q] = w_det_J * (du[0] * dXdxdXdx_T[0][j] + du[1] * dXdxdXdx_T[1][j]); in Diff()

1234567891011