psblas/krylov:
psb_dcgs.f90 psb_dcgstabl.f90 psb_krylov_mod.f90 psb_zbicg.f90 psb_zcg.f90 psb_zcgs.f90 psb_zcgstabl.f90 Added missing complex versions of iterative methods BICG CG BiGCSTAB(L). Need some more testing.psblas3-type-indexed
Salvatore Filippone
17 years ago
parent
93b0d9d4af
commit
844aef754b
@ -0,0 +1,330 @@
|
||||
!!$
|
||||
!!$ Parallel Sparse BLAS v2.0
|
||||
!!$ (C) Copyright 2006 Salvatore Filippone University of Rome Tor Vergata
|
||||
!!$ Alfredo Buttari 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 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.
|
||||
!!$
|
||||
!!$
|
||||
!!$ CCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCC
|
||||
!!$ C C
|
||||
!!$ C References: C
|
||||
!!$ C [1] Duff, I., Marrone, M., Radicati, G., and Vittoli, C. C
|
||||
!!$ C Level 3 basic linear algebra subprograms for sparse C
|
||||
!!$ C matrices: a user level interface C
|
||||
!!$ C ACM Trans. Math. Softw., 23(3), 379-401, 1997. C
|
||||
!!$ C C
|
||||
!!$ C C
|
||||
!!$ C [2] S. Filippone, M. Colajanni C
|
||||
!!$ C PSBLAS: A library for parallel linear algebra C
|
||||
!!$ C computation on sparse matrices C
|
||||
!!$ C ACM Trans. on Math. Softw., 26(4), 527-550, Dec. 2000. C
|
||||
!!$ C C
|
||||
!!$ C [3] M. Arioli, I. Duff, M. Ruiz C
|
||||
!!$ C Stopping criteria for iterative solvers C
|
||||
!!$ C SIAM J. Matrix Anal. Appl., Vol. 13, pp. 138-144, 1992 C
|
||||
!!$ C C
|
||||
!!$ C C
|
||||
!!$ C [4] R. Barrett et al C
|
||||
!!$ C Templates for the solution of linear systems C
|
||||
!!$ C SIAM, 1993 C
|
||||
!!$ C C
|
||||
!!$ C C
|
||||
!!$ CCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCC
|
||||
!
|
||||
! File: psb_zbicg.f90
|
||||
!
|
||||
! Subroutine: psb_zbicg
|
||||
! This subroutine implements the BiCG method.
|
||||
!
|
||||
! Arguments:
|
||||
!
|
||||
! a - type(psb_zspmat_type) Input: sparse matrix containing A.
|
||||
! prec - type(psb_zprec_type) Input: preconditioner
|
||||
! b(:) - complex Input: vector containing the
|
||||
! right hand side B
|
||||
! x(:) - complex Input/Output: vector containing the
|
||||
! initial guess and final solution X.
|
||||
! eps - real Input: Stopping tolerance; the iteration is
|
||||
! stopped when the error estimate |err| <= eps
|
||||
! desc_a - type(psb_desc_type). Input: The communication descriptor.
|
||||
! info - integer. Output: Return code
|
||||
!
|
||||
! itmax - integer(optional) Input: maximum number of iterations to be
|
||||
! performed.
|
||||
! iter - integer(optional) Output: how many iterations have been
|
||||
! performed.
|
||||
! err - real (optional) Output: error estimate on exit. If the
|
||||
! denominator of the estimate is exactly
|
||||
! 0, it is changed into 1.
|
||||
! itrace - integer(optional) Input: print an informational message
|
||||
! with the error estimate every itrace
|
||||
! iterations
|
||||
! istop - integer(optional) Input: stopping criterion, or how
|
||||
! to estimate the error.
|
||||
! 1: err = |r|/|b|; here the iteration is
|
||||
! stopped when |r| <= eps * |b|
|
||||
! 2: err = |r|/(|a||x|+|b|); here the iteration is
|
||||
! stopped when |r| <= eps * (|a||x|+|b|)
|
||||
! where r is the (preconditioned, recursive
|
||||
! estimate of) residual.
|
||||
!
|
||||
!
|
||||
subroutine psb_zbicg(a,prec,b,x,eps,desc_a,info,itmax,iter,err,itrace,istop)
|
||||
use psb_base_mod
|
||||
use psb_prec_mod
|
||||
use psb_krylov_mod, psb_protect_name => psb_zbicg
|
||||
implicit none
|
||||
|
||||
!!$ parameters
|
||||
type(psb_zspmat_type), intent(in) :: a
|
||||
type(psb_zprec_type), intent(in) :: prec
|
||||
type(psb_desc_type), intent(in) :: desc_a
|
||||
complex(kind(1.d0)), intent(in) :: b(:)
|
||||
complex(kind(1.d0)), intent(inout) :: x(:)
|
||||
real(kind(1.d0)), intent(in) :: eps
|
||||
integer, intent(out) :: info
|
||||
integer, optional, intent(in) :: itmax, itrace, istop
|
||||
integer, optional, intent(out) :: iter
|
||||
real(kind(1.d0)), optional, intent(out) :: err
|
||||
!!$ local data
|
||||
complex(kind(1.d0)), allocatable, target :: aux(:),wwrk(:,:)
|
||||
complex(kind(1.d0)), pointer :: ww(:), q(:),&
|
||||
& r(:), p(:), zt(:), pt(:), z(:), rt(:),qt(:)
|
||||
integer :: int_err(5)
|
||||
integer ::itmax_, naux, mglob, it, itrace_,&
|
||||
& np,me, n_row, n_col, istop_, err_act
|
||||
integer :: debug_level, debug_unit
|
||||
logical, parameter :: exchange=.true., noexchange=.false.
|
||||
integer, parameter :: irmax = 8
|
||||
integer :: itx, isvch, ictxt
|
||||
complex(kind(1.d0)) :: alpha, beta, rho, rho_old, sigma
|
||||
type(psb_itconv_type) :: stopdat
|
||||
character(len=20) :: name,ch_err
|
||||
character(len=*), parameter :: methdname='BiCG'
|
||||
|
||||
info = 0
|
||||
name = 'psb_zbicg'
|
||||
call psb_erractionsave(err_act)
|
||||
debug_unit = psb_get_debug_unit()
|
||||
debug_level = psb_get_debug_level()
|
||||
|
||||
ictxt = psb_cd_get_context(desc_a)
|
||||
call psb_info(ictxt, me, np)
|
||||
if (debug_level >= psb_debug_ext_)&
|
||||
& write(debug_unit,*) me,' ',trim(name),': from psb_info',np
|
||||
|
||||
mglob = psb_cd_get_global_rows(desc_a)
|
||||
n_row = psb_cd_get_local_rows(desc_a)
|
||||
n_col = psb_cd_get_local_cols(desc_a)
|
||||
|
||||
! Ensure global coherence for convergence checks.
|
||||
call psb_set_coher(ictxt,isvch)
|
||||
|
||||
|
||||
if (present(istop)) then
|
||||
istop_ = istop
|
||||
else
|
||||
istop_ = 1
|
||||
endif
|
||||
!
|
||||
! istop_ = 1: normwise backward error, infinity norm
|
||||
! istop_ = 2: ||r||/||b|| norm 2
|
||||
!
|
||||
|
||||
if ((istop_ < 1 ).or.(istop_ > 2 ) ) then
|
||||
info=5001
|
||||
int_err=istop_
|
||||
err=info
|
||||
call psb_errpush(info,name,i_err=int_err)
|
||||
goto 9999
|
||||
endif
|
||||
|
||||
call psb_chkvect(mglob,1,size(x,1),1,1,desc_a,info)
|
||||
if(info /= 0) then
|
||||
info=4010
|
||||
call psb_errpush(info,name,a_err='psb_chkvect on X')
|
||||
goto 9999
|
||||
end if
|
||||
call psb_chkvect(mglob,1,size(b,1),1,1,desc_a,info)
|
||||
if(info /= 0) then
|
||||
info=4010
|
||||
call psb_errpush(info,name,a_err='psb_chkvect on B')
|
||||
goto 9999
|
||||
end if
|
||||
|
||||
|
||||
naux=4*n_col
|
||||
|
||||
allocate(aux(naux),stat=info)
|
||||
if (info == 0) call psb_geall(wwrk,desc_a,info,n=9)
|
||||
if (info == 0) call psb_geasb(wwrk,desc_a,info)
|
||||
if(info /= 0) then
|
||||
info=4011
|
||||
ch_err='psb_asb'
|
||||
err=info
|
||||
call psb_errpush(info,name,a_err=ch_err)
|
||||
goto 9999
|
||||
end if
|
||||
|
||||
q => wwrk(:,1)
|
||||
qt => wwrk(:,2)
|
||||
r => wwrk(:,3)
|
||||
rt => wwrk(:,4)
|
||||
p => wwrk(:,5)
|
||||
pt => wwrk(:,6)
|
||||
z => wwrk(:,7)
|
||||
zt => wwrk(:,8)
|
||||
ww => wwrk(:,9)
|
||||
|
||||
if (present(itmax)) then
|
||||
itmax_ = itmax
|
||||
else
|
||||
itmax_ = 1000
|
||||
endif
|
||||
|
||||
if (present(itrace)) then
|
||||
itrace_ = itrace
|
||||
else
|
||||
itrace_ = 0
|
||||
end if
|
||||
|
||||
itx = 0
|
||||
|
||||
|
||||
call psb_init_conv(methdname,istop_,itrace_,itmax_,a,b,eps,desc_a,stopdat,info)
|
||||
if (info /= 0) Then
|
||||
call psb_errpush(4011,name)
|
||||
goto 9999
|
||||
End If
|
||||
|
||||
restart: do
|
||||
!!$
|
||||
!!$ r0 = b-ax0
|
||||
!!$
|
||||
if (itx >= itmax_) exit restart
|
||||
it = 0
|
||||
call psb_geaxpby(zone,b,zzero,r,desc_a,info)
|
||||
if (info == 0) call psb_spmm(-zone,a,x,zone,r,desc_a,info,work=aux)
|
||||
if (debug_level >= psb_debug_ext_)&
|
||||
& write(debug_unit,*) me,' ',trim(name),' Zone spmm',info
|
||||
if (info == 0) call psb_geaxpby(zone,r,zzero,rt,desc_a,info)
|
||||
if(info /= 0) then
|
||||
info=4011
|
||||
call psb_errpush(info,name)
|
||||
goto 9999
|
||||
end if
|
||||
|
||||
rho = zzero
|
||||
|
||||
! Perhaps we already satisfy the convergence criterion...
|
||||
if (psb_check_conv(methdname,itx,x,r,desc_a,stopdat,info)) exit restart
|
||||
if (info /= 0) Then
|
||||
call psb_errpush(4011,name)
|
||||
goto 9999
|
||||
End If
|
||||
|
||||
iteration: do
|
||||
it = it + 1
|
||||
itx = itx + 1
|
||||
|
||||
if (debug_level >= psb_debug_ext_) &
|
||||
& write(debug_unit,*) me,' ',trim(name),'iteration: ',itx
|
||||
|
||||
call psb_precaply(prec,r,z,desc_a,info,work=aux)
|
||||
if (info == 0) call psb_precaply(prec,rt,zt,desc_a,info,trans='c',work=aux)
|
||||
|
||||
rho_old = rho
|
||||
rho = psb_gedot(rt,z,desc_a,info)
|
||||
if (rho==zzero) then
|
||||
if (debug_level >= psb_debug_ext_) &
|
||||
& write(debug_unit,*) me,' ',trim(name),&
|
||||
& ' iteration breakdown r',rho
|
||||
exit iteration
|
||||
endif
|
||||
|
||||
if (it==1) then
|
||||
call psb_geaxpby(zone,z,zzero,p,desc_a,info)
|
||||
call psb_geaxpby(zone,zt,zzero,pt,desc_a,info)
|
||||
else
|
||||
beta = (rho/rho_old)
|
||||
call psb_geaxpby(zone,z,(beta),p,desc_a,info)
|
||||
call psb_geaxpby(zone,zt,(beta),pt,desc_a,info)
|
||||
end if
|
||||
|
||||
call psb_spmm(zone,a,p,zzero,q,desc_a,info,&
|
||||
& work=aux)
|
||||
call psb_spmm(zone,a,pt,zzero,qt,desc_a,info,&
|
||||
& work=aux,trans='c')
|
||||
|
||||
sigma = psb_gedot(pt,q,desc_a,info)
|
||||
if (sigma==zzero) then
|
||||
if (debug_level >= psb_debug_ext_) &
|
||||
& write(debug_unit,*) me,' ',trim(name),&
|
||||
& ' iteration breakdown s1', sigma
|
||||
exit iteration
|
||||
endif
|
||||
|
||||
alpha = rho/sigma
|
||||
|
||||
|
||||
call psb_geaxpby((alpha),p,zone,x,desc_a,info)
|
||||
call psb_geaxpby(-(alpha),q,zone,r,desc_a,info)
|
||||
call psb_geaxpby(-(alpha),qt,zone,rt,desc_a,info)
|
||||
|
||||
if (psb_check_conv(methdname,itx,x,r,desc_a,stopdat,info)) exit restart
|
||||
if (info /= 0) Then
|
||||
call psb_errpush(4011,name)
|
||||
goto 9999
|
||||
End If
|
||||
|
||||
end do iteration
|
||||
end do restart
|
||||
|
||||
call psb_end_conv(methdname,itx,desc_a,stopdat,info,err,iter)
|
||||
|
||||
deallocate(aux, stat=info)
|
||||
if (info == 0) call psb_gefree(wwrk,desc_a,info)
|
||||
if (info/=0) then
|
||||
call psb_errpush(info,name)
|
||||
goto 9999
|
||||
end if
|
||||
! restore external global coherence behaviour
|
||||
call psb_restore_coher(ictxt,isvch)
|
||||
|
||||
call psb_erractionrestore(err_act)
|
||||
return
|
||||
|
||||
9999 continue
|
||||
call psb_erractionrestore(err_act)
|
||||
if (err_act == psb_act_abort_) then
|
||||
call psb_error()
|
||||
return
|
||||
end if
|
||||
return
|
||||
|
||||
end subroutine psb_zbicg
|
||||
|
||||
|
||||
@ -0,0 +1,279 @@
|
||||
!!$
|
||||
!!$ Parallel Sparse BLAS v2.0
|
||||
!!$ (C) Copyright 2006 Salvatore Filippone University of Rome Tor Vergata
|
||||
!!$ Alfredo Buttari 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 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.
|
||||
!!$
|
||||
!!$
|
||||
! File: psb_zcg.f90
|
||||
!!$ CCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCC
|
||||
!!$ C C
|
||||
!!$ C References: C
|
||||
!!$ C [1] Duff, I., Marrone, M., Radicati, G., and Vittoli, C. C
|
||||
!!$ C Level 3 basic linear algebra subprograms for sparse C
|
||||
!!$ C matrices: a user level interface C
|
||||
!!$ C ACM Trans. Math. Softw., 23(3), 379-401, 1997. C
|
||||
!!$ C C
|
||||
!!$ C C
|
||||
!!$ C [2] S. Filippone, M. Colajanni C
|
||||
!!$ C PSBLAS: A library for parallel linear algebra C
|
||||
!!$ C computation on sparse matrices C
|
||||
!!$ C ACM Trans. on Math. Softw., 26(4), 527-550, Dec. 2000. C
|
||||
!!$ C C
|
||||
!!$ C [3] M. Arioli, I. Duff, M. Ruiz C
|
||||
!!$ C Stopping criteria for iterative solvers C
|
||||
!!$ C SIAM J. Matrix Anal. Appl., Vol. 13, pp. 138-144, 1992 C
|
||||
!!$ C C
|
||||
!!$ C C
|
||||
!!$ C [4] R. Barrett et al C
|
||||
!!$ C Templates for the solution of linear systems C
|
||||
!!$ C SIAM, 1993
|
||||
!!$ C C
|
||||
!!$ C C
|
||||
!!$ CCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCC
|
||||
! File: psb_zcg.f90
|
||||
!
|
||||
! Subroutine: psb_zcg
|
||||
! This subroutine implements the Conjugate Gradient method.
|
||||
!
|
||||
!
|
||||
! Arguments:
|
||||
!
|
||||
! a - type(psb_zspmat_type) Input: sparse matrix containing A.
|
||||
! prec - type(psb_zprec_type) Input: preconditioner
|
||||
! b(:) - complex Input: vector containing the
|
||||
! right hand side B
|
||||
! x(:) - complex Input/Output: vector containing the
|
||||
! initial guess and final solution X.
|
||||
! eps - real Input: Stopping tolerance; the iteration is
|
||||
! stopped when the error estimate |err| <= eps
|
||||
! desc_a - type(psb_desc_type). Input: The communication descriptor.
|
||||
! info - integer. Output: Return code
|
||||
!
|
||||
! itmax - integer(optional) Input: maximum number of iterations to be
|
||||
! performed.
|
||||
! iter - integer(optional) Output: how many iterations have been
|
||||
! performed.
|
||||
! performed.
|
||||
! err - real (optional) Output: error estimate on exit. If the
|
||||
! denominator of the estimate is exactly
|
||||
! 0, it is changed into 1.
|
||||
! itrace - integer(optional) Input: print an informational message
|
||||
! with the error estimate every itrace
|
||||
! iterations
|
||||
! istop - integer(optional) Input: stopping criterion, or how
|
||||
! to estimate the error.
|
||||
! 1: err = |r|/|b|; here the iteration is
|
||||
! stopped when |r| <= eps * |b|
|
||||
! 2: err = |r|/(|a||x|+|b|); here the iteration is
|
||||
! stopped when |r| <= eps * (|a||x|+|b|)
|
||||
! where r is the (preconditioned, recursive
|
||||
! estimate of) residual.
|
||||
!
|
||||
!
|
||||
subroutine psb_zcg(a,prec,b,x,eps,desc_a,info,itmax,iter,err,itrace,istop)
|
||||
use psb_base_mod
|
||||
use psb_prec_mod
|
||||
use psb_krylov_mod, psb_protect_name => psb_zcg
|
||||
implicit none
|
||||
|
||||
!!$ Parameters
|
||||
Type(psb_zspmat_type), Intent(in) :: a
|
||||
Type(psb_zprec_type), Intent(in) :: prec
|
||||
Type(psb_desc_type), Intent(in) :: desc_a
|
||||
complex(Kind(1.d0)), Intent(in) :: b(:)
|
||||
complex(Kind(1.d0)), Intent(inout) :: x(:)
|
||||
Real(Kind(1.d0)), Intent(in) :: eps
|
||||
integer, intent(out) :: info
|
||||
Integer, Optional, Intent(in) :: itmax, itrace, istop
|
||||
Integer, Optional, Intent(out) :: iter
|
||||
Real(Kind(1.d0)), Optional, Intent(out) :: err
|
||||
!!$ Local data
|
||||
complex(kind(1.d0)), allocatable, target :: aux(:), wwrk(:,:)
|
||||
complex(kind(1.d0)), pointer :: q(:), p(:), r(:), z(:), w(:)
|
||||
complex(kind(1.d0)) :: alpha, beta, rho, rho_old, sigma
|
||||
integer :: itmax_, istop_, naux, mglob, it, itx, itrace_,&
|
||||
& np,me, n_col, isvch, ictxt, n_row,err_act, int_err(5)
|
||||
integer :: debug_level, debug_unit
|
||||
type(psb_itconv_type) :: stopdat
|
||||
character(len=20) :: name
|
||||
character(len=*), parameter :: methdname='CG'
|
||||
|
||||
info = 0
|
||||
name = 'psb_zcg'
|
||||
call psb_erractionsave(err_act)
|
||||
debug_unit = psb_get_debug_unit()
|
||||
debug_level = psb_get_debug_level()
|
||||
|
||||
ictxt = psb_cd_get_context(desc_a)
|
||||
|
||||
call psb_info(ictxt, me, np)
|
||||
|
||||
|
||||
mglob = psb_cd_get_global_rows(desc_a)
|
||||
n_row = psb_cd_get_local_rows(desc_a)
|
||||
n_col = psb_cd_get_local_cols(desc_a)
|
||||
|
||||
if (present(istop)) then
|
||||
istop_ = istop
|
||||
else
|
||||
istop_ = 1
|
||||
endif
|
||||
|
||||
call psb_chkvect(mglob,1,size(x,1),1,1,desc_a,info)
|
||||
if (info == 0) call psb_chkvect(mglob,1,size(b,1),1,1,desc_a,info)
|
||||
if(info /= 0) then
|
||||
info=4010
|
||||
call psb_errpush(info,name,a_err='psb_chkvect on X/B')
|
||||
goto 9999
|
||||
end if
|
||||
|
||||
naux=4*n_col
|
||||
allocate(aux(naux), stat=info)
|
||||
if (info == 0) call psb_geall(wwrk,desc_a,info,n=5)
|
||||
if (info == 0) call psb_geasb(wwrk,desc_a,info)
|
||||
if (info /= 0) then
|
||||
info=4011
|
||||
call psb_errpush(info,name)
|
||||
goto 9999
|
||||
end if
|
||||
|
||||
p => wwrk(:,1)
|
||||
q => wwrk(:,2)
|
||||
r => wwrk(:,3)
|
||||
z => wwrk(:,4)
|
||||
w => wwrk(:,5)
|
||||
|
||||
|
||||
if (present(itmax)) then
|
||||
itmax_ = itmax
|
||||
else
|
||||
itmax_ = 1000
|
||||
endif
|
||||
|
||||
if (present(itrace)) then
|
||||
itrace_ = itrace
|
||||
else
|
||||
itrace_ = 0
|
||||
end if
|
||||
|
||||
itx=0
|
||||
|
||||
! Ensure global coherence for convergence checks.
|
||||
call psb_set_coher(ictxt,isvch)
|
||||
|
||||
restart: do
|
||||
!!$
|
||||
!!$ r0 = b-Ax0
|
||||
!!$
|
||||
if (itx>= itmax_) exit restart
|
||||
|
||||
it = 0
|
||||
call psb_geaxpby(zone,b,zzero,r,desc_a,info)
|
||||
if (info == 0) call psb_spmm(-zone,a,x,zone,r,desc_a,info,work=aux)
|
||||
if (info /= 0) then
|
||||
info=4011
|
||||
call psb_errpush(info,name)
|
||||
goto 9999
|
||||
end if
|
||||
|
||||
rho = zzero
|
||||
|
||||
call psb_init_conv(methdname,istop_,itrace_,itmax_,a,b,eps,desc_a,stopdat,info)
|
||||
if (info /= 0) Then
|
||||
call psb_errpush(4011,name)
|
||||
goto 9999
|
||||
End If
|
||||
|
||||
iteration: do
|
||||
|
||||
it = it + 1
|
||||
itx = itx + 1
|
||||
|
||||
call psb_precaply(prec,r,z,desc_a,info,work=aux)
|
||||
rho_old = rho
|
||||
rho = psb_gedot(r,z,desc_a,info)
|
||||
|
||||
if (it==1) then
|
||||
call psb_geaxpby(zone,z,zzero,p,desc_a,info)
|
||||
else
|
||||
if (rho_old==zzero) then
|
||||
if (debug_level >= psb_debug_ext_)&
|
||||
& write(debug_unit,*) me,' ',trim(name),&
|
||||
& ': CG Iteration breakdown rho'
|
||||
exit iteration
|
||||
endif
|
||||
beta = rho/rho_old
|
||||
call psb_geaxpby(zone,z,beta,p,desc_a,info)
|
||||
end if
|
||||
|
||||
call psb_spmm(zone,a,p,zzero,q,desc_a,info,work=aux)
|
||||
sigma = psb_gedot(p,q,desc_a,info)
|
||||
if (sigma==zzero) then
|
||||
if (debug_level >= psb_debug_ext_)&
|
||||
& write(debug_unit,*) me,' ',trim(name),&
|
||||
& ': CG Iteration breakdown sigma'
|
||||
exit iteration
|
||||
endif
|
||||
|
||||
alpha = rho/sigma
|
||||
call psb_geaxpby(alpha,p,zone,x,desc_a,info)
|
||||
call psb_geaxpby(-alpha,q,zone,r,desc_a,info)
|
||||
|
||||
if (psb_check_conv(methdname,itx,x,r,desc_a,stopdat,info)) exit restart
|
||||
if (info /= 0) Then
|
||||
call psb_errpush(4011,name)
|
||||
goto 9999
|
||||
End If
|
||||
|
||||
end do iteration
|
||||
end do restart
|
||||
|
||||
call psb_end_conv(methdname,itx,desc_a,stopdat,info,err,iter)
|
||||
|
||||
call psb_gefree(wwrk,desc_a,info)
|
||||
if (info /= 0) then
|
||||
call psb_errpush(info,name)
|
||||
goto 9999
|
||||
end if
|
||||
|
||||
! restore external global coherence behaviour
|
||||
call psb_restore_coher(ictxt,isvch)
|
||||
|
||||
call psb_erractionrestore(err_act)
|
||||
return
|
||||
|
||||
9999 continue
|
||||
call psb_erractionrestore(err_act)
|
||||
if (err_act == psb_act_abort_) then
|
||||
call psb_error()
|
||||
return
|
||||
end if
|
||||
return
|
||||
|
||||
end subroutine psb_zcg
|
||||
|
||||
|
||||
@ -0,0 +1,407 @@
|
||||
!!$
|
||||
!!$ Parallel Sparse BLAS v2.0
|
||||
!!$ (C) Copyright 2006 Salvatore Filippone University of Rome Tor Vergata
|
||||
!!$ Alfredo Buttari 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 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.
|
||||
!!$
|
||||
!!$
|
||||
!!$ CCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCC
|
||||
!!$ C C
|
||||
!!$ C References: C
|
||||
!!$ C [1] Duff, I., Marrone, M., Radicati, G., and Vittoli, C. C
|
||||
!!$ C Level 3 basic linear algebra subprograms for sparse C
|
||||
!!$ C matrices: a user level interface C
|
||||
!!$ C ACM Trans. Math. Softw., 23(3), 379-401, 1997. C
|
||||
!!$ C C
|
||||
!!$ C C
|
||||
!!$ C [2] S. Filippone, M. Colajanni C
|
||||
!!$ C PSBLAS: A library for parallel linear algebra C
|
||||
!!$ C computation on sparse matrices C
|
||||
!!$ C ACM Trans. on Math. Softw., 26(4), 527-550, Dec. 2000. C
|
||||
!!$ C C
|
||||
!!$ C [3] M. Arioli, I. Duff, M. Ruiz C
|
||||
!!$ C Stopping criteria for iterative solvers C
|
||||
!!$ C SIAM J. Matrix Anal. Appl., Vol. 13, pp. 138-144, 1992 C
|
||||
!!$ C C
|
||||
!!$ C C
|
||||
!!$ C [4] R. Barrett et al C
|
||||
!!$ C Templates for the solution of linear systems C
|
||||
!!$ C SIAM, 1993 C
|
||||
!!$ C C
|
||||
!!$ C C
|
||||
!!$ C [5] G. Sleijpen, D. Fokkema C
|
||||
!!$ C BICGSTAB(L) for linear equations involving unsymmetric C
|
||||
!!$ C matrices with complex spectrum C
|
||||
!!$ C Electronic Trans. on Numer. Analysis, Vol. 1, pp. 11-32, C
|
||||
!!$ C Sep. 1993 C
|
||||
!!$ C C
|
||||
!!$ C C
|
||||
!!$ CCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCC
|
||||
! File: psb_zcgstabl.f90
|
||||
!
|
||||
! Subroutine: psb_zcgstabl
|
||||
! Implements the BICGSTAB(L) method
|
||||
!
|
||||
!
|
||||
! Arguments:
|
||||
!
|
||||
! a - type(psb_zspmat_type) Input: sparse matrix containing A.
|
||||
! prec - type(psb_zprec_type) Input: preconditioner
|
||||
! b(:) - complex Input: vector containing the
|
||||
! right hand side B
|
||||
! x(:) - complex Input/Output: vector containing the
|
||||
! initial guess and final solution X.
|
||||
! eps - real Input: Stopping tolerance; the iteration is
|
||||
! stopped when the error estimate |err| <= eps
|
||||
! desc_a - type(psb_desc_type). Input: The communication descriptor.
|
||||
! info - integer. Output: Return code
|
||||
!
|
||||
! itmax - integer(optional) Input: maximum number of iterations to be
|
||||
! performed.
|
||||
! iter - integer(optional) Output: how many iterations have been
|
||||
! performed.
|
||||
! performed.
|
||||
! err - real (optional) Output: error estimate on exit. If the
|
||||
! denominator of the estimate is exactly
|
||||
! 0, it is changed into 1.
|
||||
! itrace - integer(optional) Input: print an informational message
|
||||
! with the error estimate every itrace
|
||||
! iterations
|
||||
! istop - integer(optional) Input: stopping criterion, or how
|
||||
! to estimate the error.
|
||||
! 1: err = |r|/|b|; here the iteration is
|
||||
! stopped when |r| <= eps * |b|
|
||||
! 2: err = |r|/(|a||x|+|b|); here the iteration
|
||||
! is stopped when |r| <= eps * (|a||x|+|b|)
|
||||
! where r is the (preconditioned, recursive
|
||||
! estimate of) residual.
|
||||
! irst - integer(optional) Input: restart parameter L
|
||||
!
|
||||
!
|
||||
!
|
||||
Subroutine psb_zcgstabl(a,prec,b,x,eps,desc_a,info,itmax,iter,err,itrace,irst,istop)
|
||||
use psb_base_mod
|
||||
use psb_prec_mod
|
||||
use psb_krylov_mod, psb_protect_name => psb_zcgstabl
|
||||
implicit none
|
||||
|
||||
!!$ parameters
|
||||
Type(psb_zspmat_type), Intent(in) :: a
|
||||
Type(psb_zprec_type), Intent(in) :: prec
|
||||
Type(psb_desc_type), Intent(in) :: desc_a
|
||||
complex(Kind(1.d0)), Intent(in) :: b(:)
|
||||
complex(Kind(1.d0)), Intent(inout) :: x(:)
|
||||
Real(Kind(1.d0)), Intent(in) :: eps
|
||||
integer, intent(out) :: info
|
||||
Integer, Optional, Intent(in) :: itmax, itrace, irst,istop
|
||||
Integer, Optional, Intent(out) :: iter
|
||||
Real(Kind(1.d0)), Optional, Intent(out) :: err
|
||||
!!$ local data
|
||||
complex(Kind(1.d0)), allocatable, target :: aux(:),wwrk(:,:),uh(:,:), rh(:,:)
|
||||
complex(Kind(1.d0)), Pointer :: ww(:), q(:), r(:), rt0(:), p(:), v(:), &
|
||||
& s(:), t(:), z(:), f(:), gamma(:), gamma1(:), gamma2(:), taum(:,:), sigma(:)
|
||||
|
||||
Integer :: itmax_, naux, mglob, it, itrace_,&
|
||||
& np,me, n_row, n_col, nl, err_act
|
||||
Logical, Parameter :: exchange=.True., noexchange=.False.
|
||||
Integer, Parameter :: irmax = 8
|
||||
Integer :: itx, i, isvch, ictxt,istop_,j, int_err(5)
|
||||
integer :: debug_level, debug_unit
|
||||
complex(Kind(1.d0)) :: alpha, beta, rho, rho_old, rni, xni, bni, ani,bn2,&
|
||||
& omega
|
||||
type(psb_itconv_type) :: stopdat
|
||||
character(len=20) :: name
|
||||
character(len=*), parameter :: methdname='BiCGStab(L)'
|
||||
|
||||
info = 0
|
||||
name = 'psb_zcgstabl'
|
||||
call psb_erractionsave(err_act)
|
||||
debug_unit = psb_get_debug_unit()
|
||||
debug_level = psb_get_debug_level()
|
||||
|
||||
ictxt = psb_cd_get_context(desc_a)
|
||||
Call psb_info(ictxt, me, np)
|
||||
if (debug_level >= psb_debug_ext_)&
|
||||
& write(debug_unit,*) me,' ',trim(name),': from psb_info',np
|
||||
|
||||
|
||||
mglob = psb_cd_get_global_rows(desc_a)
|
||||
n_row = psb_cd_get_local_rows(desc_a)
|
||||
n_col = psb_cd_get_local_cols(desc_a)
|
||||
|
||||
if (present(istop)) then
|
||||
istop_ = istop
|
||||
else
|
||||
istop_ = 1
|
||||
endif
|
||||
|
||||
if (present(itmax)) then
|
||||
itmax_ = itmax
|
||||
else
|
||||
itmax_ = 1000
|
||||
endif
|
||||
|
||||
if (present(itrace)) then
|
||||
itrace_ = itrace
|
||||
else
|
||||
itrace_ = 0
|
||||
end if
|
||||
|
||||
if (present(irst)) then
|
||||
nl = irst
|
||||
if (debug_level >= psb_debug_ext_) &
|
||||
& write(debug_unit,*) me,' ',trim(name),&
|
||||
& 'present: irst: ',irst,nl
|
||||
else
|
||||
nl = 1
|
||||
if (debug_level >= psb_debug_ext_) &
|
||||
& write(debug_unit,*) me,' ',trim(name),&
|
||||
& ' not present: irst: ',irst,nl
|
||||
endif
|
||||
if (nl <=0 ) then
|
||||
info=5001
|
||||
int_err(1)=nl
|
||||
err=info
|
||||
call psb_errpush(info,name,i_err=int_err)
|
||||
goto 9999
|
||||
endif
|
||||
|
||||
call psb_chkvect(mglob,1,size(x,1),1,1,desc_a,info)
|
||||
if (info == 0) call psb_chkvect(mglob,1,size(b,1),1,1,desc_a,info)
|
||||
if (info /= 0) then
|
||||
info=4010
|
||||
call psb_errpush(info,name,a_err='psb_chkvect on X/B')
|
||||
goto 9999
|
||||
end if
|
||||
|
||||
naux=4*n_col
|
||||
allocate(aux(naux),gamma(0:nl),gamma1(nl),&
|
||||
&gamma2(nl),taum(nl,nl),sigma(nl), stat=info)
|
||||
|
||||
if (info /= 0) then
|
||||
info=4000
|
||||
call psb_errpush(info,name)
|
||||
goto 9999
|
||||
end if
|
||||
if (info == 0) Call psb_geall(wwrk,desc_a,info,n=10)
|
||||
if (info == 0) Call psb_geall(uh,desc_a,info,n=nl+1,lb=0)
|
||||
if (info == 0) Call psb_geall(rh,desc_a,info,n=nl+1,lb=0)
|
||||
if (info == 0) Call psb_geasb(wwrk,desc_a,info)
|
||||
if (info == 0) Call psb_geasb(uh,desc_a,info)
|
||||
if (info == 0) Call psb_geasb(rh,desc_a,info)
|
||||
if (info /= 0) then
|
||||
info=4011
|
||||
call psb_errpush(info,name)
|
||||
goto 9999
|
||||
end if
|
||||
|
||||
q => wwrk(:,1)
|
||||
r => wwrk(:,2)
|
||||
p => wwrk(:,3)
|
||||
v => wwrk(:,4)
|
||||
f => wwrk(:,5)
|
||||
s => wwrk(:,6)
|
||||
t => wwrk(:,7)
|
||||
z => wwrk(:,8)
|
||||
ww => wwrk(:,9)
|
||||
rt0 => wwrk(:,10)
|
||||
|
||||
! Ensure global coherence for convergence checks.
|
||||
call psb_set_coher(ictxt,isvch)
|
||||
|
||||
|
||||
call psb_init_conv(methdname,istop_,itrace_,itmax_,a,b,eps,desc_a,stopdat,info)
|
||||
if (info /= 0) Then
|
||||
call psb_errpush(4011,name)
|
||||
goto 9999
|
||||
End If
|
||||
|
||||
itx = 0
|
||||
restart: do
|
||||
!!$
|
||||
!!$ r0 = b-ax0
|
||||
!!$
|
||||
if (debug_level >= psb_debug_ext_) &
|
||||
& write(debug_unit,*) me,' ',trim(name),' restart: ',itx,it
|
||||
if (itx >= itmax_) exit restart
|
||||
|
||||
it = 0
|
||||
call psb_geaxpby(zone,b,zzero,r,desc_a,info)
|
||||
if (info == 0) call psb_spmm(-zone,a,x,zone,r,desc_a,info,work=aux)
|
||||
|
||||
if (info == 0) call psb_precaply(prec,r,desc_a,info)
|
||||
|
||||
if (info == 0) call psb_geaxpby(zone,r,zzero,rt0,desc_a,info)
|
||||
if (info == 0) call psb_geaxpby(zone,r,zzero,rh(:,0),desc_a,info)
|
||||
if (info == 0) call psb_geaxpby(zzero,r,zzero,uh(:,0),desc_a,info)
|
||||
if (info /= 0) then
|
||||
info=4011
|
||||
call psb_errpush(info,name)
|
||||
goto 9999
|
||||
end if
|
||||
|
||||
rho = zone
|
||||
alpha = zzero
|
||||
omega = zone
|
||||
|
||||
if (debug_level >= psb_debug_ext_) &
|
||||
& write(debug_unit,*) me,' ',trim(name),&
|
||||
& ' on entry to amax: b: ',Size(b)
|
||||
|
||||
if (psb_check_conv(methdname,itx,x,r,desc_a,stopdat,info)) exit restart
|
||||
if (info /= 0) Then
|
||||
call psb_errpush(4011,name)
|
||||
goto 9999
|
||||
End If
|
||||
|
||||
iteration: do
|
||||
it = it + nl
|
||||
itx = itx + nl
|
||||
rho = -omega*rho
|
||||
|
||||
if (debug_level >= psb_debug_ext_) &
|
||||
& write(debug_unit,*) me,' ',trim(name),&
|
||||
& ' iteration: ',itx, rho,rh(1,0)
|
||||
|
||||
do j = 0, nl -1
|
||||
If (debug_level >= psb_debug_ext_) &
|
||||
& write(debug_unit,*) me,' ',trim(name),'bicg part: ',j, nl
|
||||
|
||||
rho_old = rho
|
||||
rho = psb_gedot(rh(:,j),rt0,desc_a,info)
|
||||
if (rho==zzero) then
|
||||
if (debug_level >= psb_debug_ext_) &
|
||||
& write(debug_unit,*) me,' ',trim(name),&
|
||||
& ' bi-cgstab iteration breakdown r',rho
|
||||
exit iteration
|
||||
endif
|
||||
|
||||
beta = alpha*rho/rho_old
|
||||
rho_old = rho
|
||||
call psb_geaxpby(zone,rh(:,0:j),-beta,uh(:,0:j),desc_a,info)
|
||||
call psb_spmm(zone,a,uh(:,j),zzero,uh(:,j+1),desc_a,info,work=aux)
|
||||
|
||||
call psb_precaply(prec,uh(:,j+1),desc_a,info)
|
||||
|
||||
gamma(j) = psb_gedot(uh(:,j+1),rt0,desc_a,info)
|
||||
|
||||
if (gamma(j)==zzero) then
|
||||
if (debug_level >= psb_debug_ext_) &
|
||||
& write(debug_unit,*) me,' ',trim(name),&
|
||||
& ' bi-cgstab iteration breakdown s2',gamma(j)
|
||||
exit iteration
|
||||
endif
|
||||
alpha = rho/gamma(j)
|
||||
if (debug_level >= psb_debug_ext_) &
|
||||
& write(debug_unit,*) me,' ',trim(name),&
|
||||
& ' bicg part: alpha=r/g ',alpha,rho,gamma(j)
|
||||
|
||||
call psb_geaxpby(-alpha,uh(:,1:j+1),zone,rh(:,0:j),desc_a,info)
|
||||
call psb_geaxpby(alpha,uh(:,0),zone,x,desc_a,info)
|
||||
call psb_spmm(zone,a,rh(:,j),zzero,rh(:,j+1),desc_a,info,work=aux)
|
||||
|
||||
call psb_precaply(prec,rh(:,j+1),desc_a,info)
|
||||
|
||||
enddo
|
||||
|
||||
do j=1, nl
|
||||
if (debug_level >= psb_debug_ext_) &
|
||||
& write(debug_unit,*) me,' ',trim(name),&
|
||||
& ' mod g-s part: ',j, nl,rh(1,0)
|
||||
|
||||
do i=1, j-1
|
||||
taum(i,j) = psb_gedot(rh(:,i),rh(:,j),desc_a,info)
|
||||
taum(i,j) = taum(i,j)/sigma(i)
|
||||
call psb_geaxpby(-taum(i,j),rh(:,i),zone,rh(:,j),desc_a,info)
|
||||
enddo
|
||||
sigma(j) = psb_gedot(rh(:,j),rh(:,j),desc_a,info)
|
||||
gamma1(j) = psb_gedot(rh(:,0),rh(:,j),desc_a,info)
|
||||
gamma1(j) = gamma1(j)/sigma(j)
|
||||
enddo
|
||||
|
||||
gamma(nl) = gamma1(nl)
|
||||
omega = gamma(nl)
|
||||
|
||||
do j=nl-1,1,-1
|
||||
gamma(j) = gamma1(j)
|
||||
do i=j+1,nl
|
||||
gamma(j) = gamma(j) - taum(j,i) * gamma(i)
|
||||
enddo
|
||||
enddo
|
||||
|
||||
do j=1,nl-1
|
||||
gamma2(j) = gamma(j+1)
|
||||
do i=j+1,nl-1
|
||||
gamma2(j) = gamma2(j) + taum(j,i) * gamma(i+1)
|
||||
enddo
|
||||
enddo
|
||||
|
||||
call psb_geaxpby(gamma(1),rh(:,0),zone,x,desc_a,info)
|
||||
call psb_geaxpby(-gamma1(nl),rh(:,nl),zone,rh(:,0),desc_a,info)
|
||||
call psb_geaxpby(-gamma(nl),uh(:,nl),zone,uh(:,0),desc_a,info)
|
||||
|
||||
do j=1, nl-1
|
||||
call psb_geaxpby(-gamma(j),uh(:,j),zone,uh(:,0),desc_a,info)
|
||||
call psb_geaxpby(gamma2(j),rh(:,j),zone,x,desc_a,info)
|
||||
call psb_geaxpby(-gamma1(j),rh(:,j),zone,rh(:,0),desc_a,info)
|
||||
enddo
|
||||
|
||||
if (psb_check_conv(methdname,itx,x,rh(:,0),desc_a,stopdat,info)) exit restart
|
||||
if (info /= 0) Then
|
||||
call psb_errpush(4011,name)
|
||||
goto 9999
|
||||
End If
|
||||
|
||||
end do iteration
|
||||
end do restart
|
||||
|
||||
call psb_end_conv(methdname,itx,desc_a,stopdat,info,err,iter)
|
||||
|
||||
deallocate(aux,stat=info)
|
||||
if (info == 0) call psb_gefree(wwrk,desc_a,info)
|
||||
if (info == 0) call psb_gefree(uh,desc_a,info)
|
||||
if (info == 0) call psb_gefree(rh,desc_a,info)
|
||||
if (info/=0) then
|
||||
call psb_errpush(info,name)
|
||||
goto 9999
|
||||
end if
|
||||
|
||||
! restore external global coherence behaviour
|
||||
call psb_restore_coher(ictxt,isvch)
|
||||
call psb_erractionrestore(err_act)
|
||||
return
|
||||
|
||||
9999 continue
|
||||
call psb_erractionrestore(err_act)
|
||||
if (err_act == psb_act_abort_) then
|
||||
call psb_error()
|
||||
return
|
||||
end if
|
||||
return
|
||||
|
||||
End Subroutine psb_zcgstabl
|
||||
|
||||
|
||||
Loading…
Reference in New Issue