Home
last modified time | relevance | path

Searched refs:j (Results 1 – 25 of 141) sorted by relevance

123456

/phasta/phSolver/compressible/
H A Dasaugmr.f33 do j = 1, nflow*nshl, nflow
35 & + EGmass(:,i ,j ) * uBrgl(:,j )
36 & + EGmass(:,i ,j+1) * uBrgl(:,j+1)
37 & + EGmass(:,i ,j+2) * uBrgl(:,j+2)
38 & + EGmass(:,i ,j+3) * uBrgl(:,j+3)
39 & + EGmass(:,i ,j+4) * uBrgl(:,j+4)
42 & + EGmass(:,i+1,j ) * uBrgl(:,j )
43 & + EGmass(:,i+1,j+1) * uBrgl(:,j+1)
44 & + EGmass(:,i+1,j+2) * uBrgl(:,j+2)
45 & + EGmass(:,i+1,j+3) * uBrgl(:,j+3)
[all …]
H A Dspsi3pre.f129 j = row(k)
137 lhsK(1,k) = BDiag(j,1,1)*lhsK(1,k)
138 lhsK(2,k) = BDiag(j,1,1)*lhsK(2,k)
139 lhsK(3,k) = BDiag(j,1,1)*lhsK(3,k)
140 lhsK(4,k) = BDiag(j,1,1)*lhsK(4,k)
141 lhsK(5,k) = BDiag(j,1,1)*lhsK(5,k)
143 lhsK(6,k) = BDiag(j,2,2)*( lhsK(6,k)
144 & - BDiag(j,1,2) * lhsK(1,k) )
145 lhsK(7,k) = BDiag(j,2,2)*( lhsK(7,k)
146 & - BDiag(j,1,2) * lhsK(2,k) )
[all …]
H A De3bdg.f37 do j = 1, nshl ! May be worth eliminating zeros in A(prim) matrices
38 tmp=shp(:,j)*WdetJ
39 BDiagl(:,j,1,1) = BDiagl(:,j,1,1)
41 & shg(:,j,1) * A1(:,1,1) +
42 & shg(:,j,2) * A2(:,1,1) +
43 & shg(:,j,3) * A3(:,1,1)
45 BDiagl(:,j,1,2) = BDiagl(:,j,1,2)
47 & shg(:,j,1) * A1(:,1,2)
51 BDiagl(:,j,1,3) = BDiagl(:,j,1,3)
54 & +shg(:,j,2) * A2(:,1,3)
[all …]
H A De3bdg_nd.f38 do j = 1, nshl ! May be worth eliminating zeros in A(prim) matrices
39 tmp=shp(:,j)*WdetJ
40 BDiagl(:,j,1,1) = BDiagl(:,j,1,1)
42 & shg(:,j,1) * A1(:,1,1) +
43 & shg(:,j,2) * A2(:,1,1) +
44 & shg(:,j,3) * A3(:,1,1)
46 BDiagl(:,j,1,2) = BDiagl(:,j,1,2)
48 & shg(:,j,1) * A1(:,1,2)
52 BDiagl(:,j,1,3) = BDiagl(:,j,1,3)
55 & +shg(:,j,2) * A2(:,1,3)
[all …]
H A Dsparseap.f33 do j=1,nflow
34 p(:,j)=p(iper(:),j)
57 j = row(k)
59 tmp1 = tmp1 + lhsK(1 ,k)*p(j,1)
60 1 + lhsK(6 ,k)*p(j,2)
61 2 + lhsK(11,k)*p(j,3)
62 3 + lhsK(16,k)*p(j,4)
63 4 + lhsK(21,k)*p(j,5)
64 tmp2 = tmp2 + lhsK(2 ,k)*p(j,1)
65 1 + lhsK(7 ,k)*p(j,2)
[all …]
H A Di3pre.f65 do j = 1, nedof
67 EGmass(n+iv,i+1,j) = EGmass(n+iv,i+1,j)
69 EGmass(n+iv,i+2,j) = (EGmass(n+iv,i+2,j)
70 & - BDiagl(n+iv,inode,2,1) * EGmass(n+iv,i+1,j))
72 EGmass(n+iv,i+3,j) = (EGmass(n+iv,i+3,j)
73 & - BDiagl(n+iv,inode,3,1) * EGmass(n+iv,i+1,j)
74 & - BDiagl(n+iv,inode,3,2) * EGmass(n+iv,i+2,j))
76 EGmass(n+iv,i+4,j) = (EGmass(n+iv,i+4,j)
77 & - BDiagl(n+iv,inode,4,1) * EGmass(n+iv,i+1,j)
78 & - BDiagl(n+iv,inode,4,2) * EGmass(n+iv,i+2,j)
[all …]
H A De3ls.f484 do j = 1, nflow
486 Atau(:,i,j) =Atau(:,i,j) + A1(:,i,k)*PTau(:,k,j)
495 do j = 1, nflow
497 A1tauA0(:,i,j) =
498 & Atau(:,i,1)*A0(:,1,j) +
499 & Atau(:,i,2)*A0(:,2,j) +
500 & Atau(:,i,3)*A0(:,3,j) +
501 & Atau(:,i,4)*A0(:,4,j) +
502 & Atau(:,i,5)*A0(:,5,j)
508 do j = 1, nflow
[all …]
H A Dlocalt.f42 do j = 1, nshl
44 rlocal(:,i,j) = global(ien(:,j),i)
73 do j = 1, nshl
76 global(ien(nel,j),i) = global(ien(nel,j),i)
77 & + rlocal(nel,i,j)
102 do j = 1, nshl
105 global(ien(nel,j),i) = rlocal(nel,i,j)
167 do j = 1, nshl
168 rlocal(:,j) = global(ien(:,j))
196 do j = 1, nshl
[all …]
H A Dd2wall.f31 do j = 1, npro
32 if(miBCB(iblk)%p(j,5).eq.2) nwalli=nwalli+1
49 do j = 1, npro ! loop over belts in this blk
50 if(miBCB(iblk)%p(j,5).eq.2) then
54 xwi(nwalli,node,1:3)=x(mienb(iblk)%p(j,node),:)
76 do j=1,numpe
77 nwallt=nwallt+nwall(j)
89 do j=2,numpe
90 idisp(j)=idisp(j-1)+nwall(j-1)
92 do j=1,nenb+1
[all …]
H A Dbc3per.f28 do j = 1,nshg
29 if (btest(iBC(j),10)) then
30 i = iper(j)
31 res(i,:) = res(i,:) + res(j,:)
32 res(j,:) = zero
79 do j = 1,nshg
80 if (btest(iBC(j),10)) then
81 i = iper(j)
82 res(i) = res(i) + res(j)
83 res(j) = zero !changed
/phasta/svLS/
H A DSPARMUL.f53 INTEGER i, j, l, col, s, e local
59 DO j=rowPtr(1,i), rowPtr(2,i)
60 KU(1,i) = KU(1,i) + K(1,j)*U(1,colPtr(j))
65 DO j=rowPtr(1,i), rowPtr(2,i)
66 col = colPtr(j)
67 KU(1,i) = KU(1,i) + K(1,j)*U(1,col) + K(2,j)*U(2,col)
68 KU(2,i) = KU(2,i) + K(3,j)*U(1,col) + K(4,j)*U(2,col)
73 DO j=rowPtr(1,i), rowPtr(2,i)
74 col = colPtr(j)
75 KU(1,i) = KU(1,i) + K(1,j)*U(1,col) + K(2,j)*U(2,col)
[all …]
H A DGE.f49 INTEGER m, ipv, i, j local
79 DO j=m, N+1
80 saveEl = C(m,j)
81 C(m,j) = C(ipv,j)
82 C(ipv,j) = saveEl
84 DO j=1, m-1
91 DO j=m+1,N+1
92 C(i,j) = C(i,j) - saveEl*C(m,j)
97 DO j=N,1,-1
98 DO i=j+1,N
[all …]
H A DGMRES.f55 INTEGER i, j, k, l local
114 DO j=1, i
115 h(j,i) = DOTV(dof, mynNo, commu, u(:,:,i+1), u(:,:,j))
116 u(:,:,i+1) = u(:,:,i+1) - h(j,i)*u(:,:,j)
121 DO j=1, i-1
122 tmp = c(j)*h(j,i) + s(j)*h(j+1,i)
123 h(j+1,i) = -s(j)*h(j,i) + c(j)*h(j+1,i)
124 h(j,i) = tmp
141 DO j=i, 1, -1
142 DO k=j+1, i
[all …]
/phasta/phSolver/common/
H A Dludcmp.f16 do j=1,n
17 if (abs(aa(i,j)).gt.aamax) aamax=abs(aa(i,j))
22 do j=1,n
23 do i=1,j-1
24 sum=aa(i,j)
26 sum=sum-aa(i,k)*aa(k,j)
28 aa(i,j)=sum
31 do i=j,n
32 sum=aa(i,j)
33 do k=1,j-1
[all …]
H A Dqpbc.f21 do j=1,2
22 istrt=j+(i-1)*(nflow-1)
23 uv(:,j)=qres(:,istrt)
26 do j=1,2
27 istrt=j+(i-1)*(nflow-1)
28 qres(:,istrt)=uv(:,j)
46 do j= 1,nshg
47 if ((btest(iBC(j),10))) then
48 i = iper(j)
49 rmass(i) = rmass(i) + rmass(j)
[all …]
H A Dlocal.f44 do j = 1, n
46 rlocal(:,i,j) = global(ien(:,i),j)
67 do j = 1, n
70 global(ien(nel,i),j) = global(ien(nel,i),j)
71 & + rlocal(nel,i,j)
93 do j = 1, n
96 global(ien(nel,i),j) = rlocal(nel,i,j)
147 do j = 1, n
149 rlocal(:,i,j) = global(ien(:,i),j)
171 do j = 1, n
[all …]
H A Ddtn.f28 do j=1,nsclr
29 tmp(j)=y(i,5+j)
38 do j=1,nsclr
39 BC(i,6+j)=-tmp(j)
116 do j=1,nsclr
118 tmpBC(:,j)=BC(:,nstart+j)
126 do j=1,nsclr
129 BCB(i,k,6+j)=tmpBCB(i,k,j)
187 integer i,j,n local
242 j = int ( (y - table(2,0,0,itype) ) / dx(2,itype))
[all …]
H A Dbctint.f201 do j=1,ntpts
203 read(567,*) (BCt(j,n),n=1,4)
251 do j=1,ntpts
310 integer iBC(numnp),nlast,i,j,nper local
321 do j=2,nlast !loop to find the interval that we are in
323 if(BCtptr(i)%p(j,4).gt.t) then
326 wr=(t-BCtptr(i)%p(j-1,4))/(BCtptr(i)%p(j,4)-BCtptr(i)%p(j-1,4))
327 BC(nbct(i),3:5)= BCtptr(i)%p(j-1,1:3)*(one-wr)
328 & + BCtptr(i)%p(j,1:3)*wr
364 do j=1,numDataImp
[all …]
H A Dsonfath.f66 do j = i, i+n3m-1
67 gfath(j) = counter
73 do j = 1, numpe
75 ifath(j,i) = gfath(imap(ncorp(j,i)))
93 do j = 1, nc4, n3m
95 do k = j, j+n3m-1
104 do j = 1, numpe
106 ifath(j,i) = gfath(imap(ncorp(j,i)))
131 do j = 1, numnp
132 i = iper(j)
[all …]
H A Drenum.f48 j = 0
51 j = j+1
52 nula(j) = i
76 do i=1,j
85 j = 0
89 j = j + 1
90 nrin(j)=nen1(i)
93 nfin = j
102 j = 0
117 j = j + 1
[all …]
/phasta/converterIO/
H A DconverterO2N.cc71 int i, j, k, N_geombc_double, N_geombc_integer, N_restart_double; in main() local
205 j = 0; in main()
209 sprintf(gfname,"./%d-procs_case/restart.%d.%d", N_parts, N_steps, startpart+j); in main()
216 subdir = (startpart+j-1) / DIR_FANOUT; in main()
218 sprintf(gfname,"./%d-procs_case/%d/restart.%d.%d",N_parts, subdir, N_steps, startpart+j); in main()
244 for ( j = 0; j < nppp; j++ ) in main()
245 …numVariables[j] = iarray[1]; //iarray[i] contains the number of variables from the header of the s… in main()
371 for ( j = 0; j < N_geombc_double; j++ ) in main()
375 paraD[i][j] = new int[expectD[j]]; in main()
381 WriteLockD[j]=0; in main()
[all …]
H A DconverterN2O.cc45 int i, j, k, N_restart_integer, N_restart_double; in main() local
206 for ( j = 0; j < nppp; j++ ) in main()
208 paraD[i][j] = new int[expectD[i]]; in main()
213 GPID = startpart + j; in main()
232 paraD[i][j][k] = iarray[k]; in main()
237 isize = paraD[i][j][0]; in main()
239 isize = paraD[i][j][0] * paraD[i][j][1]; in main()
241 Dfield[i][j] = new double[isize]; in main()
244 (void*)Dfield[i][j], in main()
270 for ( j = 0; j < nppp; j++ ) in main()
[all …]
/phasta/phSolver/incompressible/
H A Dftools.f60 integer i, j local
99 do j = 1, m
100 c(i,j) = a(i,j) * b(i,j)
116 integer m, n, i, j local
120 do j = 1, m
121 a(i,j) = 0.0e-0
135 integer m, n, i, j local
139 do j = 1, m
140 b(i,j) = a(i,j)
154 integer m, n, i, j local
[all …]
H A DlesSparse.f134 do j = 1, nflow
135 if (flowDiag(i,j).ne.0)
136 & flowDiag(i,j) = 1. / sqrt(abs(flowDiag(i,j)))
216 integer i, j, k
233 j = row(k)
235 q(j,1) = q(j,1) - pLhs(1,k) * pisave
236 q(j,2) = q(j,2) - pLhs(2,k) * pisave
237 q(j,3) = q(j,3) - pLhs(3,k) * pisave
267 integer i, j, k
287 j = row(k)
[all …]
/phasta/phSolver/AMG/
H A Dramg_coarse.f38 integer :: i,j,k,m,n,p,q local
189 j = 1
192 amg_paramap(level2)%p(j) = amg_paramap(level1)%p(i)
193 amg_paraext(level2)%p(j) = amg_paraext(level1)%p(i)
194 j = j + 1
236 j = amg_A_rowp(level1)%p(k)
237 if (cfilter.eq.amg_paramap(level1)%p(j)) then
239 if ( (amg_F(j).eq.1) .and. (mod(amg_S(k),2).eq.1) ) then
244 amg_Fn(n) = j
246 aLoc(j) = n
[all …]

123456