Home
last modified time | relevance | path

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

/phasta/svLS/
H A DBC.f41 SUBROUTINE svLS_BC_CREATE (lhs, faIn, nNo, dof, BC_type, gNodes, argument
47 INTEGER, INTENT(IN) :: faIn, nNo, dof local
55 IF (faIn .GT. lhs%nFaces) THEN
57 2 "face:", lhs%nFaces, ">", faIn
60 IF (faIn .LT. 0) THEN
65 IF (lhs%face(faIn)%foC) THEN
66 PRINT *, "BC(", faIn,") is not free"
70 lhs%face(faIn)%nNo = nNo
71 lhs%face(faIn)%dof = dof
72 lhs%face(faIn)%bGrp = BC_type
[all …]
H A DADDBCMUL.f52 INTEGER faIn, i, a, Ac, nsd local
67 DO faIn=1, nFaces
68 nsd = MIN(face(faIn)%dof,dof)
69 IF (face(faIn)%coupledFlag) THEN
70 IF (face(faIn)%sharedFlag) THEN
73 DO a=1, face(faIn)%nNo
74 Ac = face(faIn)%glob(a)
76 v(i,Ac) = face(faIn)%valM(i,a)
79 S = coef(faIn)*DOTV(dof, mynNo, commu, v, X)
80 DO a=1, face(faIn)%nNo
[all …]
H A DSOLVE.f54 INTEGER faIn, a, nNo, nnz, nFaces local
64 DO faIn=1, lhs%nFaces
65 IF (incL(faIn) .EQ. 0) lhs%face(faIn)%incFlag = .FALSE.
73 DO faIn=1, lhs%nFaces
74 lhs%face(faIn)%coupledFlag = .FALSE.
75 IF (.NOT.lhs%face(faIn)%incFlag) CYCLE
76 flag = lhs%face(faIn)%bGrp .EQ. BC_TYPE_Neu
77 IF (flag .AND. res(faIn).NE.0D0) THEN
78 lhs%face(faIn)%res = res(faIn)
79 lhs%face(faIn)%coupledFlag = .TRUE.
H A DPRECOND.f54 INTEGER i, j, a, b, d, Ac, faIn local
104 DO faIn=1, nFaces
105 IF (.NOT.face(faIn)%incFlag) CYCLE
106 i = MIN(face(faIn)%dof,dof)
107 IF (face(faIn)%bGrp .EQ. BC_TYPE_Dir) THEN
108 DO a=1, face(faIn)%nNo
109 Ac = face(faIn)%glob(a)
110 W(1:i,Ac) = W(1:i,Ac)*face(faIn)%val(1:i,a)
212 DO faIn=1, nFaces
213 IF (face(faIn)%coupledFlag) THEN
[all …]
H A DNSSOLVER.f268 INTEGER faIn, i, a, Ac local
272 DO faIn=1, nFaces
273 IF (face(faIn)%coupledFlag) THEN
274 IF (face(faIn)%sharedFlag) THEN
277 DO a=1, face(faIn)%nNo
278 Ac = face(faIn)%glob(a)
280 v(i,Ac) = face(faIn)%valM(i,a)
283 face(faIn)%nS = NORMV(nsd, mynNo, commu, v)**2D0
285 face(faIn)%nS = 0D0
286 DO a=1, face(faIn)%nNo
[all …]
H A Ddummy_prototypes.f83 SUBROUTINE svLS_BC_CREATE(lhs, faIn, nNo, dof, BC_type, argument
87 INTEGER, INTENT(IN) :: faIn, nNo, dof local
93 SUBROUTINE svLS_BC_FREE(lhs, faIn) argument
96 INTEGER, INTENT(IN) :: faIn local
H A DsvLS_API_c.h53 void svls_bc_create_(void *lhs, int *faIn, int *nNo, int *dof, int *BC_type, int *gNodes, double *V…
54 void svls_bc_free_(void *lhs, int *faIn);
H A DsvLS_API.h80 SUBROUTINE svLS_BC_CREATE(lhs, faIn, nNo, dof, BC_type,
84 INTEGER, INTENT(IN) :: faIn, nNo, dof
89 SUBROUTINE svLS_BC_FREE(lhs, faIn)
92 INTEGER, INTENT(IN) :: faIn
H A DLHS.f275 INTEGER faIn, i local
283 DO faIn = 1, lhs%nFaces
284 IF (lhs%face(faIn)%foC) CALL svLS_BC_FREE(lhs, faIn)
/phasta/phSolver/incompressible/
H A Ditrdrv.f1473 INTEGER svLS_nFaces, gnNo, nNo, faIn, facenNo local
1567 faIn = 1
1584 CALL svLS_BC_CREATE(svLS_lhs, faIn, facenNo,
1658 faIn = 1
1674 CALL svLS_BC_CREATE(svLS_lhs_S(isolsc), faIn, facenNo,