Home
last modified time | relevance | path

Searched refs:k (Results 1 – 25 of 78) sorted by relevance

1234

/phasta/phSolver/compressible/
H A Dspsi3pre.f48 do k = col(i), col(i+1)-1
50 lhsK(2,k) = lhsK(2,k)
51 & - BDiag(i,2,1) * lhsK(1,k)
52 lhsK(7,k) = lhsK(7,k)
53 & - BDiag(i,2,1) * lhsK(6,k)
54 lhsK(12,k) = lhsK(12,k)
55 & - BDiag(i,2,1) * lhsK(11,k)
56 lhsK(17,k) = lhsK(17,k)
57 & - BDiag(i,2,1) * lhsK(16,k)
58 lhsK(22,k) = lhsK(22,k)
[all …]
H A Dsparseap.f56 do k = col(i), col(i+1)-1
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)
66 2 + lhsK(12,k)*p(j,3)
[all …]
H A De3tau.f1045 do k = 1, ipord
1049 Tau(:,1,1,k) = rho*T*(STau(:,1,k)+u1*STau(:,2,k)+
1050 & u2*STau(:,4,k)+u3*STau(:,7,k)+betaT*STau(:,11,k))
1051 Tau(:,1,2,k) = rho*T*(STau(:,2,k)+u1*STau(:,3,k)+
1052 & u2*STau(:,5,k)+u3*STau(:,8,k)+betaT*STau(:,12,k))
1053 Tau(:,1,3,k) = rho*T*(STau(:,4,k)+u1*STau(:,5,k)+
1054 & u2*STau(:,6,k)+u3*STau(:,9,k)+betaT*STau(:,13,k))
1055 Tau(:,1,4,k) = rho*T*(STau(:,7,k)+u1*STau(:,8,k)+
1056 & u2*STau(:,9,k)+u3*STau(:,10,k)+betaT*STau(:,14,k))
1057 Tau(:,1,5,k) = rho*T*(STau(:,11,k)+u1*STau(:,12,k)+
[all …]
H A Dtimedata.f90205 do k=1,ndof*ntspts
206 if(vartssoln(k).ne.zero) ivarts(k)=1
223 do k=1,ndof
224 if(ivartsg(indxvarts+k).ne.0) then ! none of the vartssoln(parts) were non zero
225 varts(jj,k) =
226 & vartssolng(indxvarts+k) / ivartsg(indxvarts+k)
268 integer :: k, ibuf local
293 …& ((vartsbuff(jj,k,ibuf), k=1, ndof) !loop over the variables that you actual…
H A Dd2wall.f93 do k=1,nsd
94 call MPI_ALLGATHERV(xwi(:,j,k),nwalli,
95 & MPI_DOUBLE_PRECISION,xw(:,j,k),nwall,idisp,
111 do k=1,nenb+1
112 distance = ( x(i,1) - xw(j,k,1) )**2
113 & +( x(i,2) - xw(j,k,2) )**2
114 & +( x(i,3) - xw(j,k,3) )**2
H A Dsolgmrpetsc.c116 int i,j,k,l,m; in SolGMRp() local
140 for(k=0;k<nshg;k++) { in SolGMRp()
141 if((fncorp[k] < mbeg) || (fncorp[k] >mend)){ in SolGMRp()
252 k=0; in SolGMRp()
268 indexsetary[k] = nodetoinsert*nflow+(j-1); in SolGMRp()
269 assert(indexsetary[k]>=0); in SolGMRp()
271 k = k+1; in SolGMRp()
279 indexsetary[k] = nodetoinsert*nflow+(j-1); in SolGMRp()
280 k = k+1; in SolGMRp()
312 k = 0; in SolGMRp()
[all …]
/phasta/phSolver/incompressible/
H A DlesSparse.f30 integer n, k
39 k = sparseloc( rowp(colm(n)), colm(n+1)-colm(n), n )
42 flowdiag(n,1) = lhsK(1,k)
43 flowdiag(n,2) = lhsK(5,k)
44 flowdiag(n,3) = lhsK(9,k)
46 flowdiag(n,4) = lhsP(4,k)
51 do k=colm(n),colm(n+1)-1
54 flowdiag(n,1) = flowdiag(n,1) + abs(lhsK(1,k))
56 flowdiag(n,2) = flowdiag(n,2) + abs(lhsK(5,k))
58 flowdiag(n,3) = flowdiag(n,3) + abs(lhsK(9,k))
[all …]
H A Dgenlmass.f181 integer n, k local
193 k = sparseloc( rowp(colm(n)), colm(n+1)-colm(n), n )
196 lhsK(1,k) = lhsK(1,k) + tmp
197 lhsK(5,k) = lhsK(5,k) + tmp
198 lhsK(9,k) = lhsK(9,k) + tmp
223 integer n, k local
235 k = sparseloc( rowp(colm(n)), colm(n+1)-colm(n), n )
238 lhsS(k) = lhsS(k) + tmp
H A Dwrite_hessian.c9 int i,j,k; in write_hessian() local
40 k = map[ i ]-1; in write_hessian()
49 fprintf( uhess, "%f ", hessian[k+(u[j]-1)*(*nshg)] ); in write_hessian()
50 fprintf( vhess, "%f ", hessian[k+(v[j]-1)*(*nshg)] ); in write_hessian()
51 fprintf( whess, "%f ", hessian[k+(w[j]-1)*(*nshg)] ); in write_hessian()
/phasta/phSolver/common/
H A Dfillsparse.f12 integer aa, b, c, e, i, k, n local
37 k = sparseloc( row(c), n, ien(e,b) ) + c-1
44 lhsK(1,k) = lhsK(1,k) + xKebe(e,1,aa,b)
45 lhsK(2,k) = lhsK(2,k) + xKebe(e,2,aa,b)
46 lhsK(3,k) = lhsK(3,k) + xKebe(e,3,aa,b)
47 lhsK(4,k) = lhsK(4,k) + xKebe(e,4,aa,b)
48 lhsK(5,k) = lhsK(5,k) + xKebe(e,5,aa,b)
49 lhsK(6,k) = lhsK(6,k) + xKebe(e,6,aa,b)
50 lhsK(7,k) = lhsK(7,k) + xKebe(e,7,aa,b)
51 lhsK(8,k) = lhsK(8,k) + xKebe(e,8,aa,b)
[all …]
H A Dbctint.f188 do k=1,ntv
361 do k=1,numImpSrfs
363 numImpt(k) = numDataImp
365 read(817,*) (ValueImpt(j,n,k),n=1,2) ! n=1 time, 2 value
385 integer nlast, nper, k, j , jstep local
388 do k =1,numImpSrfs
389 nlast=numImpt(k) ! number of time series to interpolate from
390 nper=ctime/ValueImpt(nlast,1,k)!number of periods completed to shift off
391 ptime = ctime-nper*ValueImpt(nlast,1,k) ! now time in periodic domain
395 if(ValueImpt(j,1,k).gt.ptime) then ! this is upper bound, j-1 is lower
[all …]
H A Dludcmp.f25 do k=1,i-1
26 sum=sum-aa(i,k)*aa(k,j)
33 do k=1,j-1
34 sum=sum-aa(i,k)*aa(k,j)
44 do k=1,n
45 dum=aa(imax,k)
46 aa(imax,k)=aa(j,k)
47 aa(j,k)=dum
H A Dnewshape.cc175 double Pyr_eB(double xi[3], int sign[3], int k, int m, int along) in Pyr_eB() argument
180 k--; m--; along--; in Pyr_eB()
184 psi =0.125*(xi[2]*xi[2]-1)*(1+sign[k]*(2*xi[k]*tmp0))*(1+sign[m]*(2*xi[m]*tmp0)); in Pyr_eB()
187 double tmp1 =2*xi[k]*tmp0; in Pyr_eB()
193 double dPeBdxi(double xi[3], int sign[3], int k, int m, int along, int byWhich) in dPeBdxi() argument
200 k--; m--; along--; in dPeBdxi()
202 if (byWhich==k) in dPeBdxi()
203 dPsidxi =-0.25*(1+xi[2])*sign[k]*(1+sign[m]*(2*xi[m]*tmp0)); in dPeBdxi()
205 dPsidxi =-0.25*(1+xi[2])*sign[m]*(1+sign[k]*(2*xi[k]*tmp0)); in dPeBdxi()
207 dPsidxi =0.25*(xi[2]*(1+sign[k]*2*xi[k]*tmp0)*(1+sign[m]*2*xi[m]*tmp0)- in dPeBdxi()
[all …]
H A Dgen_ncorp.c138 int i,j,k; in count_owned() local
153 for(k=0;k<lenseg;k++) in count_owned()
155 if(ncorp_tmp[isgbeg-1+k] == 0) in count_owned()
158 assert(ncorp_tmp[isgbeg-1+k] != -1); in count_owned()
159 ncorp_tmp[isgbeg-1+k] = 1; in count_owned()
160 assert(isgbeg-1+k < *num_nodes); in count_owned()
166 for(k=0;k<lenseg;k++) in count_owned()
168 ncorp_tmp[isgbeg-1+k] = -1; in count_owned()
169 assert(isgbeg-1+k < *num_nodes); in count_owned()
H A Delm3keps.f132 real*8 k, kInv, kq, eps, y, epsInv, epsP2, local
175 k = abs(kay(e))
176 if (k.lt.1.e-32) k=0
187 kq = sqrt(k)
193 if ( k .gt.1.e-32 ) then
194 kInv = 1. / k
195 kqInv = 1./sqrt(k)
199 kk = k * k
236 Ret_k = 2. * k * epsInv * nuInv
272 T1st = k * epsInv ! 1st time scale
[all …]
H A Dcname.f51 do k = 1,8
52 ii = (ii - il(k-1)) / 10
53 il(k) = mod (ii,10)
58 do k = 8,1,-1
59 if (il(k) .ne. 0 .or. beg) then
61 cc = TRIM(cc) // CHAR(ic0 + il(k))
H A Dgenscale.f76 do k=1,nshl
78 & + yintl(elcnfin(i,j),k,:)*shapef(k)
168 do k=1,nshl
171 if ((x(ien2D(i,k),2).ge.xyn(j)) .and.
172 & (x(ien2D(i,k),2).le.(xyn(j+1)+0.000001))) then
173 tmp = (x(ien2D(i,k),2) - xyn(j)) /
176 velbarl(i,k,l) =
182 if ((xcyl(ien2D(i,k),1).ge.xcyl(nrint(j+1),1)) .and.
183 & (xcyl(ien2D(i,k),1).le.xcyl(nrint(j),1))) then
184 tmp = (xcyl(ien2D(i,k),1) - xcyl(nrint(j+1),1)) /
[all …]
/phasta/phSolver/AMG/
H A Dramg_coarse.f38 integer :: i,j,k,m,n,p,q local
149 k = 1
152 CF_map(level1)%p(k) = i
153 CF_revmap(level1)%p(i) = k
154 k = k+1
159 CF_map(level1)%p(k) = i
160 CF_revmap(level1)%p(i) = k
161 k = k+1
235 do k = amg_A_colm(level1)%p(i)+1,amg_A_colm(level1)%p(i+1)-1
236 j = amg_A_rowp(level1)%p(k)
[all …]
/phasta/converterIO/
H A DconverterO2N.cc71 int i, j, k, N_geombc_double, N_geombc_integer, N_restart_double; in main() local
377 for ( k = 0; k < 10; k++ ) in main()
378 iarray[k]=0; in main()
397 for ( k = 0; k < expectD[j]; k++ ) in main()
398 paraD[i][j][k] = iarray[k]; in main()
401 for ( k = 0; k < expectD[j]; k++ ) in main()
402 paraD[i][j][k] = 0; in main()
508 for ( k = 0; k < 10; k++ ) in main()
509 iarray[k]=0; in main()
552 for ( k = 0; k < expectI[j]; k++ ) in main()
[all …]
H A DconverterN2O.cc45 int i, j, k, N_restart_integer, N_restart_double; in main() local
210 for ( k = 0; k < 10; k++ ) in main()
211 iarray[k]=0; in main()
231 for ( k = 0; k < expectD[i]; k++ ) in main()
232 paraD[i][j][k] = iarray[k]; in main()
274 for ( k = 0; k < 10; k++ ) in main()
275 iarray[k]=0; in main()
295 for ( k = 0; k < expectI[i]; k++ ) in main()
296 paraI[i][j][k] = iarray[k]; in main()
381 for ( k = 0; k < expectD[i]; k++ ) in main()
[all …]
/phasta/svLS/
H A DINCOMMU.f50 INTEGER i, j, k, s, e, ierr, nTasks, tF, stat(MPI_STATUS_SIZE) local
80 k = 1
87 R(:,s:e) = R(:,s:e) + rTmp(:,k:k+e-s)
88 k = k + cS(i)%blN(j)
93 k = 1
98 rTmp(:,k:k+e-s) = R(:,s:e)
99 k = k + cS(i)%blN(j)
138 INTEGER i, j, k, s, e, ierr, nTasks, tF, stat(MPI_STATUS_SIZE) local
168 k = 1
175 R(s:e) = R(s:e) + rTmp(k:k+e-s)
[all …]
/phasta/shapeFunction/src/
H A DBn.c19 double Bn(int i, int j, int k, double r, double s, double t) { in Bn() argument
26 if( i==0 && j==0 && k==0 ) { in Bn()
29 } else if( i==0 && j==0 && k==1 ) { in Bn()
32 } else if( i==0 && j==1 && k==0 ) { in Bn()
35 } else if( i==1 && j==0 && k==0 ) { in Bn()
38 } else if( i==0 && j==0 && k==2 ) { in Bn()
44 } else if( i==0 && j==1 && k==1 ) { in Bn()
47 } else if( i==0 && j==2 && k==0 ) { in Bn()
53 } else if( i==1 && j==0 && k==1 ) { in Bn()
56 } else if( i==1 && j==1 && k==0 ) { in Bn()
[all …]
/phasta/M2NFixBnd/src/
H A Dcname.f51 do k = 1,8
52 ii = (ii - il(k-1)) / 10
53 il(k) = mod (ii,10)
58 do k = 8,1,-1
59 if (il(k) .ne. 0 .or. beg) then
61 cc = TRIM(cc) // CHAR(ic0 + il(k))
/phasta/M2N/src/
H A Dcname.f51 do k = 1,8
52 ii = (ii - il(k-1)) / 10
53 il(k) = mod (ii,10)
58 do k = 8,1,-1
59 if (il(k) .ne. 0 .or. beg) then
61 cc = TRIM(cc) // CHAR(ic0 + il(k))
/phasta/AcuStat/src/
H A Dcname.f51 do k = 1,8
52 ii = (ii - il(k-1)) / 10
53 il(k) = mod (ii,10)
58 do k = 8,1,-1
59 if (il(k) .ne. 0 .or. beg) then
61 cc = TRIM(cc) // CHAR(ic0 + il(k))

1234