fdurastante
/
psblas3
mirror of https://github.com/sfilippone/psblas3.git
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

White space changes only

Browse Source 
- Delete trainling white space
 - Use native line endings (hopefully)
pull/5/head
Izaak Beekman 9 years ago
parent e5571d1b53
commit dde3bb6cb6
4 changed files with 1476 additions and 1484 deletions
Show Stats Download Patch File Download Diff File

740
krylov/psb_cgcr.f90
Unescape Escape View File

@ -1,371 +1,369 @@
! !
! Parallel Sparse BLAS version 3.5 ! Parallel Sparse BLAS version 3.5
! (C) Copyright 2006, 2010, 2015, 2017 ! (C) Copyright 2006, 2010, 2015, 2017
! Salvatore Filippone Cranfield University ! Salvatore Filippone Cranfield University
! Alfredo Buttari CNRS-IRIT, Toulouse ! Alfredo Buttari CNRS-IRIT, Toulouse
! !
! Redistribution and use in source and binary forms, with or without ! Redistribution and use in source and binary forms, with or without
! modification, are permitted provided that the following conditions ! modification, are permitted provided that the following conditions
! are met: ! are met:
! 1. Redistributions of source code must retain the above copyright ! 1. Redistributions of source code must retain the above copyright
! notice, this list of conditions and the following disclaimer. ! notice, this list of conditions and the following disclaimer.
! 2. Redistributions in binary form must reproduce the above copyright ! 2. Redistributions in binary form must reproduce the above copyright
! notice, this list of conditions, and the following disclaimer in the ! notice, this list of conditions, and the following disclaimer in the
! documentation and/or other materials provided with the distribution. ! documentation and/or other materials provided with the distribution.
! 3. The name of the PSBLAS group or the names of its contributors may ! 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 ! not be used to endorse or promote products derived from this
! software without specific written permission. ! software without specific written permission.
! !
! THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS ! THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
! ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED ! ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
! TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR ! TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
! PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE PSBLAS GROUP OR ITS CONTRIBUTORS ! PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE PSBLAS GROUP OR ITS CONTRIBUTORS
! BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR ! BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
! CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF ! CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
! SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS ! SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
! INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN ! INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
! CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ! 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 ! ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
! POSSIBILITY OF SUCH DAMAGE. ! POSSIBILITY OF SUCH DAMAGE.
! !
! !
! File: psb_cgcr.f90 ! File: psb_cgcr.f90
!! !!
!! Contributors: Ambra Abdullahi (UNITOV) and Pasqua D’Ambra (IAC-CNR) !! Contributors: Ambra Abdullahi (UNITOV) and Pasqua D’Ambra (IAC-CNR)
!! !!
! CCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCC ! CCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCC
! C C ! C C
! C References: C ! C References: C
! C [1] Duff, I., Marrone, M., Radicati, G., and Vittoli, C. C ! C [1] Duff, I., Marrone, M., Radicati, G., and Vittoli, C. C
! C Level 3 basic linear algebra subprograms for sparse C ! C Level 3 basic linear algebra subprograms for sparse C
! C matrices: a user level interface C ! C matrices: a user level interface C
! C ACM Trans. Math. Softw., 23(3), 379-401, 1997. C ! C ACM Trans. Math. Softw., 23(3), 379-401, 1997. C
! C C ! C C
! C C ! C C
! C [2] S. Filippone, M. Colajanni C ! C [2] S. Filippone, M. Colajanni C
! C PSBLAS: A library for parallel linear algebra C ! C PSBLAS: A library for parallel linear algebra C
! C computation on sparse matrices C ! C computation on sparse matrices C
! C ACM Trans. on Math. Softw., 26(4), 527-550, Dec. 2000. C ! C ACM Trans. on Math. Softw., 26(4), 527-550, Dec. 2000. C
! C C ! C C
! C [3] M. Arioli, I. Duff, M. Ruiz C ! C [3] M. Arioli, I. Duff, M. Ruiz C
! C Stopping criteria for iterative solvers C ! C Stopping criteria for iterative solvers C
! C SIAM J. Matrix Anal. Appl., Vol. 13, pp. 138-144, 1992 C ! C SIAM J. Matrix Anal. Appl., Vol. 13, pp. 138-144, 1992 C
! C C ! C C
! C C ! C C
! C [4] R. Barrett et al C ! C [4] R. Barrett et al C
! C Templates for the solution of linear systems C ! C Templates for the solution of linear systems C
! C SIAM, 1993 ! C SIAM, 1993
! C C ! C C
! C [4] Notay, Yvan C ! C [4] Notay, Yvan C
! C Aggregation-based algebraic multigrid method C ! C Aggregation-based algebraic multigrid method C
! C SIAM Journal on Scientific Computing 34, C ! C SIAM Journal on Scientific Computing 34, C
! C pp. A2288-A2316, 2012 C ! C pp. A2288-A2316, 2012 C
! C C ! C C
! C C ! C C
! CCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCC ! CCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCC
! File: psb_cgcr.f90 ! File: psb_cgcr.f90
! !
! Subroutine: psb_cgcr ! Subroutine: psb_cgcr
! This subroutine implements the GCR method. ! This subroutine implements the GCR method.
! !
! !
! Arguments: ! Arguments:
! !
! a - type(psb_cspmat_type) Input: sparse matrix containing A. ! a - type(psb_cspmat_type) Input: sparse matrix containing A.
! prec - class(psb_cprec_type) Input: preconditioner ! prec - class(psb_cprec_type) Input: preconditioner
! b(:) - real Input: vector containing the ! b(:) - real Input: vector containing the
! right hand side B ! right hand side B
! x(:) - real Input/Output: vector containing the ! x(:) - real Input/Output: vector containing the
! initial guess and final solution X. ! initial guess and final solution X.
! eps - real Input: Stopping tolerance; the iteration is ! eps - real Input: Stopping tolerance; the iteration is
! stopped when the error estimate |err| <= eps ! stopped when the error estimate |err| <= eps
! desc_a - type(psb_desc_type). Input: The communication descriptor. ! desc_a - type(psb_desc_type). Input: The communication descriptor.
! info - integer. Output: Return code ! info - integer. Output: Return code
! !
! itmax - integer(optional) Input: maximum number of iterations to be ! itmax - integer(optional) Input: maximum number of iterations to be
! performed. ! performed.
! iter - integer(optional) Output: how many iterations have been ! iter - integer(optional) Output: how many iterations have been
! performed. ! performed.
! performed. ! performed.
! err - real (optional) Output: error estimate on exit. If the ! err - real (optional) Output: error estimate on exit. If the
! denominator of the estimate is exactly ! denominator of the estimate is exactly
! 0, it is changed into 1. ! 0, it is changed into 1.
! itrace - integer(optional) Input: print an informational message ! itrace - integer(optional) Input: print an informational message
! with the error estimate every itrace ! with the error estimate every itrace
! iterations ! iterations
! istop - integer(optional) Input: stopping criterion, or how ! istop - integer(optional) Input: stopping criterion, or how
! to estimate the error. ! to estimate the error.
! 1: err = |r|/(|a||x|+|b|); here the iteration is ! 1: err = |r|/(|a||x|+|b|); here the iteration is
! stopped when |r| <= eps * (|a||x|+|b|) ! stopped when |r| <= eps * (|a||x|+|b|)
! 2: err = |r|/|b|; here the iteration is ! 2: err = |r|/|b|; here the iteration is
! stopped when |r| <= eps * |b| ! stopped when |r| <= eps * |b|
! where r is the (preconditioned, recursive ! where r is the (preconditioned, recursive
! estimate of) residual. ! estimate of) residual.
! !
! irst - integer(optional) Input: restart parameter ! irst - integer(optional) Input: restart parameter
! !
subroutine psb_cgcr_vect(a,prec,b,x,eps,desc_a,info,& subroutine psb_cgcr_vect(a,prec,b,x,eps,desc_a,info,&
& itmax,iter,err,itrace, irst, istop) & itmax,iter,err,itrace, irst, istop)
use psb_base_mod use psb_base_mod
use psb_prec_mod use psb_prec_mod
use psb_c_krylov_conv_mod use psb_c_krylov_conv_mod
use psb_krylov_mod use psb_krylov_mod
implicit none implicit none
type(psb_cspmat_type), intent(in) :: a type(psb_cspmat_type), intent(in) :: a
Type(psb_desc_type), Intent(in) :: desc_a Type(psb_desc_type), Intent(in) :: desc_a
class(psb_cprec_type), intent(inout) :: prec class(psb_cprec_type), intent(inout) :: prec
type(psb_c_vect_type), Intent(inout) :: b type(psb_c_vect_type), Intent(inout) :: b
type(psb_c_vect_type), Intent(inout) :: x type(psb_c_vect_type), Intent(inout) :: x
real(psb_spk_), Intent(in) :: eps real(psb_spk_), Intent(in) :: eps
integer(psb_ipk_), intent(out) :: info integer(psb_ipk_), intent(out) :: info
integer(psb_ipk_), Optional, Intent(in) :: itmax, itrace, irst, istop integer(psb_ipk_), Optional, Intent(in) :: itmax, itrace, irst, istop
integer(psb_ipk_), Optional, Intent(out) :: iter integer(psb_ipk_), Optional, Intent(out) :: iter
real(psb_spk_), Optional, Intent(out) :: err real(psb_spk_), Optional, Intent(out) :: err
! = local data ! = local data
complex(psb_spk_), allocatable :: alpha(:), h(:,:) complex(psb_spk_), allocatable :: alpha(:), h(:,:)
type(psb_c_vect_type), allocatable :: z(:), c(:), c_scale(:) type(psb_c_vect_type), allocatable :: z(:), c(:), c_scale(:)
type(psb_c_vect_type) :: r type(psb_c_vect_type) :: r
real(psb_dpk_) :: r_norm, b_norm, a_norm, derr real(psb_dpk_) :: r_norm, b_norm, a_norm, derr
integer(psb_ipk_) :: n_col, mglob, naux, err_act integer(psb_ipk_) :: n_col, mglob, naux, err_act
integer(psb_ipk_) :: debug_level, debug_unit integer(psb_ipk_) :: debug_level, debug_unit
integer(psb_ipk_) :: np, me, ictxt integer(psb_ipk_) :: np, me, ictxt
integer(psb_ipk_) :: i, j, it, itx, istop_, itmax_, itrace_, nl, m, nrst integer(psb_ipk_) :: i, j, it, itx, istop_, itmax_, itrace_, nl, m, nrst
complex(psb_spk_) :: hjj complex(psb_spk_) :: hjj
complex(psb_spk_), allocatable, target :: aux(:) complex(psb_spk_), allocatable, target :: aux(:)
character(len=20) :: name character(len=20) :: name
type(psb_itconv_type) :: stopdat type(psb_itconv_type) :: stopdat
character(len=*), parameter :: methdname='GCR' character(len=*), parameter :: methdname='GCR'
integer(psb_ipk_) ::int_err(5) integer(psb_ipk_) ::int_err(5)
info = psb_success_ info = psb_success_
name = 'psb_cgcr' name = 'psb_cgcr'
call psb_erractionsave(err_act) call psb_erractionsave(err_act)
debug_unit = psb_get_debug_unit() debug_unit = psb_get_debug_unit()
debug_level = psb_get_debug_level() debug_level = psb_get_debug_level()
ictxt = desc_a%get_context() ictxt = desc_a%get_context()
call psb_info(ictxt, me, np) call psb_info(ictxt, me, np)
if (.not.allocated(b%v)) then if (.not.allocated(b%v)) then
info = psb_err_invalid_vect_state_ info = psb_err_invalid_vect_state_
call psb_errpush(info,name) call psb_errpush(info,name)
goto 9999 goto 9999
endif endif
if (.not.allocated(x%v)) then if (.not.allocated(x%v)) then
info = psb_err_invalid_vect_state_ info = psb_err_invalid_vect_state_
call psb_errpush(info,name) call psb_errpush(info,name)
goto 9999 goto 9999
endif endif
mglob = desc_a%get_global_rows() mglob = desc_a%get_global_rows()
n_col = desc_a%get_local_cols() n_col = desc_a%get_local_cols()
if (present(istop)) then if (present(istop)) then
istop_ = istop istop_ = istop
else else
istop_ = 2 istop_ = 2
endif endif
! !
! ISTOP_ = 1: Normwise backward error, infinity norm ! ISTOP_ = 1: Normwise backward error, infinity norm
! ISTOP_ = 2: ||r||/||b||, 2-norm ! ISTOP_ = 2: ||r||/||b||, 2-norm
! !
if ((istop_ < 1 ).or.(istop_ > 2 ) ) then if ((istop_ < 1 ).or.(istop_ > 2 ) ) then
info=psb_err_invalid_istop_ info=psb_err_invalid_istop_
int_err(1)=istop_ int_err(1)=istop_
err=info err=info
call psb_errpush(info,name,i_err=int_err) call psb_errpush(info,name,i_err=int_err)
goto 9999 goto 9999
endif endif
call psb_chkvect(mglob,ione,x%get_nrows(),ione,ione,desc_a,info) call psb_chkvect(mglob,ione,x%get_nrows(),ione,ione,desc_a,info)
if (info == psb_success_)& if (info == psb_success_)&
& call psb_chkvect(mglob,ione,b%get_nrows(),ione,ione,desc_a,info) & call psb_chkvect(mglob,ione,b%get_nrows(),ione,ione,desc_a,info)
if(info /= psb_success_) then if(info /= psb_success_) then
info=psb_err_from_subroutine_ info=psb_err_from_subroutine_
call psb_errpush(info,name,a_err='psb_chkvect on X/B') call psb_errpush(info,name,a_err='psb_chkvect on X/B')
goto 9999 goto 9999
end if end if
if (present(itmax)) then if (present(itmax)) then
itmax_ = itmax itmax_ = itmax
else else
itmax_ = 1000 itmax_ = 1000
endif endif
if (present(itrace)) then if (present(itrace)) then
itrace_ = itrace itrace_ = itrace
else else
itrace_ = 0 itrace_ = 0
end if end if
if (present(irst)) then if (present(irst)) then
nl = irst nl = irst
if (debug_level >= psb_debug_ext_) & if (debug_level >= psb_debug_ext_) &
& write(debug_unit,*) me,' ',trim(name),& & write(debug_unit,*) me,' ',trim(name),&
& ' present: irst: ',irst,nl & ' present: irst: ',irst,nl
else else
nl = 10 nl = 10
if (debug_level >= psb_debug_ext_) & if (debug_level >= psb_debug_ext_) &
& write(debug_unit,*) me,' ',trim(name),& & write(debug_unit,*) me,' ',trim(name),&
& ' not present: irst: ',irst,nl & ' not present: irst: ',irst,nl
endif endif
if (nl <=0 ) then if (nl <=0 ) then
info=psb_err_invalid_istop_ info=psb_err_invalid_istop_
int_err(1)=nl int_err(1)=nl
err=info err=info
call psb_errpush(info,name,i_err=int_err) call psb_errpush(info,name,i_err=int_err)
goto 9999 goto 9999
endif endif
naux=4*n_col naux=4*n_col
allocate(aux(naux),h(nl+1,nl+1),& allocate(aux(naux),h(nl+1,nl+1),&
&c_scale(nl+1),c(nl+1),z(nl+1), alpha(nl+1), stat=info) &c_scale(nl+1),c(nl+1),z(nl+1), alpha(nl+1), stat=info)
h = czero h = czero
if (info /= psb_success_) then if (info /= psb_success_) then
info=psb_err_from_subroutine_non_ info=psb_err_from_subroutine_non_
call psb_errpush(info,name) call psb_errpush(info,name)
goto 9999 goto 9999
end if end if
call psb_geasb(r, desc_a,info, scratch=.true.,mold=x%v) call psb_geasb(r, desc_a,info, scratch=.true.,mold=x%v)
do i =1,nl+1 do i =1,nl+1
call psb_geasb(c(i), desc_a,info, scratch=.true.,mold=x%v) call psb_geasb(c(i), desc_a,info, scratch=.true.,mold=x%v)
call psb_geasb(z(i), desc_a,info, scratch=.true.,mold=x%v) call psb_geasb(z(i), desc_a,info, scratch=.true.,mold=x%v)
call psb_geasb(c_scale(i), desc_a,info, scratch=.true.,mold=x%v) call psb_geasb(c_scale(i), desc_a,info, scratch=.true.,mold=x%v)
end do end do
itx = 0 itx = 0
nrst = -1 nrst = -1
call psb_init_conv(methdname,istop_,itrace_,itmax_,a,x,b,eps,desc_a,stopdat,info) call psb_init_conv(methdname,istop_,itrace_,itmax_,a,x,b,eps,desc_a,stopdat,info)
restart: do restart: do
if (itx>= itmax_) exit restart if (itx>= itmax_) exit restart
h = czero h = czero
it = 0 it = 0
! compute r0 = b-ax0 ! compute r0 = b-ax0
if (info /= psb_success_) then if (info /= psb_success_) then
info=psb_err_from_subroutine_non_ info=psb_err_from_subroutine_non_
call psb_errpush(info,name) call psb_errpush(info,name)
goto 9999 goto 9999
end if end if
call psb_geaxpby(cone, b, czero, r, desc_a, info) call psb_geaxpby(cone, b, czero, r, desc_a, info)
call psb_spmm(-cone,a,x,cone,r,desc_a,info,work=aux) call psb_spmm(-cone,a,x,cone,r,desc_a,info,work=aux)
if (info /= psb_success_) then if (info /= psb_success_) then
info=psb_err_from_subroutine_non_ info=psb_err_from_subroutine_non_
call psb_errpush(info,name) call psb_errpush(info,name)
goto 9999 goto 9999
end if end if
if (psb_check_conv(methdname,itx,x,r,desc_a,stopdat,info)) exit restart if (psb_check_conv(methdname,itx,x,r,desc_a,stopdat,info)) exit restart
nrst = nrst + 1 nrst = nrst + 1
iteration: do iteration: do
itx = itx + 1 itx = itx + 1
it = it + 1 it = it + 1
j = it j = it
!Apply preconditioner !Apply preconditioner
call prec%apply(r,z(j),desc_a,info,work=aux) call prec%apply(r,z(j),desc_a,info,work=aux)
call psb_spmm(cone,a,z(j),czero,c(1),desc_a,info,work=aux) call psb_spmm(cone,a,z(j),czero,c(1),desc_a,info,work=aux)
do i =1, j - 1 do i =1, j - 1
h(i,j) = psb_gedot(c_scale(i), c(i), desc_a, info) h(i,j) = psb_gedot(c_scale(i), c(i), desc_a, info)
call psb_geaxpby(cone, c(i), czero, c(i+1), desc_a, info) call psb_geaxpby(cone, c(i), czero, c(i+1), desc_a, info)
call psb_geaxpby(-h(i,j), c_scale(i), cone, c(i+1), desc_a, info) call psb_geaxpby(-h(i,j), c_scale(i), cone, c(i+1), desc_a, info)
end do end do
h(j,j) = psb_norm2(c(j), desc_a, info) h(j,j) = psb_norm2(c(j), desc_a, info)
hjj = cone/h(j,j) hjj = cone/h(j,j)
call psb_geaxpby(hjj, c(j), czero, c_scale(j), desc_a, info) call psb_geaxpby(hjj, c(j), czero, c_scale(j), desc_a, info)
alpha(j) = psb_gedot(c_scale(j), r, desc_a, info) alpha(j) = psb_gedot(c_scale(j), r, desc_a, info)
!Update residual !Update residual
call psb_geaxpby(cone, r, czero, r, desc_a, info) call psb_geaxpby(cone, r, czero, r, desc_a, info)
call psb_geaxpby(-alpha(j), c_scale(j), cone, r, desc_a, info) call psb_geaxpby(-alpha(j), c_scale(j), cone, r, desc_a, info)
if (psb_check_conv(methdname,itx,x,r,desc_a,stopdat,info)) exit restart if (psb_check_conv(methdname,itx,x,r,desc_a,stopdat,info)) exit restart
if (j >= irst) exit iteration if (j >= irst) exit iteration
end do iteration end do iteration
m = j m = j
!Compute solution !Compute solution
call ctrsm('l','u','n','n',m,1,cone,h,size(h,1),alpha,size(alpha,1)) call ctrsm('l','u','n','n',m,1,cone,h,size(h,1),alpha,size(alpha,1))
if (nrst == 0 ) then if (nrst == 0 ) then
call x%set(czero) call x%set(czero)
endif endif
do i=1,m do i=1,m
call psb_geaxpby(alpha(i), z(i), cone, x, desc_a, info) call psb_geaxpby(alpha(i), z(i), cone, x, desc_a, info)
enddo enddo
end do restart end do restart
m = j m = j
!Compute solution !Compute solution
call ctrsm('l','u','n','n',m,1,cone,h,size(h,1),alpha,size(alpha,1)) call ctrsm('l','u','n','n',m,1,cone,h,size(h,1),alpha,size(alpha,1))
call x%set(czero) call x%set(czero)
do i=1,m do i=1,m
call psb_geaxpby(alpha(i), z(i), cone, x, desc_a, info) call psb_geaxpby(alpha(i), z(i), cone, x, desc_a, info)
enddo enddo
iter = j iter = j
call psb_end_conv(methdname,itx,desc_a,stopdat,info,derr,iter) call psb_end_conv(methdname,itx,desc_a,stopdat,info,derr,iter)
if (present(err)) err = derr if (present(err)) err = derr
if (info == psb_success_) call psb_gefree(r,desc_a,info) if (info == psb_success_) call psb_gefree(r,desc_a,info)
do j = 1,m do j = 1,m
if (info == psb_success_) call psb_gefree(z(j),desc_a,info) if (info == psb_success_) call psb_gefree(z(j),desc_a,info)
if (info == psb_success_) call psb_gefree(c_scale(j),desc_a,info) if (info == psb_success_) call psb_gefree(c_scale(j),desc_a,info)
enddo enddo
do i =1,nl+1 do i =1,nl+1
if (info == psb_success_) call psb_gefree(c(i),desc_a,info) if (info == psb_success_) call psb_gefree(c(i),desc_a,info)
end do end do
if (info == psb_success_) deallocate(aux,h,c_scale,z,c,alpha,stat=info) if (info == psb_success_) deallocate(aux,h,c_scale,z,c,alpha,stat=info)
if (info /= psb_success_) then if (info /= psb_success_) then
info=psb_err_from_subroutine_non_ info=psb_err_from_subroutine_non_
call psb_errpush(info,name) call psb_errpush(info,name)
goto 9999 goto 9999
end if end if
call psb_erractionrestore(err_act) call psb_erractionrestore(err_act)
return return
9999 continue 9999 continue
call psb_erractionrestore(err_act) call psb_erractionrestore(err_act)
if (err_act.eq.psb_act_abort_) then if (err_act.eq.psb_act_abort_) then
call psb_error() call psb_error()
return return
end if end if
return return
end subroutine psb_cgcr_vect end subroutine psb_cgcr_vect

