! ! ! AMG-AINV: Approximate Inverse plugin for ! AMG4PSBLAS version 1.0 ! ! (C) Copyright 2020 ! ! Salvatore Filippone University of Rome Tor Vergata ! ! Redistribution and use in source and binary forms, with or without ! modification, are permitted provided that the following conditions ! are met: ! 1. Redistributions of source code must retain the above copyright ! notice, this list of conditions and the following disclaimer. ! 2. Redistributions in binary form must reproduce the above copyright ! notice, this list of conditions, and the following disclaimer in the ! documentation and/or other materials provided with the distribution. ! 3. The name of the AMG4PSBLAS group or the names of its contributors may ! not be used to endorse or promote products derived from this ! software without specific written permission. ! ! THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS ! ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED ! TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR ! PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE AMG4PSBLAS GROUP OR ITS CONTRIBUTORS ! BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR ! CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF ! SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS ! INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN ! CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ! ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE ! POSSIBILITY OF SUCH DAMAGE. ! ! subroutine psb_zsparse_biconjg_s_llk(n,a,p,z,w,nzrmax,sp_thresh,info) use psb_base_mod use psb_ainv_tools_mod use psb_z_biconjg_mod, psb_protect_name => psb_zsparse_biconjg_s_llk ! ! Left-looking variant SYMMETRIC/HERMITIAN A. You have been warned! ! ! implicit none integer(psb_ipk_), intent(in) :: n type(psb_z_csr_sparse_mat), intent(in) :: a type(psb_z_csc_sparse_mat), intent(inout) :: z,w integer(psb_ipk_), intent(in) :: nzrmax real(psb_dpk_), intent(in) :: sp_thresh complex(psb_dpk_), intent(out) :: p(:) integer(psb_ipk_), intent(out) :: info ! Locals integer(psb_ipk_), allocatable :: ia(:), ja(:), izkr(:), izcr(:) complex(psb_dpk_), allocatable :: zval(:),val(:), q(:) integer(psb_ipk_) :: i,j,k, kc, kr, err_act, nz, nzra, nzrz, ipzi,ipzj,& & nzzi,nzzj, nzz, ip1, ip2, ipza,ipzz, ipzn, nzzn, ipz1, ipz2,& & ipj, lastj, nextj, nzw,kk type(psb_i_heap) :: heap, rheap type(psb_z_csc_sparse_mat) :: ac complex(psb_dpk_) :: alpha, zvalmax character(len=20) :: name='psb_orth_llk' logical, parameter :: debug=.false. allocate(zval(n),ia(n),val(n),izkr(n),izcr(n),stat=info) if (info == psb_success_) call ac%cp_from_fmt(a,info) if (info /= psb_success_) then call psb_errpush(psb_err_from_subroutine_,name,a_err='Allocate') return end if ! ! izkr(i): flag nonzeros in ZVAL. To minimize traffic into heap. ! izcr(i): flag rows to be used for the dot products. Used to minimize ! traffic in rheap. ! do i=1,n izkr(i) = 0 izcr(i) = 0 zval(i) = zzero end do ! Init z_1=e_1 and p_1=a_11 p(1) = zzero i = 1 nz = a%irp(i+1) - a%irp(i) do j=1,nz if (a%ja(j) == 1) then p(1) = a%val(j) exit end if end do if (abs(p(1)) < d_epstol) & & p(1) = 1.d-3 ! ! call z%allocate(n,n,n*nzrmax) z%icp(1) = 1 z%icp(2) = 2 z%ia(1) = 1 z%val(1) = zone nzz = 1 zvalmax = zone do i = 2, n if (debug) write(0,*) 'Main loop iteration ',i,n ! ! Update loop on Z. ! Must be separated from update loop of W because of ! the conflict on J that would result. ! ! ZVAL = e_i ! !$ do j=1, i-1 ! !$ zval(j) = zzero ! !$ end do zval(i) = zone izkr(i) = 1 call heap%init(info) if (info == psb_success_) call heap%insert(i,info) if (info == psb_success_) call rheap%init(info) do j = ac%icp(i), ac%icp(i+1)-1 if (ac%ia(j) < i) then if (info == psb_success_) call rheap%insert(ac%ia(j),info) izcr(ac%ia(j)) = 1 end if end do if (info /= psb_success_) then info=psb_err_from_subroutine_ call psb_errpush(info,name,a_err='psb_init_heap') return end if ! Update loop ! The idea is to keep track of the indices of the nonzeros in zval, ! so as to only do the dot products on the rows which have nonzeros ! in their positions; to do this we keep an extra ! copy of A in CSC, and the row indices to be considered are in rheap. lastj = -1 outer: do inner: do call rheap%get_first(j,info) if (debug) write(0,*) 'from get_first: ',j,info if (info == -1) exit outer ! Empty heap if (j > lastj) then lastj = j exit inner end if end do inner izcr(j) = 0 if (j>=i) cycle outer if (debug) write(0,*) 'update loop, using row: ',j,i ip1 = a%irp(j) ip2 = a%irp(j+1) - 1 do if (ip2 < ip1 ) exit if (a%ja(ip2) <= n) exit ip2 = ip2 -1 end do nzra = max(0,ip2 - ip1 + 1) p(i) = psb_spge_dot(nzra,a%ja(ip1:ip2),a%val(ip1:ip2),zval) ! !$ write(psb_err_unit,*) j,i,p(i) alpha = (-p(i)/p(j)) if (.false..or.(abs(alpha) > sp_thresh)) then do k=z%icp(j), z%icp(j+1)-1 kr = z%ia(k) zval(kr) = zval(kr) + alpha*z%val(k) !!$ if (abs(zval(kr)) > 1e16) then !!$ write(0,*) i,j,p(i),p(j),alpha,z%val(k),alpha*z%val(k),kr,zval(kr) !!$ end if if (izkr(kr) == 0) then call heap%insert(kr,info) if (info /= psb_success_) exit izkr(kr) = 1 ! We have just added a new nonzero in KR. Thus, we will ! need to explicitly compute the dot products on all ! rows jj).and.(nextj