Home
last modified time | relevance | path

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

/phasta/phSolver/compressible/
H A Dd2wall.f53 do node = 1, nenbl
54 xwi(nwalli,node,1:3)=x(mienb(iblk)%p(j,node),:)
56 do node = 1, nenbl
58 & +xwi(nwalli,node,:)
H A Dsolgmrpetsc.c108 int node, element, var, eqn; in SolGMRp() local
369 for ( node = 0; node< nshg; node++) { in SolGMRp()
371 index = node + (var-1)*nshg; in SolGMRp()
447 int node, element, var, eqn; in SolGMRpSclr() local
659 for ( node = 0; node< nshg; node++) { in SolGMRpSclr()
660 index = node; in SolGMRpSclr()
/phasta/phSolver/common/
H A Dsonfath.f10 & counter,nc8,nc4,node,ifil,itmp local
96 node = (i-1)*n2m*n3m + k
97 gfath(node) = counter
H A Dinput.config170 Cores per node: 1 # for varts only
177 # probe 2 will be treated by rank (numpe-1)-1*(4*16) on another node
178 # probe 3 will be treated by rank (numpe-1)-2*(4*16) on another node
H A Dcommon.h345 c ndof : number of degrees of freedom per node
/phasta/phSolver/AMG/
H A Damgread.txt80 by group in parallel. For each node, there is a "group id" assigned to
81 it. For all interior node, the "group id" is the rank of the local
82 processor. For a boundary node, if it is a "master", the rank of it is
219 considering triple boundaries, if a boundary node has 3 or more
/phasta/svLS/
H A DsvLS_STRUCT.h84 ! Global node number (IN)
/phasta/M2NFixBnd/include/
H A DcommonM2NFixBnd.h310 c ndof : number of degrees of freedom per node
/phasta/M2N/include/
H A DcommonM2N.h311 c ndof : number of degrees of freedom per node
/phasta/AcuStat/include/
H A DcommonAcuStat.h310 c ndof : number of degrees of freedom per node