Home
last modified time | relevance | path

Searched refs:nodes (Results 1 – 25 of 39) sorted by relevance

12

/libCEED/julia/LibCEED.jl/examples/
H A Dcommon.jl39 nnodes::CeedInt = pp1^dim # number of scal. nodes per element
110 # The H1 basis uses Lobatto quadrature points as nodes.
111 nodes::Vector{CeedScalar} = lobatto_quadrature(p + 1) # nodes are in [-1,1]
112 nodes = 0.5 .+ 0.5*nodes
123 coords[gsnodes+scalar_size*(d-1)+1] = ((d1d÷p) + nodes[d1d%p+1])/nxyz[d]
H A Dex1-volume-c.jl95 nnodes = pp1^dim # number of scal. nodes per element
170 nodes = zeros(C.CeedScalar, p + 1)
171 # The H1 basis uses Lobatto quadrature points as nodes.
172 C.CeedLobattoQuadrature(p + 1, nodes, C_NULL) # nodes are in [-1,1]
173 nodes = 0.5 .+ 0.5*nodes
178 coords[gsnodes+scalar_size*(d-1)+1] = (div(d1d, p) + nodes[d1d%p+1])/nxyz[d]
262 println("Number of mesh nodes : ", div(mesh_size, dim))
263 println("Number of solution nodes : ", sol_size)
/libCEED/tests/output/
H A Dt211-elemrestriction.out1 CeedElemRestriction from (6, 1) to 3 elements with 2 nodes each and strides [1, 2, 2]
2 CeedElemRestriction from (6, 1) to 3 elements with 2 nodes each and strides [1, 2, 2]
H A Dt211-elemrestriction-f.out1 CeedElemRestriction from (6, 1) to 3 elements with 2 nodes each and strides [1, 2, 2]
2 CeedElemRestriction from (6, 1) to 3 elements with 2 nodes each and strides [1, 2, 2]
H A Dt212-elemrestriction-f.out1 Blocked CeedElemRestriction from (6, 1) to 3 elements with 2 nodes each and strides [1, 2, 2]
2 Blocked CeedElemRestriction from (6, 1) to 3 elements with 2 nodes each and strides [1, 2, 2]
H A Dt210-elemrestriction.out1 CeedElemRestriction from (4, 1) to 3 elements with 2 nodes each and component stride 1
2 CeedElemRestriction from (4, 1) to 3 elements with 2 nodes each and component stride 1
H A Dt210-elemrestriction-f.out1 CeedElemRestriction from (4, 1) to 3 elements with 2 nodes each and component stride 1
2 CeedElemRestriction from (4, 1) to 3 elements with 2 nodes each and component stride 1
H A Dt212-elemrestriction.out1 Blocked CeedElemRestriction from (6, 1) to 3 elements with 2 nodes each and strides [1, 2, 2]
2 Blocked CeedElemRestriction from (6, 1) to 3 elements with 2 nodes each and strides [1, 2, 2]
/libCEED/examples/ceed/
H A Dex1-volume-f.f90210 real*8, dimension (:), allocatable :: nodes, qpts local
226 allocate (nodes(p))
228 call ceedlobattoquadrature(p, nodes, qpts, err)
231 nodes(i) = 0.5 + 0.5 * nodes(i)
239 … coords(scalar_size * (j - 1) + i) = ((d_1d/(p - 1)) + nodes(mod(d_1d, p - 1) + 1))/num_xyz(j)
243 deallocate(nodes)
H A Dex2-surface.c400 CeedScalar *nodes = malloc(sizeof(CeedScalar) * p); in SetCartesianMeshCoords() local
403 CeedLobattoQuadrature(p, nodes, NULL); // nodes are in [-1,1] in SetCartesianMeshCoords()
404 for (CeedInt i = 0; i < p; i++) nodes[i] = 0.5 + 0.5 * nodes[i]; in SetCartesianMeshCoords()
411 coords[gs_nodes + scalar_size * d] = ((d1d / (p - 1)) + nodes[d1d % (p - 1)]) / num_xyz[d]; in SetCartesianMeshCoords()
415 free(nodes); in SetCartesianMeshCoords()
H A Dex3-volume.c367 CeedScalar *nodes = malloc(sizeof(CeedScalar) * p); in SetCartesianMeshCoords() local
370 CeedLobattoQuadrature(p, nodes, NULL); // nodes are in [-1,1] in SetCartesianMeshCoords()
371 for (CeedInt i = 0; i < p; i++) nodes[i] = 0.5 + 0.5 * nodes[i]; in SetCartesianMeshCoords()
377 coords[gs_nodes + scalar_size * d] = ((d_1d / (p - 1)) + nodes[d_1d % (p - 1)]) / num_xyz[d]; in SetCartesianMeshCoords()
381 free(nodes); in SetCartesianMeshCoords()
H A Dex1-volume.c376 CeedScalar *nodes = malloc(sizeof(CeedScalar) * p); in SetCartesianMeshCoords() local
379 CeedLobattoQuadrature(p, nodes, NULL); // nodes are in [-1,1] in SetCartesianMeshCoords()
380 for (CeedInt i = 0; i < p; i++) nodes[i] = 0.5 + 0.5 * nodes[i]; in SetCartesianMeshCoords()
387 coords[gs_nodes + scalar_size * d] = ((d_1d / (p - 1)) + nodes[d_1d % (p - 1)]) / num_xyz[d]; in SetCartesianMeshCoords()
391 free(nodes); in SetCartesianMeshCoords()
/libCEED/examples/python/
H A Dex_common.py177 nodes, _ = ceed.lobatto_quadrature(p)
178 nodes = 0.5 + 0.5 * nodes # Map from [-1,1] to [0,1]
188 coords[gs_node + scalar_size * d] = (elem_id + nodes[node_id]) / num_xyz[d]
H A Dtutorial-3-basis.ipynb79 …"The Lagrange interpolation nodes are at the Gauss-Lobatto points, so interpolation to Gauss-Lobat…
95 " P=4, # number of basis functions (nodes) per dimension\n",
130 "# Mark tho Lobatto nodes\n",
131 "nodes, _ = ceed.lobatto_quadrature(P)\n",
132 "plt.plot(nodes, 0*nodes, 'ok');"
163 … create a 3D tensor product element with more quadrature points than Lagrange interpolation nodes."
H A Dtutorial-6-shell.ipynb22 "polynomials defined over $P$ non-uniformly spaced nodes, the\n",
189 "Number of mesh nodes : 274625\n",
190 "Number of solution nodes : 274625\n",
280 "Number of mesh nodes : 274625\n",
281 "Number of solution nodes : 274625\n",
H A Dtutorial-2-elemrestriction.ipynb99 "# In this 1D example, there are four nodes per element\n",
176 "# In this 1D example, there are three elements (four nodes in total) \n",
340 …"Note that the nodes at the boundary between elements have multiplicty 2, while the internal nodes…
/libCEED/tests/
H A Dt541-operator.c165 CeedScalar nodes[p]; in main() local
168 CeedLobattoQuadrature(p, nodes, NULL); in main()
171 …nt j = 0; j < p; j++) u_array[i * p + j] = -(nodes[i] - 1.0) * (nodes[i] + 1.0) - (nodes[j] - 1.0)… in main()
/libCEED/python/tests/output/
H A Dtest_211.out1 CeedElemRestriction from (6, 1) to 3 elements with 2 nodes each and strides [1, 2, 2]
H A Dtest_212.out1 Blocked CeedElemRestriction from (6, 1) to 3 elements with 2 nodes each and strides [1, 2, 2]
H A Dtest_210.out1 CeedElemRestriction from (4, 1) to 3 elements with 2 nodes each and component stride 1
/libCEED/examples/rust-qfunctions/
H A Dex1-volume.c386 CeedScalar *nodes = malloc(sizeof(CeedScalar) * p); in SetCartesianMeshCoords() local
389 CeedLobattoQuadrature(p, nodes, NULL); // nodes are in [-1,1] in SetCartesianMeshCoords()
390 for (CeedInt i = 0; i < p; i++) nodes[i] = 0.5 + 0.5 * nodes[i]; in SetCartesianMeshCoords()
397 coords[gs_nodes + scalar_size * d] = ((d_1d / (p - 1)) + nodes[d_1d % (p - 1)]) / num_xyz[d]; in SetCartesianMeshCoords()
401 free(nodes); in SetCartesianMeshCoords()
/libCEED/examples/rust/mesh/src/
H A Dlib.rs149 let nodes = nodes_full.view()?; localVariable
155 + nodes[d_1d % (p - 1)])
/libCEED/julia/LibCEED.jl/src/
H A DBasis.jl47 - `p`: Number of Gauss-Lobatto nodes in one dimension. The polynomial degree of the
68 - `p`: Number of nodes in one dimension.
123 - `nnodes`: Total number of nodes.
181 - `nnodes`: Total number of nodes.
239 - `nnodes`: Total number of nodes.
292 Apply basis evaluation from nodes to quadrature points or vice versa, storing the result in
298 Set `tmode` to `CEED_NOTRANSPOSE` to evaluate from nodes to quadrature or to
299 `CEED_TRANSPOSE` to apply the transpose, mapping from quadrature points to nodes.
389 Return the number of nodes of the given [`Basis`](@ref).
400 Return the number of 1D nodes of the given (tensor-product) [`Basis`](@ref).
H A DElemRestriction.jl56 - `elemsize`: Size (number of "nodes") per element
120 - `elemsize`: Size (number of "nodes") per element
188 - `elemsize`: Size (number of "nodes") per element
247 - `elemsize`: Size (number of "nodes") per element
251 - `strides`: Array for strides between [nodes, components, elements]. Data for node $i$,
407 Get the multiplicity of nodes in an [`ElemRestriction`](@ref). The [`CeedVector`](@ref) `v`
418 Convenience function to get the multiplicity of nodes in the [`ElemRestriction`](@ref),
/libCEED/examples/
H A Dnotation.md5 …the high-order Lagrange polynomials defined over $P$ non-uniformly spaced nodes, the Gauss-Legendr…

12