Home
last modified time | relevance | path

Searched refs:nNodes (Results 1 – 4 of 4) sorted by relevance

/phasta/phSolver/incompressible/
H A DlesSparse.f205 & p, q, nNodes,
211 integer nNodes, nnz_tot
212 integer col(nNodes+1), row(nnz_tot)
213 real*8 pLhs(4,nnz_tot), p(nNodes), q(nNodes,3)
220 do i = 1, nNodes
228 do i = 1, nNodes
253 1 p, q, nNodes,
261 integer nNodes
262 integer col(nNodes+1), row(nnz_tot)
264 real*8 p(nNodes,4), q(nNodes,3)
[all …]
H A Dlestools.c26 int *nDstDims, int *nDims, int *nNodes );
35 int *nDims, int *nNodes);
37 void FLESZERO( double *dstpnt, int *nDims, int *nNodes);
72 int *nDstDims, int *nNodes);
92 int *nNodes, int *nnz);
96 int *nNodes, int *nnz);
99 int *nSrc1Dims,int *nSrc2Dims, int *nDims, int *nNodes);
103 int *nNodes);
107 int *nNodes, int *nnz);
111 int *nNodes, int *nnz);
[all …]
H A Dusr.h34 int nNodes ; /* number of nodes */ member
124 int* nNodes,
H A Dusr.c55 int* nNodes, in usrNew() argument
88 usrHd->nNodes = *nNodes ; in usrNew()
145 pnt = pnt + (id + offset) * usrHd->nNodes ; in usrPointer()