Home
last modified time | relevance | path

Searched refs:nd (Results 1 – 9 of 9) sorted by relevance

/libCEED/examples/python/
H A Dex_common.py112 nd = []
117 nd.append(num_xyz[d] * (p - 1) + 1) # Nodes per dimension
118 scalar_size *= nd[d]
139 g_stride *= nd[d]
170 nd = []
173 nd.append(num_xyz[d] * (p - 1) + 1)
174 scalar_size *= nd[d]
185 d_1d = r_node % nd[d]
189 r_node //= nd[d]
/libCEED/julia/LibCEED.jl/examples/
H A Dcommon.jl42 nd = CeedInt.(p*nxyz .+ 1)
44 scalar_size::CeedInt = prod(nd)
71 gnodes_stride::CeedInt *= nd[d]
106 nd = p*nxyz .+ 1
108 scalar_size::CeedInt = prod(nd)
118 ndd = nd[d]
H A Dex1-volume-c.jl100 nd = p*nxyz .+ 1
102 scalar_size = prod(nd)
123 gnodes_stride *= nd[d]
162 nd = p*nxyz .+ 1
164 scalar_size = prod(nd)
177 d1d = rnodes%nd[d]
179 rnodes = div(rnodes, nd[d])
/libCEED/examples/ceed/
H A Dex1-volume-f.f9096 integer nd(3) local
112 nd(i) = num_xyz(i) * (p - 1) + 1
113 scalar_size = scalar_size*nd(i)
140 g_nodes_stride = g_nodes_stride * nd(k)
209 integer nd(3) local
218 nd(i) = num_xyz(i) * (p - 1) + 1
219 scalar_size = scalar_size * nd(i)
238 d_1d = mod(r_nodes, nd(j))
240 r_nodes = r_nodes/nd(j)
H A Dex2-surface.c343 CeedInt nd[3], num_elem = 1, scalar_size = 1; in BuildCartesianRestriction() local
347 nd[d] = num_xyz[d] * (p - 1) + 1; in BuildCartesianRestriction()
348 scalar_size *= nd[d]; in BuildCartesianRestriction()
370 g_nodes_stride *= nd[d]; in BuildCartesianRestriction()
391 CeedInt nd[3], scalar_size = 1; in SetCartesianMeshCoords() local
394 nd[d] = num_xyz[d] * (p - 1) + 1; in SetCartesianMeshCoords()
395 scalar_size *= nd[d]; in SetCartesianMeshCoords()
409 CeedInt d1d = r_nodes % nd[d]; in SetCartesianMeshCoords()
412 r_nodes /= nd[d]; in SetCartesianMeshCoords()
H A Dex3-volume.c312 CeedInt nd[3], num_elem = 1, scalar_size = 1; in BuildCartesianRestriction() local
316 nd[d] = num_xyz[d] * (p - 1) + 1; in BuildCartesianRestriction()
317 scalar_size *= nd[d]; in BuildCartesianRestriction()
339 g_nodes_stride *= nd[d]; in BuildCartesianRestriction()
358 CeedInt nd[3], scalar_size = 1; in SetCartesianMeshCoords() local
361 nd[d] = num_xyz[d] * (p - 1) + 1; in SetCartesianMeshCoords()
362 scalar_size *= nd[d]; in SetCartesianMeshCoords()
376 CeedInt d_1d = r_nodes % nd[d]; in SetCartesianMeshCoords()
378 r_nodes /= nd[d]; in SetCartesianMeshCoords()
H A Dex1-volume.c323 CeedInt nd[3], num_elem = 1, scalar_size = 1; in BuildCartesianRestriction() local
327 nd[d] = num_xyz[d] * (p - 1) + 1; in BuildCartesianRestriction()
328 scalar_size *= nd[d]; in BuildCartesianRestriction()
350 g_nodes_stride *= nd[d]; in BuildCartesianRestriction()
367 CeedInt nd[3], scalar_size = 1; in SetCartesianMeshCoords() local
370 nd[d] = num_xyz[d] * (p - 1) + 1; in SetCartesianMeshCoords()
371 scalar_size *= nd[d]; in SetCartesianMeshCoords()
385 CeedInt d_1d = r_nodes % nd[d]; in SetCartesianMeshCoords()
388 r_nodes /= nd[d]; in SetCartesianMeshCoords()
/libCEED/examples/rust-qfunctions/
H A Dex1-volume.c333 CeedInt nd[3], num_elem = 1, scalar_size = 1; in BuildCartesianRestriction() local
337 nd[d] = num_xyz[d] * (p - 1) + 1; in BuildCartesianRestriction()
338 scalar_size *= nd[d]; in BuildCartesianRestriction()
360 g_nodes_stride *= nd[d]; in BuildCartesianRestriction()
377 CeedInt nd[3], scalar_size = 1; in SetCartesianMeshCoords() local
380 nd[d] = num_xyz[d] * (p - 1) + 1; in SetCartesianMeshCoords()
381 scalar_size *= nd[d]; in SetCartesianMeshCoords()
395 CeedInt d_1d = r_nodes % nd[d]; in SetCartesianMeshCoords()
398 r_nodes /= nd[d]; in SetCartesianMeshCoords()
/libCEED/doc/sphinx/source/
H A DlibCEEDapi.md31 …component problems in $d$ dimensions, $\bm f_0 \in \mathbb{R}^n$ and $\bm f_1 \in \mathbb{R}^{nd}$.