Home
last modified time | relevance | path

Searched refs:dof (Results 1 – 16 of 16) sorted by relevance

/phasta/svLS/
H A DPRECOND.f41 SUBROUTINE PRECOND(nFaces, dof, nNo, nnz, commu, cS, face, argument
46 INTEGER, INTENT(IN) :: nFaces, dof, nNo, nnz local
51 REAL*8, INTENT(INOUT) :: Val(dof*dof,nnz), R(dof,nNo)
52 REAL*8, INTENT(OUT) :: W(dof,nNo)
56 SELECT CASE (dof)
85 DO i=1, dof
86 W(i,Ac) = Val(i*dof-dof+i,d)
91 CALL COMMUV(dof, nNo, commu, cS, W)
95 DO i=1, dof
98 Val(i*dof-dof+i,d) = 1D0
[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
52 REAL*8, INTENT(IN) :: Val(dof*dof,nnz), R(dof,nNo)
53 REAL*8, INTENT(OUT) :: X(dof,nNo)
61 ALLOCATE(h(ls%sD+1,ls%sD), u(dof,nNo,ls%sD+1), unCondU(dof,nNo),
73 CALL SPARMULVV(dof, nNo, nnz, commu, cS, rowPtr, colPtr,
76 CALL ADDBCMUL(BCOP_TYPE_ADD, nFaces, dof, nNo, mynNo, commu,
83 CALL ADDBCMUL(BCOP_TYPE_PRE, nFaces, dof, nNo, mynNo, commu,
87 err(1) = NORMV(dof, mynNo, commu, u(:,:,1))
103 CALL SPARMULVV(dof, nNo, nnz, commu, cS, rowPtr, colPtr,
[all …]
H A DSOLVE.f41 SUBROUTINE svLS_SOLVE (lhs, ls, dof, Ri, Val, incL, res) argument
47 INTEGER, INTENT(IN) :: dof local
48 REAL*8, INTENT(INOUT) :: Ri(dof,lhs%nNo)
49 REAL*8, INTENT(INOUT) :: Val(dof*dof,lhs%nnz)
84 ALLOCATE(R(dof,nNo), W(dof,nNo))
89 CALL COMMUV(dof, nNo, lhs%commu, lhs%cS, R)
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,
102 IF (dof .EQ. 1) THEN
[all …]
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
52 REAL*8, INTENT(IN) :: D(dof,nnz), G(dof,nnz), L(nnz)
61 ALLOCATE(X(nNo), P(nNo), SP(nNo), DGP(nNo), GP(dof,nNo),
62 2 unCondU(dof,nNo))
81 CALL SPARMULSV(dof, nNo, nnz, commu, cS, rowPtr, colPtr,
86 CALL ADDBCMUL(BCOP_TYPE_PRE, nFaces, dof, nNo, mynNo, commu,
90 CALL SPARMULVS(dof, 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
[all …]
H A DSPARMUL.f41 SUBROUTINE SPARMULVV(dof, nNo, nnz, commu, cS, rowPtr, colPtr, argument
46 INTEGER, INTENT(IN) :: dof, nNo, nnz local
50 REAL*8, INTENT(IN) :: K(dof*dof,nnz), U(dof,nNo)
51 REAL*8, INTENT(OUT) :: KU(dof,nNo)
56 SELECT CASE (dof)
101 DO l=1, dof
102 e = l*dof
103 s = e - dof + 1
110 CALL COMMUV(dof, nNo, commu, cS, KU)
117 SUBROUTINE SPARMULVS(dof, nNo, nnz, commu, cS, rowPtr, colPtr, argument
[all …]
H A DADDBCMUL.f41 SUBROUTINE ADDBCMUL(op_Type, nFaces, dof, nNo, mynNo, commu, face, argument
46 INTEGER, INTENT(IN) :: op_type, nFaces, dof, nNo, mynNo local
49 REAL*8, INTENT(IN) :: X(dof, nNo)
50 REAL*8, INTENT(INOUT) :: Y(dof, nNo)
68 nsd = MIN(face(faIn)%dof,dof)
71 IF (.NOT.ALLOCATED(v)) ALLOCATE(v(dof,nNo))
79 S = coef(faIn)*DOTV(dof, mynNo, commu, v, X)
H A DBC.f41 SUBROUTINE svLS_BC_CREATE (lhs, faIn, nNo, dof, BC_type, gNodes, argument
47 INTEGER, INTENT(IN) :: faIn, nNo, dof local
50 REAL*8, INTENT(IN), OPTIONAL :: Val(dof,nNo)
71 lhs%face(faIn)%dof = dof
74 ALLOCATE(lhs%face(faIn)%glob(nNo), lhs%face(faIn)%val(dof,nNo),
75 2 lhs%face(faIn)%valM(dof,nNo))
97 IF (.NOT.ALLOCATED(v)) ALLOCATE(v(dof,lhs%nNo))
103 CALL COMMUV(dof, lhs%nNo, lhs%commu, lhs%cS, v)
H A Ddummy_prototypes.f83 SUBROUTINE svLS_BC_CREATE(lhs, faIn, nNo, dof, BC_type, argument
87 INTEGER, INTENT(IN) :: faIn, nNo, dof local
90 REAL*8, INTENT(IN), OPTIONAL :: Val(dof,nNo)
99 SUBROUTINE svLS_SOLVE (lhs, ls, dof, Ri, Val, res) argument
103 INTEGER, INTENT(IN) :: dof local
104 REAL*8, INTENT(INOUT) :: Ri(dof,lhs%nNo)
105 REAL*8, INTENT(IN) :: Val(dof*dof,lhs%nnz)
H A DDOT.f41 FUNCTION DOTV(dof, nNo, commu, U, V)
45 INTEGER, INTENT(IN) :: dof, nNo local
47 REAL*8, INTENT(IN) :: V(dof,nNo), U(dof,nNo)
53 SELECT CASE(dof)
H A DNORM.f41 FUNCTION NORMV(dof, nNo, commu, U)
45 INTEGER, INTENT(IN) :: dof, nNo local
47 REAL*8, INTENT(IN) :: U(dof,nNo)
53 SELECT CASE(dof)
H A DsvLS_API.h80 SUBROUTINE svLS_BC_CREATE(lhs, faIn, nNo, dof, BC_type,
84 INTEGER, INTENT(IN) :: faIn, nNo, dof
87 REAL*8, INTENT(IN), OPTIONAL :: Val(dof,nNo)
95 SUBROUTINE svLS_SOLVE (lhs, ls, dof, Ri, Val, incL, res)
99 INTEGER, INTENT(IN) :: dof
100 REAL*8, INTENT(INOUT) :: Ri(dof,lhs%nNo)
101 REAL*8, INTENT(IN) :: Val(dof*dof,lhs%nnz)
H A DINCOMMU.f41 SUBROUTINE COMMUV(dof, nNo, commu, cS, R) argument
45 INTEGER, INTENT(IN) :: dof, nNo local
48 REAL*8, INTENT(INOUT) :: R(dof,nNo)
63 ALLOCATE(rTmp(dof,i))
71 CALL MPI_IRECV(rTmp(:,s:e), cS(i)%n*dof, mpreal, i-1,
74 CALL MPI_ISEND(R(:,s:e), cS(i)%n*dof, mpreal, i-1,
109 CALL MPI_IRECV(R(:,s:e), cS(i)%n*dof, mpreal, i-1,
112 CALL MPI_ISEND(rTmp(:,s:e), cS(i)%n*dof, mpreal, i-1,
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…
56 void svls_solve_(void *lhs, svLS_lsType *ls, int *dof, double *Ri, double *Val, int *incL, double *…
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
53 REAL*8, INTENT(IN) :: Val(dof*dof,nnz)
54 REAL*8, INTENT(INOUT) :: Ri(dof,nNo)
62 nsd = dof - 1
70 Rci = Ri(dof,:)
180 Ri(dof,:) = Rci
H A DsvLS_STRUCT.h79 INTEGER :: dof
/phasta/phSolver/incompressible/
H A Dsolfar.f115 INTEGER dof, i, j, k, l local
168 dof = 4
170 ALLOCATE (Res4(dof,nshg), Val4(dof*dof,nnz_tot))
174 Res4(1:dof,i) = res(i,1:dof)
197 CALL svLS_SOLVE(svLS_lhs, svLS_ls, dof, Res4, Val4, incL,
204 solinc(i,1:dof) = Res4(1:dof,i)
420 INTEGER dof, i, j, k, l local
457 dof = 1
459 ALLOCATE (Res1(dof,nshg), Val1(dof*dof,nnz_tot))
470 CALL svLS_SOLVE(svLS_lhs, svLS_ls, dof, Res1, Val1, incL,