Home
last modified time | relevance | path

Searched refs:node (Results 1 – 5 of 5) sorted by relevance

/honee/src/
H A Dsetupts.c101 for (PetscInt node = 0; node < dof / num_comp; node++) { in Surface_Forces_NS() local
103 reaction_force[w * dim + j] -= r[node].momentum[j]; in Surface_Forces_NS()
/honee/doc/
H A Dexamples.md245 There are two methods to do this; algorithmically, or specifying the node locations via a file.
246 Algorithmically, a base node distribution is defined at the inlet (assumed to be $\min(x)$) and the…
251 Alternatively, a file may be specified containing the locations of each node.
253 The node locations used exactly at the inlet (assumed to be $\min(x)$) and linearly stretched/squee…
291 - Path to file with y node locations. If empty, will use mesh warping instead.
H A Dauxiliary.md341 - Number of MPI ranks associated with each collocated database (i.e. ranks per node)
394 The database may also be located on the same node as a MPI rank (collocated) or located on a separa…
H A Dtheory.md355 For compressible Navier-Stokes, this requires projecting 12 scalars-per-node: 4 conserved scalars (…
378 For compressible Navier-Stokes, this means only projecting only 4 scalars-per-node.
614 These values are then interpolated to a physical location (node or quadrature point). It has the fo…
/honee/
H A DDoxyfile2539 # class node. If there are many fields or methods and many nodes the graph may
2728 # by representing a node as a red box. Note that doxygen if the number of direct
2729 # children of the root node in a graph is already larger than
2740 # further from the root node will be omitted. Note that setting this option to 1