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.
552 lines
16 KiB
Fortran
552 lines
16 KiB
Fortran
!!$
|
|
!!$ Parallel Sparse BLAS version 2.2
|
|
!!$ (C) Copyright 2006/2007/2008
|
|
!!$ 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_cspsm.f90
|
|
!
|
|
! Subroutine: psb_cspsm
|
|
! Performs one of the distributed matrix-vector operations
|
|
!
|
|
! sub( Y ) := alpha * Pr * A-1 * Pc *sub( X ) + beta * sub (Y ), or
|
|
!
|
|
! sub( Y ) := alpha * D * Pr * A-1 * Pc * sub( X ) + beta * sub (Y ), or
|
|
!
|
|
! sub( Y ) := alpha * Pr * A-1 * Pc * D * sub( X ) + beta * sub (Y ), or
|
|
!
|
|
! sub( Y ) := alpha * Pr * A-T * Pc * sub( X ) + beta * sub (Y ), or
|
|
!
|
|
! sub( Y ) := alpha * D * Pr * A-T * Pc * sub( X ) + beta * sub (Y ), or
|
|
!
|
|
! sub( Y ) := alpha * Pr * A-T * Pc * D * sub( X ) + beta * sub (Y ), or
|
|
!
|
|
! where :
|
|
!
|
|
! sub( X ) denotes X(1:M,JX:JX+K-1),
|
|
!
|
|
! sub( Y ) denotes Y(1:M,JY:JY+K-1).
|
|
!
|
|
! sub( X ) is a distributed
|
|
! vector and T is a M-by-M distributed triangular matrix.
|
|
!
|
|
! Arguments:
|
|
! alpha - complex. The scalar alpha.
|
|
! a - type(psb_c_sparse_mat). The sparse matrix containing A.
|
|
! x(:,:) - complex The input vector containing the entries of ( X ).
|
|
! beta - complex The scalar beta.
|
|
! y(:,:) - complex The input vector containing the entries of ( Y ).
|
|
! desc_a - type(psb_desc_type). The communication descriptor.
|
|
! info - integer. Return code
|
|
! trans - character(optional). Whether A or A'. If not present 'N' is assumed.
|
|
! scale - character(optional). Specify some type of operation with
|
|
! the diagonal matrix D.
|
|
! choice - integer(optional). The kind of update to perform on overlap elements.
|
|
! d(:) - complex, optional Matrix for diagonal scaling.
|
|
! k - integer(optional). The number of right-hand sides.
|
|
! jx - integer(optional). The column offset for ( X ). Default: 1
|
|
! jy - integer(optional). The column offset for ( Y ). Default: 1
|
|
! work(:) - complex, optional Working area.
|
|
!
|
|
subroutine psb_cspsm(alpha,a,x,beta,y,desc_a,info,&
|
|
& trans, scale, choice, diag, k, jx, jy, work)
|
|
use psb_sparse_mod, psb_protect_name => psb_cspsm
|
|
use psi_mod
|
|
implicit none
|
|
|
|
complex(psb_spk_), intent(in) :: alpha, beta
|
|
complex(psb_spk_), intent(in), target :: x(:,:)
|
|
complex(psb_spk_), intent(inout), target :: y(:,:)
|
|
type (psb_c_sparse_mat), intent(in) :: a
|
|
type(psb_desc_type), intent(in) :: desc_a
|
|
integer, intent(out) :: info
|
|
complex(psb_spk_), intent(in), optional, target :: diag(:)
|
|
complex(psb_spk_), optional, target, intent(inout) :: work(:)
|
|
character, intent(in), optional :: trans, scale
|
|
integer, intent(in), optional :: choice
|
|
integer, intent(in), optional :: k, jx, jy
|
|
|
|
! locals
|
|
integer :: ictxt, np, me,&
|
|
& err_act, iix, jjx, ia, ja, iia, jja, lldx,lldy, choice_,&
|
|
& ix, iy, ik, ijx, ijy, i, lld,&
|
|
& m, nrow, ncol, liwork, llwork, iiy, jjy, idx, ndm
|
|
|
|
character :: lscale
|
|
integer, parameter :: nb=4
|
|
complex(psb_spk_),pointer :: iwork(:), xp(:,:), yp(:,:), id(:)
|
|
character :: itrans
|
|
character(len=20) :: name, ch_err
|
|
logical :: aliw
|
|
|
|
name='psb_cspsm'
|
|
if(psb_get_errstatus() /= 0) return
|
|
info=0
|
|
call psb_erractionsave(err_act)
|
|
|
|
ictxt=psb_cd_get_context(desc_a)
|
|
|
|
call psb_info(ictxt, me, np)
|
|
if (np == -1) then
|
|
info = 2010
|
|
call psb_errpush(info,name)
|
|
goto 9999
|
|
endif
|
|
|
|
! just this case right now
|
|
ia = 1
|
|
ja = 1
|
|
|
|
ix = 1
|
|
if (present(jx)) then
|
|
ijx = jx
|
|
else
|
|
ijx = 1
|
|
endif
|
|
|
|
iy = 1
|
|
if (present(jy)) then
|
|
ijy = jy
|
|
else
|
|
ijy = 1
|
|
endif
|
|
|
|
if (present(k)) then
|
|
ik = min(k,size(x,2)-ijx+1)
|
|
ik = min(ik,size(y,2)-ijy+1)
|
|
else
|
|
ik = min(size(x,2)-ijx+1,size(y,2)-ijy+1)
|
|
endif
|
|
|
|
if (present(choice)) then
|
|
choice_ = choice
|
|
else
|
|
choice_ = psb_avg_
|
|
endif
|
|
|
|
if (present(scale)) then
|
|
lscale = psb_toupper(scale)
|
|
else
|
|
lscale = 'U'
|
|
endif
|
|
|
|
if (present(trans)) then
|
|
itrans = psb_toupper(trans)
|
|
if((itrans == 'N').or.(itrans == 'T').or. (itrans == 'C')) then
|
|
! OK
|
|
else
|
|
info = 70
|
|
call psb_errpush(info,name)
|
|
goto 9999
|
|
end if
|
|
else
|
|
itrans = 'N'
|
|
endif
|
|
|
|
m = psb_cd_get_global_rows(desc_a)
|
|
nrow = psb_cd_get_local_rows(desc_a)
|
|
ncol = psb_cd_get_local_cols(desc_a)
|
|
lldx = size(x,1)
|
|
lldy = size(y,1)
|
|
|
|
if((lldx < ncol).or.(lldy < ncol)) then
|
|
info=3010
|
|
call psb_errpush(info,name)
|
|
goto 9999
|
|
end if
|
|
|
|
! check for presence/size of a work area
|
|
iwork => null()
|
|
liwork= 2*ncol
|
|
if (present(work)) then
|
|
if (size(work) >= liwork) then
|
|
aliw =.false.
|
|
else
|
|
aliw=.true.
|
|
endif
|
|
else
|
|
aliw=.true.
|
|
end if
|
|
|
|
if (aliw) then
|
|
allocate(iwork(liwork),stat=info)
|
|
if(info /= 0) then
|
|
info=4010
|
|
ch_err='psb_realloc'
|
|
call psb_errpush(info,name,a_err=ch_err)
|
|
goto 9999
|
|
end if
|
|
else
|
|
iwork => work
|
|
endif
|
|
|
|
iwork(1)=0.d0
|
|
|
|
if(present(diag)) then
|
|
lld = size(diag)
|
|
id => diag
|
|
else
|
|
lld=1
|
|
allocate(id(1))
|
|
id=1.d0
|
|
end if
|
|
|
|
! checking for matrix correctness
|
|
call psb_chkmat(m,m,ia,ja,desc_a,info,iia,jja)
|
|
! checking for vectors correctness
|
|
if (info == 0) &
|
|
& call psb_chkvect(m,ik,size(x,1),ix,ijx,desc_a,info,iix,jjx)
|
|
if (info == 0) &
|
|
& call psb_chkvect(m,ik,size(y,1),iy,ijy,desc_a,info,iiy,jjy)
|
|
if(info /= 0) then
|
|
info=4010
|
|
ch_err='psb_chkvect/mat'
|
|
call psb_errpush(info,name,a_err=ch_err)
|
|
goto 9999
|
|
end if
|
|
|
|
if(ja /= ix) then
|
|
! this case is not yet implemented
|
|
info = 3030
|
|
end if
|
|
|
|
if((iix /= 1).or.(iiy /= 1)) then
|
|
! this case is not yet implemented
|
|
info = 3040
|
|
end if
|
|
|
|
if(info /= 0) then
|
|
call psb_errpush(info,name)
|
|
goto 9999
|
|
end if
|
|
|
|
! Perform local triangular system solve
|
|
xp => x(iix:lldx,jjx:jjx+ik-1)
|
|
yp => y(iiy:lldy,jjy:jjy+ik-1)
|
|
call psb_cssm(alpha,a,xp,beta,yp,info,scale=scale,d=diag,trans=trans)
|
|
|
|
if(info /= 0) then
|
|
info = 4010
|
|
ch_err='cssm'
|
|
call psb_errpush(info,name,a_err=ch_err)
|
|
goto 9999
|
|
end if
|
|
|
|
! update overlap elements
|
|
if (choice_ > 0) then
|
|
|
|
call psi_swapdata(ior(psb_swap_send_,psb_swap_recv_),ik,&
|
|
& cone,yp,desc_a,iwork,info,data=psb_comm_ovr_)
|
|
|
|
if (info == 0) call psi_ovrl_upd(yp,desc_a,choice_,info)
|
|
if (info /= 0) then
|
|
call psb_errpush(4010,name,a_err='Inner updates')
|
|
goto 9999
|
|
end if
|
|
end if
|
|
|
|
if(aliw) deallocate(iwork)
|
|
if(.not.present(diag)) deallocate(id)
|
|
|
|
call psb_erractionrestore(err_act)
|
|
return
|
|
|
|
9999 continue
|
|
call psb_erractionrestore(err_act)
|
|
|
|
if (err_act == psb_act_abort_) then
|
|
call psb_error(ictxt)
|
|
return
|
|
end if
|
|
return
|
|
end subroutine psb_cspsm
|
|
|
|
!!$
|
|
!!$ Parallel Sparse BLAS version 2.2
|
|
!!$ (C) Copyright 2006/2007/2008
|
|
!!$ 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.
|
|
!!$
|
|
!!$
|
|
!
|
|
! Subroutine: psb_cspsv
|
|
! Performs one of the distributed matrix-vector operations
|
|
!
|
|
! Y := alpha * Pr * A-1 * Pc * X + beta * Y, or
|
|
!
|
|
! Y := alpha * D * Pr * A-1 * Pc * X + beta * Y, or
|
|
!
|
|
! Y := alpha * Pr * A-1 * Pc * D * X + beta * Y, or
|
|
!
|
|
! Y := alpha * Pr * A-T * Pc * X + beta * Y, or
|
|
!
|
|
! Y := alpha * D * Pr * A-T * Pc * X + beta * Y, or
|
|
!
|
|
! Y := alpha * Pr * A-T * Pc * D * X + beta * Y, or
|
|
!
|
|
! X is a distributed
|
|
! vector and T is a M-by-M distributed triangular matrix.
|
|
!
|
|
!
|
|
! Arguments:
|
|
! alpha - complex. The scalar alpha.
|
|
! a - type(psb_c_sparse_mat). The sparse matrix containing A.
|
|
! x(:) - complex The input vector containing the entries of ( X ).
|
|
! beta - complex The scalar beta.
|
|
! y(:) - complex The input vector containing the entries of ( Y ).
|
|
! desc_a - type(psb_desc_type). The communication descriptor.
|
|
! info - integer. Return code
|
|
! trans - character(optional). Whether A or A'. If not present 'N' is assumed.
|
|
! scale - character(optional). Specify some type of operation with
|
|
! the diagonal matrix D.
|
|
! choice - integer(optional). The kind of update to perform on overlap elements.
|
|
! d(:) - complex, optional Matrix for diagonal scaling.
|
|
! work(:) - complex, optional Working area.
|
|
!
|
|
subroutine psb_cspsv(alpha,a,x,beta,y,desc_a,info,&
|
|
& trans, scale, choice, diag, work)
|
|
use psb_sparse_mod, psb_protect_name => psb_cspsv
|
|
use psi_mod
|
|
implicit none
|
|
|
|
complex(psb_spk_), intent(in) :: alpha, beta
|
|
complex(psb_spk_), intent(in), target :: x(:)
|
|
complex(psb_spk_), intent(inout), target :: y(:)
|
|
type(psb_c_sparse_mat), intent(in) :: a
|
|
type(psb_desc_type), intent(in) :: desc_a
|
|
integer, intent(out) :: info
|
|
complex(psb_spk_), intent(in), optional, target :: diag(:)
|
|
complex(psb_spk_), optional, target, intent(inout) :: work(:)
|
|
character, intent(in), optional :: trans, scale
|
|
integer, intent(in), optional :: choice
|
|
|
|
! locals
|
|
integer :: ictxt, np, me, &
|
|
& err_act, iix, jjx, ia, ja, iia, jja, lldx,lldy, choice_,&
|
|
& ix, iy, ik, jx, jy, i, lld,&
|
|
& m, nrow, ncol, liwork, llwork, iiy, jjy, idx, ndm
|
|
|
|
character :: lscale
|
|
integer, parameter :: nb=4
|
|
complex(psb_spk_),pointer :: iwork(:), xp(:), yp(:), id(:)
|
|
character :: itrans
|
|
character(len=20) :: name, ch_err
|
|
logical :: aliw
|
|
|
|
name='psb_cspsv'
|
|
if(psb_get_errstatus() /= 0) return
|
|
info=0
|
|
call psb_erractionsave(err_act)
|
|
|
|
ictxt=psb_cd_get_context(desc_a)
|
|
|
|
call psb_info(ictxt, me, np)
|
|
if (np == -1) then
|
|
info = 2010
|
|
call psb_errpush(info,name)
|
|
goto 9999
|
|
endif
|
|
|
|
! just this case right now
|
|
ia = 1
|
|
ja = 1
|
|
ix = 1
|
|
iy = 1
|
|
ik = 1
|
|
jx= 1
|
|
jy= 1
|
|
|
|
if (present(choice)) then
|
|
choice_ = choice
|
|
else
|
|
choice_ = psb_avg_
|
|
endif
|
|
|
|
if (present(scale)) then
|
|
lscale = psb_toupper(scale)
|
|
else
|
|
lscale = 'U'
|
|
endif
|
|
|
|
if (present(trans)) then
|
|
itrans = psb_toupper(trans)
|
|
if((itrans == 'N').or.(itrans == 'T').or.(itrans == 'C')) then
|
|
! Ok
|
|
else
|
|
info = 70
|
|
call psb_errpush(info,name)
|
|
goto 9999
|
|
end if
|
|
else
|
|
itrans = 'N'
|
|
endif
|
|
|
|
m = psb_cd_get_global_rows(desc_a)
|
|
nrow = psb_cd_get_local_rows(desc_a)
|
|
ncol = psb_cd_get_local_cols(desc_a)
|
|
lldx = size(x)
|
|
lldy = size(y)
|
|
|
|
if((lldx < ncol).or.(lldy < ncol)) then
|
|
info=3010
|
|
call psb_errpush(info,name)
|
|
goto 9999
|
|
end if
|
|
|
|
iwork => null()
|
|
! check for presence/size of a work area
|
|
liwork= 2*ncol
|
|
|
|
if (present(work)) then
|
|
if (size(work) >= liwork) then
|
|
aliw =.false.
|
|
else
|
|
aliw=.true.
|
|
endif
|
|
else
|
|
aliw=.true.
|
|
end if
|
|
|
|
if (aliw) then
|
|
allocate(iwork(liwork),stat=info)
|
|
if(info /= 0) then
|
|
info=4010
|
|
ch_err='psb_realloc'
|
|
call psb_errpush(info,name,a_err=ch_err)
|
|
goto 9999
|
|
end if
|
|
else
|
|
iwork => work
|
|
endif
|
|
|
|
iwork(1)=0.d0
|
|
|
|
if(present(diag)) then
|
|
lld = size(diag)
|
|
id => diag
|
|
else
|
|
lld=1
|
|
allocate(id(1))
|
|
id=1.d0
|
|
end if
|
|
|
|
! checking for matrix correctness
|
|
call psb_chkmat(m,m,ia,ja,desc_a,info,iia,jja)
|
|
! checking for vectors correctness
|
|
if (info == 0) &
|
|
& call psb_chkvect(m,ik,size(x),ix,jx,desc_a,info,iix,jjx)
|
|
if (info == 0) &
|
|
& call psb_chkvect(m,ik,size(y),iy,jy,desc_a,info,iiy,jjy)
|
|
if(info /= 0) then
|
|
info=4010
|
|
ch_err='psb_chkvect/mat'
|
|
call psb_errpush(info,name,a_err=ch_err)
|
|
goto 9999
|
|
end if
|
|
|
|
if(ja /= ix) then
|
|
! this case is not yet implemented
|
|
info = 3030
|
|
end if
|
|
|
|
if((iix /= 1).or.(iiy /= 1)) then
|
|
! this case is not yet implemented
|
|
info = 3040
|
|
end if
|
|
|
|
if(info /= 0) then
|
|
call psb_errpush(info,name)
|
|
goto 9999
|
|
end if
|
|
|
|
! Perform local triangular system solve
|
|
xp => x(iix:lldx)
|
|
yp => y(iiy:lldy)
|
|
call psb_cssm(alpha,a,xp,beta,yp,info,scale=scale,d=diag,trans=trans)
|
|
|
|
if(info /= 0) then
|
|
info = 4010
|
|
ch_err='dcssm'
|
|
call psb_errpush(info,name,a_err=ch_err)
|
|
goto 9999
|
|
end if
|
|
|
|
! update overlap elements
|
|
if(choice_ > 0) then
|
|
call psi_swapdata(ior(psb_swap_send_,psb_swap_recv_),&
|
|
& cone,yp,desc_a,iwork,info,data=psb_comm_ovr_)
|
|
|
|
|
|
if (info == 0) call psi_ovrl_upd(yp,desc_a,choice_,info)
|
|
if (info /= 0) then
|
|
call psb_errpush(4010,name,a_err='Inner updates')
|
|
goto 9999
|
|
end if
|
|
end if
|
|
|
|
if (aliw) deallocate(iwork)
|
|
if(.not.present(diag)) deallocate(id)
|
|
|
|
call psb_erractionrestore(err_act)
|
|
return
|
|
|
|
9999 continue
|
|
call psb_erractionrestore(err_act)
|
|
|
|
if (err_act == psb_act_abort_) then
|
|
call psb_error(ictxt)
|
|
return
|
|
end if
|
|
return
|
|
end subroutine psb_cspsv
|
|
|