Home
last modified time | relevance | path

Searched refs:lhs (Results 1 – 25 of 38) sorted by relevance

12

/phasta/svLS/
H A DSOLVE.f41 SUBROUTINE svLS_SOLVE (lhs, ls, dof, Ri, Val, incL, res) argument
45 TYPE(svLS_lhsType), INTENT(INOUT) :: lhs local
48 REAL*8, INTENT(INOUT) :: Ri(dof,lhs%nNo)
49 REAL*8, INTENT(INOUT) :: Val(dof*dof,lhs%nnz)
50 INTEGER, INTENT(IN), OPTIONAL :: incL(lhs%nFaces)
51 REAL*8, INTENT(IN), OPTIONAL :: res(lhs%nFaces)
57 nNo = lhs%nNo
58 nnz = lhs%nnz
59 nFaces = lhs%nFaces
61 IF (lhs%nFaces .NE. 0) THEN
[all …]
H A DLHS.f41 SUBROUTINE svLS_LHS_CREATE(lhs, commu, gnNo, nNo, nnz, gNodes, argument
46 TYPE(svLS_lhsType), INTENT(INOUT) :: lhs local
59 IF (lhs%foC) THEN
64 lhs%foC = .TRUE.
65 lhs%gnNo = gnNo
66 lhs%nNo = nNo
67 lhs%nnz = nnz
68 lhs%commu = commu
69 lhs%nFaces = nFaces
75 ALLOCATE (lhs%colPtr(nnz), lhs%rowPtr(2,nNo), lhs%diagPtr(nNo),
[all …]
H A DBC.f41 SUBROUTINE svLS_BC_CREATE (lhs, faIn, nNo, dof, BC_type, gNodes, argument
46 TYPE(svLS_lhsType), INTENT(INOUT) :: lhs local
55 IF (faIn .GT. lhs%nFaces) THEN
57 2 "face:", lhs%nFaces, ">", faIn
65 IF (lhs%face(faIn)%foC) THEN
70 lhs%face(faIn)%nNo = nNo
71 lhs%face(faIn)%dof = dof
72 lhs%face(faIn)%bGrp = BC_type
74 ALLOCATE(lhs%face(faIn)%glob(nNo), lhs%face(faIn)%val(dof,nNo),
75 2 lhs%face(faIn)%valM(dof,nNo))
[all …]
H A Ddummy_prototypes.f52 SUBROUTINE svLS_LHS_CREATE(lhs, commu, gnNo, nNo, nnz, argument
55 TYPE(svLS_lhsType), INTENT(INOUT) :: lhs local
63 SUBROUTINE svLS_LHS_FREE(lhs) argument
65 TYPE(svLS_lhsType), INTENT(INOUT) :: lhs local
83 SUBROUTINE svLS_BC_CREATE(lhs, faIn, nNo, dof, BC_type, argument
86 TYPE(svLS_lhsType), INTENT(INOUT) :: lhs local
93 SUBROUTINE svLS_BC_FREE(lhs, faIn) argument
95 TYPE(svLS_lhsType), INTENT(INOUT) :: lhs local
99 SUBROUTINE svLS_SOLVE (lhs, ls, dof, Ri, Val, res) argument
101 TYPE(svLS_lhsType), INTENT(INOUT) :: lhs local
[all …]
H A DsvLS_API_c.h47 void svls_lhs_create_c_(void **lhs, svLS_commuType *commu, int *gnNo, int *nNo, int *nnz, int *gNod…
48 void svls_lhs_free_(void *lhs);
53 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);
56 void svls_solve_(void *lhs, svLS_lsType *ls, int *dof, double *Ri, double *Val, int *incL, double *…
H A DsvLS_API.h51 SUBROUTINE svLS_LHS_CREATE(lhs, commu, gnNo, nNo, nnz,
54 TYPE(svLS_lhsType), INTENT(INOUT) :: lhs
61 SUBROUTINE svLS_LHS_FREE(lhs)
63 TYPE(svLS_lhsType), INTENT(INOUT) :: lhs
80 SUBROUTINE svLS_BC_CREATE(lhs, faIn, nNo, dof, BC_type,
83 TYPE(svLS_lhsType), INTENT(INOUT) :: lhs
89 SUBROUTINE svLS_BC_FREE(lhs, faIn)
91 TYPE(svLS_lhsType), INTENT(INOUT) :: lhs
95 SUBROUTINE svLS_SOLVE (lhs, ls, dof, Ri, Val, incL, res)
97 TYPE(svLS_lhsType), INTENT(INOUT) :: lhs
[all …]
/phasta/phSolver/compressible/
H A Delmgmrpetsc.f163 if(lhs.eq.1) then
183 if(lhs.eq.1) then
206 if(lhs.eq.1) call cycle_count_print()
391 if(lhs.eq.1) then
414 if(lhs.eq.1) then
424 if(lhs.eq.1) deallocate ( EGmasst )
H A Delmgmr.f119 if (lhs. eq. 1) EGmass = zero
401 if (lhs. eq. 1) lhsK = zero
429 if(lhs.eq.1) then
449 if(lhs.eq.1) then
508 if(lhs.eq.1 .and. iLHScond >= 1) then
524 if(lhs == 1 .and. iLHScond > 0) then
744 if (lhs .eq. 1) EGmasst = zero
H A Ditrdrv.f456 lhs = 1 - min(1,mod(ifuncs(1)-1,LHSupd(1)))
457 iprec=lhs
493 lhs=0
511 lhs = 1 - min(1,mod(ifuncs(1)-1,LHSupd(1)))
512 iprec = lhs
556 lhs = 1 - min(1,mod(ifuncs(isclr+2)-1,
558 iprec = lhs
H A De3.f123 if (lhs .eq. 1) stiff = zero
254 if (lhs .eq. 1) then
261 if(iprec.eq.1 .and. lhs.ne.1)then
522 if (lhs .eq. 1) then
H A Dsolgmrpetsc.c218 if(genpar.lhs ==1) ierr = MatZeroEntries(lhsP); in SolGMRp()
291 if(genpar.lhs == 1) { in SolGMRp()
546 if(genpar.lhs == 1) ierr = MatZeroEntries(lhsPs); in SolGMRpSclr()
606 if(genpar.lhs ==1) { in SolGMRpSclr()
H A De3wmlt.f150 if (lhs .eq. 1) then
354 if (lhs .eq. 1) then
H A De3conv.f188 if (lhs .eq. 1) then
456 if (lhs .eq. 1) then
/phasta/phSolver/incompressible/
H A De3.f128 if (lhs .eq. 1) then
145 if (lhs .eq. 1) then
271 if (lhs .eq. 1) then
H A Dasigmr.f75 if (lhs. eq. 1) then
173 if (lhs. eq. 1) then
H A Delmgmr.f133 if (lhs .eq. 1) then
180 if (impl(1) .ne. 9 .and. lhs .eq. 1) then
306 if (impl(1) .ne. 9 .and. lhs .eq. 1) then
457 if (lhs .eq. 1) then
493 if (impl(1) .ne. 9 .and. lhs .eq. 1) then
H A Dgenlmass.f188 if((flmpl.ne.0).and.(lhs.eq.1)) then
230 if((flmpl.ne.0).and.(lhs.eq.1)) then
H A DlesSparse.f493 subroutine fLesSparseApSclr( col, row, lhs, argument
502 real*8 lhs(nnz_tot), p(nNodes), q(nNodes)
513 tmp = tmp + lhs(k) * p(row(k))
H A DelmStats.f100 lhs = 0
H A Dsoldir.f41 lhs = 1 ! always
H A Dasbmfg.f53 if (lhs. eq. 1) then
H A Dbflux.f99 lhs = 0
/phasta/phSolver/AMG/
H A Dramg_tools.f442 subroutine ramg_check_diag(colm,rowp,lhs,nshg,nnz_tot) argument
447 real(kind=8),intent(in),dimension(nnz_tot) :: lhs local
461 diagrow = lhs(p)
468 if (lhs(p).gt.diagrow) then
471 write(*,*)'diag:',diagrow,p,lhs(p)
/phasta/AcuStat/include/
H A DcommonAcuStat_c.h297 int lhs; member
/phasta/phSolver/common/
H A Dinput.f242 & idiff, lhs, itau, ipord, ipred, lstres,

12