Home
last modified time | relevance | path

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

12

/phasta/svLS/
H A DCGRAD.f41 SUBROUTINE CGRAD(nFaces, dof, nNo, nnz, mynNo, commu, cS, face, argument
46 INTEGER, INTENT(IN) :: nFaces, dof, nNo, nnz, mynNo local
51 INTEGER, INTENT(IN) :: rowPtr(2,nNo), colPtr(nnz)
52 REAL*8, INTENT(IN) :: D(dof,nnz), G(dof,nnz), L(nnz)
81 CALL SPARMULSV(dof, nNo, nnz, commu, cS, rowPtr, colPtr,
90 CALL SPARMULVS(dof, nNo, nnz, commu, cS, rowPtr, colPtr,
93 CALL SPARMULSS( nNo, nnz, commu, cS, rowPtr, colPtr,
117 SUBROUTINE CGRADV(dof, nNo, nnz, mynNo, commu, cS, ls, argument
122 INTEGER, INTENT(IN) :: dof, nNo, nnz, mynNo local
126 INTEGER, INTENT(IN) :: rowPtr(2,nNo), colPtr(nnz)
[all …]
H A DSOLVE.f49 REAL*8, INTENT(INOUT) :: Val(dof*dof,lhs%nnz)
54 INTEGER faIn, a, nNo, nnz, nFaces local
58 nnz = lhs%nnz
90 CALL PRECOND(nFaces, dof, nNo, nnz, lhs%commu, lhs%cS,
95 CALL NSSOLVER(nFaces, lhs%gnNo, dof, nNo, nnz, lhs%mynNo,
99 CALL GMRESV(nFaces, dof, nNo, nnz, lhs%mynNo, lhs%commu,
103 CALL CGRADS(nNo, nnz, lhs%mynNo, lhs%commu, lhs%cS,
106 CALL CGRADV(dof, nNo, nnz, lhs%mynNo, lhs%commu, lhs%cS,
H A DSPARMUL.f41 SUBROUTINE SPARMULVV(dof, nNo, nnz, commu, cS, rowPtr, colPtr, argument
46 INTEGER, INTENT(IN) :: dof, nNo, nnz local
49 INTEGER, INTENT(IN) :: rowPtr(2,nNo), colPtr(nnz)
50 REAL*8, INTENT(IN) :: K(dof*dof,nnz), U(dof,nNo)
117 SUBROUTINE SPARMULVS(dof, nNo, nnz, commu, cS, rowPtr, colPtr, argument
122 INTEGER, INTENT(IN) :: dof, nNo, nnz local
125 INTEGER, INTENT(IN) :: rowPtr(2,nNo), colPtr(nnz)
126 REAL*8, INTENT(IN) :: K(dof,nnz), U(dof,nNo)
177 SUBROUTINE SPARMULSV(dof, nNo, nnz, commu, cS, rowPtr, colPtr, argument
182 INTEGER, INTENT(IN) :: dof, nNo, nnz local
[all …]
H A DNSSOLVER.f41 SUBROUTINE NSSOLVER(nFaces, gnNo, dof, nNo, nnz, mynNo, commu, argument
47 INTEGER, INTENT(IN) :: nFaces, gnNo, dof, nNo, nnz, mynNo local
52 INTEGER, INTENT(IN) :: rowPtr(2,nNo), colPtr(nnz)
53 REAL*8, INTENT(IN) :: Val(dof*dof,nnz)
95 CALL GMRES(nFaces, nsd, nNo, nnz, mynNo, commu, cS, face,
98 CALL SPARMULVS(nsd, nNo, nnz, commu, cS,
102 CALL CGRAD(nFaces, nsd, nNo, nnz, mynNo, commu, cS, face,
105 CALL SPARMULSV(nsd, nNo, nnz, commu, cS,
109 CALL GMRES(nFaces, nsd, nNo, nnz, mynNo, commu, cS, face,
112 CALL SPARMULVV(nsd, nNo, nnz, commu, cS,
[all …]
H A DLHS.f41 SUBROUTINE svLS_LHS_CREATE(lhs, commu, gnNo, nNo, nnz, gNodes, argument
48 INTEGER, INTENT(IN) :: gnNo, nNo, nnz local
49 INTEGER, INTENT(IN) :: gNodes(nNo), rowPtr(nNo+1), colPtr(nnz)
67 lhs%nnz = nnz
75 ALLOCATE (lhs%colPtr(nnz), lhs%rowPtr(2,nNo), lhs%diagPtr(nNo),
79 DO i=1, nnz
195 DO i=1, nnz
296 lhs%nnz = 0
307 SUBROUTINE svLS_LHS_CREATE_C(pLHS, commu, gnNo, nNo, nnz, gNodes, argument
314 INTEGER, INTENT(IN) :: gnNo, nNo, nnz local
[all …]
H A DGMRES.f41 SUBROUTINE GMRES(nFaces, dof, nNo, nnz, mynNo, commu, cS, face, argument
46 INTEGER, INTENT(IN) :: nFaces, dof, nNo, nnz, mynNo local
51 INTEGER, INTENT(IN) :: rowPtr(2,nNo), colPtr(nnz)
52 REAL*8, INTENT(IN) :: Val(dof*dof,nnz), R(dof,nNo)
73 CALL SPARMULVV(dof, nNo, nnz, commu, cS, rowPtr, colPtr,
103 CALL SPARMULVV(dof, nNo, nnz, commu, cS, rowPtr, colPtr,
163 SUBROUTINE GMRESV(nFaces, dof, nNo, nnz, mynNo, commu, cS, face, argument
168 INTEGER, INTENT(IN) :: nFaces, dof, nNo, nnz, mynNo local
173 INTEGER, INTENT(IN) :: rowPtr(2,nNo), colPtr(nnz)
174 REAL*8, INTENT(IN) :: Val(dof*dof,nnz)
[all …]
H A Ddummy_prototypes.f52 SUBROUTINE svLS_LHS_CREATE(lhs, commu, gnNo, nNo, nnz, argument
57 INTEGER, INTENT(IN) :: gnNo, nNo, nnz local
59 2 colPtr(nnz)
105 REAL*8, INTENT(IN) :: Val(dof*dof,lhs%nnz)
H A DsvLS_API.h51 SUBROUTINE svLS_LHS_CREATE(lhs, commu, gnNo, nNo, nnz,
56 INTEGER, INTENT(IN) :: gnNo, nNo, nnz
58 2 colPtr(nnz)
101 REAL*8, INTENT(IN) :: Val(dof*dof,lhs%nnz)
H A DPRECOND.f41 SUBROUTINE PRECOND(nFaces, dof, nNo, nnz, commu, cS, face, argument
46 INTEGER, INTENT(IN) :: nFaces, dof, nNo, nnz local
50 INTEGER, INTENT(IN) :: rowPtr(2,nNo), colPtr(nnz), diagPtr(nNo)
51 REAL*8, INTENT(INOUT) :: Val(dof*dof,nnz), R(dof,nNo)
H A DsvLS_API_c.h47 void svls_lhs_create_c_(void **lhs, svLS_commuType *commu, int *gnNo, int *nNo, int *nnz, int *gNod…
/phasta/phSolver/common/
H A Dgenadj.f7 integer rowp(nshg*nnz), colm(nshg+1)
8 integer adjcnt(nshg), row_fill_list(nshg,15*nnz), mloc(1)
70 if(icnt.gt.nnz*nshg) then
H A Dasadj.f10 integer row_fill_list(nshg,15*nnz),
44 if(jlngth.gt.15*nnz) then
H A Dfillsparse.f9 integer ien(npro,nshl), col(nshg+1), row(nshg*nnz)
82 integer ien(npro,nshl), col(nshg+1), row(nnz*nshg)
145 integer ien(npro,nshl), col(nshg+1), row(nnz*nshg)
199 integer ien(npro,nshl), col(nshg+1), row(nshg*nnz)
H A Dinput.f152 nnz = 35
154 nnz = 85
156 nnz = 300
225 & nshg, nnz, istop, nflow, nnz_tot, idtn,
H A Dcmass.f15 allocate ( lhsG(nnz*nshg) )
H A Dcommon.h118 & nshg, nnz, nflow,
124 & nshg, nnz, istop, nflow, nnz_tot, idtn,
/phasta/phSolver/incompressible/
H A Dgenlmass.f180 integer rowp(nnz*nshg), colm(nshg+1)
222 integer rowp(nnz*nshg), colm(nshg+1)
H A DelmStats.f96 & ilwork(nlwork), rowp(nshg,nnz),
H A Dlestools.c92 int *nNodes, int *nnz);
96 int *nNodes, int *nnz);
107 int *nNodes, int *nnz);
111 int *nNodes, int *nnz);
115 int *nNodes, int *nnz);
119 int *nNodes, int *nnz);
H A Dsolfar.f97 & rowp(nshg*nnz), colm(nshg+1),
405 & rowp(nshg*nnz), colm(nshg+1),
H A Delmgmr.f46 integer rowp(nshg*nnz), colm(nshg+1)
400 integer ilwork(nlwork), rowp(nshg*nnz), colm(nshg+1)
/phasta/phSolver/compressible/
H A Dsparseap.f18 integer col(nshg+1), row(nnz*nshg),
/phasta/AcuStat/include/
H A DcommonAcuStat_c.h207 int nnz; member
/phasta/M2N/include/
H A DcommonM2N_c.h207 int nnz; member
/phasta/M2NFixBnd/include/
H A DcommonM2NFixBnd_c.h207 int nnz; member

12