Lines Matching refs:k

38       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)
239 if ( (amg_F(j).eq.1) .and. (mod(amg_S(k),2).eq.1) ) then
245 amg_la(n) = amg_A_lhs(level1)%p(k,1)
252 do k=amg_A_colm(level1)%p(i)+1,amg_A_colm(level1)%p(i+1)-1
253 j = amg_A_rowp(level1)%p(k)
254 if ( (amg_F(j).eq.2) .and. (mod(amg_S(k),2).eq.1)) then
289 do k = 1,n ! all non diagonal
290 aLoc(amg_Fn(k))=0
292 if ( amg_la(k).lt.0 ) then ! a-hat < 0
293 alpha = alpha + amg_la(k)
295 beta = beta + amg_la(k)
298 if (amg_Fp(k).eq.1) then
300 if (amg_la(k).lt.0) then ! a-hat < 0 in coarse
301 alphac = alphac + amg_la(k)
303 betac = betac + amg_la(k)
305 amg_Fn(I_nnz) = amg_Fn(k)
306 amg_la(I_nnz) = amg_la(k)
312 do k = 1,I_nnz
313 if ( amg_la(k).lt.0) then
314 amg_la(k) = amg_la(k)*alpha
316 amg_la(k) = amg_la(k)*beta
318 rtp = max(rtp,abs(amg_la(k)))
328 do k=1,n
329 tmp3 = tmp3 + min(amg_la(k),zero)
330 tmp4 = tmp4 + max(amg_la(k),zero)
331 if (abs(amg_la(k)).gt.rtp) then
332 tmp1 = tmp1 + min(amg_la(k),zero)
333 tmp2 = tmp2 + max(amg_la(k),zero)
335 amg_Fn(I_nnz) = amg_Fn(k)
336 amg_la(I_nnz) = amg_la(k)
341 do k=1,I_nnz
342 if (amg_la(k).lt.0) then
343 amg_la(k) = amg_la(k)*tmp1
345 amg_la(k) = amg_la(k)*tmp2
356 do k = 1,I_nnz ! scan over P-hat
357 amg_I_rowp%pp(i)%p(k) = amg_Ip(amg_Fn(k))
359 if (amg_la(k).lt.0) then
360 amg_I%pp(i)%p(k) = amg_la(k)
362 amg_I%pp(i)%p(k) = amg_la(k)
446 do k=I_cf_colm(level1)%p(i),I_cf_colm(level1)%p(i+1)-1
447 j = I_cf_rowp(level1)%p(k)
451 I_fc(level1)%p(kj) = I_cf(level1)%p(k)
473 integer :: i,j,k,t local
480 k = i
481 j = ishft(k-1,-1)
482 do while ( ( k.gt.0 ).and.(wght(heap(k)).gt.wght(heap(j))) )
484 heap(j) = heap(k)
485 heap(k) = t
486 k = j
504 integer i,j,k local
519 integer i,j,k,t local
589 integer :: i,j,k,n,m local
617 k = arowp(j)
618 if ((cfilter.eq.afmap(k)).and.(alhs(j).lt.rowmax(i))) then
621 if ((cfilter.eq.afmap(k)).and.(alhs(j).gt.prowmax(i))) then
636 k = arowp(j)
637 if (cfilter.eq.afmap(k)) then ! same subset
642 if (alhs(j) .lt. rowmax(k)) then
650 if (alhs(j) .gt. prowmax(k)) then
665 k = arowp(j)
666 if ((amg_S(j).ne.0).and.(afmap(k).eq.cfilter)) then
683 k = 0
686 k = k+1
689 if (k.eq.anshg) then
701 k = arowp(j)
702 if ((afmap(k).eq.cfilter).and.(amg_S(j).ge.2)) then ! in S^T
704 if (amg_CF(k).eq.0) then ! undecided
706 else if (amg_CF(k).eq.2) then ! free
741 k = iabs(afmap(m))
742 if (oneck(k).eq.1) then
761 k = arowp(j)
762 if (afmap(k).eq.afmap(m)) then
764 if (amg_CF(k).eq.0) then !not defined yet !if A
766 amg_CF(k) = 2 ! mark fine
767 amg_L(k) = 0!afmap(k)+k*MSCALE!0 !floor(amg_L(k))
768 call ramg_popheap(aheap,ainvheap,amg_L,nheaps,ainvheap(k),
771 do i = acolm(k),acolm(k+1)-1
788 if (amg_CF(k).eq.0) then
790 amg_L(k) = amg_L(k) - LSCALE
792 amg_L(k) = amg_L(k) + LSCALE
794 call ramg_adjheap(aheap,ainvheap,amg_L,nheaps,ainvheap(k),
801 k = 0
804 k = k+1
807 if (k.eq.anshg) then
826 k = 0
829 k = k+1
840 if (k.eq.anshg) then