740
krylov/psb_dgcr.f90
Unescape Escape View File

@ -1,371 +1,369 @@
! !
! Parallel Sparse BLAS version 3.5 ! Parallel Sparse BLAS version 3.5
! (C) Copyright 2006, 2010, 2015, 2017 ! (C) Copyright 2006, 2010, 2015, 2017
! Salvatore Filippone Cranfield University ! Salvatore Filippone Cranfield University
! Alfredo Buttari CNRS-IRIT, Toulouse ! Alfredo Buttari CNRS-IRIT, Toulouse
! !
! Redistribution and use in source and binary forms, with or without ! Redistribution and use in source and binary forms, with or without
! modification, are permitted provided that the following conditions ! modification, are permitted provided that the following conditions
! are met: ! are met:
! 1. Redistributions of source code must retain the above copyright ! 1. Redistributions of source code must retain the above copyright
! notice, this list of conditions and the following disclaimer. ! notice, this list of conditions and the following disclaimer.
! 2. Redistributions in binary form must reproduce the above copyright ! 2. Redistributions in binary form must reproduce the above copyright
! notice, this list of conditions, and the following disclaimer in the ! notice, this list of conditions, and the following disclaimer in the
! documentation and/or other materials provided with the distribution. ! documentation and/or other materials provided with the distribution.
! 3. The name of the PSBLAS group or the names of its contributors may ! 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 ! not be used to endorse or promote products derived from this
! software without specific written permission. ! software without specific written permission.
! !
! THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS ! THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
! ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED ! ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
! TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR ! TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
! PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE PSBLAS GROUP OR ITS CONTRIBUTORS ! PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE PSBLAS GROUP OR ITS CONTRIBUTORS
! BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR ! BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
! CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF ! CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
! SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS ! SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
! INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN ! INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
! CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ! 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 ! ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
! POSSIBILITY OF SUCH DAMAGE. ! POSSIBILITY OF SUCH DAMAGE.
! !
! !
! File: psb_dgcr.f90 ! File: psb_dgcr.f90
!! !!
!! Contributors: Ambra Abdullahi (UNITOV) and Pasqua D’Ambra (IAC-CNR) !! Contributors: Ambra Abdullahi (UNITOV) and Pasqua D’Ambra (IAC-CNR)
!! !!
! CCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCC ! CCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCC
! C C ! C C
! C References: C ! C References: C
! C [1] Duff, I., Marrone, M., Radicati, G., and Vittoli, C. C ! C [1] Duff, I., Marrone, M., Radicati, G., and Vittoli, C. C
! C Level 3 basic linear algebra subprograms for sparse C ! C Level 3 basic linear algebra subprograms for sparse C
! C matrices: a user level interface C ! C matrices: a user level interface C
! C ACM Trans. Math. Softw., 23(3), 379-401, 1997. C ! C ACM Trans. Math. Softw., 23(3), 379-401, 1997. C
! C C ! C C
! C C ! C C
! C [2] S. Filippone, M. Colajanni C ! C [2] S. Filippone, M. Colajanni C
! C PSBLAS: A library for parallel linear algebra C ! C PSBLAS: A library for parallel linear algebra C
! C computation on sparse matrices C ! C computation on sparse matrices C
! C ACM Trans. on Math. Softw., 26(4), 527-550, Dec. 2000. C ! C ACM Trans. on Math. Softw., 26(4), 527-550, Dec. 2000. C
! C C ! C C
! C [3] M. Arioli, I. Duff, M. Ruiz C ! C [3] M. Arioli, I. Duff, M. Ruiz C
! C Stopping criteria for iterative solvers C ! C Stopping criteria for iterative solvers C
! C SIAM J. Matrix Anal. Appl., Vol. 13, pp. 138-144, 1992 C ! C SIAM J. Matrix Anal. Appl., Vol. 13, pp. 138-144, 1992 C
! C C ! C C
! C C ! C C
! C [4] R. Barrett et al C ! C [4] R. Barrett et al C
! C Templates for the solution of linear systems C ! C Templates for the solution of linear systems C
! C SIAM, 1993 ! C SIAM, 1993
! C C ! C C
! C [4] Notay, Yvan C ! C [4] Notay, Yvan C
! C Aggregation-based algebraic multigrid method C ! C Aggregation-based algebraic multigrid method C
! C SIAM Journal on Scientific Computing 34, C ! C SIAM Journal on Scientific Computing 34, C
! C pp. A2288-A2316, 2012 C ! C pp. A2288-A2316, 2012 C
! C C ! C C
! C C ! C C
! CCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCC ! CCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCC
! File: psb_dgcr.f90 ! File: psb_dgcr.f90
! !
! Subroutine: psb_dgcr ! Subroutine: psb_dgcr
! This subroutine implements the GCR method. ! This subroutine implements the GCR method.
! !
! !
! Arguments: ! Arguments:
! !
! a - type(psb_dspmat_type) Input: sparse matrix containing A. ! a - type(psb_dspmat_type) Input: sparse matrix containing A.
! prec - class(psb_dprec_type) Input: preconditioner ! prec - class(psb_dprec_type) Input: preconditioner
! b(:) - real Input: vector containing the ! b(:) - real Input: vector containing the
! right hand side B ! right hand side B
! x(:) - real Input/Output: vector containing the ! x(:) - real Input/Output: vector containing the
! initial guess and final solution X. ! initial guess and final solution X.
! eps - real Input: Stopping tolerance; the iteration is ! eps - real Input: Stopping tolerance; the iteration is
! stopped when the error estimate |err| <= eps ! stopped when the error estimate |err| <= eps
! desc_a - type(psb_desc_type). Input: The communication descriptor. ! desc_a - type(psb_desc_type). Input: The communication descriptor.
! info - integer. Output: Return code ! info - integer. Output: Return code
! !
! itmax - integer(optional) Input: maximum number of iterations to be ! itmax - integer(optional) Input: maximum number of iterations to be
! performed. ! performed.
! iter - integer(optional) Output: how many iterations have been ! iter - integer(optional) Output: how many iterations have been
! performed. ! performed.
! performed. ! performed.
! err - real (optional) Output: error estimate on exit. If the ! err - real (optional) Output: error estimate on exit. If the
! denominator of the estimate is exactly ! denominator of the estimate is exactly
! 0, it is changed into 1. ! 0, it is changed into 1.
! itrace - integer(optional) Input: print an informational message ! itrace - integer(optional) Input: print an informational message
! with the error estimate every itrace ! with the error estimate every itrace
! iterations ! iterations
! istop - integer(optional) Input: stopping criterion, or how ! istop - integer(optional) Input: stopping criterion, or how
! to estimate the error. ! to estimate the error.
! 1: err = |r|/(|a||x|+|b|); here the iteration is ! 1: err = |r|/(|a||x|+|b|); here the iteration is
! stopped when |r| <= eps * (|a||x|+|b|) ! stopped when |r| <= eps * (|a||x|+|b|)
! 2: err = |r|/|b|; here the iteration is ! 2: err = |r|/|b|; here the iteration is
! stopped when |r| <= eps * |b| ! stopped when |r| <= eps * |b|
! where r is the (preconditioned, recursive ! where r is the (preconditioned, recursive
! estimate of) residual. ! estimate of) residual.
! !
! irst - integer(optional) Input: restart parameter ! irst - integer(optional) Input: restart parameter
! !
subroutine psb_dgcr_vect(a,prec,b,x,eps,desc_a,info,& subroutine psb_dgcr_vect(a,prec,b,x,eps,desc_a,info,&
& itmax,iter,err,itrace, irst, istop) & itmax,iter,err,itrace, irst, istop)
use psb_base_mod use psb_base_mod
use psb_prec_mod use psb_prec_mod
use psb_d_krylov_conv_mod use psb_d_krylov_conv_mod
use psb_krylov_mod use psb_krylov_mod
implicit none implicit none
type(psb_dspmat_type), intent(in) :: a type(psb_dspmat_type), intent(in) :: a
Type(psb_desc_type), Intent(in) :: desc_a Type(psb_desc_type), Intent(in) :: desc_a
class(psb_dprec_type), intent(inout) :: prec class(psb_dprec_type), intent(inout) :: prec
type(psb_d_vect_type), Intent(inout) :: b type(psb_d_vect_type), Intent(inout) :: b
type(psb_d_vect_type), Intent(inout) :: x type(psb_d_vect_type), Intent(inout) :: x
real(psb_dpk_), Intent(in) :: eps real(psb_dpk_), Intent(in) :: eps
integer(psb_ipk_), intent(out) :: info integer(psb_ipk_), intent(out) :: info
integer(psb_ipk_), Optional, Intent(in) :: itmax, itrace, irst, istop integer(psb_ipk_), Optional, Intent(in) :: itmax, itrace, irst, istop
integer(psb_ipk_), Optional, Intent(out) :: iter integer(psb_ipk_), Optional, Intent(out) :: iter
real(psb_dpk_), Optional, Intent(out) :: err real(psb_dpk_), Optional, Intent(out) :: err
! = local data ! = local data
real(psb_dpk_), allocatable :: alpha(:), h(:,:) real(psb_dpk_), allocatable :: alpha(:), h(:,:)
type(psb_d_vect_type), allocatable :: z(:), c(:), c_scale(:) type(psb_d_vect_type), allocatable :: z(:), c(:), c_scale(:)
type(psb_d_vect_type) :: r type(psb_d_vect_type) :: r
real(psb_dpk_) :: r_norm, b_norm, a_norm, derr real(psb_dpk_) :: r_norm, b_norm, a_norm, derr
integer(psb_ipk_) :: n_col, mglob, naux, err_act integer(psb_ipk_) :: n_col, mglob, naux, err_act
integer(psb_ipk_) :: debug_level, debug_unit integer(psb_ipk_) :: debug_level, debug_unit
integer(psb_ipk_) :: np, me, ictxt integer(psb_ipk_) :: np, me, ictxt
integer(psb_ipk_) :: i, j, it, itx, istop_, itmax_, itrace_, nl, m, nrst integer(psb_ipk_) :: i, j, it, itx, istop_, itmax_, itrace_, nl, m, nrst
real(psb_dpk_) :: hjj real(psb_dpk_) :: hjj
real(psb_dpk_), allocatable, target :: aux(:) real(psb_dpk_), allocatable, target :: aux(:)
character(len=20) :: name character(len=20) :: name
type(psb_itconv_type) :: stopdat type(psb_itconv_type) :: stopdat
character(len=*), parameter :: methdname='GCR' character(len=*), parameter :: methdname='GCR'
integer(psb_ipk_) ::int_err(5) integer(psb_ipk_) ::int_err(5)
info = psb_success_ info = psb_success_
name = 'psb_dgcr' name = 'psb_dgcr'
call psb_erractionsave(err_act) call psb_erractionsave(err_act)
debug_unit = psb_get_debug_unit() debug_unit = psb_get_debug_unit()
debug_level = psb_get_debug_level() debug_level = psb_get_debug_level()
ictxt = desc_a%get_context() ictxt = desc_a%get_context()
call psb_info(ictxt, me, np) call psb_info(ictxt, me, np)
if (.not.allocated(b%v)) then if (.not.allocated(b%v)) then
info = psb_err_invalid_vect_state_ info = psb_err_invalid_vect_state_
call psb_errpush(info,name) call psb_errpush(info,name)
goto 9999 goto 9999
endif endif
if (.not.allocated(x%v)) then if (.not.allocated(x%v)) then
info = psb_err_invalid_vect_state_ info = psb_err_invalid_vect_state_
call psb_errpush(info,name) call psb_errpush(info,name)
goto 9999 goto 9999
endif endif
mglob = desc_a%get_global_rows() mglob = desc_a%get_global_rows()
n_col = desc_a%get_local_cols() n_col = desc_a%get_local_cols()
if (present(istop)) then if (present(istop)) then
istop_ = istop istop_ = istop
else else
istop_ = 2 istop_ = 2
endif endif
! !
! ISTOP_ = 1: Normwise backward error, infinity norm ! ISTOP_ = 1: Normwise backward error, infinity norm
! ISTOP_ = 2: ||r||/||b||, 2-norm ! ISTOP_ = 2: ||r||/||b||, 2-norm
! !
if ((istop_ < 1 ).or.(istop_ > 2 ) ) then if ((istop_ < 1 ).or.(istop_ > 2 ) ) then
info=psb_err_invalid_istop_ info=psb_err_invalid_istop_
int_err(1)=istop_ int_err(1)=istop_
err=info err=info
call psb_errpush(info,name,i_err=int_err) call psb_errpush(info,name,i_err=int_err)
goto 9999 goto 9999
endif endif
call psb_chkvect(mglob,ione,x%get_nrows(),ione,ione,desc_a,info) call psb_chkvect(mglob,ione,x%get_nrows(),ione,ione,desc_a,info)
if (info == psb_success_)& if (info == psb_success_)&
& call psb_chkvect(mglob,ione,b%get_nrows(),ione,ione,desc_a,info) & call psb_chkvect(mglob,ione,b%get_nrows(),ione,ione,desc_a,info)
if(info /= psb_success_) then if(info /= psb_success_) then
info=psb_err_from_subroutine_ info=psb_err_from_subroutine_
call psb_errpush(info,name,a_err='psb_chkvect on X/B') call psb_errpush(info,name,a_err='psb_chkvect on X/B')
goto 9999 goto 9999
end if end if
if (present(itmax)) then if (present(itmax)) then
itmax_ = itmax itmax_ = itmax
else else
itmax_ = 1000 itmax_ = 1000
endif endif
if (present(itrace)) then if (present(itrace)) then
itrace_ = itrace itrace_ = itrace
else else
itrace_ = 0 itrace_ = 0
end if end if
if (present(irst)) then if (present(irst)) then
nl = irst nl = irst
if (debug_level >= psb_debug_ext_) & if (debug_level >= psb_debug_ext_) &
& write(debug_unit,*) me,' ',trim(name),& & write(debug_unit,*) me,' ',trim(name),&
& ' present: irst: ',irst,nl & ' present: irst: ',irst,nl
else else
nl = 10 nl = 10
if (debug_level >= psb_debug_ext_) & if (debug_level >= psb_debug_ext_) &
& write(debug_unit,*) me,' ',trim(name),& & write(debug_unit,*) me,' ',trim(name),&
& ' not present: irst: ',irst,nl & ' not present: irst: ',irst,nl
endif endif
if (nl <=0 ) then if (nl <=0 ) then
info=psb_err_invalid_istop_ info=psb_err_invalid_istop_
int_err(1)=nl int_err(1)=nl
err=info err=info
call psb_errpush(info,name,i_err=int_err) call psb_errpush(info,name,i_err=int_err)
goto 9999 goto 9999
endif endif
naux=4*n_col naux=4*n_col
allocate(aux(naux),h(nl+1,nl+1),& allocate(aux(naux),h(nl+1,nl+1),&
&c_scale(nl+1),c(nl+1),z(nl+1), alpha(nl+1), stat=info) &c_scale(nl+1),c(nl+1),z(nl+1), alpha(nl+1), stat=info)
h = dzero h = dzero
if (info /= psb_success_) then if (info /= psb_success_) then
info=psb_err_from_subroutine_non_ info=psb_err_from_subroutine_non_
call psb_errpush(info,name) call psb_errpush(info,name)
goto 9999 goto 9999
end if end if
call psb_geasb(r, desc_a,info, scratch=.true.,mold=x%v) call psb_geasb(r, desc_a,info, scratch=.true.,mold=x%v)
do i =1,nl+1 do i =1,nl+1
call psb_geasb(c(i), desc_a,info, scratch=.true.,mold=x%v) call psb_geasb(c(i), desc_a,info, scratch=.true.,mold=x%v)
call psb_geasb(z(i), desc_a,info, scratch=.true.,mold=x%v) call psb_geasb(z(i), desc_a,info, scratch=.true.,mold=x%v)
call psb_geasb(c_scale(i), desc_a,info, scratch=.true.,mold=x%v) call psb_geasb(c_scale(i), desc_a,info, scratch=.true.,mold=x%v)
end do end do
itx = 0 itx = 0
nrst = -1 nrst = -1
call psb_init_conv(methdname,istop_,itrace_,itmax_,a,x,b,eps,desc_a,stopdat,info) call psb_init_conv(methdname,istop_,itrace_,itmax_,a,x,b,eps,desc_a,stopdat,info)
restart: do restart: do
if (itx>= itmax_) exit restart if (itx>= itmax_) exit restart
h = dzero h = dzero
it = 0 it = 0
! compute r0 = b-ax0 ! compute r0 = b-ax0
if (info /= psb_success_) then if (info /= psb_success_) then
info=psb_err_from_subroutine_non_ info=psb_err_from_subroutine_non_
call psb_errpush(info,name) call psb_errpush(info,name)
goto 9999 goto 9999
end if end if
call psb_geaxpby(done, b, dzero, r, desc_a, info) call psb_geaxpby(done, b, dzero, r, desc_a, info)
call psb_spmm(-done,a,x,done,r,desc_a,info,work=aux) call psb_spmm(-done,a,x,done,r,desc_a,info,work=aux)
if (info /= psb_success_) then if (info /= psb_success_) then
info=psb_err_from_subroutine_non_ info=psb_err_from_subroutine_non_
call psb_errpush(info,name) call psb_errpush(info,name)
goto 9999 goto 9999
end if end if
if (psb_check_conv(methdname,itx,x,r,desc_a,stopdat,info)) exit restart if (psb_check_conv(methdname,itx,x,r,desc_a,stopdat,info)) exit restart
nrst = nrst + 1 nrst = nrst + 1
iteration: do iteration: do
itx = itx + 1 itx = itx + 1
it = it + 1 it = it + 1
j = it j = it
!Apply preconditioner !Apply preconditioner
call prec%apply(r,z(j),desc_a,info,work=aux) call prec%apply(r,z(j),desc_a,info,work=aux)
call psb_spmm(done,a,z(j),dzero,c(1),desc_a,info,work=aux) call psb_spmm(done,a,z(j),dzero,c(1),desc_a,info,work=aux)
do i =1, j - 1 do i =1, j - 1
h(i,j) = psb_gedot(c_scale(i), c(i), desc_a, info) h(i,j) = psb_gedot(c_scale(i), c(i), desc_a, info)
call psb_geaxpby(done, c(i), dzero, c(i+1), desc_a, info) call psb_geaxpby(done, c(i), dzero, c(i+1), desc_a, info)
call psb_geaxpby(-h(i,j), c_scale(i), done, c(i+1), desc_a, info) call psb_geaxpby(-h(i,j), c_scale(i), done, c(i+1), desc_a, info)
end do end do
h(j,j) = psb_norm2(c(j), desc_a, info) h(j,j) = psb_norm2(c(j), desc_a, info)
hjj = done/h(j,j) hjj = done/h(j,j)
call psb_geaxpby(hjj, c(j), dzero, c_scale(j), desc_a, info) call psb_geaxpby(hjj, c(j), dzero, c_scale(j), desc_a, info)
alpha(j) = psb_gedot(c_scale(j), r, desc_a, info) alpha(j) = psb_gedot(c_scale(j), r, desc_a, info)
!Update residual !Update residual
call psb_geaxpby(done, r, dzero, r, desc_a, info) call psb_geaxpby(done, r, dzero, r, desc_a, info)
call psb_geaxpby(-alpha(j), c_scale(j), done, r, desc_a, info) call psb_geaxpby(-alpha(j), c_scale(j), done, r, desc_a, info)
if (psb_check_conv(methdname,itx,x,r,desc_a,stopdat,info)) exit restart if (psb_check_conv(methdname,itx,x,r,desc_a,stopdat,info)) exit restart
if (j >= irst) exit iteration if (j >= irst) exit iteration
end do iteration end do iteration
m = j m = j
!Compute solution !Compute solution
call dtrsm('l','u','n','n',m,1,done,h,size(h,1),alpha,size(alpha,1)) call dtrsm('l','u','n','n',m,1,done,h,size(h,1),alpha,size(alpha,1))
if (nrst == 0 ) then if (nrst == 0 ) then
call x%set(dzero) call x%set(dzero)
endif endif
do i=1,m do i=1,m
call psb_geaxpby(alpha(i), z(i), done, x, desc_a, info) call psb_geaxpby(alpha(i), z(i), done, x, desc_a, info)
enddo enddo
end do restart end do restart
m = j m = j
!Compute solution !Compute solution
call dtrsm('l','u','n','n',m,1,done,h,size(h,1),alpha,size(alpha,1)) call dtrsm('l','u','n','n',m,1,done,h,size(h,1),alpha,size(alpha,1))
call x%set(dzero) call x%set(dzero)
do i=1,m do i=1,m
call psb_geaxpby(alpha(i), z(i), done, x, desc_a, info) call psb_geaxpby(alpha(i), z(i), done, x, desc_a, info)
enddo enddo
iter = j iter = j
call psb_end_conv(methdname,itx,desc_a,stopdat,info,derr,iter) call psb_end_conv(methdname,itx,desc_a,stopdat,info,derr,iter)
if (present(err)) err = derr if (present(err)) err = derr
if (info == psb_success_) call psb_gefree(r,desc_a,info) if (info == psb_success_) call psb_gefree(r,desc_a,info)
do j = 1,m do j = 1,m
if (info == psb_success_) call psb_gefree(z(j),desc_a,info) if (info == psb_success_) call psb_gefree(z(j),desc_a,info)
if (info == psb_success_) call psb_gefree(c_scale(j),desc_a,info) if (info == psb_success_) call psb_gefree(c_scale(j),desc_a,info)
enddo enddo
do i =1,nl+1 do i =1,nl+1
if (info == psb_success_) call psb_gefree(c(i),desc_a,info) if (info == psb_success_) call psb_gefree(c(i),desc_a,info)
end do end do
if (info == psb_success_) deallocate(aux,h,c_scale,z,c,alpha,stat=info) if (info == psb_success_) deallocate(aux,h,c_scale,z,c,alpha,stat=info)
if (info /= psb_success_) then if (info /= psb_success_) then
info=psb_err_from_subroutine_non_ info=psb_err_from_subroutine_non_
call psb_errpush(info,name) call psb_errpush(info,name)
goto 9999 goto 9999
end if end if
call psb_erractionrestore(err_act) call psb_erractionrestore(err_act)
return return
9999 continue 9999 continue
call psb_erractionrestore(err_act) call psb_erractionrestore(err_act)
if (err_act.eq.psb_act_abort_) then if (err_act.eq.psb_act_abort_) then
call psb_error() call psb_error()
return return
end if end if
return return
end subroutine psb_dgcr_vect end subroutine psb_dgcr_vect

