You cannot select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
507 lines
15 KiB
Fortran
507 lines
15 KiB
Fortran
!!$
|
|
!!$
|
|
!!$ MLD2P4 version 2.0
|
|
!!$ MultiLevel Domain Decomposition Parallel Preconditioners Package
|
|
!!$ based on PSBLAS (Parallel Sparse BLAS version 3.0)
|
|
!!$
|
|
!!$ (C) Copyright 2008,2009,2010,2010,2012
|
|
!!$
|
|
!!$ Salvatore Filippone University of Rome Tor Vergata
|
|
!!$ Alfredo Buttari CNRS-IRIT, Toulouse
|
|
!!$ Pasqua D'Ambra ICAR-CNR, Naples
|
|
!!$ Daniela di Serafino Second University of Naples
|
|
!!$
|
|
!!$ 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 MLD2P4 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 MLD2P4 GROUP OR ITS CONTRIBUTORS
|
|
!!$ BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
|
|
!!$ CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
|
|
!!$ SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
|
|
!!$ INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
|
|
!!$ CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
|
|
!!$ ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
|
|
!!$ POSSIBILITY OF SUCH DAMAGE.
|
|
!!$
|
|
!!$
|
|
subroutine mld_s_as_smoother_apply_vect(alpha,sm,x,beta,y,desc_data,trans,&
|
|
& sweeps,work,info)
|
|
use psb_base_mod
|
|
use mld_s_as_smoother, mld_protect_nam => mld_s_as_smoother_apply_vect
|
|
implicit none
|
|
type(psb_desc_type), intent(in) :: desc_data
|
|
class(mld_s_as_smoother_type), intent(inout) :: sm
|
|
type(psb_s_vect_type),intent(inout) :: x
|
|
type(psb_s_vect_type),intent(inout) :: y
|
|
real(psb_spk_),intent(in) :: alpha,beta
|
|
character(len=1),intent(in) :: trans
|
|
integer(psb_ipk_), intent(in) :: sweeps
|
|
real(psb_spk_),target, intent(inout) :: work(:)
|
|
integer(psb_ipk_), intent(out) :: info
|
|
|
|
integer(psb_ipk_) :: n_row,n_col, nrow_d, i
|
|
real(psb_spk_), pointer :: ww(:), aux(:), tx(:),ty(:)
|
|
real(psb_spk_), allocatable :: vx(:)
|
|
type(psb_s_vect_type) :: vtx, vty, vww
|
|
integer(psb_ipk_) :: ictxt,np,me, err_act,isz,int_err(5)
|
|
character :: trans_
|
|
character(len=20) :: name='s_as_smoother_apply', ch_err
|
|
|
|
call psb_erractionsave(err_act)
|
|
|
|
info = psb_success_
|
|
ictxt = desc_data%get_context()
|
|
call psb_info(ictxt,me,np)
|
|
|
|
trans_ = psb_toupper(trans)
|
|
select case(trans_)
|
|
case('N')
|
|
case('T')
|
|
case('C')
|
|
case default
|
|
call psb_errpush(psb_err_iarg_invalid_i_,name)
|
|
goto 9999
|
|
end select
|
|
|
|
if (.not.allocated(sm%sv)) then
|
|
info = 1121
|
|
call psb_errpush(info,name)
|
|
goto 9999
|
|
end if
|
|
|
|
|
|
n_row = sm%desc_data%get_local_rows()
|
|
n_col = sm%desc_data%get_local_cols()
|
|
nrow_d = desc_data%get_local_rows()
|
|
isz = max(n_row,N_COL)
|
|
|
|
if ((6*isz) <= size(work)) then
|
|
ww => work(1:isz)
|
|
tx => work(isz+1:2*isz)
|
|
ty => work(2*isz+1:3*isz)
|
|
aux => work(3*isz+1:)
|
|
else if ((4*isz) <= size(work)) then
|
|
aux => work(1:)
|
|
allocate(ww(isz),tx(isz),ty(isz),stat=info)
|
|
if (info /= psb_success_) then
|
|
call psb_errpush(psb_err_alloc_request_,name,&
|
|
& i_err=(/3*isz,izero,izero,izero,izero/),&
|
|
& a_err='real(psb_spk_)')
|
|
goto 9999
|
|
end if
|
|
else if ((3*isz) <= size(work)) then
|
|
ww => work(1:isz)
|
|
tx => work(isz+1:2*isz)
|
|
ty => work(2*isz+1:3*isz)
|
|
allocate(aux(4*isz),stat=info)
|
|
if (info /= psb_success_) then
|
|
call psb_errpush(psb_err_alloc_request_,name,&
|
|
& i_err=(/4*isz,izero,izero,izero,izero/),&
|
|
& a_err='real(psb_spk_)')
|
|
goto 9999
|
|
end if
|
|
else
|
|
allocate(ww(isz),tx(isz),ty(isz),&
|
|
&aux(4*isz),stat=info)
|
|
if (info /= psb_success_) then
|
|
call psb_errpush(psb_err_alloc_request_,name,&
|
|
& i_err=(/4*isz,izero,izero,izero,izero/),&
|
|
& a_err='real(psb_spk_)')
|
|
goto 9999
|
|
end if
|
|
|
|
endif
|
|
|
|
if ((sm%novr == 0).and.(sweeps == 1)) then
|
|
!
|
|
! Shortcut: in this case it's just the same
|
|
! as Block Jacobi.
|
|
!
|
|
call sm%sv%apply(alpha,x,beta,y,desc_data,trans_,aux,info)
|
|
|
|
if (info /= psb_success_) then
|
|
call psb_errpush(psb_err_internal_error_,name,&
|
|
& a_err='Error in sub_aply Jacobi Sweeps = 1')
|
|
goto 9999
|
|
endif
|
|
|
|
else
|
|
|
|
|
|
vx = x%get_vect()
|
|
|
|
call psb_geall(vtx,sm%desc_data,info)
|
|
call psb_geasb(vtx,sm%desc_data,info,mold=x%v)
|
|
call psb_geall(vty,sm%desc_data,info)
|
|
call psb_geasb(vty,sm%desc_data,info,mold=x%v)
|
|
call psb_geall(vww,sm%desc_data,info)
|
|
call psb_geasb(vww,sm%desc_data,info,mold=x%v)
|
|
call vtx%set(szero)
|
|
call vty%set(szero)
|
|
call vww%set(szero)
|
|
|
|
|
|
call vtx%set(vx(1:nrow_d))
|
|
|
|
if (sweeps == 1) then
|
|
|
|
select case(trans_)
|
|
case('N')
|
|
!
|
|
! Get the overlap entries of tx (tx == x)
|
|
!
|
|
if (sm%restr == psb_halo_) then
|
|
call psb_halo(vtx,sm%desc_data,info,work=aux,data=psb_comm_ext_)
|
|
if(info /= psb_success_) then
|
|
info=psb_err_from_subroutine_
|
|
ch_err='psb_halo'
|
|
goto 9999
|
|
end if
|
|
else if (sm%restr /= psb_none_) then
|
|
call psb_errpush(psb_err_internal_error_,name,&
|
|
& a_err='Invalid mld_sub_restr_')
|
|
goto 9999
|
|
end if
|
|
|
|
|
|
case('T','C')
|
|
!
|
|
! With transpose, we have to do it here
|
|
!
|
|
|
|
select case (sm%prol)
|
|
|
|
case(psb_none_)
|
|
!
|
|
! Do nothing
|
|
|
|
case(psb_sum_)
|
|
!
|
|
! The transpose of sum is halo
|
|
!
|
|
call psb_halo(vtx,sm%desc_data,info,work=aux,data=psb_comm_ext_)
|
|
if(info /= psb_success_) then
|
|
info=psb_err_from_subroutine_
|
|
ch_err='psb_halo'
|
|
goto 9999
|
|
end if
|
|
|
|
case(psb_avg_)
|
|
!
|
|
! Tricky one: first we have to scale the overlap entries,
|
|
! which we can do by assignind mode=0, i.e. no communication
|
|
! (hence only scaling), then we do the halo
|
|
!
|
|
call psb_ovrl(vtx,sm%desc_data,info,&
|
|
& update=psb_avg_,work=aux,mode=izero)
|
|
if(info /= psb_success_) then
|
|
info=psb_err_from_subroutine_
|
|
ch_err='psb_ovrl'
|
|
goto 9999
|
|
end if
|
|
call psb_halo(vtx,sm%desc_data,info,work=aux,data=psb_comm_ext_)
|
|
if(info /= psb_success_) then
|
|
info=psb_err_from_subroutine_
|
|
ch_err='psb_halo'
|
|
goto 9999
|
|
end if
|
|
|
|
case default
|
|
call psb_errpush(psb_err_internal_error_,name,&
|
|
& a_err='Invalid mld_sub_prol_')
|
|
goto 9999
|
|
end select
|
|
|
|
|
|
case default
|
|
info=psb_err_iarg_invalid_i_
|
|
int_err(1)=6
|
|
ch_err(2:2)=trans
|
|
goto 9999
|
|
end select
|
|
|
|
call sm%sv%apply(sone,vtx,szero,vty,sm%desc_data,trans_,aux,info)
|
|
|
|
if (info /= psb_success_) then
|
|
call psb_errpush(psb_err_internal_error_,name,&
|
|
& a_err='Error in sub_aply Jacobi Sweeps = 1')
|
|
goto 9999
|
|
endif
|
|
|
|
select case(trans_)
|
|
case('N')
|
|
|
|
select case (sm%prol)
|
|
|
|
case(psb_none_)
|
|
!
|
|
! Would work anyway, but since it is supposed to do nothing ...
|
|
! call psb_ovrl(ty,sm%desc_data,info,&
|
|
! & update=sm%prol,work=aux)
|
|
|
|
|
|
case(psb_sum_,psb_avg_)
|
|
!
|
|
! Update the overlap of ty
|
|
!
|
|
call psb_ovrl(vty,sm%desc_data,info,&
|
|
& update=sm%prol,work=aux)
|
|
if(info /= psb_success_) then
|
|
info=psb_err_from_subroutine_
|
|
ch_err='psb_ovrl'
|
|
goto 9999
|
|
end if
|
|
|
|
case default
|
|
call psb_errpush(psb_err_internal_error_,name,&
|
|
& a_err='Invalid mld_sub_prol_')
|
|
goto 9999
|
|
end select
|
|
|
|
case('T','C')
|
|
!
|
|
! With transpose, we have to do it here
|
|
!
|
|
if (sm%restr == psb_halo_) then
|
|
call psb_ovrl(vty,sm%desc_data,info,&
|
|
& update=psb_sum_,work=aux)
|
|
if(info /= psb_success_) then
|
|
info=psb_err_from_subroutine_
|
|
ch_err='psb_ovrl'
|
|
goto 9999
|
|
end if
|
|
else if (sm%restr /= psb_none_) then
|
|
call psb_errpush(psb_err_internal_error_,name,&
|
|
& a_err='Invalid mld_sub_restr_')
|
|
goto 9999
|
|
end if
|
|
|
|
case default
|
|
info=psb_err_iarg_invalid_i_
|
|
int_err(1)=6
|
|
ch_err(2:2)=trans
|
|
goto 9999
|
|
end select
|
|
|
|
|
|
|
|
else if (sweeps > 1) then
|
|
|
|
!
|
|
!
|
|
! Apply prec%iprcparm(mld_smoother_sweeps_) sweeps of a block-Jacobi solver
|
|
! to compute an approximate solution of a linear system.
|
|
!
|
|
!
|
|
call vty%set(szero)
|
|
|
|
do i=1, sweeps
|
|
select case(trans_)
|
|
case('N')
|
|
!
|
|
! Get the overlap entries of tx (tx == x)
|
|
!
|
|
if (sm%restr == psb_halo_) then
|
|
call psb_halo(vtx,sm%desc_data,info,work=aux,data=psb_comm_ext_)
|
|
if(info /= psb_success_) then
|
|
info=psb_err_from_subroutine_
|
|
ch_err='psb_halo'
|
|
goto 9999
|
|
end if
|
|
else if (sm%restr /= psb_none_) then
|
|
call psb_errpush(psb_err_internal_error_,name,&
|
|
& a_err='Invalid mld_sub_restr_')
|
|
goto 9999
|
|
end if
|
|
|
|
|
|
case('T','C')
|
|
!
|
|
! With transpose, we have to do it here
|
|
!
|
|
|
|
select case (sm%prol)
|
|
|
|
case(psb_none_)
|
|
!
|
|
! Do nothing
|
|
|
|
case(psb_sum_)
|
|
!
|
|
! The transpose of sum is halo
|
|
!
|
|
call psb_halo(vtx,sm%desc_data,info,work=aux,data=psb_comm_ext_)
|
|
if(info /= psb_success_) then
|
|
info=psb_err_from_subroutine_
|
|
ch_err='psb_halo'
|
|
goto 9999
|
|
end if
|
|
|
|
case(psb_avg_)
|
|
!
|
|
! Tricky one: first we have to scale the overlap entries,
|
|
! which we can do by assignind mode=0, i.e. no communication
|
|
! (hence only scaling), then we do the halo
|
|
!
|
|
call psb_ovrl(vtx,sm%desc_data,info,&
|
|
& update=psb_avg_,work=aux,mode=izero)
|
|
if(info /= psb_success_) then
|
|
info=psb_err_from_subroutine_
|
|
ch_err='psb_ovrl'
|
|
goto 9999
|
|
end if
|
|
call psb_halo(vtx,sm%desc_data,info,work=aux,data=psb_comm_ext_)
|
|
if(info /= psb_success_) then
|
|
info=psb_err_from_subroutine_
|
|
ch_err='psb_halo'
|
|
goto 9999
|
|
end if
|
|
|
|
case default
|
|
call psb_errpush(psb_err_internal_error_,name,&
|
|
& a_err='Invalid mld_sub_prol_')
|
|
goto 9999
|
|
end select
|
|
|
|
|
|
case default
|
|
info=psb_err_iarg_invalid_i_
|
|
int_err(1)=6
|
|
ch_err(2:2)=trans
|
|
goto 9999
|
|
end select
|
|
!
|
|
! Compute Y(j+1) = D^(-1)*(X-ND*Y(j)), where D and ND are the
|
|
! block diagonal part and the remaining part of the local matrix
|
|
! and Y(j) is the approximate solution at sweep j.
|
|
!
|
|
call psb_geaxpby(sone,vtx,szero,vww,sm%desc_data,info)
|
|
call psb_spmm(-sone,sm%nd,vty,sone,vww,sm%desc_data,info,&
|
|
& work=aux,trans=trans_)
|
|
|
|
if (info /= psb_success_) exit
|
|
|
|
call sm%sv%apply(sone,vww,szero,vty,sm%desc_data,trans_,aux,info)
|
|
|
|
if (info /= psb_success_) exit
|
|
|
|
|
|
select case(trans_)
|
|
case('N')
|
|
|
|
select case (sm%prol)
|
|
|
|
case(psb_none_)
|
|
!
|
|
! Would work anyway, but since it is supposed to do nothing ...
|
|
! call psb_ovrl(ty,sm%desc_data,info,&
|
|
! & update=sm%prol,work=aux)
|
|
|
|
|
|
case(psb_sum_,psb_avg_)
|
|
!
|
|
! Update the overlap of ty
|
|
!
|
|
call psb_ovrl(vty,sm%desc_data,info,&
|
|
& update=sm%prol,work=aux)
|
|
if(info /= psb_success_) then
|
|
info=psb_err_from_subroutine_
|
|
ch_err='psb_ovrl'
|
|
goto 9999
|
|
end if
|
|
|
|
case default
|
|
call psb_errpush(psb_err_internal_error_,name,&
|
|
& a_err='Invalid mld_sub_prol_')
|
|
goto 9999
|
|
end select
|
|
|
|
case('T','C')
|
|
!
|
|
! With transpose, we have to do it here
|
|
!
|
|
if (sm%restr == psb_halo_) then
|
|
call psb_ovrl(vty,sm%desc_data,info,&
|
|
& update=psb_sum_,work=aux)
|
|
if(info /= psb_success_) then
|
|
info=psb_err_from_subroutine_
|
|
ch_err='psb_ovrl'
|
|
goto 9999
|
|
end if
|
|
else if (sm%restr /= psb_none_) then
|
|
call psb_errpush(psb_err_internal_error_,name,&
|
|
& a_err='Invalid mld_sub_restr_')
|
|
goto 9999
|
|
end if
|
|
|
|
case default
|
|
info=psb_err_iarg_invalid_i_
|
|
int_err(1)=6
|
|
ch_err(2:2)=trans
|
|
goto 9999
|
|
end select
|
|
end do
|
|
|
|
if (info /= psb_success_) then
|
|
info=psb_err_internal_error_
|
|
call psb_errpush(info,name,&
|
|
& a_err='subsolve with Jacobi sweeps > 1')
|
|
goto 9999
|
|
end if
|
|
|
|
|
|
else
|
|
|
|
info = psb_err_iarg_neg_
|
|
call psb_errpush(info,name,&
|
|
& i_err=(/itwo,sweeps,izero,izero,izero/))
|
|
goto 9999
|
|
|
|
|
|
end if
|
|
|
|
!
|
|
! Compute y = beta*y + alpha*ty (ty == K^(-1)*tx)
|
|
!
|
|
call psb_geaxpby(alpha,vty,beta,y,desc_data,info)
|
|
|
|
end if
|
|
|
|
|
|
if ((6*isz) <= size(work)) then
|
|
else if ((4*isz) <= size(work)) then
|
|
deallocate(ww,tx,ty)
|
|
else if ((3*isz) <= size(work)) then
|
|
deallocate(aux)
|
|
else
|
|
deallocate(ww,aux,tx,ty)
|
|
endif
|
|
call vww%free(info)
|
|
call vtx%free(info)
|
|
call vty%free(info)
|
|
|
|
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 mld_s_as_smoother_apply_vect
|