| /phasta/phSolver/common/ |
| H A D | symquad.c | 80 int i,j,l; in quadIntPnt() local
99 for(l=0;l<16;l++){ in quadIntPnt()
100 rstw[l][0]=bp4[i]; in quadIntPnt()
101 rstw[l][1]=bp4[j]; in quadIntPnt()
102 rstw[l][2]=QpNon; in quadIntPnt()
103 twt[l]= bw4[i]*bw4[j]; in quadIntPnt()
115 for(l=0;l<25;l++){ in quadIntPnt()
116 rstw[l][0]=bp5[i]; in quadIntPnt()
117 rstw[l][1]=bp5[j]; in quadIntPnt()
118 rstw[l][2]=QpNon; in quadIntPnt()
[all …]
|
| H A D | symhex.c | 147 int i,j,k,l; in hexIntPnt() local
172 for(l=0;l<64;l++){ in hexIntPnt()
173 rstw[l][0]=bp4[i]; in hexIntPnt()
174 rstw[l][1]=bp4[j]; in hexIntPnt()
175 rstw[l][2]=bp4[k]; in hexIntPnt()
176 rstw[l][3]=0.0; in hexIntPnt()
177 twt[l]=bw4[i]*bw4[j]*bw4[k]; in hexIntPnt()
193 for(l=0;l<125;l++){ in hexIntPnt()
194 rstw[l][0]=bp5[i]; in hexIntPnt()
195 rstw[l][1]=bp5[j]; in hexIntPnt()
[all …]
|
| H A D | sympyr.c | 230 int i,j,k,l; in pyrIntPnt() local
253 for(l=0;l<64;l++){ in pyrIntPnt()
254 twt[l]=bw4[i]*bw4[j]*bw4[k]; in pyrIntPnt()
270 for(l=0;l<125;l++){ in pyrIntPnt()
271 rstw[l][0]=bp5[i]; in pyrIntPnt()
272 rstw[l][1]=bp5[j]; in pyrIntPnt()
273 rstw[l][2]=bp5[k]; in pyrIntPnt()
274 rstw[l][3]=0.0; in pyrIntPnt()
275 twt[l]=bw5[i]*bw5[j]*bw5[k]; in pyrIntPnt()
|
| H A D | genscale.f | 175 do l=1,nflow
176 velbarl(i,k,l) =
177 & (velbarR(j+1,l) - velbarR(j,l)) *
178 & tmp + velbarR(j,l)
186 do l=1,nflow
187 velbarl(i,k,l) =
188 & (velbarR(j,l) - velbarR(j+1,l)) *
189 & tmp + velbarR(j+1,l)
|
| H A D | asadj.f | 32 do l= 1,jlngth
33 if(row_fill_list(jnd,l).eq. knd) then
|
| H A D | sonfath.f | 121 read(96) (iper(l),l=1,numnp)
|
| H A D | eqn_plane.f | 159 do l=j,nshl
160 if (erreur(j)*erreur(l).le. 0.0) then
|
| /phasta/M2N/src/ |
| H A D | readnblk.f | 1109 do l=1,irankN
1110 if(icountN(l).gt.0) then ! I have data to write for rank l
1123 if (l .gt. 0) itmp = int(log10(float(l)))+1
1125 write (fnamer,fmt1) l
1128 open(unit=700+l,file=fnamer,status='unknown',
1131 open(unit=700+l,file=fnamer,status='unknown')
1143 do l=1,irankN
1144 if(icountN(l).gt.0) then ! I have data to write for rank l
1146 write(700+l) icountN(l), ndof
1148 write(700+l,*) icountN(l), ndof
[all …]
|
| /phasta/phSolver/AMG/ |
| H A D | ramg_ITAI.f | 7 & c_colm,m,l,n)
8 integer,intent(in) :: m,l,n local
9 integer,intent(in) :: a_colm(m+1),b_colm(l+1)
12 integer,intent(in) :: b_rowp(b_colm(l+1)-1)
15 integer :: itemp(max(m,l))
37 & c_colm,c_rowp,m,l,n,diagflag) argument
38 integer,intent(in) :: m,l,n local
39 integer,intent(in) :: a_colm(m+1),b_colm(l+1)
43 integer,intent(in) :: b_rowp(b_colm(l+1)-1)
47 integer :: itemp(max(m,l))
[all …]
|
| H A D | amgread.txt | 181 This does A_(l+1)=Q^T*A_l*Q, creation of coarser matrices.
|
| /phasta/phSolver/testIC-DSIM/ |
| H A D | geom.sms | 156 0 24+4+l-m-2
158 0 24+5+a-o-l
173 0 34-q-x-l-u
|
| H A D | geom.sdm | 155 0 24+4+l-m-2
157 0 24+5+a-o-l
|
| /phasta/svLS/ |
| H A D | GMRES.f | 55 INTEGER i, j, k, l local
68 DO l=1, ls%mItr
69 IF (l .EQ. 1) THEN
88 IF (l .EQ. 1) THEN
177 INTEGER i, j, k, l local
200 DO l=1, ls%mItr
|
| H A D | SPARMUL.f | 53 INTEGER i, j, l, col, s, e local
101 DO l=1, dof
102 e = l*dof
104 KU(l,i) = KU(l,i) + SUM(K(s:e,j)*U(:,col))
|
| H A D | NSSOLVER.f | 196 INTEGER i, j, k, l local
250 DO l=rowPtr(1,k), rowPtr(2,k)
251 IF (colPtr(l) .EQ. i) THEN
252 Gt(:,l) = -mG(:,j)
|
| /phasta/phSolver/incompressible/ |
| H A D | solfar.f | 115 INTEGER dof, i, j, k, l local
189 DO l=colm(k), colm(k+1) - 1
190 IF (rowp(l) .EQ. i) THEN
191 Val4(4:12:4,l) = -lhsP(1:3,j)
420 INTEGER dof, i, j, k, l local
|
| H A D | advLES.f | 420 do l = 1, 9
422 stressli(k,l) = stressli(k,l)*WdetJ(k)*tauM(k)
459 do l = 1, 9
460 stressl(:,l) = stressl(:,l) + stressli(:,l)
463 do l = 1, 3
464 dissl(:,l) = dissl(:,l) + dissi(:,l)
|
| /phasta/phSolver/compressible/ |
| H A D | solgmrpetsc.c | 116 int i,j,k,l,m; in SolGMRp() local
455 int i,j,k,l,m; in SolGMRpSclr() local
|