740
krylov/psb_sgcr.f90
Unescape Escape View File

@ -1,371 +1,369 @@
! !
! Parallel Sparse BLAS version 3.5 ! Parallel Sparse BLAS version 3.5
! (C) Copyright 2006, 2010, 2015, 2017 ! (C) Copyright 2006, 2010, 2015, 2017
! Salvatore Filippone Cranfield University ! Salvatore Filippone Cranfield University
! Alfredo Buttari CNRS-IRIT, Toulouse ! Alfredo Buttari CNRS-IRIT, Toulouse
! !
! Redistribution and use in source and binary forms, with or without ! Redistribution and use in source and binary forms, with or without
! modification, are permitted provided that the following conditions ! modification, are permitted provided that the following conditions
! are met: ! are met:
! 1. Redistributions of source code must retain the above copyright ! 1. Redistributions of source code must retain the above copyright
! notice, this list of conditions and the following disclaimer. ! notice, this list of conditions and the following disclaimer.
! 2. Redistributions in binary form must reproduce the above copyright ! 2. Redistributions in binary form must reproduce the above copyright
! notice, this list of conditions, and the following disclaimer in the ! notice, this list of conditions, and the following disclaimer in the
! documentation and/or other materials provided with the distribution. ! documentation and/or other materials provided with the distribution.
! 3. The name of the PSBLAS group or the names of its contributors may ! 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 ! not be used to endorse or promote products derived from this
! software without specific written permission. ! software without specific written permission.
! !
! THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS ! THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
! ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED ! ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
! TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR ! TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
! PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE PSBLAS GROUP OR ITS CONTRIBUTORS ! PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE PSBLAS GROUP OR ITS CONTRIBUTORS
! BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR ! BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
! CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF ! CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
! SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS ! SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
! INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN ! INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
! CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ! 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 ! ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
! POSSIBILITY OF SUCH DAMAGE. ! POSSIBILITY OF SUCH DAMAGE.
! !
! !
! File: psb_sgcr.f90 ! File: psb_sgcr.f90
!! !!
!! Contributors: Ambra Abdullahi (UNITOV) and Pasqua D’Ambra (IAC-CNR) !! Contributors: Ambra Abdullahi (UNITOV) and Pasqua D’Ambra (IAC-CNR)
!! !!
! CCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCC ! CCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCC
! C C ! C C
! C References: C ! C References: C
! C [1] Duff, I., Marrone, M., Radicati, G., and Vittoli, C. C ! C [1] Duff, I., Marrone, M., Radicati, G., and Vittoli, C. C
! C Level 3 basic linear algebra subprograms for sparse C ! C Level 3 basic linear algebra subprograms for sparse C
! C matrices: a user level interface C ! C matrices: a user level interface C
! C ACM Trans. Math. Softw., 23(3), 379-401, 1997. C ! C ACM Trans. Math. Softw., 23(3), 379-401, 1997. C
! C C ! C C
! C C ! C C
! C [2] S. Filippone, M. Colajanni C ! C [2] S. Filippone, M. Colajanni C
! C PSBLAS: A library for parallel linear algebra C ! C PSBLAS: A library for parallel linear algebra C
! C computation on sparse matrices C ! C computation on sparse matrices C
! C ACM Trans. on Math. Softw., 26(4), 527-550, Dec. 2000. C ! C ACM Trans. on Math. Softw., 26(4), 527-550, Dec. 2000. C
! C C ! C C
! C [3] M. Arioli, I. Duff, M. Ruiz C ! C [3] M. Arioli, I. Duff, M. Ruiz C
! C Stopping criteria for iterative solvers C ! C Stopping criteria for iterative solvers C
! C SIAM J. Matrix Anal. Appl., Vol. 13, pp. 138-144, 1992 C ! C SIAM J. Matrix Anal. Appl., Vol. 13, pp. 138-144, 1992 C
! C C ! C C
! C C ! C C
! C [4] R. Barrett et al C ! C [4] R. Barrett et al C
! C Templates for the solution of linear systems C ! C Templates for the solution of linear systems C
! C SIAM, 1993 ! C SIAM, 1993
! C C ! C C
! C [4] Notay, Yvan C ! C [4] Notay, Yvan C
! C Aggregation-based algebraic multigrid method C ! C Aggregation-based algebraic multigrid method C
! C SIAM Journal on Scientific Computing 34, C ! C SIAM Journal on Scientific Computing 34, C
! C pp. A2288-A2316, 2012 C ! C pp. A2288-A2316, 2012 C
! C C ! C C
! C C ! C C
! CCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCC ! CCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCC
! File: psb_sgcr.f90 ! File: psb_sgcr.f90
! !
! Subroutine: psb_sgcr ! Subroutine: psb_sgcr
! This subroutine implements the GCR method. ! This subroutine implements the GCR method.
! !
! !
! Arguments: ! Arguments:
! !
! a - type(psb_sspmat_type) Input: sparse matrix containing A. ! a - type(psb_sspmat_type) Input: sparse matrix containing A.
! prec - class(psb_sprec_type) Input: preconditioner ! prec - class(psb_sprec_type) Input: preconditioner
! b(:) - real Input: vector containing the ! b(:) - real Input: vector containing the
! right hand side B ! right hand side B
! x(:) - real Input/Output: vector containing the ! x(:) - real Input/Output: vector containing the
! initial guess and final solution X. ! initial guess and final solution X.
! eps - real Input: Stopping tolerance; the iteration is ! eps - real Input: Stopping tolerance; the iteration is
! stopped when the error estimate |err| <= eps ! stopped when the error estimate |err| <= eps
! desc_a - type(psb_desc_type). Input: The communication descriptor. ! desc_a - type(psb_desc_type). Input: The communication descriptor.
! info - integer. Output: Return code ! info - integer. Output: Return code
! !
! itmax - integer(optional) Input: maximum number of iterations to be ! itmax - integer(optional) Input: maximum number of iterations to be
! performed. ! performed.
! iter - integer(optional) Output: how many iterations have been ! iter - integer(optional) Output: how many iterations have been
! performed. ! performed.
! performed. ! performed.
! err - real (optional) Output: error estimate on exit. If the ! err - real (optional) Output: error estimate on exit. If the
! denominator of the estimate is exactly ! denominator of the estimate is exactly
! 0, it is changed into 1. ! 0, it is changed into 1.
! itrace - integer(optional) Input: print an informational message ! itrace - integer(optional) Input: print an informational message
! with the error estimate every itrace ! with the error estimate every itrace
! iterations ! iterations
! istop - integer(optional) Input: stopping criterion, or how ! istop - integer(optional) Input: stopping criterion, or how
! to estimate the error. ! to estimate the error.
! 1: err = |r|/(|a||x|+|b|); here the iteration is ! 1: err = |r|/(|a||x|+|b|); here the iteration is
! stopped when |r| <= eps * (|a||x|+|b|) ! stopped when |r| <= eps * (|a||x|+|b|)
! 2: err = |r|/|b|; here the iteration is ! 2: err = |r|/|b|; here the iteration is
! stopped when |r| <= eps * |b| ! stopped when |r| <= eps * |b|
! where r is the (preconditioned, recursive ! where r is the (preconditioned, recursive
! estimate of) residual. ! estimate of) residual.
! !
! irst - integer(optional) Input: restart parameter ! irst - integer(optional) Input: restart parameter
! !
subroutine psb_sgcr_vect(a,prec,b,x,eps,desc_a,info,& subroutine psb_sgcr_vect(a,prec,b,x,eps,desc_a,info,&
& itmax,iter,err,itrace, irst, istop) & itmax,iter,err,itrace, irst, istop)
use psb_base_mod use psb_base_mod
use psb_prec_mod use psb_prec_mod
use psb_s_krylov_conv_mod use psb_s_krylov_conv_mod
use psb_krylov_mod use psb_krylov_mod
implicit none implicit none
type(psb_sspmat_type), intent(in) :: a type(psb_sspmat_type), intent(in) :: a
Type(psb_desc_type), Intent(in) :: desc_a Type(psb_desc_type), Intent(in) :: desc_a
class(psb_sprec_type), intent(inout) :: prec class(psb_sprec_type), intent(inout) :: prec
type(psb_s_vect_type), Intent(inout) :: b type(psb_s_vect_type), Intent(inout) :: b
type(psb_s_vect_type), Intent(inout) :: x type(psb_s_vect_type), Intent(inout) :: x
real(psb_spk_), Intent(in) :: eps real(psb_spk_), Intent(in) :: eps
integer(psb_ipk_), intent(out) :: info integer(psb_ipk_), intent(out) :: info
integer(psb_ipk_), Optional, Intent(in) :: itmax, itrace, irst, istop integer(psb_ipk_), Optional, Intent(in) :: itmax, itrace, irst, istop
integer(psb_ipk_), Optional, Intent(out) :: iter integer(psb_ipk_), Optional, Intent(out) :: iter
real(psb_spk_), Optional, Intent(out) :: err real(psb_spk_), Optional, Intent(out) :: err
! = local data ! = local data
real(psb_spk_), allocatable :: alpha(:), h(:,:) real(psb_spk_), allocatable :: alpha(:), h(:,:)
type(psb_s_vect_type), allocatable :: z(:), c(:), c_scale(:) type(psb_s_vect_type), allocatable :: z(:), c(:), c_scale(:)
type(psb_s_vect_type) :: r type(psb_s_vect_type) :: r
real(psb_dpk_) :: r_norm, b_norm, a_norm, derr real(psb_dpk_) :: r_norm, b_norm, a_norm, derr
integer(psb_ipk_) :: n_col, mglob, naux, err_act integer(psb_ipk_) :: n_col, mglob, naux, err_act
integer(psb_ipk_) :: debug_level, debug_unit integer(psb_ipk_) :: debug_level, debug_unit
integer(psb_ipk_) :: np, me, ictxt integer(psb_ipk_) :: np, me, ictxt
integer(psb_ipk_) :: i, j, it, itx, istop_, itmax_, itrace_, nl, m, nrst integer(psb_ipk_) :: i, j, it, itx, istop_, itmax_, itrace_, nl, m, nrst
real(psb_spk_) :: hjj real(psb_spk_) :: hjj
real(psb_spk_), allocatable, target :: aux(:) real(psb_spk_), allocatable, target :: aux(:)
character(len=20) :: name character(len=20) :: name
type(psb_itconv_type) :: stopdat type(psb_itconv_type) :: stopdat
character(len=*), parameter :: methdname='GCR' character(len=*), parameter :: methdname='GCR'
integer(psb_ipk_) ::int_err(5) integer(psb_ipk_) ::int_err(5)
info = psb_success_ info = psb_success_
name = 'psb_sgcr' name = 'psb_sgcr'
call psb_erractionsave(err_act) call psb_erractionsave(err_act)
debug_unit = psb_get_debug_unit() debug_unit = psb_get_debug_unit()
debug_level = psb_get_debug_level() debug_level = psb_get_debug_level()
ictxt = desc_a%get_context() ictxt = desc_a%get_context()
call psb_info(ictxt, me, np) call psb_info(ictxt, me, np)
if (.not.allocated(b%v)) then if (.not.allocated(b%v)) then
info = psb_err_invalid_vect_state_ info = psb_err_invalid_vect_state_
call psb_errpush(info,name) call psb_errpush(info,name)
goto 9999 goto 9999
endif endif
if (.not.allocated(x%v)) then if (.not.allocated(x%v)) then
info = psb_err_invalid_vect_state_ info = psb_err_invalid_vect_state_
call psb_errpush(info,name) call psb_errpush(info,name)
goto 9999 goto 9999
endif endif
mglob = desc_a%get_global_rows() mglob = desc_a%get_global_rows()
n_col = desc_a%get_local_cols() n_col = desc_a%get_local_cols()
if (present(istop)) then if (present(istop)) then
istop_ = istop istop_ = istop
else else
istop_ = 2 istop_ = 2
endif endif
! !
! ISTOP_ = 1: Normwise backward error, infinity norm ! ISTOP_ = 1: Normwise backward error, infinity norm
! ISTOP_ = 2: ||r||/||b||, 2-norm ! ISTOP_ = 2: ||r||/||b||, 2-norm
! !
if ((istop_ < 1 ).or.(istop_ > 2 ) ) then if ((istop_ < 1 ).or.(istop_ > 2 ) ) then
info=psb_err_invalid_istop_ info=psb_err_invalid_istop_
int_err(1)=istop_ int_err(1)=istop_
err=info err=info
call psb_errpush(info,name,i_err=int_err) call psb_errpush(info,name,i_err=int_err)
goto 9999 goto 9999
endif endif
call psb_chkvect(mglob,ione,x%get_nrows(),ione,ione,desc_a,info) call psb_chkvect(mglob,ione,x%get_nrows(),ione,ione,desc_a,info)
if (info == psb_success_)& if (info == psb_success_)&
& call psb_chkvect(mglob,ione,b%get_nrows(),ione,ione,desc_a,info) & call psb_chkvect(mglob,ione,b%get_nrows(),ione,ione,desc_a,info)
if(info /= psb_success_) then if(info /= psb_success_) then
info=psb_err_from_subroutine_ info=psb_err_from_subroutine_
call psb_errpush(info,name,a_err='psb_chkvect on X/B') call psb_errpush(info,name,a_err='psb_chkvect on X/B')
goto 9999 goto 9999
end if end if
if (present(itmax)) then if (present(itmax)) then
itmax_ = itmax itmax_ = itmax
else else
itmax_ = 1000 itmax_ = 1000
endif endif
if (present(itrace)) then if (present(itrace)) then
itrace_ = itrace itrace_ = itrace
else else
itrace_ = 0 itrace_ = 0
end if end if
if (present(irst)) then if (present(irst)) then
nl = irst nl = irst
if (debug_level >= psb_debug_ext_) & if (debug_level >= psb_debug_ext_) &
& write(debug_unit,*) me,' ',trim(name),& & write(debug_unit,*) me,' ',trim(name),&
& ' present: irst: ',irst,nl & ' present: irst: ',irst,nl
else else
nl = 10 nl = 10
if (debug_level >= psb_debug_ext_) & if (debug_level >= psb_debug_ext_) &
& write(debug_unit,*) me,' ',trim(name),& & write(debug_unit,*) me,' ',trim(name),&
& ' not present: irst: ',irst,nl & ' not present: irst: ',irst,nl
endif endif
if (nl <=0 ) then if (nl <=0 ) then
info=psb_err_invalid_istop_ info=psb_err_invalid_istop_
int_err(1)=nl int_err(1)=nl
err=info err=info
call psb_errpush(info,name,i_err=int_err) call psb_errpush(info,name,i_err=int_err)
goto 9999 goto 9999
endif endif
naux=4*n_col naux=4*n_col
allocate(aux(naux),h(nl+1,nl+1),& allocate(aux(naux),h(nl+1,nl+1),&
&c_scale(nl+1),c(nl+1),z(nl+1), alpha(nl+1), stat=info) &c_scale(nl+1),c(nl+1),z(nl+1), alpha(nl+1), stat=info)
h = szero h = szero
if (info /= psb_success_) then if (info /= psb_success_) then
info=psb_err_from_subroutine_non_ info=psb_err_from_subroutine_non_
call psb_errpush(info,name) call psb_errpush(info,name)
goto 9999 goto 9999
end if end if
call psb_geasb(r, desc_a,info, scratch=.true.,mold=x%v) call psb_geasb(r, desc_a,info, scratch=.true.,mold=x%v)
do i =1,nl+1 do i =1,nl+1
call psb_geasb(c(i), desc_a,info, scratch=.true.,mold=x%v) call psb_geasb(c(i), desc_a,info, scratch=.true.,mold=x%v)
call psb_geasb(z(i), desc_a,info, scratch=.true.,mold=x%v) call psb_geasb(z(i), desc_a,info, scratch=.true.,mold=x%v)
call psb_geasb(c_scale(i), desc_a,info, scratch=.true.,mold=x%v) call psb_geasb(c_scale(i), desc_a,info, scratch=.true.,mold=x%v)
end do end do
itx = 0 itx = 0
nrst = -1 nrst = -1
call psb_init_conv(methdname,istop_,itrace_,itmax_,a,x,b,eps,desc_a,stopdat,info) call psb_init_conv(methdname,istop_,itrace_,itmax_,a,x,b,eps,desc_a,stopdat,info)
restart: do restart: do
if (itx>= itmax_) exit restart if (itx>= itmax_) exit restart
h = szero h = szero
it = 0 it = 0
! compute r0 = b-ax0 ! compute r0 = b-ax0
if (info /= psb_success_) then if (info /= psb_success_) then
info=psb_err_from_subroutine_non_ info=psb_err_from_subroutine_non_
call psb_errpush(info,name) call psb_errpush(info,name)
goto 9999 goto 9999
end if end if
call psb_geaxpby(sone, b, szero, r, desc_a, info) call psb_geaxpby(sone, b, szero, r, desc_a, info)
call psb_spmm(-sone,a,x,sone,r,desc_a,info,work=aux) call psb_spmm(-sone,a,x,sone,r,desc_a,info,work=aux)
if (info /= psb_success_) then if (info /= psb_success_) then
info=psb_err_from_subroutine_non_ info=psb_err_from_subroutine_non_
call psb_errpush(info,name) call psb_errpush(info,name)
goto 9999 goto 9999
end if end if
if (psb_check_conv(methdname,itx,x,r,desc_a,stopdat,info)) exit restart if (psb_check_conv(methdname,itx,x,r,desc_a,stopdat,info)) exit restart
nrst = nrst + 1 nrst = nrst + 1
iteration: do iteration: do
itx = itx + 1 itx = itx + 1
it = it + 1 it = it + 1
j = it j = it
!Apply preconditioner !Apply preconditioner
call prec%apply(r,z(j),desc_a,info,work=aux) call prec%apply(r,z(j),desc_a,info,work=aux)
call psb_spmm(sone,a,z(j),szero,c(1),desc_a,info,work=aux) call psb_spmm(sone,a,z(j),szero,c(1),desc_a,info,work=aux)
do i =1, j - 1 do i =1, j - 1
h(i,j) = psb_gedot(c_scale(i), c(i), desc_a, info) h(i,j) = psb_gedot(c_scale(i), c(i), desc_a, info)
call psb_geaxpby(sone, c(i), szero, c(i+1), desc_a, info) call psb_geaxpby(sone, c(i), szero, c(i+1), desc_a, info)
call psb_geaxpby(-h(i,j), c_scale(i), sone, c(i+1), desc_a, info) call psb_geaxpby(-h(i,j), c_scale(i), sone, c(i+1), desc_a, info)
end do end do
h(j,j) = psb_norm2(c(j), desc_a, info) h(j,j) = psb_norm2(c(j), desc_a, info)
hjj = sone/h(j,j) hjj = sone/h(j,j)
call psb_geaxpby(hjj, c(j), szero, c_scale(j), desc_a, info) call psb_geaxpby(hjj, c(j), szero, c_scale(j), desc_a, info)
alpha(j) = psb_gedot(c_scale(j), r, desc_a, info) alpha(j) = psb_gedot(c_scale(j), r, desc_a, info)
!Update residual !Update residual
call psb_geaxpby(sone, r, szero, r, desc_a, info) call psb_geaxpby(sone, r, szero, r, desc_a, info)
call psb_geaxpby(-alpha(j), c_scale(j), sone, r, desc_a, info) call psb_geaxpby(-alpha(j), c_scale(j), sone, r, desc_a, info)
if (psb_check_conv(methdname,itx,x,r,desc_a,stopdat,info)) exit restart if (psb_check_conv(methdname,itx,x,r,desc_a,stopdat,info)) exit restart
if (j >= irst) exit iteration if (j >= irst) exit iteration
end do iteration end do iteration
m = j m = j
!Compute solution !Compute solution
call strsm('l','u','n','n',m,1,sone,h,size(h,1),alpha,size(alpha,1)) call strsm('l','u','n','n',m,1,sone,h,size(h,1),alpha,size(alpha,1))
if (nrst == 0 ) then if (nrst == 0 ) then
call x%set(szero) call x%set(szero)
endif endif
do i=1,m do i=1,m
call psb_geaxpby(alpha(i), z(i), sone, x, desc_a, info) call psb_geaxpby(alpha(i), z(i), sone, x, desc_a, info)
enddo enddo
end do restart end do restart
m = j m = j
!Compute solution !Compute solution
call strsm('l','u','n','n',m,1,sone,h,size(h,1),alpha,size(alpha,1)) call strsm('l','u','n','n',m,1,sone,h,size(h,1),alpha,size(alpha,1))
call x%set(szero) call x%set(szero)
do i=1,m do i=1,m
call psb_geaxpby(alpha(i), z(i), sone, x, desc_a, info) call psb_geaxpby(alpha(i), z(i), sone, x, desc_a, info)
enddo enddo
iter = j iter = j
call psb_end_conv(methdname,itx,desc_a,stopdat,info,derr,iter) call psb_end_conv(methdname,itx,desc_a,stopdat,info,derr,iter)
if (present(err)) err = derr if (present(err)) err = derr
if (info == psb_success_) call psb_gefree(r,desc_a,info) if (info == psb_success_) call psb_gefree(r,desc_a,info)
do j = 1,m do j = 1,m
if (info == psb_success_) call psb_gefree(z(j),desc_a,info) if (info == psb_success_) call psb_gefree(z(j),desc_a,info)
if (info == psb_success_) call psb_gefree(c_scale(j),desc_a,info) if (info == psb_success_) call psb_gefree(c_scale(j),desc_a,info)
enddo enddo
do i =1,nl+1 do i =1,nl+1
if (info == psb_success_) call psb_gefree(c(i),desc_a,info) if (info == psb_success_) call psb_gefree(c(i),desc_a,info)
end do end do
if (info == psb_success_) deallocate(aux,h,c_scale,z,c,alpha,stat=info) if (info == psb_success_) deallocate(aux,h,c_scale,z,c,alpha,stat=info)
if (info /= psb_success_) then if (info /= psb_success_) then
info=psb_err_from_subroutine_non_ info=psb_err_from_subroutine_non_
call psb_errpush(info,name) call psb_errpush(info,name)
goto 9999 goto 9999
end if end if
call psb_erractionrestore(err_act) call psb_erractionrestore(err_act)
return return
9999 continue 9999 continue
call psb_erractionrestore(err_act) call psb_erractionrestore(err_act)
if (err_act.eq.psb_act_abort_) then if (err_act.eq.psb_act_abort_) then
call psb_error() call psb_error()
return return
end if end if
return return
end subroutine psb_sgcr_vect end subroutine psb_sgcr_vect

