Added module for biconjugation algorithms
Cirdans-Home
4 years ago
parent
8d2ab75737
commit
87e54f75e5
@ -0,0 +1,366 @@
|
||||
!
|
||||
!
|
||||
! 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_csparse_biconjg_llk(n,a,p,z,w,nzrmax,sp_thresh,info)
|
||||
use psb_base_mod
|
||||
use psb_ainv_tools_mod
|
||||
use psb_c_biconjg_mod, psb_protect_name => psb_csparse_biconjg_llk
|
||||
!
|
||||
! Left-looking variant
|
||||
!
|
||||
!
|
||||
implicit none
|
||||
integer(psb_ipk_), intent(in) :: n
|
||||
type(psb_c_csr_sparse_mat), intent(in) :: a
|
||||
type(psb_c_csc_sparse_mat), intent(inout) :: z,w
|
||||
integer(psb_ipk_), intent(in) :: nzrmax
|
||||
real(psb_spk_), intent(in) :: sp_thresh
|
||||
complex(psb_spk_), intent(out) :: p(:)
|
||||
integer(psb_ipk_), intent(out) :: info
|
||||
|
||||
! Locals
|
||||
integer(psb_ipk_), allocatable :: ia(:), ja(:), izkr(:), izcr(:)
|
||||
complex(psb_spk_), 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
|
||||
type(psb_i_heap) :: heap, rheap
|
||||
type(psb_c_csc_sparse_mat) :: ac
|
||||
complex(psb_spk_) :: alpha
|
||||
character(len=20) :: name='psb_orth_llk'
|
||||
logical, parameter :: debug=.false.
|
||||
|
||||
allocate(zval(n),ia(n),val(n),izkr(n),izcr(n),q(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) = czero
|
||||
end do
|
||||
|
||||
! Init z_1=e_1 and p_1=a_11
|
||||
p(1) = czero
|
||||
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)) < s_epstol) &
|
||||
& p(1) = 1.d-3
|
||||
|
||||
q(1) = p(1)
|
||||
!
|
||||
!
|
||||
call z%allocate(n,n,n*nzrmax)
|
||||
|
||||
z%icp(1) = 1
|
||||
z%icp(2) = 2
|
||||
z%ia(1) = 1
|
||||
z%val(1) = cone
|
||||
nzz = 1
|
||||
|
||||
call w%allocate(n,n,n*nzrmax)
|
||||
w%icp(1) = 1
|
||||
w%icp(2) = 2
|
||||
w%ia(1) = 1
|
||||
w%val(1) = cone
|
||||
nzw = 1
|
||||
|
||||
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) = czero
|
||||
! !$ end do
|
||||
zval(i) = cone
|
||||
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
|
||||
!!$ write(0,*) i, ' Outer inserting ',ac%ia(j)
|
||||
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))
|
||||
!!$ write(0,*) 'At step ',i,j,' p(i) ',p(i),alpha
|
||||
if (.false..or.(abs(alpha) > sp_thresh)) then
|
||||
!!$ write(0,*) 'At step ',i,j,' range ',z%icp(j), z%icp(j+1)-1, &
|
||||
!!$ & ' vals ',z%ia(z%icp(j):z%icp(j+1)-1)
|
||||
do k=z%icp(j), z%icp(j+1)-1
|
||||
kr = z%ia(k)
|
||||
zval(kr) = zval(kr) + alpha*z%val(k)
|
||||
if (izkr(kr) == 0) then
|
||||
!!$ write(0,*) ' main inner Inserting ',kr
|
||||
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 j<k<i with nonzeros in column kr; we keep them in
|
||||
! a heap.
|
||||
!
|
||||
do kc = ac%icp(kr), ac%icp(kr+1)-1
|
||||
nextj=ac%ia(kc)
|
||||
if ((info == psb_success_).and.(izcr(nextj)==0)&
|
||||
& .and.(nextj>j).and.(nextj<i)) then
|
||||
!!$ write(0,*) j,i,' Inner inserting ',nextj
|
||||
call rheap%insert(nextj,info)
|
||||
izcr(nextj) = 1
|
||||
end if
|
||||
end do
|
||||
if (debug) write(0,*) 'update loop, adding indices: ',&
|
||||
& ac%ia(ac%icp(kr):ac%icp(kr+1)-1)
|
||||
|
||||
end if
|
||||
if (info /= psb_success_) exit
|
||||
end do
|
||||
if (info /= psb_success_) then
|
||||
info=psb_err_from_subroutine_
|
||||
call psb_errpush(info,name,a_err='psb_insert_heap')
|
||||
return
|
||||
end if
|
||||
end if
|
||||
end do outer
|
||||
call a%csget(i,i,nzra,ia,ja,val,info)
|
||||
call rwclip(nzra,ia,ja,val,ione,n,ione,n)
|
||||
p(i) = psb_spge_dot(nzra,ja,val,zval)
|
||||
if (abs(p(i)) < s_epstol) &
|
||||
& p(i) = 1.d-3
|
||||
|
||||
!!$ write(0,*) 'Dropping from a column with: ',i,psb_howmany_heap(heap),sp_thresh
|
||||
|
||||
!
|
||||
! Sparsify current ZVAL and put into ZMAT
|
||||
!
|
||||
call sparsify(i,nzrmax,sp_thresh,n,zval,nzrz,ia,val,info,iheap=heap,ikr=izkr)
|
||||
if (info /= psb_success_) then
|
||||
info = psb_err_internal_error_
|
||||
call psb_errpush(info,name,a_err='sparsify')
|
||||
return
|
||||
end if
|
||||
call psb_ensure_size(nzz+nzrz, z%ia, info)
|
||||
call psb_ensure_size(nzz+nzrz, z%val, info)
|
||||
ipz1 = z%icp(i)
|
||||
do j=1, nzrz
|
||||
z%ia(ipz1 + j -1) = ia(j)
|
||||
z%val(ipz1 + j -1) = val(j)
|
||||
end do
|
||||
z%icp(i+1) = ipz1 + nzrz
|
||||
nzz = nzz + nzrz
|
||||
|
||||
|
||||
! WVAL = e_i
|
||||
! !$ do j=1, i-1
|
||||
! !$ zval(j) = czero
|
||||
! !$ end do
|
||||
zval(i) = cone
|
||||
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 = a%irp(i), a%irp(i+1)-1
|
||||
if (a%ja(j) < i) then
|
||||
if (info == psb_success_) call rheap%insert(a%ja(j),info)
|
||||
izcr(a%ja(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
|
||||
outerw: do
|
||||
innerw: do
|
||||
call rheap%get_first(j,info)
|
||||
if (debug) write(0,*) 'from get_first: ',j,info
|
||||
if (info == -1) exit outerw ! Empty heap
|
||||
if (j > lastj) then
|
||||
lastj = j
|
||||
exit innerw
|
||||
end if
|
||||
end do innerw
|
||||
izcr(j) = 0
|
||||
if (j>=i) cycle outerw
|
||||
if (debug) write(0,*) 'update loop, using row: ',j
|
||||
ip1 = ac%icp(j)
|
||||
ip2 = ac%icp(j+1) - 1
|
||||
do
|
||||
if (ip2 < ip1 ) exit
|
||||
if (ac%ia(ip2) <= n) exit
|
||||
ip2 = ip2 -1
|
||||
end do
|
||||
nzra = max(0,ip2 - ip1 + 1)
|
||||
q(i) = psb_spge_dot(nzra,ac%ia(ip1:ip2),ac%val(ip1:ip2),zval)
|
||||
! !$ write(psb_err_unit,*) j,i,p(i)
|
||||
|
||||
alpha = (-q(i)/q(j))
|
||||
if (.false..or.(abs(alpha) > sp_thresh)) then
|
||||
|
||||
do k=w%icp(j), w%icp(j+1)-1
|
||||
kr = w%ia(k)
|
||||
zval(kr) = zval(kr) + alpha*w%val(k)
|
||||
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 j<k<i with nonzeros in column kr; we keep them in
|
||||
! a heap.
|
||||
!
|
||||
do kc = a%irp(kr), a%irp(kr+1)-1
|
||||
nextj=a%ja(kc)
|
||||
if ((info == psb_success_).and.(izcr(nextj)==0)&
|
||||
& .and.(nextj>j).and.(nextj<i)) then
|
||||
call rheap%insert(nextj,info)
|
||||
izcr(nextj) = 1
|
||||
end if
|
||||
end do
|
||||
if (debug) write(0,*) 'update loop, adding indices: ',&
|
||||
& a%ja(a%irp(kr):a%irp(kr+1)-1)
|
||||
|
||||
end if
|
||||
if (info /= psb_success_) exit
|
||||
end do
|
||||
if (info /= psb_success_) then
|
||||
info=psb_err_from_subroutine_
|
||||
call psb_errpush(info,name,a_err='psb_insert_heap')
|
||||
return
|
||||
end if
|
||||
end if
|
||||
end do outerw
|
||||
ip1 = ac%icp(i)
|
||||
ip2 = ac%icp(i+1) - 1
|
||||
do
|
||||
if (ip2 < ip1 ) exit
|
||||
if (ac%ia(ip2) <= n) exit
|
||||
ip2 = ip2 -1
|
||||
end do
|
||||
nzra = max(0,ip2 - ip1 + 1)
|
||||
q(i) = psb_spge_dot(nzra,ac%ia(ip1:ip2),ac%val(ip1:ip2),zval)
|
||||
if (abs(q(i)) < s_epstol) &
|
||||
& q(i) = 1.d-3
|
||||
|
||||
!!$ write(0,*) 'Dropping from a column with: ',i,psb_howmany_heap(heap),sp_thresh
|
||||
!
|
||||
! Sparsify current ZVAL and put into ZMAT
|
||||
!
|
||||
call sparsify(i,nzrmax,sp_thresh,n,zval,nzrz,ia,val,info,iheap=heap,ikr=izkr)
|
||||
if (info /= psb_success_) then
|
||||
info = psb_err_internal_error_
|
||||
call psb_errpush(info,name,a_err='sparsify')
|
||||
return
|
||||
end if
|
||||
call psb_ensure_size(nzw+nzrz, w%ia, info)
|
||||
call psb_ensure_size(nzw+nzrz, w%val, info)
|
||||
ipz1 = w%icp(i)
|
||||
do j=1, nzrz
|
||||
w%ia(ipz1 + j -1) = ia(j)
|
||||
w%val(ipz1 + j -1) = val(j)
|
||||
end do
|
||||
w%icp(i+1) = ipz1 + nzrz
|
||||
nzw = nzw + nzrz
|
||||
|
||||
end do
|
||||
|
||||
end subroutine psb_csparse_biconjg_llk
|
||||
@ -0,0 +1,362 @@
|
||||
!
|
||||
!
|
||||
! 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_csparse_biconjg_llk_noth(n,a,p,z,w,nzrmax,sp_thresh,info)
|
||||
use psb_base_mod
|
||||
use psb_ainv_tools_mod
|
||||
use psb_c_biconjg_mod, psb_protect_name => psb_csparse_biconjg_llk_noth
|
||||
|
||||
!
|
||||
! Left-looking variant, with NO drop rule on p(i)/p(j)
|
||||
!
|
||||
!
|
||||
implicit none
|
||||
integer(psb_ipk_), intent(in) :: n
|
||||
type(psb_c_csr_sparse_mat), intent(in) :: a
|
||||
type(psb_c_csc_sparse_mat), intent(inout) :: z,w
|
||||
integer(psb_ipk_), intent(in) :: nzrmax
|
||||
real(psb_spk_), intent(in) :: sp_thresh
|
||||
complex(psb_spk_), intent(out) :: p(:)
|
||||
integer(psb_ipk_), intent(out) :: info
|
||||
|
||||
! Locals
|
||||
integer(psb_ipk_), allocatable :: ia(:), ja(:), izkr(:), izcr(:)
|
||||
complex(psb_spk_), 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
|
||||
type(psb_i_heap) :: heap, rheap
|
||||
type(psb_c_csc_sparse_mat) :: ac
|
||||
real(psb_dpk_) :: alpha
|
||||
character(len=20) :: name='psb_orth_llk_noth'
|
||||
logical, parameter :: debug=.false.
|
||||
|
||||
allocate(zval(n),ia(n),val(n),izkr(n),izcr(n),q(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) = czero
|
||||
end do
|
||||
|
||||
! Init z_1=e_1 and p_1=a_11
|
||||
p(1) = czero
|
||||
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)) < s_epstol) &
|
||||
& p(1) = 1.d-3
|
||||
|
||||
q(1) = p(1)
|
||||
!
|
||||
!
|
||||
call z%allocate(n,n,n*nzrmax)
|
||||
|
||||
z%icp(1) = 1
|
||||
z%icp(2) = 2
|
||||
z%ia(1) = 1
|
||||
z%val(1) = done
|
||||
nzz = 1
|
||||
|
||||
call w%allocate(n,n,n*nzrmax)
|
||||
w%icp(1) = 1
|
||||
w%icp(2) = 2
|
||||
w%ia(1) = 1
|
||||
w%val(1) = done
|
||||
nzw = 1
|
||||
|
||||
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) = czero
|
||||
! !$ end do
|
||||
zval(i) = done
|
||||
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 (.true.) then
|
||||
do k=z%icp(j), z%icp(j+1)-1
|
||||
kr = z%ia(k)
|
||||
zval(kr) = zval(kr) + alpha*z%val(k)
|
||||
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 j<k<i with nonzeros in column kr; we keep them in
|
||||
! a heap.
|
||||
!
|
||||
do kc = ac%icp(kr), ac%icp(kr+1)-1
|
||||
nextj=ac%ia(kc)
|
||||
if ((info == psb_success_).and.(izcr(nextj)==0)&
|
||||
& .and.(nextj>j).and.(nextj<i)) then
|
||||
call rheap%insert(nextj,info)
|
||||
izcr(nextj) = 1
|
||||
end if
|
||||
end do
|
||||
if (debug) write(0,*) 'update loop, adding indices: ',&
|
||||
& ac%ia(ac%icp(kr):ac%icp(kr+1)-1)
|
||||
|
||||
end if
|
||||
if (info /= psb_success_) exit
|
||||
end do
|
||||
if (info /= psb_success_) then
|
||||
info=psb_err_from_subroutine_
|
||||
call psb_errpush(info,name,a_err='psb_insert_heap')
|
||||
return
|
||||
end if
|
||||
end if
|
||||
end do outer
|
||||
call a%csget(i,i,nzra,ia,ja,val,info)
|
||||
call rwclip(nzra,ia,ja,val,ione,n,ione,n)
|
||||
p(i) = psb_spge_dot(nzra,ja,val,zval)
|
||||
if (abs(p(i)) < s_epstol) &
|
||||
& p(i) = 1.d-3
|
||||
|
||||
!!$ write(0,*) 'Dropping from a column with: ',i,psb_howmany_heap(heap),sp_thresh
|
||||
|
||||
!
|
||||
! Sparsify current ZVAL and put into ZMAT
|
||||
!
|
||||
call sparsify(i,nzrmax,sp_thresh,n,zval,nzrz,ia,val,info,iheap=heap,ikr=izkr)
|
||||
if (info /= psb_success_) then
|
||||
info = psb_err_internal_error_
|
||||
call psb_errpush(info,name,a_err='sparsify')
|
||||
return
|
||||
end if
|
||||
call psb_ensure_size(nzz+nzrz, z%ia, info)
|
||||
call psb_ensure_size(nzz+nzrz, z%val, info)
|
||||
ipz1 = z%icp(i)
|
||||
do j=1, nzrz
|
||||
z%ia(ipz1 + j -1) = ia(j)
|
||||
z%val(ipz1 + j -1) = val(j)
|
||||
end do
|
||||
z%icp(i+1) = ipz1 + nzrz
|
||||
nzz = nzz + nzrz
|
||||
|
||||
|
||||
! WVAL = e_i
|
||||
! !$ do j=1, i-1
|
||||
! !$ zval(j) = czero
|
||||
! !$ end do
|
||||
zval(i) = done
|
||||
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 = a%irp(i), a%irp(i+1)-1
|
||||
if (a%ja(j) < i) then
|
||||
if (info == psb_success_) call rheap%insert(a%ja(j),info)
|
||||
izcr(a%ja(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
|
||||
outerw: do
|
||||
innerw: do
|
||||
call rheap%get_first(j,info)
|
||||
if (debug) write(0,*) 'from get_first: ',j,info
|
||||
if (info == -1) exit outerw ! Empty heap
|
||||
if (j > lastj) then
|
||||
lastj = j
|
||||
exit innerw
|
||||
end if
|
||||
end do innerw
|
||||
izcr(j) = 0
|
||||
if (j>=i) cycle outerw
|
||||
if (debug) write(0,*) 'update loop, using row: ',j
|
||||
ip1 = ac%icp(j)
|
||||
ip2 = ac%icp(j+1) - 1
|
||||
do
|
||||
if (ip2 < ip1 ) exit
|
||||
if (ac%ia(ip2) <= n) exit
|
||||
ip2 = ip2 -1
|
||||
end do
|
||||
nzra = max(0,ip2 - ip1 + 1)
|
||||
q(i) = psb_spge_dot(nzra,ac%ia(ip1:ip2),ac%val(ip1:ip2),zval)
|
||||
! !$ write(psb_err_unit,*) j,i,p(i)
|
||||
|
||||
alpha = (-q(i)/q(j))
|
||||
if (.true.) then
|
||||
|
||||
do k=w%icp(j), w%icp(j+1)-1
|
||||
kr = w%ia(k)
|
||||
zval(kr) = zval(kr) + alpha*w%val(k)
|
||||
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 j<k<i with nonzeros in column kr; we keep them in
|
||||
! a heap.
|
||||
!
|
||||
do kc = a%irp(kr), a%irp(kr+1)-1
|
||||
nextj=a%ja(kc)
|
||||
if ((info == psb_success_).and.(izcr(nextj)==0)&
|
||||
& .and.(nextj>j).and.(nextj<i)) then
|
||||
call rheap%insert(nextj,info)
|
||||
izcr(nextj) = 1
|
||||
end if
|
||||
end do
|
||||
if (debug) write(0,*) 'update loop, adding indices: ',&
|
||||
& a%ja(a%irp(kr):a%irp(kr+1)-1)
|
||||
|
||||
end if
|
||||
if (info /= psb_success_) exit
|
||||
end do
|
||||
if (info /= psb_success_) then
|
||||
info=psb_err_from_subroutine_
|
||||
call psb_errpush(info,name,a_err='psb_insert_heap')
|
||||
return
|
||||
end if
|
||||
end if
|
||||
end do outerw
|
||||
ip1 = ac%icp(i)
|
||||
ip2 = ac%icp(i+1) - 1
|
||||
do
|
||||
if (ip2 < ip1 ) exit
|
||||
if (ac%ia(ip2) <= n) exit
|
||||
ip2 = ip2 -1
|
||||
end do
|
||||
nzra = max(0,ip2 - ip1 + 1)
|
||||
q(i) = psb_spge_dot(nzra,ac%ia(ip1:ip2),ac%val(ip1:ip2),zval)
|
||||
if (abs(q(i)) < s_epstol) &
|
||||
& q(i) = 1.d-3
|
||||
|
||||
!!$ write(0,*) 'Dropping from a column with: ',i,psb_howmany_heap(heap),sp_thresh
|
||||
!
|
||||
! Sparsify current ZVAL and put into ZMAT
|
||||
!
|
||||
call sparsify(i,nzrmax,sp_thresh,n,zval,nzrz,ia,val,info,iheap=heap,ikr=izkr)
|
||||
if (info /= psb_success_) then
|
||||
info = psb_err_internal_error_
|
||||
call psb_errpush(info,name,a_err='sparsify')
|
||||
return
|
||||
end if
|
||||
call psb_ensure_size(nzw+nzrz, w%ia, info)
|
||||
call psb_ensure_size(nzw+nzrz, w%val, info)
|
||||
ipz1 = w%icp(i)
|
||||
do j=1, nzrz
|
||||
w%ia(ipz1 + j -1) = ia(j)
|
||||
w%val(ipz1 + j -1) = val(j)
|
||||
end do
|
||||
w%icp(i+1) = ipz1 + nzrz
|
||||
nzw = nzw + nzrz
|
||||
|
||||
end do
|
||||
|
||||
end subroutine psb_csparse_biconjg_llk_noth
|
||||
@ -0,0 +1,501 @@
|
||||
!
|
||||
!
|
||||
! 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_csparse_biconjg_mlk(n,a,p,z,w,nzrmax,sp_thresh,info)
|
||||
use psb_base_mod
|
||||
use psb_ainv_tools_mod
|
||||
use psb_c_biconjg_mod, psb_protect_name => psb_csparse_biconjg_mlk
|
||||
!
|
||||
! Left-looking variant
|
||||
!
|
||||
!
|
||||
implicit none
|
||||
integer(psb_ipk_), intent(in) :: n
|
||||
type(psb_c_csr_sparse_mat), intent(in) :: a
|
||||
type(psb_c_csc_sparse_mat), intent(inout) :: z,w
|
||||
integer(psb_ipk_), intent(in) :: nzrmax
|
||||
real(psb_spk_), intent(in) :: sp_thresh
|
||||
complex(psb_spk_), intent(out) :: p(:)
|
||||
integer(psb_ipk_), intent(out) :: info
|
||||
|
||||
! Locals
|
||||
integer(psb_ipk_), allocatable :: ia(:), ja(:), izkr(:), izcr(:), hlist(:), bfr(:), rwlist(:)
|
||||
complex(psb_spk_), 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, hlhead, li, mj, kkc, ifrst, ilst, rwhead
|
||||
type(psb_i_heap) :: heap, rheap
|
||||
type(psb_c_csc_sparse_mat) :: ac
|
||||
complex(psb_spk_) :: alpha
|
||||
character(len=20) :: name='psb_biconjg_mlk'
|
||||
logical, parameter :: debug=.false., test_merge=.true.
|
||||
|
||||
allocate(zval(n),ia(n),val(n),izkr(n),izcr(n),q(n), &
|
||||
& hlist(n),rwlist(n),bfr(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) = czero
|
||||
hlist(i) = -1
|
||||
rwlist(i) = -1
|
||||
end do
|
||||
|
||||
! Init z_1=e_1 and p_1=a_11
|
||||
p(1) = czero
|
||||
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)) < s_epstol) &
|
||||
& p(1) = 1.d-3
|
||||
|
||||
q(1) = p(1)
|
||||
!
|
||||
!
|
||||
call z%allocate(n,n,n*nzrmax)
|
||||
|
||||
z%icp(1) = 1
|
||||
z%icp(2) = 2
|
||||
z%ia(1) = 1
|
||||
z%val(1) = cone
|
||||
nzz = 1
|
||||
|
||||
call w%allocate(n,n,n*nzrmax)
|
||||
w%icp(1) = 1
|
||||
w%icp(2) = 2
|
||||
w%ia(1) = 1
|
||||
w%val(1) = cone
|
||||
nzw = 1
|
||||
|
||||
|
||||
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) = czero
|
||||
! !$ end do
|
||||
zval(i) = cone
|
||||
izkr(i) = 1
|
||||
rwhead = i
|
||||
|
||||
hlhead = -1
|
||||
|
||||
kkc = 0
|
||||
ilst = ac%icp(i)-1
|
||||
ifrst = ac%icp(i)
|
||||
do j = ac%icp(i+1)-1, ac%icp(i), -1
|
||||
if (ac%ia(j) < i) then
|
||||
ilst = j
|
||||
exit
|
||||
end if
|
||||
end do
|
||||
kkc = ilst-ifrst+1
|
||||
|
||||
if (.true..or.debug) then
|
||||
!!$ write(0,*) 'Outer Before insertion : ',hlhead
|
||||
call printlist(hlhead,hlist)
|
||||
end if
|
||||
if (kkc > 0) then
|
||||
!!$ write(0,*) i,' Outer Inserting : ',kkc,':',ac%ia(ifrst:ilst)
|
||||
|
||||
!call hlmerge(hlhead,hlist,bfr(1:kkc))
|
||||
call hlmerge(hlhead,hlist,ac%ia(ifrst:ilst))
|
||||
end if
|
||||
if (debug) then
|
||||
write(0,*) 'Outer After insertion: ',hlhead
|
||||
call printlist(hlhead,hlist)
|
||||
end if
|
||||
|
||||
if (info /= psb_success_) then
|
||||
info=psb_err_from_subroutine_
|
||||
call psb_errpush(info,name,a_err='init_lists')
|
||||
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
|
||||
mj = hlhead
|
||||
if (mj > 0) then
|
||||
hlhead = hlist(mj)
|
||||
hlist(mj) = -1
|
||||
end if
|
||||
j = mj
|
||||
if (j < 0) exit outer
|
||||
|
||||
izcr(j) = 0
|
||||
if (j>=i) cycle outer
|
||||
|
||||
if (debug) write(0,*) 'update loop, using row: ',j,i,mj
|
||||
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))
|
||||
!!$ write(0,*) 'At step ',i,j,' p(i) ',p(i),alpha
|
||||
!!$ write(0,*) ' Current list is : ',hlhead
|
||||
!!$ call printlist(hlhead,hlist)
|
||||
!!$
|
||||
|
||||
|
||||
if (.false..or.(abs(alpha) > sp_thresh)) then
|
||||
ifrst=z%icp(j)
|
||||
ilst=z%icp(j+1)-1
|
||||
call hlmerge(rwhead,rwlist,z%ia(ifrst:ilst))
|
||||
!!$ write(0,*) 'At step ',i,j,' range ',z%icp(j), z%icp(j+1)-1, &
|
||||
!!$ & ' vals ',z%ia(z%icp(j):z%icp(j+1)-1)
|
||||
|
||||
do k=z%icp(j), z%icp(j+1)-1
|
||||
kr = z%ia(k)
|
||||
zval(kr) = zval(kr) + alpha*z%val(k)
|
||||
|
||||
if (izkr(kr) == 0) then
|
||||
!!$ write(0,*) ' main inner Inserting ',kr
|
||||
!!$ call hlmerge(rwhead,rwlist,(/kr/))
|
||||
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 j<k<i with nonzeros in column kr; we keep them in
|
||||
! a heap.
|
||||
!
|
||||
ilst = ac%icp(kr)-1
|
||||
ifrst = ac%icp(kr+1)
|
||||
kkc = 0
|
||||
do kc = ac%icp(kr), ac%icp(kr+1)-1
|
||||
if ((ac%ia(kc) < i).and.(ac%ia(kc) >j)) then
|
||||
ifrst = min(ifrst,kc )
|
||||
ilst = max(ilst,kc)
|
||||
end if
|
||||
end do
|
||||
kkc = ilst-ifrst+1
|
||||
if (debug) then
|
||||
write(0,*) 'Inner Before insertion: '
|
||||
call printlist(hlhead,hlist)
|
||||
write(0,*) 'Inner Inserting : ',kkc,':',ac%ia(ifrst:ilst)
|
||||
end if
|
||||
if (ilst >= ifrst) then
|
||||
!!$ write(0,*) j,i,' Inner inserting ',ac%ia(ifrst:ilst)
|
||||
call hlmerge(hlhead,hlist,ac%ia(ifrst:ilst))
|
||||
end if
|
||||
|
||||
if (debug) then
|
||||
write(0,*) 'Inner After insertion: ',hlhead
|
||||
call printlist(hlhead,hlist)
|
||||
end if
|
||||
|
||||
end if
|
||||
if (info /= psb_success_) exit
|
||||
end do
|
||||
if (info /= psb_success_) then
|
||||
info=psb_err_from_subroutine_
|
||||
call psb_errpush(info,name,a_err='psb_insert_heap')
|
||||
return
|
||||
end if
|
||||
end if
|
||||
end do outer
|
||||
call a%csget(i,i,nzra,ia,ja,val,info)
|
||||
call rwclip(nzra,ia,ja,val,ione,n,ione,n)
|
||||
p(i) = psb_spge_dot(nzra,ja,val,zval)
|
||||
if (abs(p(i)) < s_epstol) &
|
||||
& p(i) = 1.d-3
|
||||
|
||||
!!$ write(0,*) 'Dropping from a column with: ',i,psb_howmany_heap(heap),sp_thresh
|
||||
|
||||
!
|
||||
! Sparsify current ZVAL and put into ZMAT
|
||||
!
|
||||
call sparsify(i,nzrmax,sp_thresh,n,zval,nzrz,ia,val,rwhead,rwlist,izkr,info)
|
||||
|
||||
if (info /= psb_success_) then
|
||||
info = psb_err_internal_error_
|
||||
call psb_errpush(info,name,a_err='sparsify')
|
||||
return
|
||||
end if
|
||||
call psb_ensure_size(nzz+nzrz, z%ia, info)
|
||||
call psb_ensure_size(nzz+nzrz, z%val, info)
|
||||
ipz1 = z%icp(i)
|
||||
do j=1, nzrz
|
||||
z%ia(ipz1 + j -1) = ia(j)
|
||||
z%val(ipz1 + j -1) = val(j)
|
||||
end do
|
||||
z%icp(i+1) = ipz1 + nzrz
|
||||
nzz = nzz + nzrz
|
||||
|
||||
|
||||
! WVAL = e_i
|
||||
! !$ do j=1, i-1
|
||||
! !$ zval(j) = czero
|
||||
! !$ end do
|
||||
zval(i) = cone
|
||||
izkr(i) = 1
|
||||
rwhead = i
|
||||
hlhead = -1
|
||||
|
||||
kkc = 0
|
||||
ilst = a%irp(i)-1
|
||||
ifrst = a%irp(i)
|
||||
do j = a%irp(i+1)-1, a%irp(i), -1
|
||||
if (a%ja(j) < i) then
|
||||
ilst = j
|
||||
exit
|
||||
end if
|
||||
end do
|
||||
kkc = ilst-ifrst+1
|
||||
|
||||
if (debug) then
|
||||
write(0,*) 'Outer Before insertion: '
|
||||
call printlist(hlhead,hlist)
|
||||
write(0,*) 'Outer Inserting : ',kkc,':',a%ja(ifrst:ilst)
|
||||
end if
|
||||
if (kkc > 0 ) then
|
||||
!call hlmerge(hlhead,hlist,bfr(1:kkc))
|
||||
call hlmerge(hlhead,hlist,a%ja(ifrst:ilst))
|
||||
end if
|
||||
if (debug) then
|
||||
write(0,*) 'Outer After insertion: ',hlhead
|
||||
call printlist(hlhead,hlist)
|
||||
end if
|
||||
|
||||
if (info /= psb_success_) then
|
||||
info=psb_err_from_subroutine_
|
||||
call psb_errpush(info,name,a_err='init_lists')
|
||||
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
|
||||
outerw: do
|
||||
mj = hlhead
|
||||
if (hlhead > 0) then
|
||||
hlhead = hlist(mj)
|
||||
hlist(mj) = -1
|
||||
end if
|
||||
j = mj
|
||||
if (j < 0) exit outerw
|
||||
|
||||
izcr(j) = 0
|
||||
if (j>=i) cycle outerw
|
||||
if (debug) write(0,*) 'update loop, using row: ',j
|
||||
ip1 = ac%icp(j)
|
||||
ip2 = ac%icp(j+1) - 1
|
||||
do
|
||||
if (ip2 < ip1 ) exit
|
||||
if (ac%ia(ip2) <= n) exit
|
||||
ip2 = ip2 -1
|
||||
end do
|
||||
nzra = max(0,ip2 - ip1 + 1)
|
||||
q(i) = psb_spge_dot(nzra,ac%ia(ip1:ip2),ac%val(ip1:ip2),zval)
|
||||
! !$ write(psb_err_unit,*) j,i,p(i)
|
||||
|
||||
alpha = (-q(i)/q(j))
|
||||
if (.false..or.(abs(alpha) > sp_thresh)) then
|
||||
ifrst=w%icp(j)
|
||||
ilst=w%icp(j+1)-1
|
||||
call hlmerge(rwhead,rwlist,w%ia(ifrst:ilst))
|
||||
|
||||
do k=w%icp(j), w%icp(j+1)-1
|
||||
kr = w%ia(k)
|
||||
zval(kr) = zval(kr) + alpha*w%val(k)
|
||||
if (izkr(kr) == 0) then
|
||||
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 j<k<i with nonzeros in column kr; we keep them in
|
||||
! a heap.
|
||||
!
|
||||
ilst = a%irp(kr)-1
|
||||
ifrst = a%irp(kr+1)
|
||||
kkc = 0
|
||||
do kc = a%irp(kr), a%irp(kr+1)-1
|
||||
if ((a%ja(kc) < i).and.(a%ja(kc) >j)) then
|
||||
ifrst = min(ifrst,kc )
|
||||
ilst = max(ilst,kc)
|
||||
end if
|
||||
end do
|
||||
kkc = ilst-ifrst+1
|
||||
if (debug) then
|
||||
write(0,*) 'Inner Before insertion: '
|
||||
call printlist(hlhead,hlist)
|
||||
write(0,*) 'Inner Inserting : ',kkc,':',a%ja(ifrst:ilst)
|
||||
end if
|
||||
|
||||
call hlmerge(hlhead,hlist,a%ja(ifrst:ilst))
|
||||
|
||||
if (debug) then
|
||||
write(0,*) 'Inner After insertion: ',hlhead
|
||||
call printlist(hlhead,hlist)
|
||||
end if
|
||||
if (debug) write(0,*) 'update loop, adding indices: ',&
|
||||
& a%ja(a%irp(kr):a%irp(kr+1)-1)
|
||||
|
||||
end if
|
||||
if (info /= psb_success_) exit
|
||||
end do
|
||||
if (info /= psb_success_) then
|
||||
info=psb_err_from_subroutine_
|
||||
call psb_errpush(info,name,a_err='psb_insert_heap')
|
||||
return
|
||||
end if
|
||||
end if
|
||||
end do outerw
|
||||
ip1 = ac%icp(i)
|
||||
ip2 = ac%icp(i+1) - 1
|
||||
do
|
||||
if (ip2 < ip1 ) exit
|
||||
if (ac%ia(ip2) <= n) exit
|
||||
ip2 = ip2 -1
|
||||
end do
|
||||
nzra = max(0,ip2 - ip1 + 1)
|
||||
q(i) = psb_spge_dot(nzra,ac%ia(ip1:ip2),ac%val(ip1:ip2),zval)
|
||||
if (abs(q(i)) < s_epstol) &
|
||||
& q(i) = 1.d-3
|
||||
|
||||
!!$ write(0,*) 'Dropping from a column with: ',i,psb_howmany_heap(heap),sp_thresh
|
||||
!
|
||||
! Sparsify current ZVAL and put into ZMAT
|
||||
!
|
||||
call sparsify(i,nzrmax,sp_thresh,n,zval,nzrz,ia,val,rwhead,rwlist,izkr,info)
|
||||
if (info /= psb_success_) then
|
||||
info = psb_err_internal_error_
|
||||
call psb_errpush(info,name,a_err='sparsify')
|
||||
return
|
||||
end if
|
||||
call psb_ensure_size(nzw+nzrz, w%ia, info)
|
||||
call psb_ensure_size(nzw+nzrz, w%val, info)
|
||||
ipz1 = w%icp(i)
|
||||
do j=1, nzrz
|
||||
w%ia(ipz1 + j -1) = ia(j)
|
||||
w%val(ipz1 + j -1) = val(j)
|
||||
end do
|
||||
w%icp(i+1) = ipz1 + nzrz
|
||||
nzw = nzw + nzrz
|
||||
|
||||
end do
|
||||
|
||||
contains
|
||||
|
||||
subroutine hlmerge(head,listv,vals)
|
||||
integer(psb_ipk_), intent(inout) :: head, listv(:)
|
||||
integer(psb_ipk_), intent(in) :: vals(:)
|
||||
integer(psb_ipk_) :: i,j,k, lh, lv, nv, vv, flh, ph
|
||||
|
||||
nv = size(vals)
|
||||
lh = head
|
||||
flh = -1
|
||||
lv = 1
|
||||
if ((head < 0).and.(nv > 0)) then
|
||||
! Adjust head if empty
|
||||
head = vals(lv)
|
||||
lv = lv + 1
|
||||
else if ((head > 0) .and. (nv >0)) then
|
||||
! Adjust head if first item less than it
|
||||
if (head > vals(lv)) then
|
||||
listv(vals(lv)) = head
|
||||
head = vals(lv)
|
||||
lv = lv + 1
|
||||
end if
|
||||
end if
|
||||
|
||||
lh = head
|
||||
ph = lh
|
||||
do while ((lh > 0) .and. (lv <= nv))
|
||||
if (lh == vals(lv)) then
|
||||
lv = lv + 1
|
||||
else if (lh > vals(lv)) then
|
||||
listv(vals(lv)) = lh
|
||||
listv(ph) = vals(lv)
|
||||
lh = vals(lv)
|
||||
lv = lv + 1
|
||||
else
|
||||
ph = lh
|
||||
lh = listv(lh)
|
||||
end if
|
||||
end do
|
||||
lh = ph
|
||||
do while (lv <= nv)
|
||||
listv(lh) = vals(lv)
|
||||
lh = listv(lh)
|
||||
lv = lv + 1
|
||||
end do
|
||||
end subroutine hlmerge
|
||||
|
||||
|
||||
subroutine printlist(head,listv)
|
||||
integer(psb_ipk_), intent(in) :: head, listv(:)
|
||||
integer(psb_ipk_) :: li
|
||||
|
||||
li = head
|
||||
do while (li > 0)
|
||||
write(0,*) 'Item: ', li
|
||||
li = listv(li)
|
||||
end do
|
||||
end subroutine printlist
|
||||
|
||||
end subroutine psb_csparse_biconjg_mlk
|
||||
@ -0,0 +1,414 @@
|
||||
!
|
||||
!
|
||||
! 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_csparse_biconjg_s_ft_llk(n,a,p,z,w,nzrmax,sp_thresh,info)
|
||||
use psb_base_mod
|
||||
use psb_ainv_tools_mod
|
||||
use psb_c_biconjg_mod, psb_protect_name => psb_csparse_biconjg_s_ft_llk
|
||||
|
||||
!
|
||||
! Left-looking variant, stabilized i.e. product by A is applied
|
||||
! to compute the diagonal elements.
|
||||
!
|
||||
!
|
||||
implicit none
|
||||
integer(psb_ipk_), intent(in) :: n
|
||||
type(psb_c_csr_sparse_mat), intent(in) :: a
|
||||
type(psb_c_csc_sparse_mat), intent(inout) :: z,w
|
||||
integer(psb_ipk_), intent(in) :: nzrmax
|
||||
real(psb_spk_), intent(in) :: sp_thresh
|
||||
complex(psb_spk_), intent(out) :: p(:)
|
||||
integer(psb_ipk_), intent(out) :: info
|
||||
|
||||
! Locals
|
||||
integer(psb_ipk_), allocatable :: ia(:), ja(:), izkr(:), izcr(:),iww(:)
|
||||
complex(psb_spk_), allocatable :: zval(:),val(:), q(:), ww(:)
|
||||
integer(psb_ipk_) :: i,j,k, kc, kr, err_act, nz, nzra, nzrz, ipzi,ipzj, nzww,&
|
||||
& nzzi,nzzj, nzz, ip1, ip2, ipza,ipzz, ipzn, nzzn, ipz1, ipz2,&
|
||||
& ipj, lastj, nextj, nzw, nzrw
|
||||
type(psb_i_heap) :: heap, rheap
|
||||
type(psb_c_csc_sparse_mat) :: ac
|
||||
complex(psb_spk_) :: alpha, tmpq,tmpq2
|
||||
character(len=20) :: name='psb_orth_llk'
|
||||
logical, parameter :: debug=.false.
|
||||
|
||||
allocate(zval(n),ia(n),val(n),izkr(n),izcr(n),q(n),iww(n),ww(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
|
||||
!
|
||||
! Init pointers to:
|
||||
! ljr(i): last occupied column index within row I
|
||||
! izcr(i): first occupied row index within column I
|
||||
!
|
||||
do i=1,n
|
||||
izkr(i) = 0
|
||||
izcr(i) = 0
|
||||
zval(i) = czero
|
||||
end do
|
||||
|
||||
! Init z_1=e_1 and p_1=a_11
|
||||
p(1) = czero
|
||||
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)) < s_epstol) &
|
||||
& p(1) = 1.d-3
|
||||
|
||||
q(1) = p(1)
|
||||
!
|
||||
!
|
||||
call z%allocate(n,n,n*nzrmax)
|
||||
|
||||
z%icp(1) = 1
|
||||
z%icp(2) = 2
|
||||
z%ia(1) = 1
|
||||
z%val(1) = cone
|
||||
nzz = 1
|
||||
|
||||
call w%allocate(n,n,n*nzrmax)
|
||||
w%icp(1) = 1
|
||||
w%icp(2) = 2
|
||||
w%ia(1) = 1
|
||||
w%val(1) = cone
|
||||
nzw = 1
|
||||
|
||||
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) = czero
|
||||
! !$ end do
|
||||
zval(i) = cone
|
||||
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) exit outer
|
||||
if (debug) write(0,*) 'update loop, using row: ',j
|
||||
ip1 = w%icp(j)
|
||||
ip2 = w%icp(j+1) - 1
|
||||
nzra = max(0,ip2 - ip1 + 1)
|
||||
nzww = 0
|
||||
call psb_d_spvspm(cone,a,nzra,w%ia(ip1:ip2),w%val(ip1:ip2),&
|
||||
& czero,nzww,iww,ww,info)
|
||||
|
||||
p(i) = psb_spge_dot(nzww,iww,ww,zval)
|
||||
|
||||
ipz1 = z%icp(j)
|
||||
ipz2 = z%icp(j+1)
|
||||
nzrz = ipz2-ipz1
|
||||
alpha = (-p(i)/p(j))
|
||||
!!$ write(0,*) ' p(i)/p(j) ',i,j,alpha,p(i),p(j)
|
||||
if (.false..or.(abs(alpha) > sp_thresh)) then
|
||||
|
||||
do k=ipz1, ipz2-1
|
||||
kr = z%ia(k)
|
||||
zval(kr) = zval(kr) + alpha*z%val(k)
|
||||
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 j<k<i with nonzeros in column kr; we keep them in
|
||||
! a heap.
|
||||
!
|
||||
do kc = ac%icp(kr), ac%icp(kr+1)-1
|
||||
nextj=ac%ia(kc)
|
||||
if ((info == psb_success_).and.(izcr(nextj)==0)&
|
||||
& .and.(nextj>j).and.(nextj<i)) then
|
||||
call rheap%insert(nextj,info)
|
||||
izcr(nextj) = 1
|
||||
end if
|
||||
end do
|
||||
if (debug) write(0,*) 'update loop, adding indices: ',&
|
||||
& ac%ia(ac%icp(kr):ac%icp(kr+1)-1)
|
||||
|
||||
end if
|
||||
if (info /= psb_success_) exit
|
||||
end do
|
||||
if (info /= psb_success_) then
|
||||
info=psb_err_from_subroutine_
|
||||
call psb_errpush(info,name,a_err='psb_insert_heap')
|
||||
return
|
||||
end if
|
||||
end if
|
||||
!!$ izcr(j) = 0
|
||||
end do outer
|
||||
|
||||
if (.false.) then
|
||||
! We can't do the proper thing until we have bot Z_i and W_i.
|
||||
call a%csget(i,i,nzra,ia,ja,val,info)
|
||||
call rwclip(nzra,ia,ja,val,ione,n,ione,n)
|
||||
p(i) = psb_spge_dot(nzra,ja,val,zval)
|
||||
if (abs(p(i)) < s_epstol) &
|
||||
& p(i) = 1.d-3
|
||||
end if
|
||||
|
||||
!
|
||||
! Sparsify current ZVAL and put into ZMAT
|
||||
!
|
||||
call sparsify(i,nzrmax,sp_thresh,n,zval,nzrz,ia,val,info,iheap=heap,ikr=izkr)
|
||||
if (info /= psb_success_) then
|
||||
info = psb_err_internal_error_
|
||||
call psb_errpush(info,name,a_err='sparsify')
|
||||
return
|
||||
end if
|
||||
call psb_ensure_size(nzz+nzrz, z%ia, info)
|
||||
call psb_ensure_size(nzz+nzrz, z%val, info)
|
||||
ipz1 = z%icp(i)
|
||||
do j=1, nzrz
|
||||
z%ia(ipz1 + j -1) = ia(j)
|
||||
z%val(ipz1 + j -1) = val(j)
|
||||
end do
|
||||
z%icp(i+1) = ipz1 + nzrz
|
||||
nzz = nzz + nzrz
|
||||
|
||||
|
||||
|
||||
|
||||
! WVAL = e_i
|
||||
! !$ do j=1, i-1
|
||||
! !$ zval(j) = czero
|
||||
! !$ end do
|
||||
zval(i) = cone
|
||||
izkr(i) = 1
|
||||
call heap%init(info)
|
||||
if (info == psb_success_) call heap%insert(i,info)
|
||||
!!$ write(0,*) 'Inserting into heap ',i
|
||||
if (info == psb_success_) call rheap%init(info)
|
||||
do j = a%irp(i), a%irp(i+1)-1
|
||||
if (a%ja(j)<i) then
|
||||
if (info == psb_success_) call rheap%insert(a%ja(j),info)
|
||||
izcr(a%ja(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
|
||||
outerw: do
|
||||
innerw: do
|
||||
call rheap%get_first(j,info)
|
||||
if (debug) write(0,*) 'from get_first: ',j,info
|
||||
if (info == -1) exit outerw ! Empty heap
|
||||
if (j > lastj) then
|
||||
lastj = j
|
||||
exit innerw
|
||||
end if
|
||||
end do innerw
|
||||
izcr(j) = 0
|
||||
if (j>=i) exit outerw
|
||||
if (debug) write(0,*) 'update loop, using row: ',j
|
||||
if (.false.) then
|
||||
ip1 = ac%icp(j)
|
||||
ip2 = ac%icp(j+1) - 1
|
||||
do
|
||||
if (ip2 < ip1 ) exit
|
||||
if (ac%ia(ip2) <= n) exit
|
||||
ip2 = ip2 -1
|
||||
end do
|
||||
nzra = max(0,ip2 - ip1 + 1)
|
||||
q(i) = psb_spge_dot(nzra,ac%ia(ip1:ip2),ac%val(ip1:ip2),zval)
|
||||
! !$ write(psb_err_unit,*) j,i,p(i)
|
||||
else
|
||||
ip1 = z%icp(j)
|
||||
ip2 = z%icp(j+1) - 1
|
||||
nzra = max(0,ip2 - ip1 + 1)
|
||||
nzww = 0
|
||||
call psb_d_spmspv(cone,ac,nzra,z%ia(ip1:ip2),z%val(ip1:ip2),&
|
||||
& czero,nzww,iww,ww,info)
|
||||
|
||||
q(i) = psb_spge_dot(nzww,iww,ww,zval)
|
||||
end if
|
||||
|
||||
ipz1 = w%icp(j)
|
||||
ipz2 = w%icp(j+1)
|
||||
nzrz = ipz2-ipz1
|
||||
alpha = (-q(i)/q(j))
|
||||
!!$ write(0,*) ' q(i)/q(j) ',i,j,alpha,q(i),q(j)
|
||||
if (.false..or.(abs(alpha) > sp_thresh)) then
|
||||
|
||||
do k=ipz1, ipz2-1
|
||||
kr = w%ia(k)
|
||||
zval(kr) = zval(kr) + alpha*w%val(k)
|
||||
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 j<k<i with nonzeros in column kr; we keep them in
|
||||
! a heap.
|
||||
!
|
||||
do kc = a%irp(kr), a%irp(kr+1)-1
|
||||
nextj=a%ja(kc)
|
||||
if ((info == psb_success_).and.(izcr(nextj)==0)&
|
||||
& .and.(nextj>j).and.(nextj<i)) then
|
||||
call rheap%insert(nextj,info)
|
||||
izcr(nextj) = 1
|
||||
end if
|
||||
end do
|
||||
if (debug) write(0,*) 'update loop, adding indices: ',&
|
||||
& a%ja(a%irp(kr):a%irp(kr+1)-1)
|
||||
|
||||
end if
|
||||
if (info /= psb_success_) exit
|
||||
end do
|
||||
if (info /= psb_success_) then
|
||||
info=psb_err_from_subroutine_
|
||||
call psb_errpush(info,name,a_err='psb_insert_heap')
|
||||
return
|
||||
end if
|
||||
end if
|
||||
!!$ izcr(j) = 0
|
||||
end do outerw
|
||||
|
||||
!!$ ip1 = ac%icp(i)
|
||||
!!$ ip2 = ac%icp(i+1) - 1
|
||||
!!$ do
|
||||
!!$ if (ip2 < ip1 ) exit
|
||||
!!$ if (ac%ia(ip2) <= n) exit
|
||||
!!$ ip2 = ip2 -1
|
||||
!!$ end do
|
||||
!!$ nzra = max(0,ip2 - ip1 + 1)
|
||||
!!$
|
||||
!!$ q(i) = psb_spge_dot(nzra,ac%ia(ip1:ip2),ac%val(ip1:ip2),zval)
|
||||
!!$ if (abs(q(i)) < s_epstol) &
|
||||
!!$ & q(i) = 1.d-3
|
||||
!
|
||||
! Sparsify current ZVAL and put into ZMAT
|
||||
!
|
||||
call sparsify(i,nzrmax,sp_thresh,n,zval,nzrw,ia,val,info,iheap=heap,ikr=izkr)
|
||||
if (info /= psb_success_) then
|
||||
info = psb_err_internal_error_
|
||||
call psb_errpush(info,name,a_err='sparsify')
|
||||
return
|
||||
end if
|
||||
call psb_ensure_size(nzw+nzrw, w%ia, info)
|
||||
call psb_ensure_size(nzw+nzrw, w%val, info)
|
||||
ipz1 = w%icp(i)
|
||||
do j=1, nzrw
|
||||
w%ia(ipz1 + j -1) = ia(j)
|
||||
w%val(ipz1 + j -1) = val(j)
|
||||
end do
|
||||
w%icp(i+1) = ipz1 + nzrw
|
||||
nzw = nzw + nzrw
|
||||
|
||||
!!$ !
|
||||
!!$ ! Ok, now compute w_i^T A z_i
|
||||
!!$ !
|
||||
nzww = 0
|
||||
nzrz = z%icp(i+1)-z%icp(i)
|
||||
ipz1 = z%icp(i)
|
||||
call psb_d_spmspv(cone,ac,&
|
||||
& nzrz,z%ia(ipz1:ipz1+nzrz-1),z%val(ipz1:ipz1+nzrz-1),&
|
||||
& czero,nzww,iww,ww,info)
|
||||
tmpq = psb_spdot_srtd(nzww,iww,ww,nzrw,ia,val)
|
||||
q(i) = tmpq
|
||||
! if (tmpq <0) then
|
||||
!!$ write(0,*) 'On negative dot prod at ',i
|
||||
!!$ write(0,*) 'On negative dot prod a ',ia(1:nzrw),val(1:nzrw)
|
||||
!!$ write(0,*) 'On negative dot prod w ',iww(1:nzww),ww(1:nzww)
|
||||
!!$ ip1 = ac%icp(i)
|
||||
!!$ ip2 = ac%icp(i+1) - 1
|
||||
!!$ do
|
||||
!!$ if (ip2 < ip1 ) exit
|
||||
!!$ if (ac%ia(ip2) <= n) exit
|
||||
!!$ ip2 = ip2 -1
|
||||
!!$ end do
|
||||
!!$ nzra = max(0,ip2 - ip1 + 1)
|
||||
!!$ write(0,*) 'On negative dot prod a ',ac%ia(ip1:ip2),ac%val(ip1:ip2)
|
||||
!
|
||||
! end if
|
||||
|
||||
if (abs(q(i)) < s_epstol) &
|
||||
& q(i) = 1.d-3
|
||||
p(i) = q(i)
|
||||
|
||||
end do
|
||||
|
||||
end subroutine psb_csparse_biconjg_s_ft_llk
|
||||
@ -0,0 +1,248 @@
|
||||
!
|
||||
!
|
||||
! 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_csparse_biconjg_s_llk(n,a,p,z,w,nzrmax,sp_thresh,info)
|
||||
use psb_base_mod
|
||||
use psb_ainv_tools_mod
|
||||
use psb_c_biconjg_mod, psb_protect_name => psb_csparse_biconjg_s_llk
|
||||
|
||||
!
|
||||
! Left-looking variant SYMMETRIC/HERMITIAN A. You have been warned!
|
||||
!
|
||||
!
|
||||
implicit none
|
||||
integer(psb_ipk_), intent(in) :: n
|
||||
type(psb_c_csr_sparse_mat), intent(in) :: a
|
||||
type(psb_c_csc_sparse_mat), intent(inout) :: z,w
|
||||
integer(psb_ipk_), intent(in) :: nzrmax
|
||||
real(psb_spk_), intent(in) :: sp_thresh
|
||||
complex(psb_spk_), intent(out) :: p(:)
|
||||
integer(psb_ipk_), intent(out) :: info
|
||||
|
||||
! Locals
|
||||
integer(psb_ipk_), allocatable :: ia(:), ja(:), izkr(:), izcr(:)
|
||||
complex(psb_spk_), 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_c_csc_sparse_mat) :: ac
|
||||
complex(psb_spk_) :: 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) = czero
|
||||
end do
|
||||
|
||||
! Init z_1=e_1 and p_1=a_11
|
||||
p(1) = czero
|
||||
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)) < s_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) = cone
|
||||
nzz = 1
|
||||
zvalmax = cone
|
||||
|
||||
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) = czero
|
||||
! !$ end do
|
||||
zval(i) = cone
|
||||
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 j<k<i with nonzeros in column kr; we keep them in
|
||||
! a heap.
|
||||
!
|
||||
do kc = ac%icp(kr), ac%icp(kr+1)-1
|
||||
nextj=ac%ia(kc)
|
||||
if ((info == psb_success_).and.(izcr(nextj)==0)&
|
||||
& .and.(nextj>j).and.(nextj<i)) then
|
||||
call rheap%insert(nextj,info)
|
||||
izcr(nextj) = 1
|
||||
end if
|
||||
end do
|
||||
if (debug) write(0,*) 'update loop, adding indices: ',&
|
||||
& ac%ia(ac%icp(kr):ac%icp(kr+1)-1)
|
||||
|
||||
end if
|
||||
if (info /= psb_success_) exit
|
||||
end do
|
||||
if (info /= psb_success_) then
|
||||
info=psb_err_from_subroutine_
|
||||
call psb_errpush(info,name,a_err='psb_insert_heap')
|
||||
return
|
||||
end if
|
||||
end if
|
||||
end do outer
|
||||
call a%csget(i,i,nzra,ia,ja,val,info)
|
||||
call rwclip(nzra,ia,ja,val,ione,n,ione,n)
|
||||
p(i) = psb_spge_dot(nzra,ja,val,zval)
|
||||
!!$ if ((1761<=i).and.(i<=1780)) then
|
||||
!!$ write(0,*) 'Dot product terms at ',i,nzra
|
||||
!!$ do kk=1,nzra
|
||||
!!$ write(0,*) kk,ja(kk),val(kk),zval(ja(kk))
|
||||
!!$ end do
|
||||
!!$ end if
|
||||
|
||||
if (abs(p(i)) < s_epstol) &
|
||||
& p(i) = 1.d-3
|
||||
|
||||
! !$ write(0,*) 'Dropping from a column with: ',i,psb_howmany_heap(heap),sp_thresh
|
||||
|
||||
!
|
||||
! Sparsify current ZVAL and put into ZMAT
|
||||
!
|
||||
call sparsify(i,nzrmax,sp_thresh,n,zval,nzrz,ia,val,info,iheap=heap,ikr=izkr)
|
||||
if (info /= psb_success_) then
|
||||
info = psb_err_internal_error_
|
||||
call psb_errpush(info,name,a_err='sparsify')
|
||||
return
|
||||
end if
|
||||
call psb_ensure_size(nzz+nzrz, z%ia, info)
|
||||
call psb_ensure_size(nzz+nzrz, z%val, info)
|
||||
ipz1 = z%icp(i)
|
||||
do j=1, nzrz
|
||||
z%ia(ipz1 + j -1) = ia(j)
|
||||
z%val(ipz1 + j -1) = val(j)
|
||||
!!$ zvalmax = max(zvalmax,abs(val(j)))
|
||||
end do
|
||||
z%icp(i+1) = ipz1 + nzrz
|
||||
nzz = nzz + nzrz
|
||||
!!$ write(0,*) ' Dot: ',i,p(i),zvalmax
|
||||
|
||||
end do
|
||||
|
||||
call z%cp_to_fmt(w,info)
|
||||
|
||||
end subroutine psb_csparse_biconjg_s_llk
|
||||
@ -0,0 +1,366 @@
|
||||
!
|
||||
!
|
||||
! 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_dsparse_biconjg_llk(n,a,p,z,w,nzrmax,sp_thresh,info)
|
||||
use psb_base_mod
|
||||
use psb_ainv_tools_mod
|
||||
use psb_d_biconjg_mod, psb_protect_name => psb_dsparse_biconjg_llk
|
||||
!
|
||||
! Left-looking variant
|
||||
!
|
||||
!
|
||||
implicit none
|
||||
integer(psb_ipk_), intent(in) :: n
|
||||
type(psb_d_csr_sparse_mat), intent(in) :: a
|
||||
type(psb_d_csc_sparse_mat), intent(inout) :: z,w
|
||||
integer(psb_ipk_), intent(in) :: nzrmax
|
||||
real(psb_dpk_), intent(in) :: sp_thresh
|
||||
real(psb_dpk_), intent(out) :: p(:)
|
||||
integer(psb_ipk_), intent(out) :: info
|
||||
|
||||
! Locals
|
||||
integer(psb_ipk_), allocatable :: ia(:), ja(:), izkr(:), izcr(:)
|
||||
real(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
|
||||
type(psb_i_heap) :: heap, rheap
|
||||
type(psb_d_csc_sparse_mat) :: ac
|
||||
real(psb_dpk_) :: alpha
|
||||
character(len=20) :: name='psb_orth_llk'
|
||||
logical, parameter :: debug=.false.
|
||||
|
||||
allocate(zval(n),ia(n),val(n),izkr(n),izcr(n),q(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) = dzero
|
||||
end do
|
||||
|
||||
! Init z_1=e_1 and p_1=a_11
|
||||
p(1) = dzero
|
||||
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
|
||||
|
||||
q(1) = p(1)
|
||||
!
|
||||
!
|
||||
call z%allocate(n,n,n*nzrmax)
|
||||
|
||||
z%icp(1) = 1
|
||||
z%icp(2) = 2
|
||||
z%ia(1) = 1
|
||||
z%val(1) = done
|
||||
nzz = 1
|
||||
|
||||
call w%allocate(n,n,n*nzrmax)
|
||||
w%icp(1) = 1
|
||||
w%icp(2) = 2
|
||||
w%ia(1) = 1
|
||||
w%val(1) = done
|
||||
nzw = 1
|
||||
|
||||
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) = dzero
|
||||
! !$ end do
|
||||
zval(i) = done
|
||||
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
|
||||
!!$ write(0,*) i, ' Outer inserting ',ac%ia(j)
|
||||
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))
|
||||
!!$ write(0,*) 'At step ',i,j,' p(i) ',p(i),alpha
|
||||
if (.false..or.(abs(alpha) > sp_thresh)) then
|
||||
!!$ write(0,*) 'At step ',i,j,' range ',z%icp(j), z%icp(j+1)-1, &
|
||||
!!$ & ' vals ',z%ia(z%icp(j):z%icp(j+1)-1)
|
||||
do k=z%icp(j), z%icp(j+1)-1
|
||||
kr = z%ia(k)
|
||||
zval(kr) = zval(kr) + alpha*z%val(k)
|
||||
if (izkr(kr) == 0) then
|
||||
!!$ write(0,*) ' main inner Inserting ',kr
|
||||
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 j<k<i with nonzeros in column kr; we keep them in
|
||||
! a heap.
|
||||
!
|
||||
do kc = ac%icp(kr), ac%icp(kr+1)-1
|
||||
nextj=ac%ia(kc)
|
||||
if ((info == psb_success_).and.(izcr(nextj)==0)&
|
||||
& .and.(nextj>j).and.(nextj<i)) then
|
||||
!!$ write(0,*) j,i,' Inner inserting ',nextj
|
||||
call rheap%insert(nextj,info)
|
||||
izcr(nextj) = 1
|
||||
end if
|
||||
end do
|
||||
if (debug) write(0,*) 'update loop, adding indices: ',&
|
||||
& ac%ia(ac%icp(kr):ac%icp(kr+1)-1)
|
||||
|
||||
end if
|
||||
if (info /= psb_success_) exit
|
||||
end do
|
||||
if (info /= psb_success_) then
|
||||
info=psb_err_from_subroutine_
|
||||
call psb_errpush(info,name,a_err='psb_insert_heap')
|
||||
return
|
||||
end if
|
||||
end if
|
||||
end do outer
|
||||
call a%csget(i,i,nzra,ia,ja,val,info)
|
||||
call rwclip(nzra,ia,ja,val,ione,n,ione,n)
|
||||
p(i) = psb_spge_dot(nzra,ja,val,zval)
|
||||
if (abs(p(i)) < d_epstol) &
|
||||
& p(i) = 1.d-3
|
||||
|
||||
!!$ write(0,*) 'Dropping from a column with: ',i,psb_howmany_heap(heap),sp_thresh
|
||||
|
||||
!
|
||||
! Sparsify current ZVAL and put into ZMAT
|
||||
!
|
||||
call sparsify(i,nzrmax,sp_thresh,n,zval,nzrz,ia,val,info,iheap=heap,ikr=izkr)
|
||||
if (info /= psb_success_) then
|
||||
info = psb_err_internal_error_
|
||||
call psb_errpush(info,name,a_err='sparsify')
|
||||
return
|
||||
end if
|
||||
call psb_ensure_size(nzz+nzrz, z%ia, info)
|
||||
call psb_ensure_size(nzz+nzrz, z%val, info)
|
||||
ipz1 = z%icp(i)
|
||||
do j=1, nzrz
|
||||
z%ia(ipz1 + j -1) = ia(j)
|
||||
z%val(ipz1 + j -1) = val(j)
|
||||
end do
|
||||
z%icp(i+1) = ipz1 + nzrz
|
||||
nzz = nzz + nzrz
|
||||
|
||||
|
||||
! WVAL = e_i
|
||||
! !$ do j=1, i-1
|
||||
! !$ zval(j) = dzero
|
||||
! !$ end do
|
||||
zval(i) = done
|
||||
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 = a%irp(i), a%irp(i+1)-1
|
||||
if (a%ja(j) < i) then
|
||||
if (info == psb_success_) call rheap%insert(a%ja(j),info)
|
||||
izcr(a%ja(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
|
||||
outerw: do
|
||||
innerw: do
|
||||
call rheap%get_first(j,info)
|
||||
if (debug) write(0,*) 'from get_first: ',j,info
|
||||
if (info == -1) exit outerw ! Empty heap
|
||||
if (j > lastj) then
|
||||
lastj = j
|
||||
exit innerw
|
||||
end if
|
||||
end do innerw
|
||||
izcr(j) = 0
|
||||
if (j>=i) cycle outerw
|
||||
if (debug) write(0,*) 'update loop, using row: ',j
|
||||
ip1 = ac%icp(j)
|
||||
ip2 = ac%icp(j+1) - 1
|
||||
do
|
||||
if (ip2 < ip1 ) exit
|
||||
if (ac%ia(ip2) <= n) exit
|
||||
ip2 = ip2 -1
|
||||
end do
|
||||
nzra = max(0,ip2 - ip1 + 1)
|
||||
q(i) = psb_spge_dot(nzra,ac%ia(ip1:ip2),ac%val(ip1:ip2),zval)
|
||||
! !$ write(psb_err_unit,*) j,i,p(i)
|
||||
|
||||
alpha = (-q(i)/q(j))
|
||||
if (.false..or.(abs(alpha) > sp_thresh)) then
|
||||
|
||||
do k=w%icp(j), w%icp(j+1)-1
|
||||
kr = w%ia(k)
|
||||
zval(kr) = zval(kr) + alpha*w%val(k)
|
||||
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 j<k<i with nonzeros in column kr; we keep them in
|
||||
! a heap.
|
||||
!
|
||||
do kc = a%irp(kr), a%irp(kr+1)-1
|
||||
nextj=a%ja(kc)
|
||||
if ((info == psb_success_).and.(izcr(nextj)==0)&
|
||||
& .and.(nextj>j).and.(nextj<i)) then
|
||||
call rheap%insert(nextj,info)
|
||||
izcr(nextj) = 1
|
||||
end if
|
||||
end do
|
||||
if (debug) write(0,*) 'update loop, adding indices: ',&
|
||||
& a%ja(a%irp(kr):a%irp(kr+1)-1)
|
||||
|
||||
end if
|
||||
if (info /= psb_success_) exit
|
||||
end do
|
||||
if (info /= psb_success_) then
|
||||
info=psb_err_from_subroutine_
|
||||
call psb_errpush(info,name,a_err='psb_insert_heap')
|
||||
return
|
||||
end if
|
||||
end if
|
||||
end do outerw
|
||||
ip1 = ac%icp(i)
|
||||
ip2 = ac%icp(i+1) - 1
|
||||
do
|
||||
if (ip2 < ip1 ) exit
|
||||
if (ac%ia(ip2) <= n) exit
|
||||
ip2 = ip2 -1
|
||||
end do
|
||||
nzra = max(0,ip2 - ip1 + 1)
|
||||
q(i) = psb_spge_dot(nzra,ac%ia(ip1:ip2),ac%val(ip1:ip2),zval)
|
||||
if (abs(q(i)) < d_epstol) &
|
||||
& q(i) = 1.d-3
|
||||
|
||||
!!$ write(0,*) 'Dropping from a column with: ',i,psb_howmany_heap(heap),sp_thresh
|
||||
!
|
||||
! Sparsify current ZVAL and put into ZMAT
|
||||
!
|
||||
call sparsify(i,nzrmax,sp_thresh,n,zval,nzrz,ia,val,info,iheap=heap,ikr=izkr)
|
||||
if (info /= psb_success_) then
|
||||
info = psb_err_internal_error_
|
||||
call psb_errpush(info,name,a_err='sparsify')
|
||||
return
|
||||
end if
|
||||
call psb_ensure_size(nzw+nzrz, w%ia, info)
|
||||
call psb_ensure_size(nzw+nzrz, w%val, info)
|
||||
ipz1 = w%icp(i)
|
||||
do j=1, nzrz
|
||||
w%ia(ipz1 + j -1) = ia(j)
|
||||
w%val(ipz1 + j -1) = val(j)
|
||||
end do
|
||||
w%icp(i+1) = ipz1 + nzrz
|
||||
nzw = nzw + nzrz
|
||||
|
||||
end do
|
||||
|
||||
end subroutine psb_dsparse_biconjg_llk
|
||||
@ -0,0 +1,362 @@
|
||||
!
|
||||
!
|
||||
! 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_dsparse_biconjg_llk_noth(n,a,p,z,w,nzrmax,sp_thresh,info)
|
||||
use psb_base_mod
|
||||
use psb_ainv_tools_mod
|
||||
use psb_d_biconjg_mod, psb_protect_name => psb_dsparse_biconjg_llk_noth
|
||||
|
||||
!
|
||||
! Left-looking variant, with NO drop rule on p(i)/p(j)
|
||||
!
|
||||
!
|
||||
implicit none
|
||||
integer(psb_ipk_), intent(in) :: n
|
||||
type(psb_d_csr_sparse_mat), intent(in) :: a
|
||||
type(psb_d_csc_sparse_mat), intent(inout) :: z,w
|
||||
integer(psb_ipk_), intent(in) :: nzrmax
|
||||
real(psb_dpk_), intent(in) :: sp_thresh
|
||||
real(psb_dpk_), intent(out) :: p(:)
|
||||
integer(psb_ipk_), intent(out) :: info
|
||||
|
||||
! Locals
|
||||
integer(psb_ipk_), allocatable :: ia(:), ja(:), izkr(:), izcr(:)
|
||||
real(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
|
||||
type(psb_i_heap) :: heap, rheap
|
||||
type(psb_d_csc_sparse_mat) :: ac
|
||||
real(psb_dpk_) :: alpha
|
||||
character(len=20) :: name='psb_orth_llk_noth'
|
||||
logical, parameter :: debug=.false.
|
||||
|
||||
allocate(zval(n),ia(n),val(n),izkr(n),izcr(n),q(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) = dzero
|
||||
end do
|
||||
|
||||
! Init z_1=e_1 and p_1=a_11
|
||||
p(1) = dzero
|
||||
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
|
||||
|
||||
q(1) = p(1)
|
||||
!
|
||||
!
|
||||
call z%allocate(n,n,n*nzrmax)
|
||||
|
||||
z%icp(1) = 1
|
||||
z%icp(2) = 2
|
||||
z%ia(1) = 1
|
||||
z%val(1) = done
|
||||
nzz = 1
|
||||
|
||||
call w%allocate(n,n,n*nzrmax)
|
||||
w%icp(1) = 1
|
||||
w%icp(2) = 2
|
||||
w%ia(1) = 1
|
||||
w%val(1) = done
|
||||
nzw = 1
|
||||
|
||||
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) = dzero
|
||||
! !$ end do
|
||||
zval(i) = done
|
||||
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 (.true.) then
|
||||
do k=z%icp(j), z%icp(j+1)-1
|
||||
kr = z%ia(k)
|
||||
zval(kr) = zval(kr) + alpha*z%val(k)
|
||||
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 j<k<i with nonzeros in column kr; we keep them in
|
||||
! a heap.
|
||||
!
|
||||
do kc = ac%icp(kr), ac%icp(kr+1)-1
|
||||
nextj=ac%ia(kc)
|
||||
if ((info == psb_success_).and.(izcr(nextj)==0)&
|
||||
& .and.(nextj>j).and.(nextj<i)) then
|
||||
call rheap%insert(nextj,info)
|
||||
izcr(nextj) = 1
|
||||
end if
|
||||
end do
|
||||
if (debug) write(0,*) 'update loop, adding indices: ',&
|
||||
& ac%ia(ac%icp(kr):ac%icp(kr+1)-1)
|
||||
|
||||
end if
|
||||
if (info /= psb_success_) exit
|
||||
end do
|
||||
if (info /= psb_success_) then
|
||||
info=psb_err_from_subroutine_
|
||||
call psb_errpush(info,name,a_err='psb_insert_heap')
|
||||
return
|
||||
end if
|
||||
end if
|
||||
end do outer
|
||||
call a%csget(i,i,nzra,ia,ja,val,info)
|
||||
call rwclip(nzra,ia,ja,val,ione,n,ione,n)
|
||||
p(i) = psb_spge_dot(nzra,ja,val,zval)
|
||||
if (abs(p(i)) < d_epstol) &
|
||||
& p(i) = 1.d-3
|
||||
|
||||
!!$ write(0,*) 'Dropping from a column with: ',i,psb_howmany_heap(heap),sp_thresh
|
||||
|
||||
!
|
||||
! Sparsify current ZVAL and put into ZMAT
|
||||
!
|
||||
call sparsify(i,nzrmax,sp_thresh,n,zval,nzrz,ia,val,info,iheap=heap,ikr=izkr)
|
||||
if (info /= psb_success_) then
|
||||
info = psb_err_internal_error_
|
||||
call psb_errpush(info,name,a_err='sparsify')
|
||||
return
|
||||
end if
|
||||
call psb_ensure_size(nzz+nzrz, z%ia, info)
|
||||
call psb_ensure_size(nzz+nzrz, z%val, info)
|
||||
ipz1 = z%icp(i)
|
||||
do j=1, nzrz
|
||||
z%ia(ipz1 + j -1) = ia(j)
|
||||
z%val(ipz1 + j -1) = val(j)
|
||||
end do
|
||||
z%icp(i+1) = ipz1 + nzrz
|
||||
nzz = nzz + nzrz
|
||||
|
||||
|
||||
! WVAL = e_i
|
||||
! !$ do j=1, i-1
|
||||
! !$ zval(j) = dzero
|
||||
! !$ end do
|
||||
zval(i) = done
|
||||
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 = a%irp(i), a%irp(i+1)-1
|
||||
if (a%ja(j) < i) then
|
||||
if (info == psb_success_) call rheap%insert(a%ja(j),info)
|
||||
izcr(a%ja(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
|
||||
outerw: do
|
||||
innerw: do
|
||||
call rheap%get_first(j,info)
|
||||
if (debug) write(0,*) 'from get_first: ',j,info
|
||||
if (info == -1) exit outerw ! Empty heap
|
||||
if (j > lastj) then
|
||||
lastj = j
|
||||
exit innerw
|
||||
end if
|
||||
end do innerw
|
||||
izcr(j) = 0
|
||||
if (j>=i) cycle outerw
|
||||
if (debug) write(0,*) 'update loop, using row: ',j
|
||||
ip1 = ac%icp(j)
|
||||
ip2 = ac%icp(j+1) - 1
|
||||
do
|
||||
if (ip2 < ip1 ) exit
|
||||
if (ac%ia(ip2) <= n) exit
|
||||
ip2 = ip2 -1
|
||||
end do
|
||||
nzra = max(0,ip2 - ip1 + 1)
|
||||
q(i) = psb_spge_dot(nzra,ac%ia(ip1:ip2),ac%val(ip1:ip2),zval)
|
||||
! !$ write(psb_err_unit,*) j,i,p(i)
|
||||
|
||||
alpha = (-q(i)/q(j))
|
||||
if (.true.) then
|
||||
|
||||
do k=w%icp(j), w%icp(j+1)-1
|
||||
kr = w%ia(k)
|
||||
zval(kr) = zval(kr) + alpha*w%val(k)
|
||||
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 j<k<i with nonzeros in column kr; we keep them in
|
||||
! a heap.
|
||||
!
|
||||
do kc = a%irp(kr), a%irp(kr+1)-1
|
||||
nextj=a%ja(kc)
|
||||
if ((info == psb_success_).and.(izcr(nextj)==0)&
|
||||
& .and.(nextj>j).and.(nextj<i)) then
|
||||
call rheap%insert(nextj,info)
|
||||
izcr(nextj) = 1
|
||||
end if
|
||||
end do
|
||||
if (debug) write(0,*) 'update loop, adding indices: ',&
|
||||
& a%ja(a%irp(kr):a%irp(kr+1)-1)
|
||||
|
||||
end if
|
||||
if (info /= psb_success_) exit
|
||||
end do
|
||||
if (info /= psb_success_) then
|
||||
info=psb_err_from_subroutine_
|
||||
call psb_errpush(info,name,a_err='psb_insert_heap')
|
||||
return
|
||||
end if
|
||||
end if
|
||||
end do outerw
|
||||
ip1 = ac%icp(i)
|
||||
ip2 = ac%icp(i+1) - 1
|
||||
do
|
||||
if (ip2 < ip1 ) exit
|
||||
if (ac%ia(ip2) <= n) exit
|
||||
ip2 = ip2 -1
|
||||
end do
|
||||
nzra = max(0,ip2 - ip1 + 1)
|
||||
q(i) = psb_spge_dot(nzra,ac%ia(ip1:ip2),ac%val(ip1:ip2),zval)
|
||||
if (abs(q(i)) < d_epstol) &
|
||||
& q(i) = 1.d-3
|
||||
|
||||
!!$ write(0,*) 'Dropping from a column with: ',i,psb_howmany_heap(heap),sp_thresh
|
||||
!
|
||||
! Sparsify current ZVAL and put into ZMAT
|
||||
!
|
||||
call sparsify(i,nzrmax,sp_thresh,n,zval,nzrz,ia,val,info,iheap=heap,ikr=izkr)
|
||||
if (info /= psb_success_) then
|
||||
info = psb_err_internal_error_
|
||||
call psb_errpush(info,name,a_err='sparsify')
|
||||
return
|
||||
end if
|
||||
call psb_ensure_size(nzw+nzrz, w%ia, info)
|
||||
call psb_ensure_size(nzw+nzrz, w%val, info)
|
||||
ipz1 = w%icp(i)
|
||||
do j=1, nzrz
|
||||
w%ia(ipz1 + j -1) = ia(j)
|
||||
w%val(ipz1 + j -1) = val(j)
|
||||
end do
|
||||
w%icp(i+1) = ipz1 + nzrz
|
||||
nzw = nzw + nzrz
|
||||
|
||||
end do
|
||||
|
||||
end subroutine psb_dsparse_biconjg_llk_noth
|
||||
@ -0,0 +1,501 @@
|
||||
!
|
||||
!
|
||||
! 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_dsparse_biconjg_mlk(n,a,p,z,w,nzrmax,sp_thresh,info)
|
||||
use psb_base_mod
|
||||
use psb_ainv_tools_mod
|
||||
use psb_d_biconjg_mod, psb_protect_name => psb_dsparse_biconjg_mlk
|
||||
!
|
||||
! Left-looking variant
|
||||
!
|
||||
!
|
||||
implicit none
|
||||
integer(psb_ipk_), intent(in) :: n
|
||||
type(psb_d_csr_sparse_mat), intent(in) :: a
|
||||
type(psb_d_csc_sparse_mat), intent(inout) :: z,w
|
||||
integer(psb_ipk_), intent(in) :: nzrmax
|
||||
real(psb_dpk_), intent(in) :: sp_thresh
|
||||
real(psb_dpk_), intent(out) :: p(:)
|
||||
integer(psb_ipk_), intent(out) :: info
|
||||
|
||||
! Locals
|
||||
integer(psb_ipk_), allocatable :: ia(:), ja(:), izkr(:), izcr(:), hlist(:), bfr(:), rwlist(:)
|
||||
real(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, hlhead, li, mj, kkc, ifrst, ilst, rwhead
|
||||
type(psb_i_heap) :: heap, rheap
|
||||
type(psb_d_csc_sparse_mat) :: ac
|
||||
real(psb_dpk_) :: alpha
|
||||
character(len=20) :: name='psb_biconjg_mlk'
|
||||
logical, parameter :: debug=.false., test_merge=.true.
|
||||
|
||||
allocate(zval(n),ia(n),val(n),izkr(n),izcr(n),q(n), &
|
||||
& hlist(n),rwlist(n),bfr(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) = dzero
|
||||
hlist(i) = -1
|
||||
rwlist(i) = -1
|
||||
end do
|
||||
|
||||
! Init z_1=e_1 and p_1=a_11
|
||||
p(1) = dzero
|
||||
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
|
||||
|
||||
q(1) = p(1)
|
||||
!
|
||||
!
|
||||
call z%allocate(n,n,n*nzrmax)
|
||||
|
||||
z%icp(1) = 1
|
||||
z%icp(2) = 2
|
||||
z%ia(1) = 1
|
||||
z%val(1) = done
|
||||
nzz = 1
|
||||
|
||||
call w%allocate(n,n,n*nzrmax)
|
||||
w%icp(1) = 1
|
||||
w%icp(2) = 2
|
||||
w%ia(1) = 1
|
||||
w%val(1) = done
|
||||
nzw = 1
|
||||
|
||||
|
||||
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) = dzero
|
||||
! !$ end do
|
||||
zval(i) = done
|
||||
izkr(i) = 1
|
||||
rwhead = i
|
||||
|
||||
hlhead = -1
|
||||
|
||||
kkc = 0
|
||||
ilst = ac%icp(i)-1
|
||||
ifrst = ac%icp(i)
|
||||
do j = ac%icp(i+1)-1, ac%icp(i), -1
|
||||
if (ac%ia(j) < i) then
|
||||
ilst = j
|
||||
exit
|
||||
end if
|
||||
end do
|
||||
kkc = ilst-ifrst+1
|
||||
|
||||
if (.true..or.debug) then
|
||||
!!$ write(0,*) 'Outer Before insertion : ',hlhead
|
||||
call printlist(hlhead,hlist)
|
||||
end if
|
||||
if (kkc > 0) then
|
||||
!!$ write(0,*) i,' Outer Inserting : ',kkc,':',ac%ia(ifrst:ilst)
|
||||
|
||||
!call hlmerge(hlhead,hlist,bfr(1:kkc))
|
||||
call hlmerge(hlhead,hlist,ac%ia(ifrst:ilst))
|
||||
end if
|
||||
if (debug) then
|
||||
write(0,*) 'Outer After insertion: ',hlhead
|
||||
call printlist(hlhead,hlist)
|
||||
end if
|
||||
|
||||
if (info /= psb_success_) then
|
||||
info=psb_err_from_subroutine_
|
||||
call psb_errpush(info,name,a_err='init_lists')
|
||||
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
|
||||
mj = hlhead
|
||||
if (mj > 0) then
|
||||
hlhead = hlist(mj)
|
||||
hlist(mj) = -1
|
||||
end if
|
||||
j = mj
|
||||
if (j < 0) exit outer
|
||||
|
||||
izcr(j) = 0
|
||||
if (j>=i) cycle outer
|
||||
|
||||
if (debug) write(0,*) 'update loop, using row: ',j,i,mj
|
||||
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))
|
||||
!!$ write(0,*) 'At step ',i,j,' p(i) ',p(i),alpha
|
||||
!!$ write(0,*) ' Current list is : ',hlhead
|
||||
!!$ call printlist(hlhead,hlist)
|
||||
!!$
|
||||
|
||||
|
||||
if (.false..or.(abs(alpha) > sp_thresh)) then
|
||||
ifrst=z%icp(j)
|
||||
ilst=z%icp(j+1)-1
|
||||
call hlmerge(rwhead,rwlist,z%ia(ifrst:ilst))
|
||||
!!$ write(0,*) 'At step ',i,j,' range ',z%icp(j), z%icp(j+1)-1, &
|
||||
!!$ & ' vals ',z%ia(z%icp(j):z%icp(j+1)-1)
|
||||
|
||||
do k=z%icp(j), z%icp(j+1)-1
|
||||
kr = z%ia(k)
|
||||
zval(kr) = zval(kr) + alpha*z%val(k)
|
||||
|
||||
if (izkr(kr) == 0) then
|
||||
!!$ write(0,*) ' main inner Inserting ',kr
|
||||
!!$ call hlmerge(rwhead,rwlist,(/kr/))
|
||||
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 j<k<i with nonzeros in column kr; we keep them in
|
||||
! a heap.
|
||||
!
|
||||
ilst = ac%icp(kr)-1
|
||||
ifrst = ac%icp(kr+1)
|
||||
kkc = 0
|
||||
do kc = ac%icp(kr), ac%icp(kr+1)-1
|
||||
if ((ac%ia(kc) < i).and.(ac%ia(kc) >j)) then
|
||||
ifrst = min(ifrst,kc )
|
||||
ilst = max(ilst,kc)
|
||||
end if
|
||||
end do
|
||||
kkc = ilst-ifrst+1
|
||||
if (debug) then
|
||||
write(0,*) 'Inner Before insertion: '
|
||||
call printlist(hlhead,hlist)
|
||||
write(0,*) 'Inner Inserting : ',kkc,':',ac%ia(ifrst:ilst)
|
||||
end if
|
||||
if (ilst >= ifrst) then
|
||||
!!$ write(0,*) j,i,' Inner inserting ',ac%ia(ifrst:ilst)
|
||||
call hlmerge(hlhead,hlist,ac%ia(ifrst:ilst))
|
||||
end if
|
||||
|
||||
if (debug) then
|
||||
write(0,*) 'Inner After insertion: ',hlhead
|
||||
call printlist(hlhead,hlist)
|
||||
end if
|
||||
|
||||
end if
|
||||
if (info /= psb_success_) exit
|
||||
end do
|
||||
if (info /= psb_success_) then
|
||||
info=psb_err_from_subroutine_
|
||||
call psb_errpush(info,name,a_err='psb_insert_heap')
|
||||
return
|
||||
end if
|
||||
end if
|
||||
end do outer
|
||||
call a%csget(i,i,nzra,ia,ja,val,info)
|
||||
call rwclip(nzra,ia,ja,val,ione,n,ione,n)
|
||||
p(i) = psb_spge_dot(nzra,ja,val,zval)
|
||||
if (abs(p(i)) < d_epstol) &
|
||||
& p(i) = 1.d-3
|
||||
|
||||
!!$ write(0,*) 'Dropping from a column with: ',i,psb_howmany_heap(heap),sp_thresh
|
||||
|
||||
!
|
||||
! Sparsify current ZVAL and put into ZMAT
|
||||
!
|
||||
call sparsify(i,nzrmax,sp_thresh,n,zval,nzrz,ia,val,rwhead,rwlist,izkr,info)
|
||||
|
||||
if (info /= psb_success_) then
|
||||
info = psb_err_internal_error_
|
||||
call psb_errpush(info,name,a_err='sparsify')
|
||||
return
|
||||
end if
|
||||
call psb_ensure_size(nzz+nzrz, z%ia, info)
|
||||
call psb_ensure_size(nzz+nzrz, z%val, info)
|
||||
ipz1 = z%icp(i)
|
||||
do j=1, nzrz
|
||||
z%ia(ipz1 + j -1) = ia(j)
|
||||
z%val(ipz1 + j -1) = val(j)
|
||||
end do
|
||||
z%icp(i+1) = ipz1 + nzrz
|
||||
nzz = nzz + nzrz
|
||||
|
||||
|
||||
! WVAL = e_i
|
||||
! !$ do j=1, i-1
|
||||
! !$ zval(j) = dzero
|
||||
! !$ end do
|
||||
zval(i) = done
|
||||
izkr(i) = 1
|
||||
rwhead = i
|
||||
hlhead = -1
|
||||
|
||||
kkc = 0
|
||||
ilst = a%irp(i)-1
|
||||
ifrst = a%irp(i)
|
||||
do j = a%irp(i+1)-1, a%irp(i), -1
|
||||
if (a%ja(j) < i) then
|
||||
ilst = j
|
||||
exit
|
||||
end if
|
||||
end do
|
||||
kkc = ilst-ifrst+1
|
||||
|
||||
if (debug) then
|
||||
write(0,*) 'Outer Before insertion: '
|
||||
call printlist(hlhead,hlist)
|
||||
write(0,*) 'Outer Inserting : ',kkc,':',a%ja(ifrst:ilst)
|
||||
end if
|
||||
if (kkc > 0 ) then
|
||||
!call hlmerge(hlhead,hlist,bfr(1:kkc))
|
||||
call hlmerge(hlhead,hlist,a%ja(ifrst:ilst))
|
||||
end if
|
||||
if (debug) then
|
||||
write(0,*) 'Outer After insertion: ',hlhead
|
||||
call printlist(hlhead,hlist)
|
||||
end if
|
||||
|
||||
if (info /= psb_success_) then
|
||||
info=psb_err_from_subroutine_
|
||||
call psb_errpush(info,name,a_err='init_lists')
|
||||
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
|
||||
outerw: do
|
||||
mj = hlhead
|
||||
if (hlhead > 0) then
|
||||
hlhead = hlist(mj)
|
||||
hlist(mj) = -1
|
||||
end if
|
||||
j = mj
|
||||
if (j < 0) exit outerw
|
||||
|
||||
izcr(j) = 0
|
||||
if (j>=i) cycle outerw
|
||||
if (debug) write(0,*) 'update loop, using row: ',j
|
||||
ip1 = ac%icp(j)
|
||||
ip2 = ac%icp(j+1) - 1
|
||||
do
|
||||
if (ip2 < ip1 ) exit
|
||||
if (ac%ia(ip2) <= n) exit
|
||||
ip2 = ip2 -1
|
||||
end do
|
||||
nzra = max(0,ip2 - ip1 + 1)
|
||||
q(i) = psb_spge_dot(nzra,ac%ia(ip1:ip2),ac%val(ip1:ip2),zval)
|
||||
! !$ write(psb_err_unit,*) j,i,p(i)
|
||||
|
||||
alpha = (-q(i)/q(j))
|
||||
if (.false..or.(abs(alpha) > sp_thresh)) then
|
||||
ifrst=w%icp(j)
|
||||
ilst=w%icp(j+1)-1
|
||||
call hlmerge(rwhead,rwlist,w%ia(ifrst:ilst))
|
||||
|
||||
do k=w%icp(j), w%icp(j+1)-1
|
||||
kr = w%ia(k)
|
||||
zval(kr) = zval(kr) + alpha*w%val(k)
|
||||
if (izkr(kr) == 0) then
|
||||
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 j<k<i with nonzeros in column kr; we keep them in
|
||||
! a heap.
|
||||
!
|
||||
ilst = a%irp(kr)-1
|
||||
ifrst = a%irp(kr+1)
|
||||
kkc = 0
|
||||
do kc = a%irp(kr), a%irp(kr+1)-1
|
||||
if ((a%ja(kc) < i).and.(a%ja(kc) >j)) then
|
||||
ifrst = min(ifrst,kc )
|
||||
ilst = max(ilst,kc)
|
||||
end if
|
||||
end do
|
||||
kkc = ilst-ifrst+1
|
||||
if (debug) then
|
||||
write(0,*) 'Inner Before insertion: '
|
||||
call printlist(hlhead,hlist)
|
||||
write(0,*) 'Inner Inserting : ',kkc,':',a%ja(ifrst:ilst)
|
||||
end if
|
||||
|
||||
call hlmerge(hlhead,hlist,a%ja(ifrst:ilst))
|
||||
|
||||
if (debug) then
|
||||
write(0,*) 'Inner After insertion: ',hlhead
|
||||
call printlist(hlhead,hlist)
|
||||
end if
|
||||
if (debug) write(0,*) 'update loop, adding indices: ',&
|
||||
& a%ja(a%irp(kr):a%irp(kr+1)-1)
|
||||
|
||||
end if
|
||||
if (info /= psb_success_) exit
|
||||
end do
|
||||
if (info /= psb_success_) then
|
||||
info=psb_err_from_subroutine_
|
||||
call psb_errpush(info,name,a_err='psb_insert_heap')
|
||||
return
|
||||
end if
|
||||
end if
|
||||
end do outerw
|
||||
ip1 = ac%icp(i)
|
||||
ip2 = ac%icp(i+1) - 1
|
||||
do
|
||||
if (ip2 < ip1 ) exit
|
||||
if (ac%ia(ip2) <= n) exit
|
||||
ip2 = ip2 -1
|
||||
end do
|
||||
nzra = max(0,ip2 - ip1 + 1)
|
||||
q(i) = psb_spge_dot(nzra,ac%ia(ip1:ip2),ac%val(ip1:ip2),zval)
|
||||
if (abs(q(i)) < d_epstol) &
|
||||
& q(i) = 1.d-3
|
||||
|
||||
!!$ write(0,*) 'Dropping from a column with: ',i,psb_howmany_heap(heap),sp_thresh
|
||||
!
|
||||
! Sparsify current ZVAL and put into ZMAT
|
||||
!
|
||||
call sparsify(i,nzrmax,sp_thresh,n,zval,nzrz,ia,val,rwhead,rwlist,izkr,info)
|
||||
if (info /= psb_success_) then
|
||||
info = psb_err_internal_error_
|
||||
call psb_errpush(info,name,a_err='sparsify')
|
||||
return
|
||||
end if
|
||||
call psb_ensure_size(nzw+nzrz, w%ia, info)
|
||||
call psb_ensure_size(nzw+nzrz, w%val, info)
|
||||
ipz1 = w%icp(i)
|
||||
do j=1, nzrz
|
||||
w%ia(ipz1 + j -1) = ia(j)
|
||||
w%val(ipz1 + j -1) = val(j)
|
||||
end do
|
||||
w%icp(i+1) = ipz1 + nzrz
|
||||
nzw = nzw + nzrz
|
||||
|
||||
end do
|
||||
|
||||
contains
|
||||
|
||||
subroutine hlmerge(head,listv,vals)
|
||||
integer(psb_ipk_), intent(inout) :: head, listv(:)
|
||||
integer(psb_ipk_), intent(in) :: vals(:)
|
||||
integer(psb_ipk_) :: i,j,k, lh, lv, nv, vv, flh, ph
|
||||
|
||||
nv = size(vals)
|
||||
lh = head
|
||||
flh = -1
|
||||
lv = 1
|
||||
if ((head < 0).and.(nv > 0)) then
|
||||
! Adjust head if empty
|
||||
head = vals(lv)
|
||||
lv = lv + 1
|
||||
else if ((head > 0) .and. (nv >0)) then
|
||||
! Adjust head if first item less than it
|
||||
if (head > vals(lv)) then
|
||||
listv(vals(lv)) = head
|
||||
head = vals(lv)
|
||||
lv = lv + 1
|
||||
end if
|
||||
end if
|
||||
|
||||
lh = head
|
||||
ph = lh
|
||||
do while ((lh > 0) .and. (lv <= nv))
|
||||
if (lh == vals(lv)) then
|
||||
lv = lv + 1
|
||||
else if (lh > vals(lv)) then
|
||||
listv(vals(lv)) = lh
|
||||
listv(ph) = vals(lv)
|
||||
lh = vals(lv)
|
||||
lv = lv + 1
|
||||
else
|
||||
ph = lh
|
||||
lh = listv(lh)
|
||||
end if
|
||||
end do
|
||||
lh = ph
|
||||
do while (lv <= nv)
|
||||
listv(lh) = vals(lv)
|
||||
lh = listv(lh)
|
||||
lv = lv + 1
|
||||
end do
|
||||
end subroutine hlmerge
|
||||
|
||||
|
||||
subroutine printlist(head,listv)
|
||||
integer(psb_ipk_), intent(in) :: head, listv(:)
|
||||
integer(psb_ipk_) :: li
|
||||
|
||||
li = head
|
||||
do while (li > 0)
|
||||
write(0,*) 'Item: ', li
|
||||
li = listv(li)
|
||||
end do
|
||||
end subroutine printlist
|
||||
|
||||
end subroutine psb_dsparse_biconjg_mlk
|
||||
@ -0,0 +1,414 @@
|
||||
!
|
||||
!
|
||||
! 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_dsparse_biconjg_s_ft_llk(n,a,p,z,w,nzrmax,sp_thresh,info)
|
||||
use psb_base_mod
|
||||
use psb_ainv_tools_mod
|
||||
use psb_d_biconjg_mod, psb_protect_name => psb_dsparse_biconjg_s_ft_llk
|
||||
|
||||
!
|
||||
! Left-looking variant, stabilized i.e. product by A is applied
|
||||
! to compute the diagonal elements.
|
||||
!
|
||||
!
|
||||
implicit none
|
||||
integer(psb_ipk_), intent(in) :: n
|
||||
type(psb_d_csr_sparse_mat), intent(in) :: a
|
||||
type(psb_d_csc_sparse_mat), intent(inout) :: z,w
|
||||
integer(psb_ipk_), intent(in) :: nzrmax
|
||||
real(psb_dpk_), intent(in) :: sp_thresh
|
||||
real(psb_dpk_), intent(out) :: p(:)
|
||||
integer(psb_ipk_), intent(out) :: info
|
||||
|
||||
! Locals
|
||||
integer(psb_ipk_), allocatable :: ia(:), ja(:), izkr(:), izcr(:),iww(:)
|
||||
real(psb_dpk_), allocatable :: zval(:),val(:), q(:), ww(:)
|
||||
integer(psb_ipk_) :: i,j,k, kc, kr, err_act, nz, nzra, nzrz, ipzi,ipzj, nzww,&
|
||||
& nzzi,nzzj, nzz, ip1, ip2, ipza,ipzz, ipzn, nzzn, ipz1, ipz2,&
|
||||
& ipj, lastj, nextj, nzw, nzrw
|
||||
type(psb_i_heap) :: heap, rheap
|
||||
type(psb_d_csc_sparse_mat) :: ac
|
||||
real(psb_dpk_) :: alpha, tmpq,tmpq2
|
||||
character(len=20) :: name='psb_orth_llk'
|
||||
logical, parameter :: debug=.false.
|
||||
|
||||
allocate(zval(n),ia(n),val(n),izkr(n),izcr(n),q(n),iww(n),ww(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
|
||||
!
|
||||
! Init pointers to:
|
||||
! ljr(i): last occupied column index within row I
|
||||
! izcr(i): first occupied row index within column I
|
||||
!
|
||||
do i=1,n
|
||||
izkr(i) = 0
|
||||
izcr(i) = 0
|
||||
zval(i) = dzero
|
||||
end do
|
||||
|
||||
! Init z_1=e_1 and p_1=a_11
|
||||
p(1) = dzero
|
||||
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
|
||||
|
||||
q(1) = p(1)
|
||||
!
|
||||
!
|
||||
call z%allocate(n,n,n*nzrmax)
|
||||
|
||||
z%icp(1) = 1
|
||||
z%icp(2) = 2
|
||||
z%ia(1) = 1
|
||||
z%val(1) = done
|
||||
nzz = 1
|
||||
|
||||
call w%allocate(n,n,n*nzrmax)
|
||||
w%icp(1) = 1
|
||||
w%icp(2) = 2
|
||||
w%ia(1) = 1
|
||||
w%val(1) = done
|
||||
nzw = 1
|
||||
|
||||
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) = dzero
|
||||
! !$ end do
|
||||
zval(i) = done
|
||||
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) exit outer
|
||||
if (debug) write(0,*) 'update loop, using row: ',j
|
||||
ip1 = w%icp(j)
|
||||
ip2 = w%icp(j+1) - 1
|
||||
nzra = max(0,ip2 - ip1 + 1)
|
||||
nzww = 0
|
||||
call psb_d_spvspm(done,a,nzra,w%ia(ip1:ip2),w%val(ip1:ip2),&
|
||||
& dzero,nzww,iww,ww,info)
|
||||
|
||||
p(i) = psb_spge_dot(nzww,iww,ww,zval)
|
||||
|
||||
ipz1 = z%icp(j)
|
||||
ipz2 = z%icp(j+1)
|
||||
nzrz = ipz2-ipz1
|
||||
alpha = (-p(i)/p(j))
|
||||
!!$ write(0,*) ' p(i)/p(j) ',i,j,alpha,p(i),p(j)
|
||||
if (.false..or.(abs(alpha) > sp_thresh)) then
|
||||
|
||||
do k=ipz1, ipz2-1
|
||||
kr = z%ia(k)
|
||||
zval(kr) = zval(kr) + alpha*z%val(k)
|
||||
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 j<k<i with nonzeros in column kr; we keep them in
|
||||
! a heap.
|
||||
!
|
||||
do kc = ac%icp(kr), ac%icp(kr+1)-1
|
||||
nextj=ac%ia(kc)
|
||||
if ((info == psb_success_).and.(izcr(nextj)==0)&
|
||||
& .and.(nextj>j).and.(nextj<i)) then
|
||||
call rheap%insert(nextj,info)
|
||||
izcr(nextj) = 1
|
||||
end if
|
||||
end do
|
||||
if (debug) write(0,*) 'update loop, adding indices: ',&
|
||||
& ac%ia(ac%icp(kr):ac%icp(kr+1)-1)
|
||||
|
||||
end if
|
||||
if (info /= psb_success_) exit
|
||||
end do
|
||||
if (info /= psb_success_) then
|
||||
info=psb_err_from_subroutine_
|
||||
call psb_errpush(info,name,a_err='psb_insert_heap')
|
||||
return
|
||||
end if
|
||||
end if
|
||||
!!$ izcr(j) = 0
|
||||
end do outer
|
||||
|
||||
if (.false.) then
|
||||
! We can't do the proper thing until we have bot Z_i and W_i.
|
||||
call a%csget(i,i,nzra,ia,ja,val,info)
|
||||
call rwclip(nzra,ia,ja,val,ione,n,ione,n)
|
||||
p(i) = psb_spge_dot(nzra,ja,val,zval)
|
||||
if (abs(p(i)) < d_epstol) &
|
||||
& p(i) = 1.d-3
|
||||
end if
|
||||
|
||||
!
|
||||
! Sparsify current ZVAL and put into ZMAT
|
||||
!
|
||||
call sparsify(i,nzrmax,sp_thresh,n,zval,nzrz,ia,val,info,iheap=heap,ikr=izkr)
|
||||
if (info /= psb_success_) then
|
||||
info = psb_err_internal_error_
|
||||
call psb_errpush(info,name,a_err='sparsify')
|
||||
return
|
||||
end if
|
||||
call psb_ensure_size(nzz+nzrz, z%ia, info)
|
||||
call psb_ensure_size(nzz+nzrz, z%val, info)
|
||||
ipz1 = z%icp(i)
|
||||
do j=1, nzrz
|
||||
z%ia(ipz1 + j -1) = ia(j)
|
||||
z%val(ipz1 + j -1) = val(j)
|
||||
end do
|
||||
z%icp(i+1) = ipz1 + nzrz
|
||||
nzz = nzz + nzrz
|
||||
|
||||
|
||||
|
||||
|
||||
! WVAL = e_i
|
||||
! !$ do j=1, i-1
|
||||
! !$ zval(j) = dzero
|
||||
! !$ end do
|
||||
zval(i) = done
|
||||
izkr(i) = 1
|
||||
call heap%init(info)
|
||||
if (info == psb_success_) call heap%insert(i,info)
|
||||
!!$ write(0,*) 'Inserting into heap ',i
|
||||
if (info == psb_success_) call rheap%init(info)
|
||||
do j = a%irp(i), a%irp(i+1)-1
|
||||
if (a%ja(j)<i) then
|
||||
if (info == psb_success_) call rheap%insert(a%ja(j),info)
|
||||
izcr(a%ja(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
|
||||
outerw: do
|
||||
innerw: do
|
||||
call rheap%get_first(j,info)
|
||||
if (debug) write(0,*) 'from get_first: ',j,info
|
||||
if (info == -1) exit outerw ! Empty heap
|
||||
if (j > lastj) then
|
||||
lastj = j
|
||||
exit innerw
|
||||
end if
|
||||
end do innerw
|
||||
izcr(j) = 0
|
||||
if (j>=i) exit outerw
|
||||
if (debug) write(0,*) 'update loop, using row: ',j
|
||||
if (.false.) then
|
||||
ip1 = ac%icp(j)
|
||||
ip2 = ac%icp(j+1) - 1
|
||||
do
|
||||
if (ip2 < ip1 ) exit
|
||||
if (ac%ia(ip2) <= n) exit
|
||||
ip2 = ip2 -1
|
||||
end do
|
||||
nzra = max(0,ip2 - ip1 + 1)
|
||||
q(i) = psb_spge_dot(nzra,ac%ia(ip1:ip2),ac%val(ip1:ip2),zval)
|
||||
! !$ write(psb_err_unit,*) j,i,p(i)
|
||||
else
|
||||
ip1 = z%icp(j)
|
||||
ip2 = z%icp(j+1) - 1
|
||||
nzra = max(0,ip2 - ip1 + 1)
|
||||
nzww = 0
|
||||
call psb_d_spmspv(done,ac,nzra,z%ia(ip1:ip2),z%val(ip1:ip2),&
|
||||
& dzero,nzww,iww,ww,info)
|
||||
|
||||
q(i) = psb_spge_dot(nzww,iww,ww,zval)
|
||||
end if
|
||||
|
||||
ipz1 = w%icp(j)
|
||||
ipz2 = w%icp(j+1)
|
||||
nzrz = ipz2-ipz1
|
||||
alpha = (-q(i)/q(j))
|
||||
!!$ write(0,*) ' q(i)/q(j) ',i,j,alpha,q(i),q(j)
|
||||
if (.false..or.(abs(alpha) > sp_thresh)) then
|
||||
|
||||
do k=ipz1, ipz2-1
|
||||
kr = w%ia(k)
|
||||
zval(kr) = zval(kr) + alpha*w%val(k)
|
||||
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 j<k<i with nonzeros in column kr; we keep them in
|
||||
! a heap.
|
||||
!
|
||||
do kc = a%irp(kr), a%irp(kr+1)-1
|
||||
nextj=a%ja(kc)
|
||||
if ((info == psb_success_).and.(izcr(nextj)==0)&
|
||||
& .and.(nextj>j).and.(nextj<i)) then
|
||||
call rheap%insert(nextj,info)
|
||||
izcr(nextj) = 1
|
||||
end if
|
||||
end do
|
||||
if (debug) write(0,*) 'update loop, adding indices: ',&
|
||||
& a%ja(a%irp(kr):a%irp(kr+1)-1)
|
||||
|
||||
end if
|
||||
if (info /= psb_success_) exit
|
||||
end do
|
||||
if (info /= psb_success_) then
|
||||
info=psb_err_from_subroutine_
|
||||
call psb_errpush(info,name,a_err='psb_insert_heap')
|
||||
return
|
||||
end if
|
||||
end if
|
||||
!!$ izcr(j) = 0
|
||||
end do outerw
|
||||
|
||||
!!$ ip1 = ac%icp(i)
|
||||
!!$ ip2 = ac%icp(i+1) - 1
|
||||
!!$ do
|
||||
!!$ if (ip2 < ip1 ) exit
|
||||
!!$ if (ac%ia(ip2) <= n) exit
|
||||
!!$ ip2 = ip2 -1
|
||||
!!$ end do
|
||||
!!$ nzra = max(0,ip2 - ip1 + 1)
|
||||
!!$
|
||||
!!$ q(i) = psb_spge_dot(nzra,ac%ia(ip1:ip2),ac%val(ip1:ip2),zval)
|
||||
!!$ if (abs(q(i)) < d_epstol) &
|
||||
!!$ & q(i) = 1.d-3
|
||||
!
|
||||
! Sparsify current ZVAL and put into ZMAT
|
||||
!
|
||||
call sparsify(i,nzrmax,sp_thresh,n,zval,nzrw,ia,val,info,iheap=heap,ikr=izkr)
|
||||
if (info /= psb_success_) then
|
||||
info = psb_err_internal_error_
|
||||
call psb_errpush(info,name,a_err='sparsify')
|
||||
return
|
||||
end if
|
||||
call psb_ensure_size(nzw+nzrw, w%ia, info)
|
||||
call psb_ensure_size(nzw+nzrw, w%val, info)
|
||||
ipz1 = w%icp(i)
|
||||
do j=1, nzrw
|
||||
w%ia(ipz1 + j -1) = ia(j)
|
||||
w%val(ipz1 + j -1) = val(j)
|
||||
end do
|
||||
w%icp(i+1) = ipz1 + nzrw
|
||||
nzw = nzw + nzrw
|
||||
|
||||
!!$ !
|
||||
!!$ ! Ok, now compute w_i^T A z_i
|
||||
!!$ !
|
||||
nzww = 0
|
||||
nzrz = z%icp(i+1)-z%icp(i)
|
||||
ipz1 = z%icp(i)
|
||||
call psb_d_spmspv(done,ac,&
|
||||
& nzrz,z%ia(ipz1:ipz1+nzrz-1),z%val(ipz1:ipz1+nzrz-1),&
|
||||
& dzero,nzww,iww,ww,info)
|
||||
tmpq = psb_spdot_srtd(nzww,iww,ww,nzrw,ia,val)
|
||||
q(i) = tmpq
|
||||
! if (tmpq <0) then
|
||||
!!$ write(0,*) 'On negative dot prod at ',i
|
||||
!!$ write(0,*) 'On negative dot prod a ',ia(1:nzrw),val(1:nzrw)
|
||||
!!$ write(0,*) 'On negative dot prod w ',iww(1:nzww),ww(1:nzww)
|
||||
!!$ ip1 = ac%icp(i)
|
||||
!!$ ip2 = ac%icp(i+1) - 1
|
||||
!!$ do
|
||||
!!$ if (ip2 < ip1 ) exit
|
||||
!!$ if (ac%ia(ip2) <= n) exit
|
||||
!!$ ip2 = ip2 -1
|
||||
!!$ end do
|
||||
!!$ nzra = max(0,ip2 - ip1 + 1)
|
||||
!!$ write(0,*) 'On negative dot prod a ',ac%ia(ip1:ip2),ac%val(ip1:ip2)
|
||||
!
|
||||
! end if
|
||||
|
||||
if (abs(q(i)) < d_epstol) &
|
||||
& q(i) = 1.d-3
|
||||
p(i) = q(i)
|
||||
|
||||
end do
|
||||
|
||||
end subroutine psb_dsparse_biconjg_s_ft_llk
|
||||
@ -0,0 +1,248 @@
|
||||
!
|
||||
!
|
||||
! 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_dsparse_biconjg_s_llk(n,a,p,z,w,nzrmax,sp_thresh,info)
|
||||
use psb_base_mod
|
||||
use psb_ainv_tools_mod
|
||||
use psb_d_biconjg_mod, psb_protect_name => psb_dsparse_biconjg_s_llk
|
||||
|
||||
!
|
||||
! Left-looking variant SYMMETRIC/HERMITIAN A. You have been warned!
|
||||
!
|
||||
!
|
||||
implicit none
|
||||
integer(psb_ipk_), intent(in) :: n
|
||||
type(psb_d_csr_sparse_mat), intent(in) :: a
|
||||
type(psb_d_csc_sparse_mat), intent(inout) :: z,w
|
||||
integer(psb_ipk_), intent(in) :: nzrmax
|
||||
real(psb_dpk_), intent(in) :: sp_thresh
|
||||
real(psb_dpk_), intent(out) :: p(:)
|
||||
integer(psb_ipk_), intent(out) :: info
|
||||
|
||||
! Locals
|
||||
integer(psb_ipk_), allocatable :: ia(:), ja(:), izkr(:), izcr(:)
|
||||
real(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_d_csc_sparse_mat) :: ac
|
||||
real(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) = dzero
|
||||
end do
|
||||
|
||||
! Init z_1=e_1 and p_1=a_11
|
||||
p(1) = dzero
|
||||
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) = done
|
||||
nzz = 1
|
||||
zvalmax = done
|
||||
|
||||
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) = dzero
|
||||
! !$ end do
|
||||
zval(i) = done
|
||||
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 j<k<i with nonzeros in column kr; we keep them in
|
||||
! a heap.
|
||||
!
|
||||
do kc = ac%icp(kr), ac%icp(kr+1)-1
|
||||
nextj=ac%ia(kc)
|
||||
if ((info == psb_success_).and.(izcr(nextj)==0)&
|
||||
& .and.(nextj>j).and.(nextj<i)) then
|
||||
call rheap%insert(nextj,info)
|
||||
izcr(nextj) = 1
|
||||
end if
|
||||
end do
|
||||
if (debug) write(0,*) 'update loop, adding indices: ',&
|
||||
& ac%ia(ac%icp(kr):ac%icp(kr+1)-1)
|
||||
|
||||
end if
|
||||
if (info /= psb_success_) exit
|
||||
end do
|
||||
if (info /= psb_success_) then
|
||||
info=psb_err_from_subroutine_
|
||||
call psb_errpush(info,name,a_err='psb_insert_heap')
|
||||
return
|
||||
end if
|
||||
end if
|
||||
end do outer
|
||||
call a%csget(i,i,nzra,ia,ja,val,info)
|
||||
call rwclip(nzra,ia,ja,val,ione,n,ione,n)
|
||||
p(i) = psb_spge_dot(nzra,ja,val,zval)
|
||||
!!$ if ((1761<=i).and.(i<=1780)) then
|
||||
!!$ write(0,*) 'Dot product terms at ',i,nzra
|
||||
!!$ do kk=1,nzra
|
||||
!!$ write(0,*) kk,ja(kk),val(kk),zval(ja(kk))
|
||||
!!$ end do
|
||||
!!$ end if
|
||||
|
||||
if (abs(p(i)) < d_epstol) &
|
||||
& p(i) = 1.d-3
|
||||
|
||||
! !$ write(0,*) 'Dropping from a column with: ',i,psb_howmany_heap(heap),sp_thresh
|
||||
|
||||
!
|
||||
! Sparsify current ZVAL and put into ZMAT
|
||||
!
|
||||
call sparsify(i,nzrmax,sp_thresh,n,zval,nzrz,ia,val,info,iheap=heap,ikr=izkr)
|
||||
if (info /= psb_success_) then
|
||||
info = psb_err_internal_error_
|
||||
call psb_errpush(info,name,a_err='sparsify')
|
||||
return
|
||||
end if
|
||||
call psb_ensure_size(nzz+nzrz, z%ia, info)
|
||||
call psb_ensure_size(nzz+nzrz, z%val, info)
|
||||
ipz1 = z%icp(i)
|
||||
do j=1, nzrz
|
||||
z%ia(ipz1 + j -1) = ia(j)
|
||||
z%val(ipz1 + j -1) = val(j)
|
||||
!!$ zvalmax = max(zvalmax,abs(val(j)))
|
||||
end do
|
||||
z%icp(i+1) = ipz1 + nzrz
|
||||
nzz = nzz + nzrz
|
||||
!!$ write(0,*) ' Dot: ',i,p(i),zvalmax
|
||||
|
||||
end do
|
||||
|
||||
call z%cp_to_fmt(w,info)
|
||||
|
||||
end subroutine psb_dsparse_biconjg_s_llk
|
||||
@ -0,0 +1,366 @@
|
||||
!
|
||||
!
|
||||
! 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_ssparse_biconjg_llk(n,a,p,z,w,nzrmax,sp_thresh,info)
|
||||
use psb_base_mod
|
||||
use psb_ainv_tools_mod
|
||||
use psb_s_biconjg_mod, psb_protect_name => psb_ssparse_biconjg_llk
|
||||
!
|
||||
! Left-looking variant
|
||||
!
|
||||
!
|
||||
implicit none
|
||||
integer(psb_ipk_), intent(in) :: n
|
||||
type(psb_s_csr_sparse_mat), intent(in) :: a
|
||||
type(psb_s_csc_sparse_mat), intent(inout) :: z,w
|
||||
integer(psb_ipk_), intent(in) :: nzrmax
|
||||
real(psb_spk_), intent(in) :: sp_thresh
|
||||
real(psb_spk_), intent(out) :: p(:)
|
||||
integer(psb_ipk_), intent(out) :: info
|
||||
|
||||
! Locals
|
||||
integer(psb_ipk_), allocatable :: ia(:), ja(:), izkr(:), izcr(:)
|
||||
real(psb_spk_), 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
|
||||
type(psb_i_heap) :: heap, rheap
|
||||
type(psb_s_csc_sparse_mat) :: ac
|
||||
real(psb_spk_) :: alpha
|
||||
character(len=20) :: name='psb_orth_llk'
|
||||
logical, parameter :: debug=.false.
|
||||
|
||||
allocate(zval(n),ia(n),val(n),izkr(n),izcr(n),q(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) = szero
|
||||
end do
|
||||
|
||||
! Init z_1=e_1 and p_1=a_11
|
||||
p(1) = szero
|
||||
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)) < s_epstol) &
|
||||
& p(1) = 1.d-3
|
||||
|
||||
q(1) = p(1)
|
||||
!
|
||||
!
|
||||
call z%allocate(n,n,n*nzrmax)
|
||||
|
||||
z%icp(1) = 1
|
||||
z%icp(2) = 2
|
||||
z%ia(1) = 1
|
||||
z%val(1) = sone
|
||||
nzz = 1
|
||||
|
||||
call w%allocate(n,n,n*nzrmax)
|
||||
w%icp(1) = 1
|
||||
w%icp(2) = 2
|
||||
w%ia(1) = 1
|
||||
w%val(1) = sone
|
||||
nzw = 1
|
||||
|
||||
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) = szero
|
||||
! !$ end do
|
||||
zval(i) = sone
|
||||
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
|
||||
!!$ write(0,*) i, ' Outer inserting ',ac%ia(j)
|
||||
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))
|
||||
!!$ write(0,*) 'At step ',i,j,' p(i) ',p(i),alpha
|
||||
if (.false..or.(abs(alpha) > sp_thresh)) then
|
||||
!!$ write(0,*) 'At step ',i,j,' range ',z%icp(j), z%icp(j+1)-1, &
|
||||
!!$ & ' vals ',z%ia(z%icp(j):z%icp(j+1)-1)
|
||||
do k=z%icp(j), z%icp(j+1)-1
|
||||
kr = z%ia(k)
|
||||
zval(kr) = zval(kr) + alpha*z%val(k)
|
||||
if (izkr(kr) == 0) then
|
||||
!!$ write(0,*) ' main inner Inserting ',kr
|
||||
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 j<k<i with nonzeros in column kr; we keep them in
|
||||
! a heap.
|
||||
!
|
||||
do kc = ac%icp(kr), ac%icp(kr+1)-1
|
||||
nextj=ac%ia(kc)
|
||||
if ((info == psb_success_).and.(izcr(nextj)==0)&
|
||||
& .and.(nextj>j).and.(nextj<i)) then
|
||||
!!$ write(0,*) j,i,' Inner inserting ',nextj
|
||||
call rheap%insert(nextj,info)
|
||||
izcr(nextj) = 1
|
||||
end if
|
||||
end do
|
||||
if (debug) write(0,*) 'update loop, adding indices: ',&
|
||||
& ac%ia(ac%icp(kr):ac%icp(kr+1)-1)
|
||||
|
||||
end if
|
||||
if (info /= psb_success_) exit
|
||||
end do
|
||||
if (info /= psb_success_) then
|
||||
info=psb_err_from_subroutine_
|
||||
call psb_errpush(info,name,a_err='psb_insert_heap')
|
||||
return
|
||||
end if
|
||||
end if
|
||||
end do outer
|
||||
call a%csget(i,i,nzra,ia,ja,val,info)
|
||||
call rwclip(nzra,ia,ja,val,ione,n,ione,n)
|
||||
p(i) = psb_spge_dot(nzra,ja,val,zval)
|
||||
if (abs(p(i)) < s_epstol) &
|
||||
& p(i) = 1.d-3
|
||||
|
||||
!!$ write(0,*) 'Dropping from a column with: ',i,psb_howmany_heap(heap),sp_thresh
|
||||
|
||||
!
|
||||
! Sparsify current ZVAL and put into ZMAT
|
||||
!
|
||||
call sparsify(i,nzrmax,sp_thresh,n,zval,nzrz,ia,val,info,iheap=heap,ikr=izkr)
|
||||
if (info /= psb_success_) then
|
||||
info = psb_err_internal_error_
|
||||
call psb_errpush(info,name,a_err='sparsify')
|
||||
return
|
||||
end if
|
||||
call psb_ensure_size(nzz+nzrz, z%ia, info)
|
||||
call psb_ensure_size(nzz+nzrz, z%val, info)
|
||||
ipz1 = z%icp(i)
|
||||
do j=1, nzrz
|
||||
z%ia(ipz1 + j -1) = ia(j)
|
||||
z%val(ipz1 + j -1) = val(j)
|
||||
end do
|
||||
z%icp(i+1) = ipz1 + nzrz
|
||||
nzz = nzz + nzrz
|
||||
|
||||
|
||||
! WVAL = e_i
|
||||
! !$ do j=1, i-1
|
||||
! !$ zval(j) = szero
|
||||
! !$ end do
|
||||
zval(i) = sone
|
||||
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 = a%irp(i), a%irp(i+1)-1
|
||||
if (a%ja(j) < i) then
|
||||
if (info == psb_success_) call rheap%insert(a%ja(j),info)
|
||||
izcr(a%ja(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
|
||||
outerw: do
|
||||
innerw: do
|
||||
call rheap%get_first(j,info)
|
||||
if (debug) write(0,*) 'from get_first: ',j,info
|
||||
if (info == -1) exit outerw ! Empty heap
|
||||
if (j > lastj) then
|
||||
lastj = j
|
||||
exit innerw
|
||||
end if
|
||||
end do innerw
|
||||
izcr(j) = 0
|
||||
if (j>=i) cycle outerw
|
||||
if (debug) write(0,*) 'update loop, using row: ',j
|
||||
ip1 = ac%icp(j)
|
||||
ip2 = ac%icp(j+1) - 1
|
||||
do
|
||||
if (ip2 < ip1 ) exit
|
||||
if (ac%ia(ip2) <= n) exit
|
||||
ip2 = ip2 -1
|
||||
end do
|
||||
nzra = max(0,ip2 - ip1 + 1)
|
||||
q(i) = psb_spge_dot(nzra,ac%ia(ip1:ip2),ac%val(ip1:ip2),zval)
|
||||
! !$ write(psb_err_unit,*) j,i,p(i)
|
||||
|
||||
alpha = (-q(i)/q(j))
|
||||
if (.false..or.(abs(alpha) > sp_thresh)) then
|
||||
|
||||
do k=w%icp(j), w%icp(j+1)-1
|
||||
kr = w%ia(k)
|
||||
zval(kr) = zval(kr) + alpha*w%val(k)
|
||||
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 j<k<i with nonzeros in column kr; we keep them in
|
||||
! a heap.
|
||||
!
|
||||
do kc = a%irp(kr), a%irp(kr+1)-1
|
||||
nextj=a%ja(kc)
|
||||
if ((info == psb_success_).and.(izcr(nextj)==0)&
|
||||
& .and.(nextj>j).and.(nextj<i)) then
|
||||
call rheap%insert(nextj,info)
|
||||
izcr(nextj) = 1
|
||||
end if
|
||||
end do
|
||||
if (debug) write(0,*) 'update loop, adding indices: ',&
|
||||
& a%ja(a%irp(kr):a%irp(kr+1)-1)
|
||||
|
||||
end if
|
||||
if (info /= psb_success_) exit
|
||||
end do
|
||||
if (info /= psb_success_) then
|
||||
info=psb_err_from_subroutine_
|
||||
call psb_errpush(info,name,a_err='psb_insert_heap')
|
||||
return
|
||||
end if
|
||||
end if
|
||||
end do outerw
|
||||
ip1 = ac%icp(i)
|
||||
ip2 = ac%icp(i+1) - 1
|
||||
do
|
||||
if (ip2 < ip1 ) exit
|
||||
if (ac%ia(ip2) <= n) exit
|
||||
ip2 = ip2 -1
|
||||
end do
|
||||
nzra = max(0,ip2 - ip1 + 1)
|
||||
q(i) = psb_spge_dot(nzra,ac%ia(ip1:ip2),ac%val(ip1:ip2),zval)
|
||||
if (abs(q(i)) < s_epstol) &
|
||||
& q(i) = 1.d-3
|
||||
|
||||
!!$ write(0,*) 'Dropping from a column with: ',i,psb_howmany_heap(heap),sp_thresh
|
||||
!
|
||||
! Sparsify current ZVAL and put into ZMAT
|
||||
!
|
||||
call sparsify(i,nzrmax,sp_thresh,n,zval,nzrz,ia,val,info,iheap=heap,ikr=izkr)
|
||||
if (info /= psb_success_) then
|
||||
info = psb_err_internal_error_
|
||||
call psb_errpush(info,name,a_err='sparsify')
|
||||
return
|
||||
end if
|
||||
call psb_ensure_size(nzw+nzrz, w%ia, info)
|
||||
call psb_ensure_size(nzw+nzrz, w%val, info)
|
||||
ipz1 = w%icp(i)
|
||||
do j=1, nzrz
|
||||
w%ia(ipz1 + j -1) = ia(j)
|
||||
w%val(ipz1 + j -1) = val(j)
|
||||
end do
|
||||
w%icp(i+1) = ipz1 + nzrz
|
||||
nzw = nzw + nzrz
|
||||
|
||||
end do
|
||||
|
||||
end subroutine psb_ssparse_biconjg_llk
|
||||
@ -0,0 +1,362 @@
|
||||
!
|
||||
!
|
||||
! 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_ssparse_biconjg_llk_noth(n,a,p,z,w,nzrmax,sp_thresh,info)
|
||||
use psb_base_mod
|
||||
use psb_ainv_tools_mod
|
||||
use psb_s_biconjg_mod, psb_protect_name => psb_ssparse_biconjg_llk_noth
|
||||
|
||||
!
|
||||
! Left-looking variant, with NO drop rule on p(i)/p(j)
|
||||
!
|
||||
!
|
||||
implicit none
|
||||
integer(psb_ipk_), intent(in) :: n
|
||||
type(psb_s_csr_sparse_mat), intent(in) :: a
|
||||
type(psb_s_csc_sparse_mat), intent(inout) :: z,w
|
||||
integer(psb_ipk_), intent(in) :: nzrmax
|
||||
real(psb_spk_), intent(in) :: sp_thresh
|
||||
real(psb_spk_), intent(out) :: p(:)
|
||||
integer(psb_ipk_), intent(out) :: info
|
||||
|
||||
! Locals
|
||||
integer(psb_ipk_), allocatable :: ia(:), ja(:), izkr(:), izcr(:)
|
||||
real(psb_spk_), 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
|
||||
type(psb_i_heap) :: heap, rheap
|
||||
type(psb_s_csc_sparse_mat) :: ac
|
||||
real(psb_dpk_) :: alpha
|
||||
character(len=20) :: name='psb_orth_llk_noth'
|
||||
logical, parameter :: debug=.false.
|
||||
|
||||
allocate(zval(n),ia(n),val(n),izkr(n),izcr(n),q(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) = szero
|
||||
end do
|
||||
|
||||
! Init z_1=e_1 and p_1=a_11
|
||||
p(1) = szero
|
||||
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)) < s_epstol) &
|
||||
& p(1) = 1.d-3
|
||||
|
||||
q(1) = p(1)
|
||||
!
|
||||
!
|
||||
call z%allocate(n,n,n*nzrmax)
|
||||
|
||||
z%icp(1) = 1
|
||||
z%icp(2) = 2
|
||||
z%ia(1) = 1
|
||||
z%val(1) = done
|
||||
nzz = 1
|
||||
|
||||
call w%allocate(n,n,n*nzrmax)
|
||||
w%icp(1) = 1
|
||||
w%icp(2) = 2
|
||||
w%ia(1) = 1
|
||||
w%val(1) = done
|
||||
nzw = 1
|
||||
|
||||
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) = szero
|
||||
! !$ end do
|
||||
zval(i) = done
|
||||
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 (.true.) then
|
||||
do k=z%icp(j), z%icp(j+1)-1
|
||||
kr = z%ia(k)
|
||||
zval(kr) = zval(kr) + alpha*z%val(k)
|
||||
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 j<k<i with nonzeros in column kr; we keep them in
|
||||
! a heap.
|
||||
!
|
||||
do kc = ac%icp(kr), ac%icp(kr+1)-1
|
||||
nextj=ac%ia(kc)
|
||||
if ((info == psb_success_).and.(izcr(nextj)==0)&
|
||||
& .and.(nextj>j).and.(nextj<i)) then
|
||||
call rheap%insert(nextj,info)
|
||||
izcr(nextj) = 1
|
||||
end if
|
||||
end do
|
||||
if (debug) write(0,*) 'update loop, adding indices: ',&
|
||||
& ac%ia(ac%icp(kr):ac%icp(kr+1)-1)
|
||||
|
||||
end if
|
||||
if (info /= psb_success_) exit
|
||||
end do
|
||||
if (info /= psb_success_) then
|
||||
info=psb_err_from_subroutine_
|
||||
call psb_errpush(info,name,a_err='psb_insert_heap')
|
||||
return
|
||||
end if
|
||||
end if
|
||||
end do outer
|
||||
call a%csget(i,i,nzra,ia,ja,val,info)
|
||||
call rwclip(nzra,ia,ja,val,ione,n,ione,n)
|
||||
p(i) = psb_spge_dot(nzra,ja,val,zval)
|
||||
if (abs(p(i)) < s_epstol) &
|
||||
& p(i) = 1.d-3
|
||||
|
||||
!!$ write(0,*) 'Dropping from a column with: ',i,psb_howmany_heap(heap),sp_thresh
|
||||
|
||||
!
|
||||
! Sparsify current ZVAL and put into ZMAT
|
||||
!
|
||||
call sparsify(i,nzrmax,sp_thresh,n,zval,nzrz,ia,val,info,iheap=heap,ikr=izkr)
|
||||
if (info /= psb_success_) then
|
||||
info = psb_err_internal_error_
|
||||
call psb_errpush(info,name,a_err='sparsify')
|
||||
return
|
||||
end if
|
||||
call psb_ensure_size(nzz+nzrz, z%ia, info)
|
||||
call psb_ensure_size(nzz+nzrz, z%val, info)
|
||||
ipz1 = z%icp(i)
|
||||
do j=1, nzrz
|
||||
z%ia(ipz1 + j -1) = ia(j)
|
||||
z%val(ipz1 + j -1) = val(j)
|
||||
end do
|
||||
z%icp(i+1) = ipz1 + nzrz
|
||||
nzz = nzz + nzrz
|
||||
|
||||
|
||||
! WVAL = e_i
|
||||
! !$ do j=1, i-1
|
||||
! !$ zval(j) = szero
|
||||
! !$ end do
|
||||
zval(i) = done
|
||||
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 = a%irp(i), a%irp(i+1)-1
|
||||
if (a%ja(j) < i) then
|
||||
if (info == psb_success_) call rheap%insert(a%ja(j),info)
|
||||
izcr(a%ja(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
|
||||
outerw: do
|
||||
innerw: do
|
||||
call rheap%get_first(j,info)
|
||||
if (debug) write(0,*) 'from get_first: ',j,info
|
||||
if (info == -1) exit outerw ! Empty heap
|
||||
if (j > lastj) then
|
||||
lastj = j
|
||||
exit innerw
|
||||
end if
|
||||
end do innerw
|
||||
izcr(j) = 0
|
||||
if (j>=i) cycle outerw
|
||||
if (debug) write(0,*) 'update loop, using row: ',j
|
||||
ip1 = ac%icp(j)
|
||||
ip2 = ac%icp(j+1) - 1
|
||||
do
|
||||
if (ip2 < ip1 ) exit
|
||||
if (ac%ia(ip2) <= n) exit
|
||||
ip2 = ip2 -1
|
||||
end do
|
||||
nzra = max(0,ip2 - ip1 + 1)
|
||||
q(i) = psb_spge_dot(nzra,ac%ia(ip1:ip2),ac%val(ip1:ip2),zval)
|
||||
! !$ write(psb_err_unit,*) j,i,p(i)
|
||||
|
||||
alpha = (-q(i)/q(j))
|
||||
if (.true.) then
|
||||
|
||||
do k=w%icp(j), w%icp(j+1)-1
|
||||
kr = w%ia(k)
|
||||
zval(kr) = zval(kr) + alpha*w%val(k)
|
||||
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 j<k<i with nonzeros in column kr; we keep them in
|
||||
! a heap.
|
||||
!
|
||||
do kc = a%irp(kr), a%irp(kr+1)-1
|
||||
nextj=a%ja(kc)
|
||||
if ((info == psb_success_).and.(izcr(nextj)==0)&
|
||||
& .and.(nextj>j).and.(nextj<i)) then
|
||||
call rheap%insert(nextj,info)
|
||||
izcr(nextj) = 1
|
||||
end if
|
||||
end do
|
||||
if (debug) write(0,*) 'update loop, adding indices: ',&
|
||||
& a%ja(a%irp(kr):a%irp(kr+1)-1)
|
||||
|
||||
end if
|
||||
if (info /= psb_success_) exit
|
||||
end do
|
||||
if (info /= psb_success_) then
|
||||
info=psb_err_from_subroutine_
|
||||
call psb_errpush(info,name,a_err='psb_insert_heap')
|
||||
return
|
||||
end if
|
||||
end if
|
||||
end do outerw
|
||||
ip1 = ac%icp(i)
|
||||
ip2 = ac%icp(i+1) - 1
|
||||
do
|
||||
if (ip2 < ip1 ) exit
|
||||
if (ac%ia(ip2) <= n) exit
|
||||
ip2 = ip2 -1
|
||||
end do
|
||||
nzra = max(0,ip2 - ip1 + 1)
|
||||
q(i) = psb_spge_dot(nzra,ac%ia(ip1:ip2),ac%val(ip1:ip2),zval)
|
||||
if (abs(q(i)) < s_epstol) &
|
||||
& q(i) = 1.d-3
|
||||
|
||||
!!$ write(0,*) 'Dropping from a column with: ',i,psb_howmany_heap(heap),sp_thresh
|
||||
!
|
||||
! Sparsify current ZVAL and put into ZMAT
|
||||
!
|
||||
call sparsify(i,nzrmax,sp_thresh,n,zval,nzrz,ia,val,info,iheap=heap,ikr=izkr)
|
||||
if (info /= psb_success_) then
|
||||
info = psb_err_internal_error_
|
||||
call psb_errpush(info,name,a_err='sparsify')
|
||||
return
|
||||
end if
|
||||
call psb_ensure_size(nzw+nzrz, w%ia, info)
|
||||
call psb_ensure_size(nzw+nzrz, w%val, info)
|
||||
ipz1 = w%icp(i)
|
||||
do j=1, nzrz
|
||||
w%ia(ipz1 + j -1) = ia(j)
|
||||
w%val(ipz1 + j -1) = val(j)
|
||||
end do
|
||||
w%icp(i+1) = ipz1 + nzrz
|
||||
nzw = nzw + nzrz
|
||||
|
||||
end do
|
||||
|
||||
end subroutine psb_ssparse_biconjg_llk_noth
|
||||
@ -0,0 +1,501 @@
|
||||
!
|
||||
!
|
||||
! 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_ssparse_biconjg_mlk(n,a,p,z,w,nzrmax,sp_thresh,info)
|
||||
use psb_base_mod
|
||||
use psb_ainv_tools_mod
|
||||
use psb_s_biconjg_mod, psb_protect_name => psb_ssparse_biconjg_mlk
|
||||
!
|
||||
! Left-looking variant
|
||||
!
|
||||
!
|
||||
implicit none
|
||||
integer(psb_ipk_), intent(in) :: n
|
||||
type(psb_s_csr_sparse_mat), intent(in) :: a
|
||||
type(psb_s_csc_sparse_mat), intent(inout) :: z,w
|
||||
integer(psb_ipk_), intent(in) :: nzrmax
|
||||
real(psb_spk_), intent(in) :: sp_thresh
|
||||
real(psb_spk_), intent(out) :: p(:)
|
||||
integer(psb_ipk_), intent(out) :: info
|
||||
|
||||
! Locals
|
||||
integer(psb_ipk_), allocatable :: ia(:), ja(:), izkr(:), izcr(:), hlist(:), bfr(:), rwlist(:)
|
||||
real(psb_spk_), 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, hlhead, li, mj, kkc, ifrst, ilst, rwhead
|
||||
type(psb_i_heap) :: heap, rheap
|
||||
type(psb_s_csc_sparse_mat) :: ac
|
||||
real(psb_spk_) :: alpha
|
||||
character(len=20) :: name='psb_biconjg_mlk'
|
||||
logical, parameter :: debug=.false., test_merge=.true.
|
||||
|
||||
allocate(zval(n),ia(n),val(n),izkr(n),izcr(n),q(n), &
|
||||
& hlist(n),rwlist(n),bfr(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) = szero
|
||||
hlist(i) = -1
|
||||
rwlist(i) = -1
|
||||
end do
|
||||
|
||||
! Init z_1=e_1 and p_1=a_11
|
||||
p(1) = szero
|
||||
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)) < s_epstol) &
|
||||
& p(1) = 1.d-3
|
||||
|
||||
q(1) = p(1)
|
||||
!
|
||||
!
|
||||
call z%allocate(n,n,n*nzrmax)
|
||||
|
||||
z%icp(1) = 1
|
||||
z%icp(2) = 2
|
||||
z%ia(1) = 1
|
||||
z%val(1) = sone
|
||||
nzz = 1
|
||||
|
||||
call w%allocate(n,n,n*nzrmax)
|
||||
w%icp(1) = 1
|
||||
w%icp(2) = 2
|
||||
w%ia(1) = 1
|
||||
w%val(1) = sone
|
||||
nzw = 1
|
||||
|
||||
|
||||
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) = szero
|
||||
! !$ end do
|
||||
zval(i) = sone
|
||||
izkr(i) = 1
|
||||
rwhead = i
|
||||
|
||||
hlhead = -1
|
||||
|
||||
kkc = 0
|
||||
ilst = ac%icp(i)-1
|
||||
ifrst = ac%icp(i)
|
||||
do j = ac%icp(i+1)-1, ac%icp(i), -1
|
||||
if (ac%ia(j) < i) then
|
||||
ilst = j
|
||||
exit
|
||||
end if
|
||||
end do
|
||||
kkc = ilst-ifrst+1
|
||||
|
||||
if (.true..or.debug) then
|
||||
!!$ write(0,*) 'Outer Before insertion : ',hlhead
|
||||
call printlist(hlhead,hlist)
|
||||
end if
|
||||
if (kkc > 0) then
|
||||
!!$ write(0,*) i,' Outer Inserting : ',kkc,':',ac%ia(ifrst:ilst)
|
||||
|
||||
!call hlmerge(hlhead,hlist,bfr(1:kkc))
|
||||
call hlmerge(hlhead,hlist,ac%ia(ifrst:ilst))
|
||||
end if
|
||||
if (debug) then
|
||||
write(0,*) 'Outer After insertion: ',hlhead
|
||||
call printlist(hlhead,hlist)
|
||||
end if
|
||||
|
||||
if (info /= psb_success_) then
|
||||
info=psb_err_from_subroutine_
|
||||
call psb_errpush(info,name,a_err='init_lists')
|
||||
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
|
||||
mj = hlhead
|
||||
if (mj > 0) then
|
||||
hlhead = hlist(mj)
|
||||
hlist(mj) = -1
|
||||
end if
|
||||
j = mj
|
||||
if (j < 0) exit outer
|
||||
|
||||
izcr(j) = 0
|
||||
if (j>=i) cycle outer
|
||||
|
||||
if (debug) write(0,*) 'update loop, using row: ',j,i,mj
|
||||
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))
|
||||
!!$ write(0,*) 'At step ',i,j,' p(i) ',p(i),alpha
|
||||
!!$ write(0,*) ' Current list is : ',hlhead
|
||||
!!$ call printlist(hlhead,hlist)
|
||||
!!$
|
||||
|
||||
|
||||
if (.false..or.(abs(alpha) > sp_thresh)) then
|
||||
ifrst=z%icp(j)
|
||||
ilst=z%icp(j+1)-1
|
||||
call hlmerge(rwhead,rwlist,z%ia(ifrst:ilst))
|
||||
!!$ write(0,*) 'At step ',i,j,' range ',z%icp(j), z%icp(j+1)-1, &
|
||||
!!$ & ' vals ',z%ia(z%icp(j):z%icp(j+1)-1)
|
||||
|
||||
do k=z%icp(j), z%icp(j+1)-1
|
||||
kr = z%ia(k)
|
||||
zval(kr) = zval(kr) + alpha*z%val(k)
|
||||
|
||||
if (izkr(kr) == 0) then
|
||||
!!$ write(0,*) ' main inner Inserting ',kr
|
||||
!!$ call hlmerge(rwhead,rwlist,(/kr/))
|
||||
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 j<k<i with nonzeros in column kr; we keep them in
|
||||
! a heap.
|
||||
!
|
||||
ilst = ac%icp(kr)-1
|
||||
ifrst = ac%icp(kr+1)
|
||||
kkc = 0
|
||||
do kc = ac%icp(kr), ac%icp(kr+1)-1
|
||||
if ((ac%ia(kc) < i).and.(ac%ia(kc) >j)) then
|
||||
ifrst = min(ifrst,kc )
|
||||
ilst = max(ilst,kc)
|
||||
end if
|
||||
end do
|
||||
kkc = ilst-ifrst+1
|
||||
if (debug) then
|
||||
write(0,*) 'Inner Before insertion: '
|
||||
call printlist(hlhead,hlist)
|
||||
write(0,*) 'Inner Inserting : ',kkc,':',ac%ia(ifrst:ilst)
|
||||
end if
|
||||
if (ilst >= ifrst) then
|
||||
!!$ write(0,*) j,i,' Inner inserting ',ac%ia(ifrst:ilst)
|
||||
call hlmerge(hlhead,hlist,ac%ia(ifrst:ilst))
|
||||
end if
|
||||
|
||||
if (debug) then
|
||||
write(0,*) 'Inner After insertion: ',hlhead
|
||||
call printlist(hlhead,hlist)
|
||||
end if
|
||||
|
||||
end if
|
||||
if (info /= psb_success_) exit
|
||||
end do
|
||||
if (info /= psb_success_) then
|
||||
info=psb_err_from_subroutine_
|
||||
call psb_errpush(info,name,a_err='psb_insert_heap')
|
||||
return
|
||||
end if
|
||||
end if
|
||||
end do outer
|
||||
call a%csget(i,i,nzra,ia,ja,val,info)
|
||||
call rwclip(nzra,ia,ja,val,ione,n,ione,n)
|
||||
p(i) = psb_spge_dot(nzra,ja,val,zval)
|
||||
if (abs(p(i)) < s_epstol) &
|
||||
& p(i) = 1.d-3
|
||||
|
||||
!!$ write(0,*) 'Dropping from a column with: ',i,psb_howmany_heap(heap),sp_thresh
|
||||
|
||||
!
|
||||
! Sparsify current ZVAL and put into ZMAT
|
||||
!
|
||||
call sparsify(i,nzrmax,sp_thresh,n,zval,nzrz,ia,val,rwhead,rwlist,izkr,info)
|
||||
|
||||
if (info /= psb_success_) then
|
||||
info = psb_err_internal_error_
|
||||
call psb_errpush(info,name,a_err='sparsify')
|
||||
return
|
||||
end if
|
||||
call psb_ensure_size(nzz+nzrz, z%ia, info)
|
||||
call psb_ensure_size(nzz+nzrz, z%val, info)
|
||||
ipz1 = z%icp(i)
|
||||
do j=1, nzrz
|
||||
z%ia(ipz1 + j -1) = ia(j)
|
||||
z%val(ipz1 + j -1) = val(j)
|
||||
end do
|
||||
z%icp(i+1) = ipz1 + nzrz
|
||||
nzz = nzz + nzrz
|
||||
|
||||
|
||||
! WVAL = e_i
|
||||
! !$ do j=1, i-1
|
||||
! !$ zval(j) = szero
|
||||
! !$ end do
|
||||
zval(i) = sone
|
||||
izkr(i) = 1
|
||||
rwhead = i
|
||||
hlhead = -1
|
||||
|
||||
kkc = 0
|
||||
ilst = a%irp(i)-1
|
||||
ifrst = a%irp(i)
|
||||
do j = a%irp(i+1)-1, a%irp(i), -1
|
||||
if (a%ja(j) < i) then
|
||||
ilst = j
|
||||
exit
|
||||
end if
|
||||
end do
|
||||
kkc = ilst-ifrst+1
|
||||
|
||||
if (debug) then
|
||||
write(0,*) 'Outer Before insertion: '
|
||||
call printlist(hlhead,hlist)
|
||||
write(0,*) 'Outer Inserting : ',kkc,':',a%ja(ifrst:ilst)
|
||||
end if
|
||||
if (kkc > 0 ) then
|
||||
!call hlmerge(hlhead,hlist,bfr(1:kkc))
|
||||
call hlmerge(hlhead,hlist,a%ja(ifrst:ilst))
|
||||
end if
|
||||
if (debug) then
|
||||
write(0,*) 'Outer After insertion: ',hlhead
|
||||
call printlist(hlhead,hlist)
|
||||
end if
|
||||
|
||||
if (info /= psb_success_) then
|
||||
info=psb_err_from_subroutine_
|
||||
call psb_errpush(info,name,a_err='init_lists')
|
||||
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
|
||||
outerw: do
|
||||
mj = hlhead
|
||||
if (hlhead > 0) then
|
||||
hlhead = hlist(mj)
|
||||
hlist(mj) = -1
|
||||
end if
|
||||
j = mj
|
||||
if (j < 0) exit outerw
|
||||
|
||||
izcr(j) = 0
|
||||
if (j>=i) cycle outerw
|
||||
if (debug) write(0,*) 'update loop, using row: ',j
|
||||
ip1 = ac%icp(j)
|
||||
ip2 = ac%icp(j+1) - 1
|
||||
do
|
||||
if (ip2 < ip1 ) exit
|
||||
if (ac%ia(ip2) <= n) exit
|
||||
ip2 = ip2 -1
|
||||
end do
|
||||
nzra = max(0,ip2 - ip1 + 1)
|
||||
q(i) = psb_spge_dot(nzra,ac%ia(ip1:ip2),ac%val(ip1:ip2),zval)
|
||||
! !$ write(psb_err_unit,*) j,i,p(i)
|
||||
|
||||
alpha = (-q(i)/q(j))
|
||||
if (.false..or.(abs(alpha) > sp_thresh)) then
|
||||
ifrst=w%icp(j)
|
||||
ilst=w%icp(j+1)-1
|
||||
call hlmerge(rwhead,rwlist,w%ia(ifrst:ilst))
|
||||
|
||||
do k=w%icp(j), w%icp(j+1)-1
|
||||
kr = w%ia(k)
|
||||
zval(kr) = zval(kr) + alpha*w%val(k)
|
||||
if (izkr(kr) == 0) then
|
||||
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 j<k<i with nonzeros in column kr; we keep them in
|
||||
! a heap.
|
||||
!
|
||||
ilst = a%irp(kr)-1
|
||||
ifrst = a%irp(kr+1)
|
||||
kkc = 0
|
||||
do kc = a%irp(kr), a%irp(kr+1)-1
|
||||
if ((a%ja(kc) < i).and.(a%ja(kc) >j)) then
|
||||
ifrst = min(ifrst,kc )
|
||||
ilst = max(ilst,kc)
|
||||
end if
|
||||
end do
|
||||
kkc = ilst-ifrst+1
|
||||
if (debug) then
|
||||
write(0,*) 'Inner Before insertion: '
|
||||
call printlist(hlhead,hlist)
|
||||
write(0,*) 'Inner Inserting : ',kkc,':',a%ja(ifrst:ilst)
|
||||
end if
|
||||
|
||||
call hlmerge(hlhead,hlist,a%ja(ifrst:ilst))
|
||||
|
||||
if (debug) then
|
||||
write(0,*) 'Inner After insertion: ',hlhead
|
||||
call printlist(hlhead,hlist)
|
||||
end if
|
||||
if (debug) write(0,*) 'update loop, adding indices: ',&
|
||||
& a%ja(a%irp(kr):a%irp(kr+1)-1)
|
||||
|
||||
end if
|
||||
if (info /= psb_success_) exit
|
||||
end do
|
||||
if (info /= psb_success_) then
|
||||
info=psb_err_from_subroutine_
|
||||
call psb_errpush(info,name,a_err='psb_insert_heap')
|
||||
return
|
||||
end if
|
||||
end if
|
||||
end do outerw
|
||||
ip1 = ac%icp(i)
|
||||
ip2 = ac%icp(i+1) - 1
|
||||
do
|
||||
if (ip2 < ip1 ) exit
|
||||
if (ac%ia(ip2) <= n) exit
|
||||
ip2 = ip2 -1
|
||||
end do
|
||||
nzra = max(0,ip2 - ip1 + 1)
|
||||
q(i) = psb_spge_dot(nzra,ac%ia(ip1:ip2),ac%val(ip1:ip2),zval)
|
||||
if (abs(q(i)) < s_epstol) &
|
||||
& q(i) = 1.d-3
|
||||
|
||||
!!$ write(0,*) 'Dropping from a column with: ',i,psb_howmany_heap(heap),sp_thresh
|
||||
!
|
||||
! Sparsify current ZVAL and put into ZMAT
|
||||
!
|
||||
call sparsify(i,nzrmax,sp_thresh,n,zval,nzrz,ia,val,rwhead,rwlist,izkr,info)
|
||||
if (info /= psb_success_) then
|
||||
info = psb_err_internal_error_
|
||||
call psb_errpush(info,name,a_err='sparsify')
|
||||
return
|
||||
end if
|
||||
call psb_ensure_size(nzw+nzrz, w%ia, info)
|
||||
call psb_ensure_size(nzw+nzrz, w%val, info)
|
||||
ipz1 = w%icp(i)
|
||||
do j=1, nzrz
|
||||
w%ia(ipz1 + j -1) = ia(j)
|
||||
w%val(ipz1 + j -1) = val(j)
|
||||
end do
|
||||
w%icp(i+1) = ipz1 + nzrz
|
||||
nzw = nzw + nzrz
|
||||
|
||||
end do
|
||||
|
||||
contains
|
||||
|
||||
subroutine hlmerge(head,listv,vals)
|
||||
integer(psb_ipk_), intent(inout) :: head, listv(:)
|
||||
integer(psb_ipk_), intent(in) :: vals(:)
|
||||
integer(psb_ipk_) :: i,j,k, lh, lv, nv, vv, flh, ph
|
||||
|
||||
nv = size(vals)
|
||||
lh = head
|
||||
flh = -1
|
||||
lv = 1
|
||||
if ((head < 0).and.(nv > 0)) then
|
||||
! Adjust head if empty
|
||||
head = vals(lv)
|
||||
lv = lv + 1
|
||||
else if ((head > 0) .and. (nv >0)) then
|
||||
! Adjust head if first item less than it
|
||||
if (head > vals(lv)) then
|
||||
listv(vals(lv)) = head
|
||||
head = vals(lv)
|
||||
lv = lv + 1
|
||||
end if
|
||||
end if
|
||||
|
||||
lh = head
|
||||
ph = lh
|
||||
do while ((lh > 0) .and. (lv <= nv))
|
||||
if (lh == vals(lv)) then
|
||||
lv = lv + 1
|
||||
else if (lh > vals(lv)) then
|
||||
listv(vals(lv)) = lh
|
||||
listv(ph) = vals(lv)
|
||||
lh = vals(lv)
|
||||
lv = lv + 1
|
||||
else
|
||||
ph = lh
|
||||
lh = listv(lh)
|
||||
end if
|
||||
end do
|
||||
lh = ph
|
||||
do while (lv <= nv)
|
||||
listv(lh) = vals(lv)
|
||||
lh = listv(lh)
|
||||
lv = lv + 1
|
||||
end do
|
||||
end subroutine hlmerge
|
||||
|
||||
|
||||
subroutine printlist(head,listv)
|
||||
integer(psb_ipk_), intent(in) :: head, listv(:)
|
||||
integer(psb_ipk_) :: li
|
||||
|
||||
li = head
|
||||
do while (li > 0)
|
||||
write(0,*) 'Item: ', li
|
||||
li = listv(li)
|
||||
end do
|
||||
end subroutine printlist
|
||||
|
||||
end subroutine psb_ssparse_biconjg_mlk
|
||||
@ -0,0 +1,414 @@
|
||||
!
|
||||
!
|
||||
! 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_ssparse_biconjg_s_ft_llk(n,a,p,z,w,nzrmax,sp_thresh,info)
|
||||
use psb_base_mod
|
||||
use psb_ainv_tools_mod
|
||||
use psb_s_biconjg_mod, psb_protect_name => psb_ssparse_biconjg_s_ft_llk
|
||||
|
||||
!
|
||||
! Left-looking variant, stabilized i.e. product by A is applied
|
||||
! to compute the diagonal elements.
|
||||
!
|
||||
!
|
||||
implicit none
|
||||
integer(psb_ipk_), intent(in) :: n
|
||||
type(psb_s_csr_sparse_mat), intent(in) :: a
|
||||
type(psb_s_csc_sparse_mat), intent(inout) :: z,w
|
||||
integer(psb_ipk_), intent(in) :: nzrmax
|
||||
real(psb_spk_), intent(in) :: sp_thresh
|
||||
real(psb_spk_), intent(out) :: p(:)
|
||||
integer(psb_ipk_), intent(out) :: info
|
||||
|
||||
! Locals
|
||||
integer(psb_ipk_), allocatable :: ia(:), ja(:), izkr(:), izcr(:),iww(:)
|
||||
real(psb_spk_), allocatable :: zval(:),val(:), q(:), ww(:)
|
||||
integer(psb_ipk_) :: i,j,k, kc, kr, err_act, nz, nzra, nzrz, ipzi,ipzj, nzww,&
|
||||
& nzzi,nzzj, nzz, ip1, ip2, ipza,ipzz, ipzn, nzzn, ipz1, ipz2,&
|
||||
& ipj, lastj, nextj, nzw, nzrw
|
||||
type(psb_i_heap) :: heap, rheap
|
||||
type(psb_s_csc_sparse_mat) :: ac
|
||||
real(psb_spk_) :: alpha, tmpq,tmpq2
|
||||
character(len=20) :: name='psb_orth_llk'
|
||||
logical, parameter :: debug=.false.
|
||||
|
||||
allocate(zval(n),ia(n),val(n),izkr(n),izcr(n),q(n),iww(n),ww(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
|
||||
!
|
||||
! Init pointers to:
|
||||
! ljr(i): last occupied column index within row I
|
||||
! izcr(i): first occupied row index within column I
|
||||
!
|
||||
do i=1,n
|
||||
izkr(i) = 0
|
||||
izcr(i) = 0
|
||||
zval(i) = szero
|
||||
end do
|
||||
|
||||
! Init z_1=e_1 and p_1=a_11
|
||||
p(1) = szero
|
||||
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)) < s_epstol) &
|
||||
& p(1) = 1.d-3
|
||||
|
||||
q(1) = p(1)
|
||||
!
|
||||
!
|
||||
call z%allocate(n,n,n*nzrmax)
|
||||
|
||||
z%icp(1) = 1
|
||||
z%icp(2) = 2
|
||||
z%ia(1) = 1
|
||||
z%val(1) = sone
|
||||
nzz = 1
|
||||
|
||||
call w%allocate(n,n,n*nzrmax)
|
||||
w%icp(1) = 1
|
||||
w%icp(2) = 2
|
||||
w%ia(1) = 1
|
||||
w%val(1) = sone
|
||||
nzw = 1
|
||||
|
||||
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) = szero
|
||||
! !$ end do
|
||||
zval(i) = sone
|
||||
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) exit outer
|
||||
if (debug) write(0,*) 'update loop, using row: ',j
|
||||
ip1 = w%icp(j)
|
||||
ip2 = w%icp(j+1) - 1
|
||||
nzra = max(0,ip2 - ip1 + 1)
|
||||
nzww = 0
|
||||
call psb_d_spvspm(sone,a,nzra,w%ia(ip1:ip2),w%val(ip1:ip2),&
|
||||
& szero,nzww,iww,ww,info)
|
||||
|
||||
p(i) = psb_spge_dot(nzww,iww,ww,zval)
|
||||
|
||||
ipz1 = z%icp(j)
|
||||
ipz2 = z%icp(j+1)
|
||||
nzrz = ipz2-ipz1
|
||||
alpha = (-p(i)/p(j))
|
||||
!!$ write(0,*) ' p(i)/p(j) ',i,j,alpha,p(i),p(j)
|
||||
if (.false..or.(abs(alpha) > sp_thresh)) then
|
||||
|
||||
do k=ipz1, ipz2-1
|
||||
kr = z%ia(k)
|
||||
zval(kr) = zval(kr) + alpha*z%val(k)
|
||||
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 j<k<i with nonzeros in column kr; we keep them in
|
||||
! a heap.
|
||||
!
|
||||
do kc = ac%icp(kr), ac%icp(kr+1)-1
|
||||
nextj=ac%ia(kc)
|
||||
if ((info == psb_success_).and.(izcr(nextj)==0)&
|
||||
& .and.(nextj>j).and.(nextj<i)) then
|
||||
call rheap%insert(nextj,info)
|
||||
izcr(nextj) = 1
|
||||
end if
|
||||
end do
|
||||
if (debug) write(0,*) 'update loop, adding indices: ',&
|
||||
& ac%ia(ac%icp(kr):ac%icp(kr+1)-1)
|
||||
|
||||
end if
|
||||
if (info /= psb_success_) exit
|
||||
end do
|
||||
if (info /= psb_success_) then
|
||||
info=psb_err_from_subroutine_
|
||||
call psb_errpush(info,name,a_err='psb_insert_heap')
|
||||
return
|
||||
end if
|
||||
end if
|
||||
!!$ izcr(j) = 0
|
||||
end do outer
|
||||
|
||||
if (.false.) then
|
||||
! We can't do the proper thing until we have bot Z_i and W_i.
|
||||
call a%csget(i,i,nzra,ia,ja,val,info)
|
||||
call rwclip(nzra,ia,ja,val,ione,n,ione,n)
|
||||
p(i) = psb_spge_dot(nzra,ja,val,zval)
|
||||
if (abs(p(i)) < s_epstol) &
|
||||
& p(i) = 1.d-3
|
||||
end if
|
||||
|
||||
!
|
||||
! Sparsify current ZVAL and put into ZMAT
|
||||
!
|
||||
call sparsify(i,nzrmax,sp_thresh,n,zval,nzrz,ia,val,info,iheap=heap,ikr=izkr)
|
||||
if (info /= psb_success_) then
|
||||
info = psb_err_internal_error_
|
||||
call psb_errpush(info,name,a_err='sparsify')
|
||||
return
|
||||
end if
|
||||
call psb_ensure_size(nzz+nzrz, z%ia, info)
|
||||
call psb_ensure_size(nzz+nzrz, z%val, info)
|
||||
ipz1 = z%icp(i)
|
||||
do j=1, nzrz
|
||||
z%ia(ipz1 + j -1) = ia(j)
|
||||
z%val(ipz1 + j -1) = val(j)
|
||||
end do
|
||||
z%icp(i+1) = ipz1 + nzrz
|
||||
nzz = nzz + nzrz
|
||||
|
||||
|
||||
|
||||
|
||||
! WVAL = e_i
|
||||
! !$ do j=1, i-1
|
||||
! !$ zval(j) = szero
|
||||
! !$ end do
|
||||
zval(i) = sone
|
||||
izkr(i) = 1
|
||||
call heap%init(info)
|
||||
if (info == psb_success_) call heap%insert(i,info)
|
||||
!!$ write(0,*) 'Inserting into heap ',i
|
||||
if (info == psb_success_) call rheap%init(info)
|
||||
do j = a%irp(i), a%irp(i+1)-1
|
||||
if (a%ja(j)<i) then
|
||||
if (info == psb_success_) call rheap%insert(a%ja(j),info)
|
||||
izcr(a%ja(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
|
||||
outerw: do
|
||||
innerw: do
|
||||
call rheap%get_first(j,info)
|
||||
if (debug) write(0,*) 'from get_first: ',j,info
|
||||
if (info == -1) exit outerw ! Empty heap
|
||||
if (j > lastj) then
|
||||
lastj = j
|
||||
exit innerw
|
||||
end if
|
||||
end do innerw
|
||||
izcr(j) = 0
|
||||
if (j>=i) exit outerw
|
||||
if (debug) write(0,*) 'update loop, using row: ',j
|
||||
if (.false.) then
|
||||
ip1 = ac%icp(j)
|
||||
ip2 = ac%icp(j+1) - 1
|
||||
do
|
||||
if (ip2 < ip1 ) exit
|
||||
if (ac%ia(ip2) <= n) exit
|
||||
ip2 = ip2 -1
|
||||
end do
|
||||
nzra = max(0,ip2 - ip1 + 1)
|
||||
q(i) = psb_spge_dot(nzra,ac%ia(ip1:ip2),ac%val(ip1:ip2),zval)
|
||||
! !$ write(psb_err_unit,*) j,i,p(i)
|
||||
else
|
||||
ip1 = z%icp(j)
|
||||
ip2 = z%icp(j+1) - 1
|
||||
nzra = max(0,ip2 - ip1 + 1)
|
||||
nzww = 0
|
||||
call psb_d_spmspv(sone,ac,nzra,z%ia(ip1:ip2),z%val(ip1:ip2),&
|
||||
& szero,nzww,iww,ww,info)
|
||||
|
||||
q(i) = psb_spge_dot(nzww,iww,ww,zval)
|
||||
end if
|
||||
|
||||
ipz1 = w%icp(j)
|
||||
ipz2 = w%icp(j+1)
|
||||
nzrz = ipz2-ipz1
|
||||
alpha = (-q(i)/q(j))
|
||||
!!$ write(0,*) ' q(i)/q(j) ',i,j,alpha,q(i),q(j)
|
||||
if (.false..or.(abs(alpha) > sp_thresh)) then
|
||||
|
||||
do k=ipz1, ipz2-1
|
||||
kr = w%ia(k)
|
||||
zval(kr) = zval(kr) + alpha*w%val(k)
|
||||
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 j<k<i with nonzeros in column kr; we keep them in
|
||||
! a heap.
|
||||
!
|
||||
do kc = a%irp(kr), a%irp(kr+1)-1
|
||||
nextj=a%ja(kc)
|
||||
if ((info == psb_success_).and.(izcr(nextj)==0)&
|
||||
& .and.(nextj>j).and.(nextj<i)) then
|
||||
call rheap%insert(nextj,info)
|
||||
izcr(nextj) = 1
|
||||
end if
|
||||
end do
|
||||
if (debug) write(0,*) 'update loop, adding indices: ',&
|
||||
& a%ja(a%irp(kr):a%irp(kr+1)-1)
|
||||
|
||||
end if
|
||||
if (info /= psb_success_) exit
|
||||
end do
|
||||
if (info /= psb_success_) then
|
||||
info=psb_err_from_subroutine_
|
||||
call psb_errpush(info,name,a_err='psb_insert_heap')
|
||||
return
|
||||
end if
|
||||
end if
|
||||
!!$ izcr(j) = 0
|
||||
end do outerw
|
||||
|
||||
!!$ ip1 = ac%icp(i)
|
||||
!!$ ip2 = ac%icp(i+1) - 1
|
||||
!!$ do
|
||||
!!$ if (ip2 < ip1 ) exit
|
||||
!!$ if (ac%ia(ip2) <= n) exit
|
||||
!!$ ip2 = ip2 -1
|
||||
!!$ end do
|
||||
!!$ nzra = max(0,ip2 - ip1 + 1)
|
||||
!!$
|
||||
!!$ q(i) = psb_spge_dot(nzra,ac%ia(ip1:ip2),ac%val(ip1:ip2),zval)
|
||||
!!$ if (abs(q(i)) < s_epstol) &
|
||||
!!$ & q(i) = 1.d-3
|
||||
!
|
||||
! Sparsify current ZVAL and put into ZMAT
|
||||
!
|
||||
call sparsify(i,nzrmax,sp_thresh,n,zval,nzrw,ia,val,info,iheap=heap,ikr=izkr)
|
||||
if (info /= psb_success_) then
|
||||
info = psb_err_internal_error_
|
||||
call psb_errpush(info,name,a_err='sparsify')
|
||||
return
|
||||
end if
|
||||
call psb_ensure_size(nzw+nzrw, w%ia, info)
|
||||
call psb_ensure_size(nzw+nzrw, w%val, info)
|
||||
ipz1 = w%icp(i)
|
||||
do j=1, nzrw
|
||||
w%ia(ipz1 + j -1) = ia(j)
|
||||
w%val(ipz1 + j -1) = val(j)
|
||||
end do
|
||||
w%icp(i+1) = ipz1 + nzrw
|
||||
nzw = nzw + nzrw
|
||||
|
||||
!!$ !
|
||||
!!$ ! Ok, now compute w_i^T A z_i
|
||||
!!$ !
|
||||
nzww = 0
|
||||
nzrz = z%icp(i+1)-z%icp(i)
|
||||
ipz1 = z%icp(i)
|
||||
call psb_d_spmspv(sone,ac,&
|
||||
& nzrz,z%ia(ipz1:ipz1+nzrz-1),z%val(ipz1:ipz1+nzrz-1),&
|
||||
& szero,nzww,iww,ww,info)
|
||||
tmpq = psb_spdot_srtd(nzww,iww,ww,nzrw,ia,val)
|
||||
q(i) = tmpq
|
||||
! if (tmpq <0) then
|
||||
!!$ write(0,*) 'On negative dot prod at ',i
|
||||
!!$ write(0,*) 'On negative dot prod a ',ia(1:nzrw),val(1:nzrw)
|
||||
!!$ write(0,*) 'On negative dot prod w ',iww(1:nzww),ww(1:nzww)
|
||||
!!$ ip1 = ac%icp(i)
|
||||
!!$ ip2 = ac%icp(i+1) - 1
|
||||
!!$ do
|
||||
!!$ if (ip2 < ip1 ) exit
|
||||
!!$ if (ac%ia(ip2) <= n) exit
|
||||
!!$ ip2 = ip2 -1
|
||||
!!$ end do
|
||||
!!$ nzra = max(0,ip2 - ip1 + 1)
|
||||
!!$ write(0,*) 'On negative dot prod a ',ac%ia(ip1:ip2),ac%val(ip1:ip2)
|
||||
!
|
||||
! end if
|
||||
|
||||
if (abs(q(i)) < s_epstol) &
|
||||
& q(i) = 1.d-3
|
||||
p(i) = q(i)
|
||||
|
||||
end do
|
||||
|
||||
end subroutine psb_ssparse_biconjg_s_ft_llk
|
||||
@ -0,0 +1,248 @@
|
||||
!
|
||||
!
|
||||
! 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_ssparse_biconjg_s_llk(n,a,p,z,w,nzrmax,sp_thresh,info)
|
||||
use psb_base_mod
|
||||
use psb_ainv_tools_mod
|
||||
use psb_s_biconjg_mod, psb_protect_name => psb_ssparse_biconjg_s_llk
|
||||
|
||||
!
|
||||
! Left-looking variant SYMMETRIC/HERMITIAN A. You have been warned!
|
||||
!
|
||||
!
|
||||
implicit none
|
||||
integer(psb_ipk_), intent(in) :: n
|
||||
type(psb_s_csr_sparse_mat), intent(in) :: a
|
||||
type(psb_s_csc_sparse_mat), intent(inout) :: z,w
|
||||
integer(psb_ipk_), intent(in) :: nzrmax
|
||||
real(psb_spk_), intent(in) :: sp_thresh
|
||||
real(psb_spk_), intent(out) :: p(:)
|
||||
integer(psb_ipk_), intent(out) :: info
|
||||
|
||||
! Locals
|
||||
integer(psb_ipk_), allocatable :: ia(:), ja(:), izkr(:), izcr(:)
|
||||
real(psb_spk_), 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_s_csc_sparse_mat) :: ac
|
||||
real(psb_spk_) :: 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) = szero
|
||||
end do
|
||||
|
||||
! Init z_1=e_1 and p_1=a_11
|
||||
p(1) = szero
|
||||
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)) < s_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) = sone
|
||||
nzz = 1
|
||||
zvalmax = sone
|
||||
|
||||
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) = szero
|
||||
! !$ end do
|
||||
zval(i) = sone
|
||||
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 j<k<i with nonzeros in column kr; we keep them in
|
||||
! a heap.
|
||||
!
|
||||
do kc = ac%icp(kr), ac%icp(kr+1)-1
|
||||
nextj=ac%ia(kc)
|
||||
if ((info == psb_success_).and.(izcr(nextj)==0)&
|
||||
& .and.(nextj>j).and.(nextj<i)) then
|
||||
call rheap%insert(nextj,info)
|
||||
izcr(nextj) = 1
|
||||
end if
|
||||
end do
|
||||
if (debug) write(0,*) 'update loop, adding indices: ',&
|
||||
& ac%ia(ac%icp(kr):ac%icp(kr+1)-1)
|
||||
|
||||
end if
|
||||
if (info /= psb_success_) exit
|
||||
end do
|
||||
if (info /= psb_success_) then
|
||||
info=psb_err_from_subroutine_
|
||||
call psb_errpush(info,name,a_err='psb_insert_heap')
|
||||
return
|
||||
end if
|
||||
end if
|
||||
end do outer
|
||||
call a%csget(i,i,nzra,ia,ja,val,info)
|
||||
call rwclip(nzra,ia,ja,val,ione,n,ione,n)
|
||||
p(i) = psb_spge_dot(nzra,ja,val,zval)
|
||||
!!$ if ((1761<=i).and.(i<=1780)) then
|
||||
!!$ write(0,*) 'Dot product terms at ',i,nzra
|
||||
!!$ do kk=1,nzra
|
||||
!!$ write(0,*) kk,ja(kk),val(kk),zval(ja(kk))
|
||||
!!$ end do
|
||||
!!$ end if
|
||||
|
||||
if (abs(p(i)) < s_epstol) &
|
||||
& p(i) = 1.d-3
|
||||
|
||||
! !$ write(0,*) 'Dropping from a column with: ',i,psb_howmany_heap(heap),sp_thresh
|
||||
|
||||
!
|
||||
! Sparsify current ZVAL and put into ZMAT
|
||||
!
|
||||
call sparsify(i,nzrmax,sp_thresh,n,zval,nzrz,ia,val,info,iheap=heap,ikr=izkr)
|
||||
if (info /= psb_success_) then
|
||||
info = psb_err_internal_error_
|
||||
call psb_errpush(info,name,a_err='sparsify')
|
||||
return
|
||||
end if
|
||||
call psb_ensure_size(nzz+nzrz, z%ia, info)
|
||||
call psb_ensure_size(nzz+nzrz, z%val, info)
|
||||
ipz1 = z%icp(i)
|
||||
do j=1, nzrz
|
||||
z%ia(ipz1 + j -1) = ia(j)
|
||||
z%val(ipz1 + j -1) = val(j)
|
||||
!!$ zvalmax = max(zvalmax,abs(val(j)))
|
||||
end do
|
||||
z%icp(i+1) = ipz1 + nzrz
|
||||
nzz = nzz + nzrz
|
||||
!!$ write(0,*) ' Dot: ',i,p(i),zvalmax
|
||||
|
||||
end do
|
||||
|
||||
call z%cp_to_fmt(w,info)
|
||||
|
||||
end subroutine psb_ssparse_biconjg_s_llk
|
||||
@ -0,0 +1,366 @@
|
||||
!
|
||||
!
|
||||
! 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_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_llk
|
||||
!
|
||||
! Left-looking variant
|
||||
!
|
||||
!
|
||||
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
|
||||
type(psb_i_heap) :: heap, rheap
|
||||
type(psb_z_csc_sparse_mat) :: ac
|
||||
complex(psb_dpk_) :: alpha
|
||||
character(len=20) :: name='psb_orth_llk'
|
||||
logical, parameter :: debug=.false.
|
||||
|
||||
allocate(zval(n),ia(n),val(n),izkr(n),izcr(n),q(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
|
||||
|
||||
q(1) = p(1)
|
||||
!
|
||||
!
|
||||
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
|
||||
|
||||
call w%allocate(n,n,n*nzrmax)
|
||||
w%icp(1) = 1
|
||||
w%icp(2) = 2
|
||||
w%ia(1) = 1
|
||||
w%val(1) = zone
|
||||
nzw = 1
|
||||
|
||||
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
|
||||
!!$ write(0,*) i, ' Outer inserting ',ac%ia(j)
|
||||
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))
|
||||
!!$ write(0,*) 'At step ',i,j,' p(i) ',p(i),alpha
|
||||
if (.false..or.(abs(alpha) > sp_thresh)) then
|
||||
!!$ write(0,*) 'At step ',i,j,' range ',z%icp(j), z%icp(j+1)-1, &
|
||||
!!$ & ' vals ',z%ia(z%icp(j):z%icp(j+1)-1)
|
||||
do k=z%icp(j), z%icp(j+1)-1
|
||||
kr = z%ia(k)
|
||||
zval(kr) = zval(kr) + alpha*z%val(k)
|
||||
if (izkr(kr) == 0) then
|
||||
!!$ write(0,*) ' main inner Inserting ',kr
|
||||
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 j<k<i with nonzeros in column kr; we keep them in
|
||||
! a heap.
|
||||
!
|
||||
do kc = ac%icp(kr), ac%icp(kr+1)-1
|
||||
nextj=ac%ia(kc)
|
||||
if ((info == psb_success_).and.(izcr(nextj)==0)&
|
||||
& .and.(nextj>j).and.(nextj<i)) then
|
||||
!!$ write(0,*) j,i,' Inner inserting ',nextj
|
||||
call rheap%insert(nextj,info)
|
||||
izcr(nextj) = 1
|
||||
end if
|
||||
end do
|
||||
if (debug) write(0,*) 'update loop, adding indices: ',&
|
||||
& ac%ia(ac%icp(kr):ac%icp(kr+1)-1)
|
||||
|
||||
end if
|
||||
if (info /= psb_success_) exit
|
||||
end do
|
||||
if (info /= psb_success_) then
|
||||
info=psb_err_from_subroutine_
|
||||
call psb_errpush(info,name,a_err='psb_insert_heap')
|
||||
return
|
||||
end if
|
||||
end if
|
||||
end do outer
|
||||
call a%csget(i,i,nzra,ia,ja,val,info)
|
||||
call rwclip(nzra,ia,ja,val,ione,n,ione,n)
|
||||
p(i) = psb_spge_dot(nzra,ja,val,zval)
|
||||
if (abs(p(i)) < d_epstol) &
|
||||
& p(i) = 1.d-3
|
||||
|
||||
!!$ write(0,*) 'Dropping from a column with: ',i,psb_howmany_heap(heap),sp_thresh
|
||||
|
||||
!
|
||||
! Sparsify current ZVAL and put into ZMAT
|
||||
!
|
||||
call sparsify(i,nzrmax,sp_thresh,n,zval,nzrz,ia,val,info,iheap=heap,ikr=izkr)
|
||||
if (info /= psb_success_) then
|
||||
info = psb_err_internal_error_
|
||||
call psb_errpush(info,name,a_err='sparsify')
|
||||
return
|
||||
end if
|
||||
call psb_ensure_size(nzz+nzrz, z%ia, info)
|
||||
call psb_ensure_size(nzz+nzrz, z%val, info)
|
||||
ipz1 = z%icp(i)
|
||||
do j=1, nzrz
|
||||
z%ia(ipz1 + j -1) = ia(j)
|
||||
z%val(ipz1 + j -1) = val(j)
|
||||
end do
|
||||
z%icp(i+1) = ipz1 + nzrz
|
||||
nzz = nzz + nzrz
|
||||
|
||||
|
||||
! WVAL = 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 = a%irp(i), a%irp(i+1)-1
|
||||
if (a%ja(j) < i) then
|
||||
if (info == psb_success_) call rheap%insert(a%ja(j),info)
|
||||
izcr(a%ja(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
|
||||
outerw: do
|
||||
innerw: do
|
||||
call rheap%get_first(j,info)
|
||||
if (debug) write(0,*) 'from get_first: ',j,info
|
||||
if (info == -1) exit outerw ! Empty heap
|
||||
if (j > lastj) then
|
||||
lastj = j
|
||||
exit innerw
|
||||
end if
|
||||
end do innerw
|
||||
izcr(j) = 0
|
||||
if (j>=i) cycle outerw
|
||||
if (debug) write(0,*) 'update loop, using row: ',j
|
||||
ip1 = ac%icp(j)
|
||||
ip2 = ac%icp(j+1) - 1
|
||||
do
|
||||
if (ip2 < ip1 ) exit
|
||||
if (ac%ia(ip2) <= n) exit
|
||||
ip2 = ip2 -1
|
||||
end do
|
||||
nzra = max(0,ip2 - ip1 + 1)
|
||||
q(i) = psb_spge_dot(nzra,ac%ia(ip1:ip2),ac%val(ip1:ip2),zval)
|
||||
! !$ write(psb_err_unit,*) j,i,p(i)
|
||||
|
||||
alpha = (-q(i)/q(j))
|
||||
if (.false..or.(abs(alpha) > sp_thresh)) then
|
||||
|
||||
do k=w%icp(j), w%icp(j+1)-1
|
||||
kr = w%ia(k)
|
||||
zval(kr) = zval(kr) + alpha*w%val(k)
|
||||
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 j<k<i with nonzeros in column kr; we keep them in
|
||||
! a heap.
|
||||
!
|
||||
do kc = a%irp(kr), a%irp(kr+1)-1
|
||||
nextj=a%ja(kc)
|
||||
if ((info == psb_success_).and.(izcr(nextj)==0)&
|
||||
& .and.(nextj>j).and.(nextj<i)) then
|
||||
call rheap%insert(nextj,info)
|
||||
izcr(nextj) = 1
|
||||
end if
|
||||
end do
|
||||
if (debug) write(0,*) 'update loop, adding indices: ',&
|
||||
& a%ja(a%irp(kr):a%irp(kr+1)-1)
|
||||
|
||||
end if
|
||||
if (info /= psb_success_) exit
|
||||
end do
|
||||
if (info /= psb_success_) then
|
||||
info=psb_err_from_subroutine_
|
||||
call psb_errpush(info,name,a_err='psb_insert_heap')
|
||||
return
|
||||
end if
|
||||
end if
|
||||
end do outerw
|
||||
ip1 = ac%icp(i)
|
||||
ip2 = ac%icp(i+1) - 1
|
||||
do
|
||||
if (ip2 < ip1 ) exit
|
||||
if (ac%ia(ip2) <= n) exit
|
||||
ip2 = ip2 -1
|
||||
end do
|
||||
nzra = max(0,ip2 - ip1 + 1)
|
||||
q(i) = psb_spge_dot(nzra,ac%ia(ip1:ip2),ac%val(ip1:ip2),zval)
|
||||
if (abs(q(i)) < d_epstol) &
|
||||
& q(i) = 1.d-3
|
||||
|
||||
!!$ write(0,*) 'Dropping from a column with: ',i,psb_howmany_heap(heap),sp_thresh
|
||||
!
|
||||
! Sparsify current ZVAL and put into ZMAT
|
||||
!
|
||||
call sparsify(i,nzrmax,sp_thresh,n,zval,nzrz,ia,val,info,iheap=heap,ikr=izkr)
|
||||
if (info /= psb_success_) then
|
||||
info = psb_err_internal_error_
|
||||
call psb_errpush(info,name,a_err='sparsify')
|
||||
return
|
||||
end if
|
||||
call psb_ensure_size(nzw+nzrz, w%ia, info)
|
||||
call psb_ensure_size(nzw+nzrz, w%val, info)
|
||||
ipz1 = w%icp(i)
|
||||
do j=1, nzrz
|
||||
w%ia(ipz1 + j -1) = ia(j)
|
||||
w%val(ipz1 + j -1) = val(j)
|
||||
end do
|
||||
w%icp(i+1) = ipz1 + nzrz
|
||||
nzw = nzw + nzrz
|
||||
|
||||
end do
|
||||
|
||||
end subroutine psb_zsparse_biconjg_llk
|
||||
@ -0,0 +1,362 @@
|
||||
!
|
||||
!
|
||||
! 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_llk_noth(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_llk_noth
|
||||
|
||||
!
|
||||
! Left-looking variant, with NO drop rule on p(i)/p(j)
|
||||
!
|
||||
!
|
||||
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
|
||||
type(psb_i_heap) :: heap, rheap
|
||||
type(psb_z_csc_sparse_mat) :: ac
|
||||
real(psb_dpk_) :: alpha
|
||||
character(len=20) :: name='psb_orth_llk_noth'
|
||||
logical, parameter :: debug=.false.
|
||||
|
||||
allocate(zval(n),ia(n),val(n),izkr(n),izcr(n),q(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
|
||||
|
||||
q(1) = p(1)
|
||||
!
|
||||
!
|
||||
call z%allocate(n,n,n*nzrmax)
|
||||
|
||||
z%icp(1) = 1
|
||||
z%icp(2) = 2
|
||||
z%ia(1) = 1
|
||||
z%val(1) = done
|
||||
nzz = 1
|
||||
|
||||
call w%allocate(n,n,n*nzrmax)
|
||||
w%icp(1) = 1
|
||||
w%icp(2) = 2
|
||||
w%ia(1) = 1
|
||||
w%val(1) = done
|
||||
nzw = 1
|
||||
|
||||
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) = done
|
||||
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 (.true.) then
|
||||
do k=z%icp(j), z%icp(j+1)-1
|
||||
kr = z%ia(k)
|
||||
zval(kr) = zval(kr) + alpha*z%val(k)
|
||||
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 j<k<i with nonzeros in column kr; we keep them in
|
||||
! a heap.
|
||||
!
|
||||
do kc = ac%icp(kr), ac%icp(kr+1)-1
|
||||
nextj=ac%ia(kc)
|
||||
if ((info == psb_success_).and.(izcr(nextj)==0)&
|
||||
& .and.(nextj>j).and.(nextj<i)) then
|
||||
call rheap%insert(nextj,info)
|
||||
izcr(nextj) = 1
|
||||
end if
|
||||
end do
|
||||
if (debug) write(0,*) 'update loop, adding indices: ',&
|
||||
& ac%ia(ac%icp(kr):ac%icp(kr+1)-1)
|
||||
|
||||
end if
|
||||
if (info /= psb_success_) exit
|
||||
end do
|
||||
if (info /= psb_success_) then
|
||||
info=psb_err_from_subroutine_
|
||||
call psb_errpush(info,name,a_err='psb_insert_heap')
|
||||
return
|
||||
end if
|
||||
end if
|
||||
end do outer
|
||||
call a%csget(i,i,nzra,ia,ja,val,info)
|
||||
call rwclip(nzra,ia,ja,val,ione,n,ione,n)
|
||||
p(i) = psb_spge_dot(nzra,ja,val,zval)
|
||||
if (abs(p(i)) < d_epstol) &
|
||||
& p(i) = 1.d-3
|
||||
|
||||
!!$ write(0,*) 'Dropping from a column with: ',i,psb_howmany_heap(heap),sp_thresh
|
||||
|
||||
!
|
||||
! Sparsify current ZVAL and put into ZMAT
|
||||
!
|
||||
call sparsify(i,nzrmax,sp_thresh,n,zval,nzrz,ia,val,info,iheap=heap,ikr=izkr)
|
||||
if (info /= psb_success_) then
|
||||
info = psb_err_internal_error_
|
||||
call psb_errpush(info,name,a_err='sparsify')
|
||||
return
|
||||
end if
|
||||
call psb_ensure_size(nzz+nzrz, z%ia, info)
|
||||
call psb_ensure_size(nzz+nzrz, z%val, info)
|
||||
ipz1 = z%icp(i)
|
||||
do j=1, nzrz
|
||||
z%ia(ipz1 + j -1) = ia(j)
|
||||
z%val(ipz1 + j -1) = val(j)
|
||||
end do
|
||||
z%icp(i+1) = ipz1 + nzrz
|
||||
nzz = nzz + nzrz
|
||||
|
||||
|
||||
! WVAL = e_i
|
||||
! !$ do j=1, i-1
|
||||
! !$ zval(j) = zzero
|
||||
! !$ end do
|
||||
zval(i) = done
|
||||
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 = a%irp(i), a%irp(i+1)-1
|
||||
if (a%ja(j) < i) then
|
||||
if (info == psb_success_) call rheap%insert(a%ja(j),info)
|
||||
izcr(a%ja(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
|
||||
outerw: do
|
||||
innerw: do
|
||||
call rheap%get_first(j,info)
|
||||
if (debug) write(0,*) 'from get_first: ',j,info
|
||||
if (info == -1) exit outerw ! Empty heap
|
||||
if (j > lastj) then
|
||||
lastj = j
|
||||
exit innerw
|
||||
end if
|
||||
end do innerw
|
||||
izcr(j) = 0
|
||||
if (j>=i) cycle outerw
|
||||
if (debug) write(0,*) 'update loop, using row: ',j
|
||||
ip1 = ac%icp(j)
|
||||
ip2 = ac%icp(j+1) - 1
|
||||
do
|
||||
if (ip2 < ip1 ) exit
|
||||
if (ac%ia(ip2) <= n) exit
|
||||
ip2 = ip2 -1
|
||||
end do
|
||||
nzra = max(0,ip2 - ip1 + 1)
|
||||
q(i) = psb_spge_dot(nzra,ac%ia(ip1:ip2),ac%val(ip1:ip2),zval)
|
||||
! !$ write(psb_err_unit,*) j,i,p(i)
|
||||
|
||||
alpha = (-q(i)/q(j))
|
||||
if (.true.) then
|
||||
|
||||
do k=w%icp(j), w%icp(j+1)-1
|
||||
kr = w%ia(k)
|
||||
zval(kr) = zval(kr) + alpha*w%val(k)
|
||||
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 j<k<i with nonzeros in column kr; we keep them in
|
||||
! a heap.
|
||||
!
|
||||
do kc = a%irp(kr), a%irp(kr+1)-1
|
||||
nextj=a%ja(kc)
|
||||
if ((info == psb_success_).and.(izcr(nextj)==0)&
|
||||
& .and.(nextj>j).and.(nextj<i)) then
|
||||
call rheap%insert(nextj,info)
|
||||
izcr(nextj) = 1
|
||||
end if
|
||||
end do
|
||||
if (debug) write(0,*) 'update loop, adding indices: ',&
|
||||
& a%ja(a%irp(kr):a%irp(kr+1)-1)
|
||||
|
||||
end if
|
||||
if (info /= psb_success_) exit
|
||||
end do
|
||||
if (info /= psb_success_) then
|
||||
info=psb_err_from_subroutine_
|
||||
call psb_errpush(info,name,a_err='psb_insert_heap')
|
||||
return
|
||||
end if
|
||||
end if
|
||||
end do outerw
|
||||
ip1 = ac%icp(i)
|
||||
ip2 = ac%icp(i+1) - 1
|
||||
do
|
||||
if (ip2 < ip1 ) exit
|
||||
if (ac%ia(ip2) <= n) exit
|
||||
ip2 = ip2 -1
|
||||
end do
|
||||
nzra = max(0,ip2 - ip1 + 1)
|
||||
q(i) = psb_spge_dot(nzra,ac%ia(ip1:ip2),ac%val(ip1:ip2),zval)
|
||||
if (abs(q(i)) < d_epstol) &
|
||||
& q(i) = 1.d-3
|
||||
|
||||
!!$ write(0,*) 'Dropping from a column with: ',i,psb_howmany_heap(heap),sp_thresh
|
||||
!
|
||||
! Sparsify current ZVAL and put into ZMAT
|
||||
!
|
||||
call sparsify(i,nzrmax,sp_thresh,n,zval,nzrz,ia,val,info,iheap=heap,ikr=izkr)
|
||||
if (info /= psb_success_) then
|
||||
info = psb_err_internal_error_
|
||||
call psb_errpush(info,name,a_err='sparsify')
|
||||
return
|
||||
end if
|
||||
call psb_ensure_size(nzw+nzrz, w%ia, info)
|
||||
call psb_ensure_size(nzw+nzrz, w%val, info)
|
||||
ipz1 = w%icp(i)
|
||||
do j=1, nzrz
|
||||
w%ia(ipz1 + j -1) = ia(j)
|
||||
w%val(ipz1 + j -1) = val(j)
|
||||
end do
|
||||
w%icp(i+1) = ipz1 + nzrz
|
||||
nzw = nzw + nzrz
|
||||
|
||||
end do
|
||||
|
||||
end subroutine psb_zsparse_biconjg_llk_noth
|
||||
@ -0,0 +1,501 @@
|
||||
!
|
||||
!
|
||||
! 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_mlk(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_mlk
|
||||
!
|
||||
! Left-looking variant
|
||||
!
|
||||
!
|
||||
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(:), hlist(:), bfr(:), rwlist(:)
|
||||
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, hlhead, li, mj, kkc, ifrst, ilst, rwhead
|
||||
type(psb_i_heap) :: heap, rheap
|
||||
type(psb_z_csc_sparse_mat) :: ac
|
||||
complex(psb_dpk_) :: alpha
|
||||
character(len=20) :: name='psb_biconjg_mlk'
|
||||
logical, parameter :: debug=.false., test_merge=.true.
|
||||
|
||||
allocate(zval(n),ia(n),val(n),izkr(n),izcr(n),q(n), &
|
||||
& hlist(n),rwlist(n),bfr(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
|
||||
hlist(i) = -1
|
||||
rwlist(i) = -1
|
||||
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
|
||||
|
||||
q(1) = p(1)
|
||||
!
|
||||
!
|
||||
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
|
||||
|
||||
call w%allocate(n,n,n*nzrmax)
|
||||
w%icp(1) = 1
|
||||
w%icp(2) = 2
|
||||
w%ia(1) = 1
|
||||
w%val(1) = zone
|
||||
nzw = 1
|
||||
|
||||
|
||||
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
|
||||
rwhead = i
|
||||
|
||||
hlhead = -1
|
||||
|
||||
kkc = 0
|
||||
ilst = ac%icp(i)-1
|
||||
ifrst = ac%icp(i)
|
||||
do j = ac%icp(i+1)-1, ac%icp(i), -1
|
||||
if (ac%ia(j) < i) then
|
||||
ilst = j
|
||||
exit
|
||||
end if
|
||||
end do
|
||||
kkc = ilst-ifrst+1
|
||||
|
||||
if (.true..or.debug) then
|
||||
!!$ write(0,*) 'Outer Before insertion : ',hlhead
|
||||
call printlist(hlhead,hlist)
|
||||
end if
|
||||
if (kkc > 0) then
|
||||
!!$ write(0,*) i,' Outer Inserting : ',kkc,':',ac%ia(ifrst:ilst)
|
||||
|
||||
!call hlmerge(hlhead,hlist,bfr(1:kkc))
|
||||
call hlmerge(hlhead,hlist,ac%ia(ifrst:ilst))
|
||||
end if
|
||||
if (debug) then
|
||||
write(0,*) 'Outer After insertion: ',hlhead
|
||||
call printlist(hlhead,hlist)
|
||||
end if
|
||||
|
||||
if (info /= psb_success_) then
|
||||
info=psb_err_from_subroutine_
|
||||
call psb_errpush(info,name,a_err='init_lists')
|
||||
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
|
||||
mj = hlhead
|
||||
if (mj > 0) then
|
||||
hlhead = hlist(mj)
|
||||
hlist(mj) = -1
|
||||
end if
|
||||
j = mj
|
||||
if (j < 0) exit outer
|
||||
|
||||
izcr(j) = 0
|
||||
if (j>=i) cycle outer
|
||||
|
||||
if (debug) write(0,*) 'update loop, using row: ',j,i,mj
|
||||
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))
|
||||
!!$ write(0,*) 'At step ',i,j,' p(i) ',p(i),alpha
|
||||
!!$ write(0,*) ' Current list is : ',hlhead
|
||||
!!$ call printlist(hlhead,hlist)
|
||||
!!$
|
||||
|
||||
|
||||
if (.false..or.(abs(alpha) > sp_thresh)) then
|
||||
ifrst=z%icp(j)
|
||||
ilst=z%icp(j+1)-1
|
||||
call hlmerge(rwhead,rwlist,z%ia(ifrst:ilst))
|
||||
!!$ write(0,*) 'At step ',i,j,' range ',z%icp(j), z%icp(j+1)-1, &
|
||||
!!$ & ' vals ',z%ia(z%icp(j):z%icp(j+1)-1)
|
||||
|
||||
do k=z%icp(j), z%icp(j+1)-1
|
||||
kr = z%ia(k)
|
||||
zval(kr) = zval(kr) + alpha*z%val(k)
|
||||
|
||||
if (izkr(kr) == 0) then
|
||||
!!$ write(0,*) ' main inner Inserting ',kr
|
||||
!!$ call hlmerge(rwhead,rwlist,(/kr/))
|
||||
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 j<k<i with nonzeros in column kr; we keep them in
|
||||
! a heap.
|
||||
!
|
||||
ilst = ac%icp(kr)-1
|
||||
ifrst = ac%icp(kr+1)
|
||||
kkc = 0
|
||||
do kc = ac%icp(kr), ac%icp(kr+1)-1
|
||||
if ((ac%ia(kc) < i).and.(ac%ia(kc) >j)) then
|
||||
ifrst = min(ifrst,kc )
|
||||
ilst = max(ilst,kc)
|
||||
end if
|
||||
end do
|
||||
kkc = ilst-ifrst+1
|
||||
if (debug) then
|
||||
write(0,*) 'Inner Before insertion: '
|
||||
call printlist(hlhead,hlist)
|
||||
write(0,*) 'Inner Inserting : ',kkc,':',ac%ia(ifrst:ilst)
|
||||
end if
|
||||
if (ilst >= ifrst) then
|
||||
!!$ write(0,*) j,i,' Inner inserting ',ac%ia(ifrst:ilst)
|
||||
call hlmerge(hlhead,hlist,ac%ia(ifrst:ilst))
|
||||
end if
|
||||
|
||||
if (debug) then
|
||||
write(0,*) 'Inner After insertion: ',hlhead
|
||||
call printlist(hlhead,hlist)
|
||||
end if
|
||||
|
||||
end if
|
||||
if (info /= psb_success_) exit
|
||||
end do
|
||||
if (info /= psb_success_) then
|
||||
info=psb_err_from_subroutine_
|
||||
call psb_errpush(info,name,a_err='psb_insert_heap')
|
||||
return
|
||||
end if
|
||||
end if
|
||||
end do outer
|
||||
call a%csget(i,i,nzra,ia,ja,val,info)
|
||||
call rwclip(nzra,ia,ja,val,ione,n,ione,n)
|
||||
p(i) = psb_spge_dot(nzra,ja,val,zval)
|
||||
if (abs(p(i)) < d_epstol) &
|
||||
& p(i) = 1.d-3
|
||||
|
||||
!!$ write(0,*) 'Dropping from a column with: ',i,psb_howmany_heap(heap),sp_thresh
|
||||
|
||||
!
|
||||
! Sparsify current ZVAL and put into ZMAT
|
||||
!
|
||||
call sparsify(i,nzrmax,sp_thresh,n,zval,nzrz,ia,val,rwhead,rwlist,izkr,info)
|
||||
|
||||
if (info /= psb_success_) then
|
||||
info = psb_err_internal_error_
|
||||
call psb_errpush(info,name,a_err='sparsify')
|
||||
return
|
||||
end if
|
||||
call psb_ensure_size(nzz+nzrz, z%ia, info)
|
||||
call psb_ensure_size(nzz+nzrz, z%val, info)
|
||||
ipz1 = z%icp(i)
|
||||
do j=1, nzrz
|
||||
z%ia(ipz1 + j -1) = ia(j)
|
||||
z%val(ipz1 + j -1) = val(j)
|
||||
end do
|
||||
z%icp(i+1) = ipz1 + nzrz
|
||||
nzz = nzz + nzrz
|
||||
|
||||
|
||||
! WVAL = e_i
|
||||
! !$ do j=1, i-1
|
||||
! !$ zval(j) = zzero
|
||||
! !$ end do
|
||||
zval(i) = zone
|
||||
izkr(i) = 1
|
||||
rwhead = i
|
||||
hlhead = -1
|
||||
|
||||
kkc = 0
|
||||
ilst = a%irp(i)-1
|
||||
ifrst = a%irp(i)
|
||||
do j = a%irp(i+1)-1, a%irp(i), -1
|
||||
if (a%ja(j) < i) then
|
||||
ilst = j
|
||||
exit
|
||||
end if
|
||||
end do
|
||||
kkc = ilst-ifrst+1
|
||||
|
||||
if (debug) then
|
||||
write(0,*) 'Outer Before insertion: '
|
||||
call printlist(hlhead,hlist)
|
||||
write(0,*) 'Outer Inserting : ',kkc,':',a%ja(ifrst:ilst)
|
||||
end if
|
||||
if (kkc > 0 ) then
|
||||
!call hlmerge(hlhead,hlist,bfr(1:kkc))
|
||||
call hlmerge(hlhead,hlist,a%ja(ifrst:ilst))
|
||||
end if
|
||||
if (debug) then
|
||||
write(0,*) 'Outer After insertion: ',hlhead
|
||||
call printlist(hlhead,hlist)
|
||||
end if
|
||||
|
||||
if (info /= psb_success_) then
|
||||
info=psb_err_from_subroutine_
|
||||
call psb_errpush(info,name,a_err='init_lists')
|
||||
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
|
||||
outerw: do
|
||||
mj = hlhead
|
||||
if (hlhead > 0) then
|
||||
hlhead = hlist(mj)
|
||||
hlist(mj) = -1
|
||||
end if
|
||||
j = mj
|
||||
if (j < 0) exit outerw
|
||||
|
||||
izcr(j) = 0
|
||||
if (j>=i) cycle outerw
|
||||
if (debug) write(0,*) 'update loop, using row: ',j
|
||||
ip1 = ac%icp(j)
|
||||
ip2 = ac%icp(j+1) - 1
|
||||
do
|
||||
if (ip2 < ip1 ) exit
|
||||
if (ac%ia(ip2) <= n) exit
|
||||
ip2 = ip2 -1
|
||||
end do
|
||||
nzra = max(0,ip2 - ip1 + 1)
|
||||
q(i) = psb_spge_dot(nzra,ac%ia(ip1:ip2),ac%val(ip1:ip2),zval)
|
||||
! !$ write(psb_err_unit,*) j,i,p(i)
|
||||
|
||||
alpha = (-q(i)/q(j))
|
||||
if (.false..or.(abs(alpha) > sp_thresh)) then
|
||||
ifrst=w%icp(j)
|
||||
ilst=w%icp(j+1)-1
|
||||
call hlmerge(rwhead,rwlist,w%ia(ifrst:ilst))
|
||||
|
||||
do k=w%icp(j), w%icp(j+1)-1
|
||||
kr = w%ia(k)
|
||||
zval(kr) = zval(kr) + alpha*w%val(k)
|
||||
if (izkr(kr) == 0) then
|
||||
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 j<k<i with nonzeros in column kr; we keep them in
|
||||
! a heap.
|
||||
!
|
||||
ilst = a%irp(kr)-1
|
||||
ifrst = a%irp(kr+1)
|
||||
kkc = 0
|
||||
do kc = a%irp(kr), a%irp(kr+1)-1
|
||||
if ((a%ja(kc) < i).and.(a%ja(kc) >j)) then
|
||||
ifrst = min(ifrst,kc )
|
||||
ilst = max(ilst,kc)
|
||||
end if
|
||||
end do
|
||||
kkc = ilst-ifrst+1
|
||||
if (debug) then
|
||||
write(0,*) 'Inner Before insertion: '
|
||||
call printlist(hlhead,hlist)
|
||||
write(0,*) 'Inner Inserting : ',kkc,':',a%ja(ifrst:ilst)
|
||||
end if
|
||||
|
||||
call hlmerge(hlhead,hlist,a%ja(ifrst:ilst))
|
||||
|
||||
if (debug) then
|
||||
write(0,*) 'Inner After insertion: ',hlhead
|
||||
call printlist(hlhead,hlist)
|
||||
end if
|
||||
if (debug) write(0,*) 'update loop, adding indices: ',&
|
||||
& a%ja(a%irp(kr):a%irp(kr+1)-1)
|
||||
|
||||
end if
|
||||
if (info /= psb_success_) exit
|
||||
end do
|
||||
if (info /= psb_success_) then
|
||||
info=psb_err_from_subroutine_
|
||||
call psb_errpush(info,name,a_err='psb_insert_heap')
|
||||
return
|
||||
end if
|
||||
end if
|
||||
end do outerw
|
||||
ip1 = ac%icp(i)
|
||||
ip2 = ac%icp(i+1) - 1
|
||||
do
|
||||
if (ip2 < ip1 ) exit
|
||||
if (ac%ia(ip2) <= n) exit
|
||||
ip2 = ip2 -1
|
||||
end do
|
||||
nzra = max(0,ip2 - ip1 + 1)
|
||||
q(i) = psb_spge_dot(nzra,ac%ia(ip1:ip2),ac%val(ip1:ip2),zval)
|
||||
if (abs(q(i)) < d_epstol) &
|
||||
& q(i) = 1.d-3
|
||||
|
||||
!!$ write(0,*) 'Dropping from a column with: ',i,psb_howmany_heap(heap),sp_thresh
|
||||
!
|
||||
! Sparsify current ZVAL and put into ZMAT
|
||||
!
|
||||
call sparsify(i,nzrmax,sp_thresh,n,zval,nzrz,ia,val,rwhead,rwlist,izkr,info)
|
||||
if (info /= psb_success_) then
|
||||
info = psb_err_internal_error_
|
||||
call psb_errpush(info,name,a_err='sparsify')
|
||||
return
|
||||
end if
|
||||
call psb_ensure_size(nzw+nzrz, w%ia, info)
|
||||
call psb_ensure_size(nzw+nzrz, w%val, info)
|
||||
ipz1 = w%icp(i)
|
||||
do j=1, nzrz
|
||||
w%ia(ipz1 + j -1) = ia(j)
|
||||
w%val(ipz1 + j -1) = val(j)
|
||||
end do
|
||||
w%icp(i+1) = ipz1 + nzrz
|
||||
nzw = nzw + nzrz
|
||||
|
||||
end do
|
||||
|
||||
contains
|
||||
|
||||
subroutine hlmerge(head,listv,vals)
|
||||
integer(psb_ipk_), intent(inout) :: head, listv(:)
|
||||
integer(psb_ipk_), intent(in) :: vals(:)
|
||||
integer(psb_ipk_) :: i,j,k, lh, lv, nv, vv, flh, ph
|
||||
|
||||
nv = size(vals)
|
||||
lh = head
|
||||
flh = -1
|
||||
lv = 1
|
||||
if ((head < 0).and.(nv > 0)) then
|
||||
! Adjust head if empty
|
||||
head = vals(lv)
|
||||
lv = lv + 1
|
||||
else if ((head > 0) .and. (nv >0)) then
|
||||
! Adjust head if first item less than it
|
||||
if (head > vals(lv)) then
|
||||
listv(vals(lv)) = head
|
||||
head = vals(lv)
|
||||
lv = lv + 1
|
||||
end if
|
||||
end if
|
||||
|
||||
lh = head
|
||||
ph = lh
|
||||
do while ((lh > 0) .and. (lv <= nv))
|
||||
if (lh == vals(lv)) then
|
||||
lv = lv + 1
|
||||
else if (lh > vals(lv)) then
|
||||
listv(vals(lv)) = lh
|
||||
listv(ph) = vals(lv)
|
||||
lh = vals(lv)
|
||||
lv = lv + 1
|
||||
else
|
||||
ph = lh
|
||||
lh = listv(lh)
|
||||
end if
|
||||
end do
|
||||
lh = ph
|
||||
do while (lv <= nv)
|
||||
listv(lh) = vals(lv)
|
||||
lh = listv(lh)
|
||||
lv = lv + 1
|
||||
end do
|
||||
end subroutine hlmerge
|
||||
|
||||
|
||||
subroutine printlist(head,listv)
|
||||
integer(psb_ipk_), intent(in) :: head, listv(:)
|
||||
integer(psb_ipk_) :: li
|
||||
|
||||
li = head
|
||||
do while (li > 0)
|
||||
write(0,*) 'Item: ', li
|
||||
li = listv(li)
|
||||
end do
|
||||
end subroutine printlist
|
||||
|
||||
end subroutine psb_zsparse_biconjg_mlk
|
||||
@ -0,0 +1,414 @@
|
||||
!
|
||||
!
|
||||
! 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_ft_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_ft_llk
|
||||
|
||||
!
|
||||
! Left-looking variant, stabilized i.e. product by A is applied
|
||||
! to compute the diagonal elements.
|
||||
!
|
||||
!
|
||||
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(:),iww(:)
|
||||
complex(psb_dpk_), allocatable :: zval(:),val(:), q(:), ww(:)
|
||||
integer(psb_ipk_) :: i,j,k, kc, kr, err_act, nz, nzra, nzrz, ipzi,ipzj, nzww,&
|
||||
& nzzi,nzzj, nzz, ip1, ip2, ipza,ipzz, ipzn, nzzn, ipz1, ipz2,&
|
||||
& ipj, lastj, nextj, nzw, nzrw
|
||||
type(psb_i_heap) :: heap, rheap
|
||||
type(psb_z_csc_sparse_mat) :: ac
|
||||
complex(psb_dpk_) :: alpha, tmpq,tmpq2
|
||||
character(len=20) :: name='psb_orth_llk'
|
||||
logical, parameter :: debug=.false.
|
||||
|
||||
allocate(zval(n),ia(n),val(n),izkr(n),izcr(n),q(n),iww(n),ww(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
|
||||
!
|
||||
! Init pointers to:
|
||||
! ljr(i): last occupied column index within row I
|
||||
! izcr(i): first occupied row index within column I
|
||||
!
|
||||
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
|
||||
|
||||
q(1) = p(1)
|
||||
!
|
||||
!
|
||||
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
|
||||
|
||||
call w%allocate(n,n,n*nzrmax)
|
||||
w%icp(1) = 1
|
||||
w%icp(2) = 2
|
||||
w%ia(1) = 1
|
||||
w%val(1) = zone
|
||||
nzw = 1
|
||||
|
||||
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) exit outer
|
||||
if (debug) write(0,*) 'update loop, using row: ',j
|
||||
ip1 = w%icp(j)
|
||||
ip2 = w%icp(j+1) - 1
|
||||
nzra = max(0,ip2 - ip1 + 1)
|
||||
nzww = 0
|
||||
call psb_d_spvspm(zone,a,nzra,w%ia(ip1:ip2),w%val(ip1:ip2),&
|
||||
& zzero,nzww,iww,ww,info)
|
||||
|
||||
p(i) = psb_spge_dot(nzww,iww,ww,zval)
|
||||
|
||||
ipz1 = z%icp(j)
|
||||
ipz2 = z%icp(j+1)
|
||||
nzrz = ipz2-ipz1
|
||||
alpha = (-p(i)/p(j))
|
||||
!!$ write(0,*) ' p(i)/p(j) ',i,j,alpha,p(i),p(j)
|
||||
if (.false..or.(abs(alpha) > sp_thresh)) then
|
||||
|
||||
do k=ipz1, ipz2-1
|
||||
kr = z%ia(k)
|
||||
zval(kr) = zval(kr) + alpha*z%val(k)
|
||||
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 j<k<i with nonzeros in column kr; we keep them in
|
||||
! a heap.
|
||||
!
|
||||
do kc = ac%icp(kr), ac%icp(kr+1)-1
|
||||
nextj=ac%ia(kc)
|
||||
if ((info == psb_success_).and.(izcr(nextj)==0)&
|
||||
& .and.(nextj>j).and.(nextj<i)) then
|
||||
call rheap%insert(nextj,info)
|
||||
izcr(nextj) = 1
|
||||
end if
|
||||
end do
|
||||
if (debug) write(0,*) 'update loop, adding indices: ',&
|
||||
& ac%ia(ac%icp(kr):ac%icp(kr+1)-1)
|
||||
|
||||
end if
|
||||
if (info /= psb_success_) exit
|
||||
end do
|
||||
if (info /= psb_success_) then
|
||||
info=psb_err_from_subroutine_
|
||||
call psb_errpush(info,name,a_err='psb_insert_heap')
|
||||
return
|
||||
end if
|
||||
end if
|
||||
!!$ izcr(j) = 0
|
||||
end do outer
|
||||
|
||||
if (.false.) then
|
||||
! We can't do the proper thing until we have bot Z_i and W_i.
|
||||
call a%csget(i,i,nzra,ia,ja,val,info)
|
||||
call rwclip(nzra,ia,ja,val,ione,n,ione,n)
|
||||
p(i) = psb_spge_dot(nzra,ja,val,zval)
|
||||
if (abs(p(i)) < d_epstol) &
|
||||
& p(i) = 1.d-3
|
||||
end if
|
||||
|
||||
!
|
||||
! Sparsify current ZVAL and put into ZMAT
|
||||
!
|
||||
call sparsify(i,nzrmax,sp_thresh,n,zval,nzrz,ia,val,info,iheap=heap,ikr=izkr)
|
||||
if (info /= psb_success_) then
|
||||
info = psb_err_internal_error_
|
||||
call psb_errpush(info,name,a_err='sparsify')
|
||||
return
|
||||
end if
|
||||
call psb_ensure_size(nzz+nzrz, z%ia, info)
|
||||
call psb_ensure_size(nzz+nzrz, z%val, info)
|
||||
ipz1 = z%icp(i)
|
||||
do j=1, nzrz
|
||||
z%ia(ipz1 + j -1) = ia(j)
|
||||
z%val(ipz1 + j -1) = val(j)
|
||||
end do
|
||||
z%icp(i+1) = ipz1 + nzrz
|
||||
nzz = nzz + nzrz
|
||||
|
||||
|
||||
|
||||
|
||||
! WVAL = 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)
|
||||
!!$ write(0,*) 'Inserting into heap ',i
|
||||
if (info == psb_success_) call rheap%init(info)
|
||||
do j = a%irp(i), a%irp(i+1)-1
|
||||
if (a%ja(j)<i) then
|
||||
if (info == psb_success_) call rheap%insert(a%ja(j),info)
|
||||
izcr(a%ja(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
|
||||
outerw: do
|
||||
innerw: do
|
||||
call rheap%get_first(j,info)
|
||||
if (debug) write(0,*) 'from get_first: ',j,info
|
||||
if (info == -1) exit outerw ! Empty heap
|
||||
if (j > lastj) then
|
||||
lastj = j
|
||||
exit innerw
|
||||
end if
|
||||
end do innerw
|
||||
izcr(j) = 0
|
||||
if (j>=i) exit outerw
|
||||
if (debug) write(0,*) 'update loop, using row: ',j
|
||||
if (.false.) then
|
||||
ip1 = ac%icp(j)
|
||||
ip2 = ac%icp(j+1) - 1
|
||||
do
|
||||
if (ip2 < ip1 ) exit
|
||||
if (ac%ia(ip2) <= n) exit
|
||||
ip2 = ip2 -1
|
||||
end do
|
||||
nzra = max(0,ip2 - ip1 + 1)
|
||||
q(i) = psb_spge_dot(nzra,ac%ia(ip1:ip2),ac%val(ip1:ip2),zval)
|
||||
! !$ write(psb_err_unit,*) j,i,p(i)
|
||||
else
|
||||
ip1 = z%icp(j)
|
||||
ip2 = z%icp(j+1) - 1
|
||||
nzra = max(0,ip2 - ip1 + 1)
|
||||
nzww = 0
|
||||
call psb_d_spmspv(zone,ac,nzra,z%ia(ip1:ip2),z%val(ip1:ip2),&
|
||||
& zzero,nzww,iww,ww,info)
|
||||
|
||||
q(i) = psb_spge_dot(nzww,iww,ww,zval)
|
||||
end if
|
||||
|
||||
ipz1 = w%icp(j)
|
||||
ipz2 = w%icp(j+1)
|
||||
nzrz = ipz2-ipz1
|
||||
alpha = (-q(i)/q(j))
|
||||
!!$ write(0,*) ' q(i)/q(j) ',i,j,alpha,q(i),q(j)
|
||||
if (.false..or.(abs(alpha) > sp_thresh)) then
|
||||
|
||||
do k=ipz1, ipz2-1
|
||||
kr = w%ia(k)
|
||||
zval(kr) = zval(kr) + alpha*w%val(k)
|
||||
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 j<k<i with nonzeros in column kr; we keep them in
|
||||
! a heap.
|
||||
!
|
||||
do kc = a%irp(kr), a%irp(kr+1)-1
|
||||
nextj=a%ja(kc)
|
||||
if ((info == psb_success_).and.(izcr(nextj)==0)&
|
||||
& .and.(nextj>j).and.(nextj<i)) then
|
||||
call rheap%insert(nextj,info)
|
||||
izcr(nextj) = 1
|
||||
end if
|
||||
end do
|
||||
if (debug) write(0,*) 'update loop, adding indices: ',&
|
||||
& a%ja(a%irp(kr):a%irp(kr+1)-1)
|
||||
|
||||
end if
|
||||
if (info /= psb_success_) exit
|
||||
end do
|
||||
if (info /= psb_success_) then
|
||||
info=psb_err_from_subroutine_
|
||||
call psb_errpush(info,name,a_err='psb_insert_heap')
|
||||
return
|
||||
end if
|
||||
end if
|
||||
!!$ izcr(j) = 0
|
||||
end do outerw
|
||||
|
||||
!!$ ip1 = ac%icp(i)
|
||||
!!$ ip2 = ac%icp(i+1) - 1
|
||||
!!$ do
|
||||
!!$ if (ip2 < ip1 ) exit
|
||||
!!$ if (ac%ia(ip2) <= n) exit
|
||||
!!$ ip2 = ip2 -1
|
||||
!!$ end do
|
||||
!!$ nzra = max(0,ip2 - ip1 + 1)
|
||||
!!$
|
||||
!!$ q(i) = psb_spge_dot(nzra,ac%ia(ip1:ip2),ac%val(ip1:ip2),zval)
|
||||
!!$ if (abs(q(i)) < d_epstol) &
|
||||
!!$ & q(i) = 1.d-3
|
||||
!
|
||||
! Sparsify current ZVAL and put into ZMAT
|
||||
!
|
||||
call sparsify(i,nzrmax,sp_thresh,n,zval,nzrw,ia,val,info,iheap=heap,ikr=izkr)
|
||||
if (info /= psb_success_) then
|
||||
info = psb_err_internal_error_
|
||||
call psb_errpush(info,name,a_err='sparsify')
|
||||
return
|
||||
end if
|
||||
call psb_ensure_size(nzw+nzrw, w%ia, info)
|
||||
call psb_ensure_size(nzw+nzrw, w%val, info)
|
||||
ipz1 = w%icp(i)
|
||||
do j=1, nzrw
|
||||
w%ia(ipz1 + j -1) = ia(j)
|
||||
w%val(ipz1 + j -1) = val(j)
|
||||
end do
|
||||
w%icp(i+1) = ipz1 + nzrw
|
||||
nzw = nzw + nzrw
|
||||
|
||||
!!$ !
|
||||
!!$ ! Ok, now compute w_i^T A z_i
|
||||
!!$ !
|
||||
nzww = 0
|
||||
nzrz = z%icp(i+1)-z%icp(i)
|
||||
ipz1 = z%icp(i)
|
||||
call psb_d_spmspv(zone,ac,&
|
||||
& nzrz,z%ia(ipz1:ipz1+nzrz-1),z%val(ipz1:ipz1+nzrz-1),&
|
||||
& zzero,nzww,iww,ww,info)
|
||||
tmpq = psb_spdot_srtd(nzww,iww,ww,nzrw,ia,val)
|
||||
q(i) = tmpq
|
||||
! if (tmpq <0) then
|
||||
!!$ write(0,*) 'On negative dot prod at ',i
|
||||
!!$ write(0,*) 'On negative dot prod a ',ia(1:nzrw),val(1:nzrw)
|
||||
!!$ write(0,*) 'On negative dot prod w ',iww(1:nzww),ww(1:nzww)
|
||||
!!$ ip1 = ac%icp(i)
|
||||
!!$ ip2 = ac%icp(i+1) - 1
|
||||
!!$ do
|
||||
!!$ if (ip2 < ip1 ) exit
|
||||
!!$ if (ac%ia(ip2) <= n) exit
|
||||
!!$ ip2 = ip2 -1
|
||||
!!$ end do
|
||||
!!$ nzra = max(0,ip2 - ip1 + 1)
|
||||
!!$ write(0,*) 'On negative dot prod a ',ac%ia(ip1:ip2),ac%val(ip1:ip2)
|
||||
!
|
||||
! end if
|
||||
|
||||
if (abs(q(i)) < d_epstol) &
|
||||
& q(i) = 1.d-3
|
||||
p(i) = q(i)
|
||||
|
||||
end do
|
||||
|
||||
end subroutine psb_zsparse_biconjg_s_ft_llk
|
||||
@ -0,0 +1,248 @@
|
||||
!
|
||||
!
|
||||
! 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 j<k<i with nonzeros in column kr; we keep them in
|
||||
! a heap.
|
||||
!
|
||||
do kc = ac%icp(kr), ac%icp(kr+1)-1
|
||||
nextj=ac%ia(kc)
|
||||
if ((info == psb_success_).and.(izcr(nextj)==0)&
|
||||
& .and.(nextj>j).and.(nextj<i)) then
|
||||
call rheap%insert(nextj,info)
|
||||
izcr(nextj) = 1
|
||||
end if
|
||||
end do
|
||||
if (debug) write(0,*) 'update loop, adding indices: ',&
|
||||
& ac%ia(ac%icp(kr):ac%icp(kr+1)-1)
|
||||
|
||||
end if
|
||||
if (info /= psb_success_) exit
|
||||
end do
|
||||
if (info /= psb_success_) then
|
||||
info=psb_err_from_subroutine_
|
||||
call psb_errpush(info,name,a_err='psb_insert_heap')
|
||||
return
|
||||
end if
|
||||
end if
|
||||
end do outer
|
||||
call a%csget(i,i,nzra,ia,ja,val,info)
|
||||
call rwclip(nzra,ia,ja,val,ione,n,ione,n)
|
||||
p(i) = psb_spge_dot(nzra,ja,val,zval)
|
||||
!!$ if ((1761<=i).and.(i<=1780)) then
|
||||
!!$ write(0,*) 'Dot product terms at ',i,nzra
|
||||
!!$ do kk=1,nzra
|
||||
!!$ write(0,*) kk,ja(kk),val(kk),zval(ja(kk))
|
||||
!!$ end do
|
||||
!!$ end if
|
||||
|
||||
if (abs(p(i)) < d_epstol) &
|
||||
& p(i) = 1.d-3
|
||||
|
||||
! !$ write(0,*) 'Dropping from a column with: ',i,psb_howmany_heap(heap),sp_thresh
|
||||
|
||||
!
|
||||
! Sparsify current ZVAL and put into ZMAT
|
||||
!
|
||||
call sparsify(i,nzrmax,sp_thresh,n,zval,nzrz,ia,val,info,iheap=heap,ikr=izkr)
|
||||
if (info /= psb_success_) then
|
||||
info = psb_err_internal_error_
|
||||
call psb_errpush(info,name,a_err='sparsify')
|
||||
return
|
||||
end if
|
||||
call psb_ensure_size(nzz+nzrz, z%ia, info)
|
||||
call psb_ensure_size(nzz+nzrz, z%val, info)
|
||||
ipz1 = z%icp(i)
|
||||
do j=1, nzrz
|
||||
z%ia(ipz1 + j -1) = ia(j)
|
||||
z%val(ipz1 + j -1) = val(j)
|
||||
!!$ zvalmax = max(zvalmax,abs(val(j)))
|
||||
end do
|
||||
z%icp(i+1) = ipz1 + nzrz
|
||||
nzz = nzz + nzrz
|
||||
!!$ write(0,*) ' Dot: ',i,p(i),zvalmax
|
||||
|
||||
end do
|
||||
|
||||
call z%cp_to_fmt(w,info)
|
||||
|
||||
end subroutine psb_zsparse_biconjg_s_llk
|
||||
@ -0,0 +1,6 @@
|
||||
module psb_biconjg_mod
|
||||
use psb_c_biconjg_mod
|
||||
use psb_d_biconjg_mod
|
||||
use psb_s_biconjg_mod
|
||||
use psb_z_biconjg_mod
|
||||
end module psb_biconjg_mod
|
||||
@ -0,0 +1,364 @@
|
||||
!
|
||||
! Parallel Sparse BLAS version 3.5
|
||||
! (C) Copyright 2006-2018
|
||||
! Salvatore Filippone
|
||||
! Alfredo Buttari
|
||||
!
|
||||
! 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 PSBLAS 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 PSBLAS 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.
|
||||
!
|
||||
! Moved here from AMG-AINV, original copyright below.
|
||||
!
|
||||
!
|
||||
! 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.
|
||||
!
|
||||
!
|
||||
!
|
||||
!
|
||||
!
|
||||
! 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.
|
||||
!
|
||||
!
|
||||
module psb_c_biconjg_mod
|
||||
|
||||
interface psb_sparse_biconjg
|
||||
module procedure psb_csparse_biconjg
|
||||
end interface
|
||||
|
||||
|
||||
abstract interface
|
||||
subroutine psb_csparse_biconjg_variant(n,a,p,z,w,nzrmax,sp_thresh,info)
|
||||
use psb_base_mod, only : psb_c_csr_sparse_mat, psb_c_csc_sparse_mat, &
|
||||
& psb_spk_, psb_ipk_
|
||||
!
|
||||
implicit none
|
||||
integer(psb_ipk_), intent(in) :: n
|
||||
type(psb_c_csr_sparse_mat), intent(in) :: a
|
||||
type(psb_c_csc_sparse_mat), intent(inout) :: z,w
|
||||
integer(psb_ipk_), intent(in) :: nzrmax
|
||||
real(psb_spk_), intent(in) :: sp_thresh
|
||||
complex(psb_spk_), intent(out) :: p(:)
|
||||
integer(psb_ipk_), intent(out) :: info
|
||||
end subroutine psb_csparse_biconjg_variant
|
||||
end interface
|
||||
|
||||
|
||||
procedure(psb_csparse_biconjg_variant) :: psb_csparse_biconjg_llk,&
|
||||
& psb_csparse_biconjg_s_llk, psb_csparse_biconjg_s_ft_llk,&
|
||||
& psb_csparse_biconjg_llk_noth, psb_csparse_biconjg_mlk
|
||||
|
||||
#if defined(HAVE_TUMA_SAINV)
|
||||
procedure(psb_csparse_biconjg_variant) :: psb_csparse_tuma_sainv,&
|
||||
& psb_csparse_tuma_lainv
|
||||
#endif
|
||||
|
||||
|
||||
contains
|
||||
|
||||
subroutine psb_csparse_biconjg(alg,n,acsr,p,z,w,nzrmax,sp_thresh,info)
|
||||
use psb_base_mod
|
||||
use psb_base_ainv_mod
|
||||
integer(psb_ipk_), intent(in) :: alg,n
|
||||
type(psb_c_csr_sparse_mat), intent(in) :: acsr
|
||||
type(psb_cspmat_type), intent(out) :: z, w
|
||||
integer(psb_ipk_), intent(in) :: nzrmax
|
||||
real(psb_spk_), intent(in) :: sp_thresh
|
||||
complex(psb_spk_), intent(out) :: p(:)
|
||||
integer(psb_ipk_), intent(out) :: info
|
||||
|
||||
type(psb_c_csc_sparse_mat) :: zcsc,wcsc
|
||||
integer(psb_ipk_) :: i,j,k,nrm
|
||||
integer(psb_ipk_) :: err_act
|
||||
character(len=20) :: name='psb_sparse_biconjg'
|
||||
integer(psb_ipk_), parameter :: variant=1
|
||||
|
||||
|
||||
info = psb_success_
|
||||
call psb_erractionsave(err_act)
|
||||
if (psb_errstatus_fatal()) then
|
||||
info = psb_err_internal_error_; goto 9999
|
||||
end if
|
||||
|
||||
if (size(p)<n) then
|
||||
write(psb_err_unit,*) 'Size of P wrong'
|
||||
info = psb_err_internal_error_
|
||||
call psb_errpush(psb_err_internal_error_,name,a_err='Allocate')
|
||||
goto 9999
|
||||
end if
|
||||
|
||||
select case(alg)
|
||||
case (psb_ainv_llk_)
|
||||
call psb_csparse_biconjg_llk(n,acsr,p,zcsc,wcsc,nzrmax,sp_thresh,info)
|
||||
case (psb_ainv_s_llk_)
|
||||
call psb_csparse_biconjg_s_llk(n,acsr,p,zcsc,wcsc,nzrmax,sp_thresh,info)
|
||||
case (psb_ainv_mlk_)
|
||||
call psb_csparse_biconjg_mlk(n,acsr,p,zcsc,wcsc,nzrmax,sp_thresh,info)
|
||||
case (psb_ainv_s_ft_llk_)
|
||||
call psb_csparse_biconjg_s_ft_llk(n,acsr,p,zcsc,wcsc,nzrmax,sp_thresh,info)
|
||||
case (psb_ainv_llk_noth_)
|
||||
call psb_csparse_biconjg_llk_noth(n,acsr,p,zcsc,wcsc,nzrmax,sp_thresh,info)
|
||||
!#if defined(HAVE_TUMA_SAINV)
|
||||
! case (psb_ainv_s_tuma_)
|
||||
! call psb_csparse_tuma_sainv(n,acsr,p,zcsc,wcsc,nzrmax,sp_thresh,info)
|
||||
! case (psb_ainv_l_tuma_)
|
||||
! call psb_csparse_tuma_lainv(n,acsr,p,zcsc,wcsc,nzrmax,sp_thresh,info)
|
||||
!#endif
|
||||
case default
|
||||
info = psb_err_internal_error_
|
||||
call psb_errpush(info,name,a_err='Invalid alg')
|
||||
goto 9999
|
||||
end select
|
||||
|
||||
if (info /= 0) then
|
||||
info = psb_err_from_subroutine_
|
||||
call psb_errpush(info,name,a_err='sparse_orth')
|
||||
goto 9999
|
||||
end if
|
||||
|
||||
call z%mv_from(zcsc)
|
||||
call z%cscnv(info,type='CSR')
|
||||
call w%mv_from(wcsc)
|
||||
call w%transp()
|
||||
call w%cscnv(info,type='CSR')
|
||||
|
||||
call psb_erractionrestore(err_act)
|
||||
return
|
||||
|
||||
9999 call psb_error_handler(err_act)
|
||||
return
|
||||
end subroutine psb_csparse_biconjg
|
||||
|
||||
|
||||
subroutine psb_c_spmspv(alpha,a,nx,ix,vx,beta,ny,iy,vy, info)
|
||||
!
|
||||
! y = A x sparse-sparse mode, A in CSC
|
||||
!
|
||||
use psb_base_mod
|
||||
implicit none
|
||||
integer(psb_ipk_), intent(in) :: nx, ix(:)
|
||||
complex(psb_spk_), intent(in) :: alpha, beta, vx(:)
|
||||
integer(psb_ipk_), intent(inout) :: ny, iy(:)
|
||||
complex(psb_spk_), intent(inout) :: vy(:)
|
||||
type(psb_c_csc_sparse_mat), intent(in) :: a
|
||||
integer(psb_ipk_), intent(out) :: info
|
||||
|
||||
integer(psb_ipk_) :: i,j,k,m,n, nv, na, iszy
|
||||
integer(psb_ipk_), allocatable :: iv(:)
|
||||
complex(psb_spk_), allocatable :: vv(:)
|
||||
|
||||
info = 0
|
||||
! !$ write(0,*) 'd_spmspv ',alpha,beta
|
||||
if (beta == -cone) then
|
||||
do i=1, ny
|
||||
vy(i) = -vy(i)
|
||||
end do
|
||||
else if (beta == czero) then
|
||||
do i=1, ny
|
||||
vy(i) = czero
|
||||
end do
|
||||
else if (beta /= cone) then
|
||||
do i=1, ny
|
||||
vy(i) = vy(i) * beta
|
||||
end do
|
||||
end if
|
||||
if (alpha == czero) return
|
||||
iszy = min(size(iy),size(vy))
|
||||
m = a%get_nrows()
|
||||
n = a%get_ncols()
|
||||
|
||||
if ((ny > m) .or. (nx > n)) then
|
||||
write(0,*) 'Wrong input spmspv rows: ',m,ny,&
|
||||
& ' cols: ',n,nx
|
||||
info = -4
|
||||
return
|
||||
end if
|
||||
|
||||
allocate(iv(m), vv(m), stat=info)
|
||||
if (info /= 0) then
|
||||
write(0,*) 'Allocation error in spmspv'
|
||||
info = -999
|
||||
return
|
||||
endif
|
||||
|
||||
do i = 1, nx
|
||||
j = ix(i)
|
||||
! Access column J of A
|
||||
k = a%icp(j)
|
||||
na = a%icp(j+1) - a%icp(j)
|
||||
call psb_nspaxpby(nv,iv,vv,&
|
||||
& (alpha*vx(i)), na, a%ia(k:k+na-1), a%val(k:k+na-1),&
|
||||
& cone, ny, iy, vy, info)
|
||||
|
||||
if (info /= 0) then
|
||||
write(0,*) 'Internal error in spmspv from nspaxpby'
|
||||
info = -998
|
||||
return
|
||||
endif
|
||||
if (nv > iszy) then
|
||||
write(0,*) 'Error in spmspv: out of memory for output'
|
||||
info = -997
|
||||
return
|
||||
endif
|
||||
ny = nv
|
||||
iy(1:ny) = iv(1:ny)
|
||||
vy(1:ny) = vv(1:ny)
|
||||
end do
|
||||
end subroutine psb_c_spmspv
|
||||
|
||||
|
||||
subroutine psb_c_spvspm(alpha,a,nx,ix,vx,beta,ny,iy,vy, info)
|
||||
!
|
||||
! y = x A sparse-sparse mode, A in CSR
|
||||
!
|
||||
use psb_base_mod
|
||||
implicit none
|
||||
integer(psb_ipk_), intent(in) :: nx, ix(:)
|
||||
complex(psb_spk_), intent(in) :: alpha, beta, vx(:)
|
||||
integer(psb_ipk_), intent(inout) :: ny, iy(:)
|
||||
complex(psb_spk_), intent(inout) :: vy(:)
|
||||
type(psb_c_csr_sparse_mat), intent(in) :: a
|
||||
integer(psb_ipk_), intent(out) :: info
|
||||
|
||||
integer(psb_ipk_) :: i,j,k,m,n, nv, na, iszy
|
||||
integer(psb_ipk_), allocatable :: iv(:)
|
||||
complex(psb_spk_), allocatable :: vv(:)
|
||||
|
||||
info = 0
|
||||
! !$ write(0,*) 'd_spvspm ',alpha,beta
|
||||
if (beta == -cone) then
|
||||
do i=1, ny
|
||||
vy(i) = -vy(i)
|
||||
end do
|
||||
else if (beta == czero) then
|
||||
do i=1, ny
|
||||
vy(i) = czero
|
||||
end do
|
||||
else if (beta /= cone) then
|
||||
do i=1, ny
|
||||
vy(i) = vy(i) * beta
|
||||
end do
|
||||
end if
|
||||
if (alpha == czero) return
|
||||
iszy = min(size(iy),size(vy))
|
||||
m = a%get_nrows()
|
||||
n = a%get_ncols()
|
||||
|
||||
if ((ny > m) .or. (nx > n)) then
|
||||
write(0,*) 'Wrong input spmspv rows: ',m,ny,&
|
||||
& ' cols: ',n,nx
|
||||
info = -4
|
||||
return
|
||||
end if
|
||||
|
||||
allocate(iv(m), vv(m), stat=info)
|
||||
if (info /= 0) then
|
||||
write(0,*) 'Allocation error in spmspv'
|
||||
info = -999
|
||||
return
|
||||
endif
|
||||
|
||||
do i = 1, nx
|
||||
j = ix(i)
|
||||
! Access column J of A
|
||||
k = a%irp(j)
|
||||
na = a%irp(j+1) - a%irp(j)
|
||||
call psb_nspaxpby(nv,iv,vv,&
|
||||
& (alpha*vx(i)), na, a%ja(k:k+na-1), a%val(k:k+na-1),&
|
||||
& cone, ny, iy, vy, info)
|
||||
|
||||
if (info /= 0) then
|
||||
write(0,*) 'Internal error in spmspv from nspaxpby'
|
||||
info = -998
|
||||
return
|
||||
endif
|
||||
if (nv > iszy) then
|
||||
write(0,*) 'Error in spmspv: out of memory for output'
|
||||
info = -997
|
||||
return
|
||||
endif
|
||||
ny = nv
|
||||
iy(1:ny) = iv(1:ny)
|
||||
vy(1:ny) = vv(1:ny)
|
||||
end do
|
||||
end subroutine psb_c_spvspm
|
||||
|
||||
end module psb_c_biconjg_mod
|
||||
@ -0,0 +1,364 @@
|
||||
!
|
||||
! Parallel Sparse BLAS version 3.5
|
||||
! (C) Copyright 2006-2018
|
||||
! Salvatore Filippone
|
||||
! Alfredo Buttari
|
||||
!
|
||||
! 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 PSBLAS 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 PSBLAS 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.
|
||||
!
|
||||
! Moved here from AMG-AINV, original copyright below.
|
||||
!
|
||||
!
|
||||
! 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.
|
||||
!
|
||||
!
|
||||
!
|
||||
!
|
||||
!
|
||||
! 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.
|
||||
!
|
||||
!
|
||||
module psb_d_biconjg_mod
|
||||
|
||||
interface psb_sparse_biconjg
|
||||
module procedure psb_dsparse_biconjg
|
||||
end interface
|
||||
|
||||
|
||||
abstract interface
|
||||
subroutine psb_dsparse_biconjg_variant(n,a,p,z,w,nzrmax,sp_thresh,info)
|
||||
use psb_base_mod, only : psb_d_csr_sparse_mat, psb_d_csc_sparse_mat, &
|
||||
& psb_dpk_, psb_ipk_
|
||||
!
|
||||
implicit none
|
||||
integer(psb_ipk_), intent(in) :: n
|
||||
type(psb_d_csr_sparse_mat), intent(in) :: a
|
||||
type(psb_d_csc_sparse_mat), intent(inout) :: z,w
|
||||
integer(psb_ipk_), intent(in) :: nzrmax
|
||||
real(psb_dpk_), intent(in) :: sp_thresh
|
||||
real(psb_dpk_), intent(out) :: p(:)
|
||||
integer(psb_ipk_), intent(out) :: info
|
||||
end subroutine psb_dsparse_biconjg_variant
|
||||
end interface
|
||||
|
||||
|
||||
procedure(psb_dsparse_biconjg_variant) :: psb_dsparse_biconjg_llk,&
|
||||
& psb_dsparse_biconjg_s_llk, psb_dsparse_biconjg_s_ft_llk,&
|
||||
& psb_dsparse_biconjg_llk_noth, psb_dsparse_biconjg_mlk
|
||||
|
||||
#if defined(HAVE_TUMA_SAINV)
|
||||
procedure(psb_dsparse_biconjg_variant) :: psb_dsparse_tuma_sainv,&
|
||||
& psb_dsparse_tuma_lainv
|
||||
#endif
|
||||
|
||||
|
||||
contains
|
||||
|
||||
subroutine psb_dsparse_biconjg(alg,n,acsr,p,z,w,nzrmax,sp_thresh,info)
|
||||
use psb_base_mod
|
||||
use psb_base_ainv_mod
|
||||
integer(psb_ipk_), intent(in) :: alg,n
|
||||
type(psb_d_csr_sparse_mat), intent(in) :: acsr
|
||||
type(psb_dspmat_type), intent(out) :: z, w
|
||||
integer(psb_ipk_), intent(in) :: nzrmax
|
||||
real(psb_dpk_), intent(in) :: sp_thresh
|
||||
real(psb_dpk_), intent(out) :: p(:)
|
||||
integer(psb_ipk_), intent(out) :: info
|
||||
|
||||
type(psb_d_csc_sparse_mat) :: zcsc,wcsc
|
||||
integer(psb_ipk_) :: i,j,k,nrm
|
||||
integer(psb_ipk_) :: err_act
|
||||
character(len=20) :: name='psb_sparse_biconjg'
|
||||
integer(psb_ipk_), parameter :: variant=1
|
||||
|
||||
|
||||
info = psb_success_
|
||||
call psb_erractionsave(err_act)
|
||||
if (psb_errstatus_fatal()) then
|
||||
info = psb_err_internal_error_; goto 9999
|
||||
end if
|
||||
|
||||
if (size(p)<n) then
|
||||
write(psb_err_unit,*) 'Size of P wrong'
|
||||
info = psb_err_internal_error_
|
||||
call psb_errpush(psb_err_internal_error_,name,a_err='Allocate')
|
||||
goto 9999
|
||||
end if
|
||||
|
||||
select case(alg)
|
||||
case (psb_ainv_llk_)
|
||||
call psb_dsparse_biconjg_llk(n,acsr,p,zcsc,wcsc,nzrmax,sp_thresh,info)
|
||||
case (psb_ainv_s_llk_)
|
||||
call psb_dsparse_biconjg_s_llk(n,acsr,p,zcsc,wcsc,nzrmax,sp_thresh,info)
|
||||
case (psb_ainv_mlk_)
|
||||
call psb_dsparse_biconjg_mlk(n,acsr,p,zcsc,wcsc,nzrmax,sp_thresh,info)
|
||||
case (psb_ainv_s_ft_llk_)
|
||||
call psb_dsparse_biconjg_s_ft_llk(n,acsr,p,zcsc,wcsc,nzrmax,sp_thresh,info)
|
||||
case (psb_ainv_llk_noth_)
|
||||
call psb_dsparse_biconjg_llk_noth(n,acsr,p,zcsc,wcsc,nzrmax,sp_thresh,info)
|
||||
!#if defined(HAVE_TUMA_SAINV)
|
||||
! case (psb_ainv_s_tuma_)
|
||||
! call psb_dsparse_tuma_sainv(n,acsr,p,zcsc,wcsc,nzrmax,sp_thresh,info)
|
||||
! case (psb_ainv_l_tuma_)
|
||||
! call psb_dsparse_tuma_lainv(n,acsr,p,zcsc,wcsc,nzrmax,sp_thresh,info)
|
||||
!#endif
|
||||
case default
|
||||
info = psb_err_internal_error_
|
||||
call psb_errpush(info,name,a_err='Invalid alg')
|
||||
goto 9999
|
||||
end select
|
||||
|
||||
if (info /= 0) then
|
||||
info = psb_err_from_subroutine_
|
||||
call psb_errpush(info,name,a_err='sparse_orth')
|
||||
goto 9999
|
||||
end if
|
||||
|
||||
call z%mv_from(zcsc)
|
||||
call z%cscnv(info,type='CSR')
|
||||
call w%mv_from(wcsc)
|
||||
call w%transp()
|
||||
call w%cscnv(info,type='CSR')
|
||||
|
||||
call psb_erractionrestore(err_act)
|
||||
return
|
||||
|
||||
9999 call psb_error_handler(err_act)
|
||||
return
|
||||
end subroutine psb_dsparse_biconjg
|
||||
|
||||
|
||||
subroutine psb_d_spmspv(alpha,a,nx,ix,vx,beta,ny,iy,vy, info)
|
||||
!
|
||||
! y = A x sparse-sparse mode, A in CSC
|
||||
!
|
||||
use psb_base_mod
|
||||
implicit none
|
||||
integer(psb_ipk_), intent(in) :: nx, ix(:)
|
||||
real(psb_dpk_), intent(in) :: alpha, beta, vx(:)
|
||||
integer(psb_ipk_), intent(inout) :: ny, iy(:)
|
||||
real(psb_dpk_), intent(inout) :: vy(:)
|
||||
type(psb_d_csc_sparse_mat), intent(in) :: a
|
||||
integer(psb_ipk_), intent(out) :: info
|
||||
|
||||
integer(psb_ipk_) :: i,j,k,m,n, nv, na, iszy
|
||||
integer(psb_ipk_), allocatable :: iv(:)
|
||||
real(psb_dpk_), allocatable :: vv(:)
|
||||
|
||||
info = 0
|
||||
! !$ write(0,*) 'd_spmspv ',alpha,beta
|
||||
if (beta == -done) then
|
||||
do i=1, ny
|
||||
vy(i) = -vy(i)
|
||||
end do
|
||||
else if (beta == dzero) then
|
||||
do i=1, ny
|
||||
vy(i) = dzero
|
||||
end do
|
||||
else if (beta /= done) then
|
||||
do i=1, ny
|
||||
vy(i) = vy(i) * beta
|
||||
end do
|
||||
end if
|
||||
if (alpha == dzero) return
|
||||
iszy = min(size(iy),size(vy))
|
||||
m = a%get_nrows()
|
||||
n = a%get_ncols()
|
||||
|
||||
if ((ny > m) .or. (nx > n)) then
|
||||
write(0,*) 'Wrong input spmspv rows: ',m,ny,&
|
||||
& ' cols: ',n,nx
|
||||
info = -4
|
||||
return
|
||||
end if
|
||||
|
||||
allocate(iv(m), vv(m), stat=info)
|
||||
if (info /= 0) then
|
||||
write(0,*) 'Allocation error in spmspv'
|
||||
info = -999
|
||||
return
|
||||
endif
|
||||
|
||||
do i = 1, nx
|
||||
j = ix(i)
|
||||
! Access column J of A
|
||||
k = a%icp(j)
|
||||
na = a%icp(j+1) - a%icp(j)
|
||||
call psb_nspaxpby(nv,iv,vv,&
|
||||
& (alpha*vx(i)), na, a%ia(k:k+na-1), a%val(k:k+na-1),&
|
||||
& done, ny, iy, vy, info)
|
||||
|
||||
if (info /= 0) then
|
||||
write(0,*) 'Internal error in spmspv from nspaxpby'
|
||||
info = -998
|
||||
return
|
||||
endif
|
||||
if (nv > iszy) then
|
||||
write(0,*) 'Error in spmspv: out of memory for output'
|
||||
info = -997
|
||||
return
|
||||
endif
|
||||
ny = nv
|
||||
iy(1:ny) = iv(1:ny)
|
||||
vy(1:ny) = vv(1:ny)
|
||||
end do
|
||||
end subroutine psb_d_spmspv
|
||||
|
||||
|
||||
subroutine psb_d_spvspm(alpha,a,nx,ix,vx,beta,ny,iy,vy, info)
|
||||
!
|
||||
! y = x A sparse-sparse mode, A in CSR
|
||||
!
|
||||
use psb_base_mod
|
||||
implicit none
|
||||
integer(psb_ipk_), intent(in) :: nx, ix(:)
|
||||
real(psb_dpk_), intent(in) :: alpha, beta, vx(:)
|
||||
integer(psb_ipk_), intent(inout) :: ny, iy(:)
|
||||
real(psb_dpk_), intent(inout) :: vy(:)
|
||||
type(psb_d_csr_sparse_mat), intent(in) :: a
|
||||
integer(psb_ipk_), intent(out) :: info
|
||||
|
||||
integer(psb_ipk_) :: i,j,k,m,n, nv, na, iszy
|
||||
integer(psb_ipk_), allocatable :: iv(:)
|
||||
real(psb_dpk_), allocatable :: vv(:)
|
||||
|
||||
info = 0
|
||||
! !$ write(0,*) 'd_spvspm ',alpha,beta
|
||||
if (beta == -done) then
|
||||
do i=1, ny
|
||||
vy(i) = -vy(i)
|
||||
end do
|
||||
else if (beta == dzero) then
|
||||
do i=1, ny
|
||||
vy(i) = dzero
|
||||
end do
|
||||
else if (beta /= done) then
|
||||
do i=1, ny
|
||||
vy(i) = vy(i) * beta
|
||||
end do
|
||||
end if
|
||||
if (alpha == dzero) return
|
||||
iszy = min(size(iy),size(vy))
|
||||
m = a%get_nrows()
|
||||
n = a%get_ncols()
|
||||
|
||||
if ((ny > m) .or. (nx > n)) then
|
||||
write(0,*) 'Wrong input spmspv rows: ',m,ny,&
|
||||
& ' cols: ',n,nx
|
||||
info = -4
|
||||
return
|
||||
end if
|
||||
|
||||
allocate(iv(m), vv(m), stat=info)
|
||||
if (info /= 0) then
|
||||
write(0,*) 'Allocation error in spmspv'
|
||||
info = -999
|
||||
return
|
||||
endif
|
||||
|
||||
do i = 1, nx
|
||||
j = ix(i)
|
||||
! Access column J of A
|
||||
k = a%irp(j)
|
||||
na = a%irp(j+1) - a%irp(j)
|
||||
call psb_nspaxpby(nv,iv,vv,&
|
||||
& (alpha*vx(i)), na, a%ja(k:k+na-1), a%val(k:k+na-1),&
|
||||
& done, ny, iy, vy, info)
|
||||
|
||||
if (info /= 0) then
|
||||
write(0,*) 'Internal error in spmspv from nspaxpby'
|
||||
info = -998
|
||||
return
|
||||
endif
|
||||
if (nv > iszy) then
|
||||
write(0,*) 'Error in spmspv: out of memory for output'
|
||||
info = -997
|
||||
return
|
||||
endif
|
||||
ny = nv
|
||||
iy(1:ny) = iv(1:ny)
|
||||
vy(1:ny) = vv(1:ny)
|
||||
end do
|
||||
end subroutine psb_d_spvspm
|
||||
|
||||
end module psb_d_biconjg_mod
|
||||
@ -0,0 +1,364 @@
|
||||
!
|
||||
! Parallel Sparse BLAS version 3.5
|
||||
! (C) Copyright 2006-2018
|
||||
! Salvatore Filippone
|
||||
! Alfredo Buttari
|
||||
!
|
||||
! 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 PSBLAS 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 PSBLAS 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.
|
||||
!
|
||||
! Moved here from AMG-AINV, original copyright below.
|
||||
!
|
||||
!
|
||||
! 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.
|
||||
!
|
||||
!
|
||||
!
|
||||
!
|
||||
!
|
||||
! 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.
|
||||
!
|
||||
!
|
||||
module psb_s_biconjg_mod
|
||||
|
||||
interface psb_sparse_biconjg
|
||||
module procedure psb_ssparse_biconjg
|
||||
end interface
|
||||
|
||||
|
||||
abstract interface
|
||||
subroutine psb_ssparse_biconjg_variant(n,a,p,z,w,nzrmax,sp_thresh,info)
|
||||
use psb_base_mod, only : psb_s_csr_sparse_mat, psb_s_csc_sparse_mat, &
|
||||
& psb_spk_, psb_ipk_
|
||||
!
|
||||
implicit none
|
||||
integer(psb_ipk_), intent(in) :: n
|
||||
type(psb_s_csr_sparse_mat), intent(in) :: a
|
||||
type(psb_s_csc_sparse_mat), intent(inout) :: z,w
|
||||
integer(psb_ipk_), intent(in) :: nzrmax
|
||||
real(psb_spk_), intent(in) :: sp_thresh
|
||||
real(psb_spk_), intent(out) :: p(:)
|
||||
integer(psb_ipk_), intent(out) :: info
|
||||
end subroutine psb_ssparse_biconjg_variant
|
||||
end interface
|
||||
|
||||
|
||||
procedure(psb_ssparse_biconjg_variant) :: psb_ssparse_biconjg_llk,&
|
||||
& psb_ssparse_biconjg_s_llk, psb_ssparse_biconjg_s_ft_llk,&
|
||||
& psb_ssparse_biconjg_llk_noth, psb_ssparse_biconjg_mlk
|
||||
|
||||
#if defined(HAVE_TUMA_SAINV)
|
||||
procedure(psb_ssparse_biconjg_variant) :: psb_ssparse_tuma_sainv,&
|
||||
& psb_ssparse_tuma_lainv
|
||||
#endif
|
||||
|
||||
|
||||
contains
|
||||
|
||||
subroutine psb_ssparse_biconjg(alg,n,acsr,p,z,w,nzrmax,sp_thresh,info)
|
||||
use psb_base_mod
|
||||
use psb_base_ainv_mod
|
||||
integer(psb_ipk_), intent(in) :: alg,n
|
||||
type(psb_s_csr_sparse_mat), intent(in) :: acsr
|
||||
type(psb_sspmat_type), intent(out) :: z, w
|
||||
integer(psb_ipk_), intent(in) :: nzrmax
|
||||
real(psb_spk_), intent(in) :: sp_thresh
|
||||
real(psb_spk_), intent(out) :: p(:)
|
||||
integer(psb_ipk_), intent(out) :: info
|
||||
|
||||
type(psb_s_csc_sparse_mat) :: zcsc,wcsc
|
||||
integer(psb_ipk_) :: i,j,k,nrm
|
||||
integer(psb_ipk_) :: err_act
|
||||
character(len=20) :: name='psb_sparse_biconjg'
|
||||
integer(psb_ipk_), parameter :: variant=1
|
||||
|
||||
|
||||
info = psb_success_
|
||||
call psb_erractionsave(err_act)
|
||||
if (psb_errstatus_fatal()) then
|
||||
info = psb_err_internal_error_; goto 9999
|
||||
end if
|
||||
|
||||
if (size(p)<n) then
|
||||
write(psb_err_unit,*) 'Size of P wrong'
|
||||
info = psb_err_internal_error_
|
||||
call psb_errpush(psb_err_internal_error_,name,a_err='Allocate')
|
||||
goto 9999
|
||||
end if
|
||||
|
||||
select case(alg)
|
||||
case (psb_ainv_llk_)
|
||||
call psb_ssparse_biconjg_llk(n,acsr,p,zcsc,wcsc,nzrmax,sp_thresh,info)
|
||||
case (psb_ainv_s_llk_)
|
||||
call psb_ssparse_biconjg_s_llk(n,acsr,p,zcsc,wcsc,nzrmax,sp_thresh,info)
|
||||
case (psb_ainv_mlk_)
|
||||
call psb_ssparse_biconjg_mlk(n,acsr,p,zcsc,wcsc,nzrmax,sp_thresh,info)
|
||||
case (psb_ainv_s_ft_llk_)
|
||||
call psb_ssparse_biconjg_s_ft_llk(n,acsr,p,zcsc,wcsc,nzrmax,sp_thresh,info)
|
||||
case (psb_ainv_llk_noth_)
|
||||
call psb_ssparse_biconjg_llk_noth(n,acsr,p,zcsc,wcsc,nzrmax,sp_thresh,info)
|
||||
!#if defined(HAVE_TUMA_SAINV)
|
||||
! case (psb_ainv_s_tuma_)
|
||||
! call psb_ssparse_tuma_sainv(n,acsr,p,zcsc,wcsc,nzrmax,sp_thresh,info)
|
||||
! case (psb_ainv_l_tuma_)
|
||||
! call psb_ssparse_tuma_lainv(n,acsr,p,zcsc,wcsc,nzrmax,sp_thresh,info)
|
||||
!#endif
|
||||
case default
|
||||
info = psb_err_internal_error_
|
||||
call psb_errpush(info,name,a_err='Invalid alg')
|
||||
goto 9999
|
||||
end select
|
||||
|
||||
if (info /= 0) then
|
||||
info = psb_err_from_subroutine_
|
||||
call psb_errpush(info,name,a_err='sparse_orth')
|
||||
goto 9999
|
||||
end if
|
||||
|
||||
call z%mv_from(zcsc)
|
||||
call z%cscnv(info,type='CSR')
|
||||
call w%mv_from(wcsc)
|
||||
call w%transp()
|
||||
call w%cscnv(info,type='CSR')
|
||||
|
||||
call psb_erractionrestore(err_act)
|
||||
return
|
||||
|
||||
9999 call psb_error_handler(err_act)
|
||||
return
|
||||
end subroutine psb_ssparse_biconjg
|
||||
|
||||
|
||||
subroutine psb_s_spmspv(alpha,a,nx,ix,vx,beta,ny,iy,vy, info)
|
||||
!
|
||||
! y = A x sparse-sparse mode, A in CSC
|
||||
!
|
||||
use psb_base_mod
|
||||
implicit none
|
||||
integer(psb_ipk_), intent(in) :: nx, ix(:)
|
||||
real(psb_spk_), intent(in) :: alpha, beta, vx(:)
|
||||
integer(psb_ipk_), intent(inout) :: ny, iy(:)
|
||||
real(psb_spk_), intent(inout) :: vy(:)
|
||||
type(psb_s_csc_sparse_mat), intent(in) :: a
|
||||
integer(psb_ipk_), intent(out) :: info
|
||||
|
||||
integer(psb_ipk_) :: i,j,k,m,n, nv, na, iszy
|
||||
integer(psb_ipk_), allocatable :: iv(:)
|
||||
real(psb_spk_), allocatable :: vv(:)
|
||||
|
||||
info = 0
|
||||
! !$ write(0,*) 'd_spmspv ',alpha,beta
|
||||
if (beta == -sone) then
|
||||
do i=1, ny
|
||||
vy(i) = -vy(i)
|
||||
end do
|
||||
else if (beta == szero) then
|
||||
do i=1, ny
|
||||
vy(i) = szero
|
||||
end do
|
||||
else if (beta /= sone) then
|
||||
do i=1, ny
|
||||
vy(i) = vy(i) * beta
|
||||
end do
|
||||
end if
|
||||
if (alpha == szero) return
|
||||
iszy = min(size(iy),size(vy))
|
||||
m = a%get_nrows()
|
||||
n = a%get_ncols()
|
||||
|
||||
if ((ny > m) .or. (nx > n)) then
|
||||
write(0,*) 'Wrong input spmspv rows: ',m,ny,&
|
||||
& ' cols: ',n,nx
|
||||
info = -4
|
||||
return
|
||||
end if
|
||||
|
||||
allocate(iv(m), vv(m), stat=info)
|
||||
if (info /= 0) then
|
||||
write(0,*) 'Allocation error in spmspv'
|
||||
info = -999
|
||||
return
|
||||
endif
|
||||
|
||||
do i = 1, nx
|
||||
j = ix(i)
|
||||
! Access column J of A
|
||||
k = a%icp(j)
|
||||
na = a%icp(j+1) - a%icp(j)
|
||||
call psb_nspaxpby(nv,iv,vv,&
|
||||
& (alpha*vx(i)), na, a%ia(k:k+na-1), a%val(k:k+na-1),&
|
||||
& sone, ny, iy, vy, info)
|
||||
|
||||
if (info /= 0) then
|
||||
write(0,*) 'Internal error in spmspv from nspaxpby'
|
||||
info = -998
|
||||
return
|
||||
endif
|
||||
if (nv > iszy) then
|
||||
write(0,*) 'Error in spmspv: out of memory for output'
|
||||
info = -997
|
||||
return
|
||||
endif
|
||||
ny = nv
|
||||
iy(1:ny) = iv(1:ny)
|
||||
vy(1:ny) = vv(1:ny)
|
||||
end do
|
||||
end subroutine psb_s_spmspv
|
||||
|
||||
|
||||
subroutine psb_s_spvspm(alpha,a,nx,ix,vx,beta,ny,iy,vy, info)
|
||||
!
|
||||
! y = x A sparse-sparse mode, A in CSR
|
||||
!
|
||||
use psb_base_mod
|
||||
implicit none
|
||||
integer(psb_ipk_), intent(in) :: nx, ix(:)
|
||||
real(psb_spk_), intent(in) :: alpha, beta, vx(:)
|
||||
integer(psb_ipk_), intent(inout) :: ny, iy(:)
|
||||
real(psb_spk_), intent(inout) :: vy(:)
|
||||
type(psb_s_csr_sparse_mat), intent(in) :: a
|
||||
integer(psb_ipk_), intent(out) :: info
|
||||
|
||||
integer(psb_ipk_) :: i,j,k,m,n, nv, na, iszy
|
||||
integer(psb_ipk_), allocatable :: iv(:)
|
||||
real(psb_spk_), allocatable :: vv(:)
|
||||
|
||||
info = 0
|
||||
! !$ write(0,*) 'd_spvspm ',alpha,beta
|
||||
if (beta == -sone) then
|
||||
do i=1, ny
|
||||
vy(i) = -vy(i)
|
||||
end do
|
||||
else if (beta == szero) then
|
||||
do i=1, ny
|
||||
vy(i) = szero
|
||||
end do
|
||||
else if (beta /= sone) then
|
||||
do i=1, ny
|
||||
vy(i) = vy(i) * beta
|
||||
end do
|
||||
end if
|
||||
if (alpha == szero) return
|
||||
iszy = min(size(iy),size(vy))
|
||||
m = a%get_nrows()
|
||||
n = a%get_ncols()
|
||||
|
||||
if ((ny > m) .or. (nx > n)) then
|
||||
write(0,*) 'Wrong input spmspv rows: ',m,ny,&
|
||||
& ' cols: ',n,nx
|
||||
info = -4
|
||||
return
|
||||
end if
|
||||
|
||||
allocate(iv(m), vv(m), stat=info)
|
||||
if (info /= 0) then
|
||||
write(0,*) 'Allocation error in spmspv'
|
||||
info = -999
|
||||
return
|
||||
endif
|
||||
|
||||
do i = 1, nx
|
||||
j = ix(i)
|
||||
! Access column J of A
|
||||
k = a%irp(j)
|
||||
na = a%irp(j+1) - a%irp(j)
|
||||
call psb_nspaxpby(nv,iv,vv,&
|
||||
& (alpha*vx(i)), na, a%ja(k:k+na-1), a%val(k:k+na-1),&
|
||||
& sone, ny, iy, vy, info)
|
||||
|
||||
if (info /= 0) then
|
||||
write(0,*) 'Internal error in spmspv from nspaxpby'
|
||||
info = -998
|
||||
return
|
||||
endif
|
||||
if (nv > iszy) then
|
||||
write(0,*) 'Error in spmspv: out of memory for output'
|
||||
info = -997
|
||||
return
|
||||
endif
|
||||
ny = nv
|
||||
iy(1:ny) = iv(1:ny)
|
||||
vy(1:ny) = vv(1:ny)
|
||||
end do
|
||||
end subroutine psb_s_spvspm
|
||||
|
||||
end module psb_s_biconjg_mod
|
||||
@ -0,0 +1,364 @@
|
||||
!
|
||||
! Parallel Sparse BLAS version 3.5
|
||||
! (C) Copyright 2006-2018
|
||||
! Salvatore Filippone
|
||||
! Alfredo Buttari
|
||||
!
|
||||
! 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 PSBLAS 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 PSBLAS 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.
|
||||
!
|
||||
! Moved here from AMG-AINV, original copyright below.
|
||||
!
|
||||
!
|
||||
! 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.
|
||||
!
|
||||
!
|
||||
!
|
||||
!
|
||||
!
|
||||
! 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.
|
||||
!
|
||||
!
|
||||
module psb_z_biconjg_mod
|
||||
|
||||
interface psb_sparse_biconjg
|
||||
module procedure psb_zsparse_biconjg
|
||||
end interface
|
||||
|
||||
|
||||
abstract interface
|
||||
subroutine psb_zsparse_biconjg_variant(n,a,p,z,w,nzrmax,sp_thresh,info)
|
||||
use psb_base_mod, only : psb_z_csr_sparse_mat, psb_z_csc_sparse_mat, &
|
||||
& psb_dpk_, psb_ipk_
|
||||
!
|
||||
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
|
||||
end subroutine psb_zsparse_biconjg_variant
|
||||
end interface
|
||||
|
||||
|
||||
procedure(psb_zsparse_biconjg_variant) :: psb_zsparse_biconjg_llk,&
|
||||
& psb_zsparse_biconjg_s_llk, psb_zsparse_biconjg_s_ft_llk,&
|
||||
& psb_zsparse_biconjg_llk_noth, psb_zsparse_biconjg_mlk
|
||||
|
||||
#if defined(HAVE_TUMA_SAINV)
|
||||
procedure(psb_zsparse_biconjg_variant) :: psb_zsparse_tuma_sainv,&
|
||||
& psb_zsparse_tuma_lainv
|
||||
#endif
|
||||
|
||||
|
||||
contains
|
||||
|
||||
subroutine psb_zsparse_biconjg(alg,n,acsr,p,z,w,nzrmax,sp_thresh,info)
|
||||
use psb_base_mod
|
||||
use psb_base_ainv_mod
|
||||
integer(psb_ipk_), intent(in) :: alg,n
|
||||
type(psb_z_csr_sparse_mat), intent(in) :: acsr
|
||||
type(psb_zspmat_type), intent(out) :: 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
|
||||
|
||||
type(psb_z_csc_sparse_mat) :: zcsc,wcsc
|
||||
integer(psb_ipk_) :: i,j,k,nrm
|
||||
integer(psb_ipk_) :: err_act
|
||||
character(len=20) :: name='psb_sparse_biconjg'
|
||||
integer(psb_ipk_), parameter :: variant=1
|
||||
|
||||
|
||||
info = psb_success_
|
||||
call psb_erractionsave(err_act)
|
||||
if (psb_errstatus_fatal()) then
|
||||
info = psb_err_internal_error_; goto 9999
|
||||
end if
|
||||
|
||||
if (size(p)<n) then
|
||||
write(psb_err_unit,*) 'Size of P wrong'
|
||||
info = psb_err_internal_error_
|
||||
call psb_errpush(psb_err_internal_error_,name,a_err='Allocate')
|
||||
goto 9999
|
||||
end if
|
||||
|
||||
select case(alg)
|
||||
case (psb_ainv_llk_)
|
||||
call psb_zsparse_biconjg_llk(n,acsr,p,zcsc,wcsc,nzrmax,sp_thresh,info)
|
||||
case (psb_ainv_s_llk_)
|
||||
call psb_zsparse_biconjg_s_llk(n,acsr,p,zcsc,wcsc,nzrmax,sp_thresh,info)
|
||||
case (psb_ainv_mlk_)
|
||||
call psb_zsparse_biconjg_mlk(n,acsr,p,zcsc,wcsc,nzrmax,sp_thresh,info)
|
||||
case (psb_ainv_s_ft_llk_)
|
||||
call psb_zsparse_biconjg_s_ft_llk(n,acsr,p,zcsc,wcsc,nzrmax,sp_thresh,info)
|
||||
case (psb_ainv_llk_noth_)
|
||||
call psb_zsparse_biconjg_llk_noth(n,acsr,p,zcsc,wcsc,nzrmax,sp_thresh,info)
|
||||
!#if defined(HAVE_TUMA_SAINV)
|
||||
! case (psb_ainv_s_tuma_)
|
||||
! call psb_zsparse_tuma_sainv(n,acsr,p,zcsc,wcsc,nzrmax,sp_thresh,info)
|
||||
! case (psb_ainv_l_tuma_)
|
||||
! call psb_zsparse_tuma_lainv(n,acsr,p,zcsc,wcsc,nzrmax,sp_thresh,info)
|
||||
!#endif
|
||||
case default
|
||||
info = psb_err_internal_error_
|
||||
call psb_errpush(info,name,a_err='Invalid alg')
|
||||
goto 9999
|
||||
end select
|
||||
|
||||
if (info /= 0) then
|
||||
info = psb_err_from_subroutine_
|
||||
call psb_errpush(info,name,a_err='sparse_orth')
|
||||
goto 9999
|
||||
end if
|
||||
|
||||
call z%mv_from(zcsc)
|
||||
call z%cscnv(info,type='CSR')
|
||||
call w%mv_from(wcsc)
|
||||
call w%transp()
|
||||
call w%cscnv(info,type='CSR')
|
||||
|
||||
call psb_erractionrestore(err_act)
|
||||
return
|
||||
|
||||
9999 call psb_error_handler(err_act)
|
||||
return
|
||||
end subroutine psb_zsparse_biconjg
|
||||
|
||||
|
||||
subroutine psb_z_spmspv(alpha,a,nx,ix,vx,beta,ny,iy,vy, info)
|
||||
!
|
||||
! y = A x sparse-sparse mode, A in CSC
|
||||
!
|
||||
use psb_base_mod
|
||||
implicit none
|
||||
integer(psb_ipk_), intent(in) :: nx, ix(:)
|
||||
complex(psb_dpk_), intent(in) :: alpha, beta, vx(:)
|
||||
integer(psb_ipk_), intent(inout) :: ny, iy(:)
|
||||
complex(psb_dpk_), intent(inout) :: vy(:)
|
||||
type(psb_z_csc_sparse_mat), intent(in) :: a
|
||||
integer(psb_ipk_), intent(out) :: info
|
||||
|
||||
integer(psb_ipk_) :: i,j,k,m,n, nv, na, iszy
|
||||
integer(psb_ipk_), allocatable :: iv(:)
|
||||
complex(psb_dpk_), allocatable :: vv(:)
|
||||
|
||||
info = 0
|
||||
! !$ write(0,*) 'd_spmspv ',alpha,beta
|
||||
if (beta == -zone) then
|
||||
do i=1, ny
|
||||
vy(i) = -vy(i)
|
||||
end do
|
||||
else if (beta == zzero) then
|
||||
do i=1, ny
|
||||
vy(i) = zzero
|
||||
end do
|
||||
else if (beta /= zone) then
|
||||
do i=1, ny
|
||||
vy(i) = vy(i) * beta
|
||||
end do
|
||||
end if
|
||||
if (alpha == zzero) return
|
||||
iszy = min(size(iy),size(vy))
|
||||
m = a%get_nrows()
|
||||
n = a%get_ncols()
|
||||
|
||||
if ((ny > m) .or. (nx > n)) then
|
||||
write(0,*) 'Wrong input spmspv rows: ',m,ny,&
|
||||
& ' cols: ',n,nx
|
||||
info = -4
|
||||
return
|
||||
end if
|
||||
|
||||
allocate(iv(m), vv(m), stat=info)
|
||||
if (info /= 0) then
|
||||
write(0,*) 'Allocation error in spmspv'
|
||||
info = -999
|
||||
return
|
||||
endif
|
||||
|
||||
do i = 1, nx
|
||||
j = ix(i)
|
||||
! Access column J of A
|
||||
k = a%icp(j)
|
||||
na = a%icp(j+1) - a%icp(j)
|
||||
call psb_nspaxpby(nv,iv,vv,&
|
||||
& (alpha*vx(i)), na, a%ia(k:k+na-1), a%val(k:k+na-1),&
|
||||
& zone, ny, iy, vy, info)
|
||||
|
||||
if (info /= 0) then
|
||||
write(0,*) 'Internal error in spmspv from nspaxpby'
|
||||
info = -998
|
||||
return
|
||||
endif
|
||||
if (nv > iszy) then
|
||||
write(0,*) 'Error in spmspv: out of memory for output'
|
||||
info = -997
|
||||
return
|
||||
endif
|
||||
ny = nv
|
||||
iy(1:ny) = iv(1:ny)
|
||||
vy(1:ny) = vv(1:ny)
|
||||
end do
|
||||
end subroutine psb_z_spmspv
|
||||
|
||||
|
||||
subroutine psb_z_spvspm(alpha,a,nx,ix,vx,beta,ny,iy,vy, info)
|
||||
!
|
||||
! y = x A sparse-sparse mode, A in CSR
|
||||
!
|
||||
use psb_base_mod
|
||||
implicit none
|
||||
integer(psb_ipk_), intent(in) :: nx, ix(:)
|
||||
complex(psb_dpk_), intent(in) :: alpha, beta, vx(:)
|
||||
integer(psb_ipk_), intent(inout) :: ny, iy(:)
|
||||
complex(psb_dpk_), intent(inout) :: vy(:)
|
||||
type(psb_z_csr_sparse_mat), intent(in) :: a
|
||||
integer(psb_ipk_), intent(out) :: info
|
||||
|
||||
integer(psb_ipk_) :: i,j,k,m,n, nv, na, iszy
|
||||
integer(psb_ipk_), allocatable :: iv(:)
|
||||
complex(psb_dpk_), allocatable :: vv(:)
|
||||
|
||||
info = 0
|
||||
! !$ write(0,*) 'd_spvspm ',alpha,beta
|
||||
if (beta == -zone) then
|
||||
do i=1, ny
|
||||
vy(i) = -vy(i)
|
||||
end do
|
||||
else if (beta == zzero) then
|
||||
do i=1, ny
|
||||
vy(i) = zzero
|
||||
end do
|
||||
else if (beta /= zone) then
|
||||
do i=1, ny
|
||||
vy(i) = vy(i) * beta
|
||||
end do
|
||||
end if
|
||||
if (alpha == zzero) return
|
||||
iszy = min(size(iy),size(vy))
|
||||
m = a%get_nrows()
|
||||
n = a%get_ncols()
|
||||
|
||||
if ((ny > m) .or. (nx > n)) then
|
||||
write(0,*) 'Wrong input spmspv rows: ',m,ny,&
|
||||
& ' cols: ',n,nx
|
||||
info = -4
|
||||
return
|
||||
end if
|
||||
|
||||
allocate(iv(m), vv(m), stat=info)
|
||||
if (info /= 0) then
|
||||
write(0,*) 'Allocation error in spmspv'
|
||||
info = -999
|
||||
return
|
||||
endif
|
||||
|
||||
do i = 1, nx
|
||||
j = ix(i)
|
||||
! Access column J of A
|
||||
k = a%irp(j)
|
||||
na = a%irp(j+1) - a%irp(j)
|
||||
call psb_nspaxpby(nv,iv,vv,&
|
||||
& (alpha*vx(i)), na, a%ja(k:k+na-1), a%val(k:k+na-1),&
|
||||
& zone, ny, iy, vy, info)
|
||||
|
||||
if (info /= 0) then
|
||||
write(0,*) 'Internal error in spmspv from nspaxpby'
|
||||
info = -998
|
||||
return
|
||||
endif
|
||||
if (nv > iszy) then
|
||||
write(0,*) 'Error in spmspv: out of memory for output'
|
||||
info = -997
|
||||
return
|
||||
endif
|
||||
ny = nv
|
||||
iy(1:ny) = iv(1:ny)
|
||||
vy(1:ny) = vv(1:ny)
|
||||
end do
|
||||
end subroutine psb_z_spvspm
|
||||
|
||||
end module psb_z_biconjg_mod
|
||||
Loading…
Reference in New Issue