740
krylov/psb_zgcr.f90
Unescape Escape View File

@ -1,371 +1,369 @@
! !
! Parallel Sparse BLAS version 3.5 ! Parallel Sparse BLAS version 3.5
! (C) Copyright 2006, 2010, 2015, 2017 ! (C) Copyright 2006, 2010, 2015, 2017
! Salvatore Filippone Cranfield University ! Salvatore Filippone Cranfield University
! Alfredo Buttari CNRS-IRIT, Toulouse ! Alfredo Buttari CNRS-IRIT, Toulouse
! !
! Redistribution and use in source and binary forms, with or without ! Redistribution and use in source and binary forms, with or without
! modification, are permitted provided that the following conditions ! modification, are permitted provided that the following conditions
! are met: ! are met:
! 1. Redistributions of source code must retain the above copyright ! 1. Redistributions of source code must retain the above copyright
! notice, this list of conditions and the following disclaimer. ! notice, this list of conditions and the following disclaimer.
! 2. Redistributions in binary form must reproduce the above copyright ! 2. Redistributions in binary form must reproduce the above copyright
! notice, this list of conditions, and the following disclaimer in the ! notice, this list of conditions, and the following disclaimer in the
! documentation and/or other materials provided with the distribution. ! documentation and/or other materials provided with the distribution.
! 3. The name of the PSBLAS group or the names of its contributors may ! 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 ! not be used to endorse or promote products derived from this
! software without specific written permission. ! software without specific written permission.
! !
! THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS ! THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
! ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED ! ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
! TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR ! TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
! PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE PSBLAS GROUP OR ITS CONTRIBUTORS ! PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE PSBLAS GROUP OR ITS CONTRIBUTORS
! BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR ! BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
! CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF ! CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
! SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS ! SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
! INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN ! INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
! CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ! 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 ! ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
! POSSIBILITY OF SUCH DAMAGE. ! POSSIBILITY OF SUCH DAMAGE.
! !
! !
! File: psb_zgcr.f90 ! File: psb_zgcr.f90
!! !!
!! Contributors: Ambra Abdullahi (UNITOV) and Pasqua D’Ambra (IAC-CNR) !! Contributors: Ambra Abdullahi (UNITOV) and Pasqua D’Ambra (IAC-CNR)
!! !!
! CCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCC ! CCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCC
! C C ! C C
! C References: C ! C References: C
! C [1] Duff, I., Marrone, M., Radicati, G., and Vittoli, C. C ! C [1] Duff, I., Marrone, M., Radicati, G., and Vittoli, C. C
! C Level 3 basic linear algebra subprograms for sparse C ! C Level 3 basic linear algebra subprograms for sparse C
! C matrices: a user level interface C ! C matrices: a user level interface C
! C ACM Trans. Math. Softw., 23(3), 379-401, 1997. C ! C ACM Trans. Math. Softw., 23(3), 379-401, 1997. C
! C C ! C C
! C C ! C C
! C [2] S. Filippone, M. Colajanni C ! C [2] S. Filippone, M. Colajanni C
! C PSBLAS: A library for parallel linear algebra C ! C PSBLAS: A library for parallel linear algebra C
! C computation on sparse matrices C ! C computation on sparse matrices C
! C ACM Trans. on Math. Softw., 26(4), 527-550, Dec. 2000. C ! C ACM Trans. on Math. Softw., 26(4), 527-550, Dec. 2000. C
! C C ! C C
! C [3] M. Arioli, I. Duff, M. Ruiz C ! C [3] M. Arioli, I. Duff, M. Ruiz C
! C Stopping criteria for iterative solvers C ! C Stopping criteria for iterative solvers C
! C SIAM J. Matrix Anal. Appl., Vol. 13, pp. 138-144, 1992 C ! C SIAM J. Matrix Anal. Appl., Vol. 13, pp. 138-144, 1992 C
! C C ! C C
! C C ! C C
! C [4] R. Barrett et al C ! C [4] R. Barrett et al C
! C Templates for the solution of linear systems C ! C Templates for the solution of linear systems C
! C SIAM, 1993 ! C SIAM, 1993
! C C ! C C
! C [4] Notay, Yvan C ! C [4] Notay, Yvan C
! C Aggregation-based algebraic multigrid method C ! C Aggregation-based algebraic multigrid method C
! C SIAM Journal on Scientific Computing 34, C ! C SIAM Journal on Scientific Computing 34, C
! C pp. A2288-A2316, 2012 C ! C pp. A2288-A2316, 2012 C
! C C ! C C
! C C ! C C
! CCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCC ! CCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCC
! File: psb_zgcr.f90 ! File: psb_zgcr.f90
! !
! Subroutine: psb_zgcr ! Subroutine: psb_zgcr
! This subroutine implements the GCR method. ! This subroutine implements the GCR method.
! !
! !
! Arguments: ! Arguments:
! !
! a - type(psb_zspmat_type) Input: sparse matrix containing A. ! a - type(psb_zspmat_type) Input: sparse matrix containing A.
! prec - class(psb_zprec_type) Input: preconditioner ! prec - class(psb_zprec_type) Input: preconditioner
! b(:) - real Input: vector containing the ! b(:) - real Input: vector containing the
! right hand side B ! right hand side B
! x(:) - real Input/Output: vector containing the ! x(:) - real Input/Output: vector containing the
! initial guess and final solution X. ! initial guess and final solution X.
! eps - real Input: Stopping tolerance; the iteration is ! eps - real Input: Stopping tolerance; the iteration is
! stopped when the error estimate |err| <= eps ! stopped when the error estimate |err| <= eps
! desc_a - type(psb_desc_type). Input: The communication descriptor. ! desc_a - type(psb_desc_type). Input: The communication descriptor.
! info - integer. Output: Return code ! info - integer. Output: Return code
! !
! itmax - integer(optional) Input: maximum number of iterations to be ! itmax - integer(optional) Input: maximum number of iterations to be
! performed. ! performed.
! iter - integer(optional) Output: how many iterations have been ! iter - integer(optional) Output: how many iterations have been
! performed. ! performed.
! performed. ! performed.
! err - real (optional) Output: error estimate on exit. If the ! err - real (optional) Output: error estimate on exit. If the
! denominator of the estimate is exactly ! denominator of the estimate is exactly
! 0, it is changed into 1. ! 0, it is changed into 1.
! itrace - integer(optional) Input: print an informational message ! itrace - integer(optional) Input: print an informational message
! with the error estimate every itrace ! with the error estimate every itrace
! iterations ! iterations
! istop - integer(optional) Input: stopping criterion, or how ! istop - integer(optional) Input: stopping criterion, or how
! to estimate the error. ! to estimate the error.
! 1: err = |r|/(|a||x|+|b|); here the iteration is ! 1: err = |r|/(|a||x|+|b|); here the iteration is
! stopped when |r| <= eps * (|a||x|+|b|) ! stopped when |r| <= eps * (|a||x|+|b|)
! 2: err = |r|/|b|; here the iteration is ! 2: err = |r|/|b|; here the iteration is
! stopped when |r| <= eps * |b| ! stopped when |r| <= eps * |b|
! where r is the (preconditioned, recursive ! where r is the (preconditioned, recursive
! estimate of) residual. ! estimate of) residual.
! !
! irst - integer(optional) Input: restart parameter ! irst - integer(optional) Input: restart parameter
! !
subroutine psb_zgcr_vect(a,prec,b,x,eps,desc_a,info,& subroutine psb_zgcr_vect(a,prec,b,x,eps,desc_a,info,&
& itmax,iter,err,itrace, irst, istop) & itmax,iter,err,itrace, irst, istop)
use psb_base_mod use psb_base_mod
use psb_prec_mod use psb_prec_mod
use psb_z_krylov_conv_mod use psb_z_krylov_conv_mod
use psb_krylov_mod use psb_krylov_mod
implicit none implicit none
type(psb_zspmat_type), intent(in) :: a type(psb_zspmat_type), intent(in) :: a
Type(psb_desc_type), Intent(in) :: desc_a Type(psb_desc_type), Intent(in) :: desc_a
class(psb_zprec_type), intent(inout) :: prec class(psb_zprec_type), intent(inout) :: prec
type(psb_z_vect_type), Intent(inout) :: b type(psb_z_vect_type), Intent(inout) :: b
type(psb_z_vect_type), Intent(inout) :: x type(psb_z_vect_type), Intent(inout) :: x
real(psb_dpk_), Intent(in) :: eps real(psb_dpk_), Intent(in) :: eps
integer(psb_ipk_), intent(out) :: info integer(psb_ipk_), intent(out) :: info
integer(psb_ipk_), Optional, Intent(in) :: itmax, itrace, irst, istop integer(psb_ipk_), Optional, Intent(in) :: itmax, itrace, irst, istop
integer(psb_ipk_), Optional, Intent(out) :: iter integer(psb_ipk_), Optional, Intent(out) :: iter
real(psb_dpk_), Optional, Intent(out) :: err real(psb_dpk_), Optional, Intent(out) :: err
! = local data ! = local data
complex(psb_dpk_), allocatable :: alpha(:), h(:,:) complex(psb_dpk_), allocatable :: alpha(:), h(:,:)
type(psb_z_vect_type), allocatable :: z(:), c(:), c_scale(:) type(psb_z_vect_type), allocatable :: z(:), c(:), c_scale(:)
type(psb_z_vect_type) :: r type(psb_z_vect_type) :: r
real(psb_dpk_) :: r_norm, b_norm, a_norm, derr real(psb_dpk_) :: r_norm, b_norm, a_norm, derr
integer(psb_ipk_) :: n_col, mglob, naux, err_act integer(psb_ipk_) :: n_col, mglob, naux, err_act
integer(psb_ipk_) :: debug_level, debug_unit integer(psb_ipk_) :: debug_level, debug_unit
integer(psb_ipk_) :: np, me, ictxt integer(psb_ipk_) :: np, me, ictxt
integer(psb_ipk_) :: i, j, it, itx, istop_, itmax_, itrace_, nl, m, nrst integer(psb_ipk_) :: i, j, it, itx, istop_, itmax_, itrace_, nl, m, nrst
complex(psb_dpk_) :: hjj complex(psb_dpk_) :: hjj
complex(psb_dpk_), allocatable, target :: aux(:) complex(psb_dpk_), allocatable, target :: aux(:)
character(len=20) :: name character(len=20) :: name
type(psb_itconv_type) :: stopdat type(psb_itconv_type) :: stopdat
character(len=*), parameter :: methdname='GCR' character(len=*), parameter :: methdname='GCR'
integer(psb_ipk_) ::int_err(5) integer(psb_ipk_) ::int_err(5)
info = psb_success_ info = psb_success_
name = 'psb_zgcr' name = 'psb_zgcr'
call psb_erractionsave(err_act) call psb_erractionsave(err_act)
debug_unit = psb_get_debug_unit() debug_unit = psb_get_debug_unit()
debug_level = psb_get_debug_level() debug_level = psb_get_debug_level()
ictxt = desc_a%get_context() ictxt = desc_a%get_context()
call psb_info(ictxt, me, np) call psb_info(ictxt, me, np)
if (.not.allocated(b%v)) then if (.not.allocated(b%v)) then
info = psb_err_invalid_vect_state_ info = psb_err_invalid_vect_state_
call psb_errpush(info,name) call psb_errpush(info,name)
goto 9999 goto 9999
endif endif
if (.not.allocated(x%v)) then if (.not.allocated(x%v)) then
info = psb_err_invalid_vect_state_ info = psb_err_invalid_vect_state_
call psb_errpush(info,name) call psb_errpush(info,name)
goto 9999 goto 9999
endif endif
mglob = desc_a%get_global_rows() mglob = desc_a%get_global_rows()
n_col = desc_a%get_local_cols() n_col = desc_a%get_local_cols()
if (present(istop)) then if (present(istop)) then
istop_ = istop istop_ = istop
else else
istop_ = 2 istop_ = 2
endif endif
! !
! ISTOP_ = 1: Normwise backward error, infinity norm ! ISTOP_ = 1: Normwise backward error, infinity norm
! ISTOP_ = 2: ||r||/||b||, 2-norm ! ISTOP_ = 2: ||r||/||b||, 2-norm
! !
if ((istop_ < 1 ).or.(istop_ > 2 ) ) then if ((istop_ < 1 ).or.(istop_ > 2 ) ) then
info=psb_err_invalid_istop_ info=psb_err_invalid_istop_
int_err(1)=istop_ int_err(1)=istop_
err=info err=info
call psb_errpush(info,name,i_err=int_err) call psb_errpush(info,name,i_err=int_err)
goto 9999 goto 9999
endif endif
call psb_chkvect(mglob,ione,x%get_nrows(),ione,ione,desc_a,info) call psb_chkvect(mglob,ione,x%get_nrows(),ione,ione,desc_a,info)
if (info == psb_success_)& if (info == psb_success_)&
& call psb_chkvect(mglob,ione,b%get_nrows(),ione,ione,desc_a,info) & call psb_chkvect(mglob,ione,b%get_nrows(),ione,ione,desc_a,info)
if(info /= psb_success_) then if(info /= psb_success_) then
info=psb_err_from_subroutine_ info=psb_err_from_subroutine_
call psb_errpush(info,name,a_err='psb_chkvect on X/B') call psb_errpush(info,name,a_err='psb_chkvect on X/B')
goto 9999 goto 9999
end if end if
if (present(itmax)) then if (present(itmax)) then
itmax_ = itmax itmax_ = itmax
else else
itmax_ = 1000 itmax_ = 1000
endif endif
if (present(itrace)) then if (present(itrace)) then
itrace_ = itrace itrace_ = itrace
else else
itrace_ = 0 itrace_ = 0
end if end if
if (present(irst)) then if (present(irst)) then
nl = irst nl = irst
if (debug_level >= psb_debug_ext_) & if (debug_level >= psb_debug_ext_) &
& write(debug_unit,*) me,' ',trim(name),& & write(debug_unit,*) me,' ',trim(name),&
& ' present: irst: ',irst,nl & ' present: irst: ',irst,nl
else else
nl = 10 nl = 10
if (debug_level >= psb_debug_ext_) & if (debug_level >= psb_debug_ext_) &
& write(debug_unit,*) me,' ',trim(name),& & write(debug_unit,*) me,' ',trim(name),&
& ' not present: irst: ',irst,nl & ' not present: irst: ',irst,nl
endif endif
if (nl <=0 ) then if (nl <=0 ) then
info=psb_err_invalid_istop_ info=psb_err_invalid_istop_
int_err(1)=nl int_err(1)=nl
err=info err=info
call psb_errpush(info,name,i_err=int_err) call psb_errpush(info,name,i_err=int_err)
goto 9999 goto 9999
endif endif
naux=4*n_col naux=4*n_col
allocate(aux(naux),h(nl+1,nl+1),& allocate(aux(naux),h(nl+1,nl+1),&
&c_scale(nl+1),c(nl+1),z(nl+1), alpha(nl+1), stat=info) &c_scale(nl+1),c(nl+1),z(nl+1), alpha(nl+1), stat=info)
h = zzero h = zzero
if (info /= psb_success_) then if (info /= psb_success_) then
info=psb_err_from_subroutine_non_ info=psb_err_from_subroutine_non_
call psb_errpush(info,name) call psb_errpush(info,name)
goto 9999 goto 9999
end if end if
call psb_geasb(r, desc_a,info, scratch=.true.,mold=x%v) call psb_geasb(r, desc_a,info, scratch=.true.,mold=x%v)
do i =1,nl+1 do i =1,nl+1
call psb_geasb(c(i), desc_a,info, scratch=.true.,mold=x%v) call psb_geasb(c(i), desc_a,info, scratch=.true.,mold=x%v)
call psb_geasb(z(i), desc_a,info, scratch=.true.,mold=x%v) call psb_geasb(z(i), desc_a,info, scratch=.true.,mold=x%v)
call psb_geasb(c_scale(i), desc_a,info, scratch=.true.,mold=x%v) call psb_geasb(c_scale(i), desc_a,info, scratch=.true.,mold=x%v)
end do end do
itx = 0 itx = 0
nrst = -1 nrst = -1
call psb_init_conv(methdname,istop_,itrace_,itmax_,a,x,b,eps,desc_a,stopdat,info) call psb_init_conv(methdname,istop_,itrace_,itmax_,a,x,b,eps,desc_a,stopdat,info)
restart: do restart: do
if (itx>= itmax_) exit restart if (itx>= itmax_) exit restart
h = zzero h = zzero
it = 0 it = 0
! compute r0 = b-ax0 ! compute r0 = b-ax0
if (info /= psb_success_) then if (info /= psb_success_) then
info=psb_err_from_subroutine_non_ info=psb_err_from_subroutine_non_
call psb_errpush(info,name) call psb_errpush(info,name)
goto 9999 goto 9999
end if end if
call psb_geaxpby(zone, b, zzero, r, desc_a, info) call psb_geaxpby(zone, b, zzero, r, desc_a, info)
call psb_spmm(-zone,a,x,zone,r,desc_a,info,work=aux) call psb_spmm(-zone,a,x,zone,r,desc_a,info,work=aux)
if (info /= psb_success_) then if (info /= psb_success_) then
info=psb_err_from_subroutine_non_ info=psb_err_from_subroutine_non_
call psb_errpush(info,name) call psb_errpush(info,name)
goto 9999 goto 9999
end if end if
if (psb_check_conv(methdname,itx,x,r,desc_a,stopdat,info)) exit restart if (psb_check_conv(methdname,itx,x,r,desc_a,stopdat,info)) exit restart
nrst = nrst + 1 nrst = nrst + 1
iteration: do iteration: do
itx = itx + 1 itx = itx + 1
it = it + 1 it = it + 1
j = it j = it
!Apply preconditioner !Apply preconditioner
call prec%apply(r,z(j),desc_a,info,work=aux) call prec%apply(r,z(j),desc_a,info,work=aux)
call psb_spmm(zone,a,z(j),zzero,c(1),desc_a,info,work=aux) call psb_spmm(zone,a,z(j),zzero,c(1),desc_a,info,work=aux)
do i =1, j - 1 do i =1, j - 1
h(i,j) = psb_gedot(c_scale(i), c(i), desc_a, info) h(i,j) = psb_gedot(c_scale(i), c(i), desc_a, info)
call psb_geaxpby(zone, c(i), zzero, c(i+1), desc_a, info) call psb_geaxpby(zone, c(i), zzero, c(i+1), desc_a, info)
call psb_geaxpby(-h(i,j), c_scale(i), zone, c(i+1), desc_a, info) call psb_geaxpby(-h(i,j), c_scale(i), zone, c(i+1), desc_a, info)
end do end do
h(j,j) = psb_norm2(c(j), desc_a, info) h(j,j) = psb_norm2(c(j), desc_a, info)
hjj = zone/h(j,j) hjj = zone/h(j,j)
call psb_geaxpby(hjj, c(j), zzero, c_scale(j), desc_a, info) call psb_geaxpby(hjj, c(j), zzero, c_scale(j), desc_a, info)
alpha(j) = psb_gedot(c_scale(j), r, desc_a, info) alpha(j) = psb_gedot(c_scale(j), r, desc_a, info)
!Update residual !Update residual
call psb_geaxpby(zone, r, zzero, r, desc_a, info) call psb_geaxpby(zone, r, zzero, r, desc_a, info)
call psb_geaxpby(-alpha(j), c_scale(j), zone, r, desc_a, info) call psb_geaxpby(-alpha(j), c_scale(j), zone, r, desc_a, info)
if (psb_check_conv(methdname,itx,x,r,desc_a,stopdat,info)) exit restart if (psb_check_conv(methdname,itx,x,r,desc_a,stopdat,info)) exit restart
if (j >= irst) exit iteration if (j >= irst) exit iteration
end do iteration end do iteration
m = j m = j
!Compute solution !Compute solution
call ztrsm('l','u','n','n',m,1,zone,h,size(h,1),alpha,size(alpha,1)) call ztrsm('l','u','n','n',m,1,zone,h,size(h,1),alpha,size(alpha,1))
if (nrst == 0 ) then if (nrst == 0 ) then
call x%set(zzero) call x%set(zzero)
endif endif
do i=1,m do i=1,m
call psb_geaxpby(alpha(i), z(i), zone, x, desc_a, info) call psb_geaxpby(alpha(i), z(i), zone, x, desc_a, info)
enddo enddo
end do restart end do restart
m = j m = j
!Compute solution !Compute solution
call ztrsm('l','u','n','n',m,1,zone,h,size(h,1),alpha,size(alpha,1)) call ztrsm('l','u','n','n',m,1,zone,h,size(h,1),alpha,size(alpha,1))
call x%set(zzero) call x%set(zzero)
do i=1,m do i=1,m
call psb_geaxpby(alpha(i), z(i), zone, x, desc_a, info) call psb_geaxpby(alpha(i), z(i), zone, x, desc_a, info)
enddo enddo
iter = j iter = j
call psb_end_conv(methdname,itx,desc_a,stopdat,info,derr,iter) call psb_end_conv(methdname,itx,desc_a,stopdat,info,derr,iter)
if (present(err)) err = derr if (present(err)) err = derr
if (info == psb_success_) call psb_gefree(r,desc_a,info) if (info == psb_success_) call psb_gefree(r,desc_a,info)
do j = 1,m do j = 1,m
if (info == psb_success_) call psb_gefree(z(j),desc_a,info) if (info == psb_success_) call psb_gefree(z(j),desc_a,info)
if (info == psb_success_) call psb_gefree(c_scale(j),desc_a,info) if (info == psb_success_) call psb_gefree(c_scale(j),desc_a,info)
enddo enddo
do i =1,nl+1 do i =1,nl+1
if (info == psb_success_) call psb_gefree(c(i),desc_a,info) if (info == psb_success_) call psb_gefree(c(i),desc_a,info)
end do end do
if (info == psb_success_) deallocate(aux,h,c_scale,z,c,alpha,stat=info) if (info == psb_success_) deallocate(aux,h,c_scale,z,c,alpha,stat=info)
if (info /= psb_success_) then if (info /= psb_success_) then
info=psb_err_from_subroutine_non_ info=psb_err_from_subroutine_non_
call psb_errpush(info,name) call psb_errpush(info,name)
goto 9999 goto 9999
end if end if
call psb_erractionrestore(err_act) call psb_erractionrestore(err_act)
return return
9999 continue 9999 continue
call psb_erractionrestore(err_act) call psb_erractionrestore(err_act)
if (err_act.eq.psb_act_abort_) then if (err_act.eq.psb_act_abort_) then
call psb_error() call psb_error()
return return
end if end if
return return
end subroutine psb_zgcr_vect end subroutine psb_zgcr_vect

Write Preview
Loading…
Cancel
Save