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.
295 lines
8.8 KiB
Fortran
295 lines
8.8 KiB
Fortran
!!$
|
|
!!$ 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.
|
|
!!$
|
|
!!$
|
|
program df_sample
|
|
use psb_base_mod
|
|
use psb_prec_mod
|
|
use psb_krylov_mod
|
|
use psb_util_mod
|
|
use getp
|
|
implicit none
|
|
|
|
! input parameters
|
|
character(len=40) :: cmethd, ptype, mtrx_file, rhs_file
|
|
|
|
! sparse matrices
|
|
type(psb_dspmat_type) :: a, aux_a
|
|
|
|
! preconditioner data
|
|
type(psb_dprec_type) :: prec
|
|
|
|
! dense matrices
|
|
real(kind(1.d0)), allocatable, target :: aux_b(:,:), d(:)
|
|
real(kind(1.d0)), allocatable , save :: b_col(:), x_col(:), r_col(:), &
|
|
& x_col_glob(:), r_col_glob(:)
|
|
real(kind(1.d0)), pointer :: b_col_glob(:)
|
|
|
|
! communications data structure
|
|
type(psb_desc_type):: desc_a
|
|
|
|
integer :: ictxt, iam, np
|
|
logical :: amroot
|
|
integer, parameter :: root=0
|
|
|
|
! solver paramters
|
|
integer :: iter, itmax, ierr, itrace, ircode, ipart,&
|
|
& methd, istopc, irst,amatsize,precsize,descsize
|
|
real(kind(1.d0)) :: err, eps
|
|
|
|
character(len=5) :: afmt
|
|
character(len=20) :: name
|
|
integer :: iparm(20)
|
|
|
|
! other variables
|
|
integer :: i,info,j,m_problem
|
|
integer :: internal, m,ii,nnzero
|
|
real(kind(1.d0)) :: t1, t2, tprec, r_amax, b_amax,&
|
|
&scale,resmx,resmxp
|
|
integer :: nrhs, nrow, n_row, dim, nv, ne
|
|
integer, allocatable :: ivg(:), ipv(:)
|
|
|
|
|
|
call psb_init(ictxt)
|
|
call psb_info(ictxt,iam,np)
|
|
|
|
if (iam < 0) then
|
|
! This should not happen, but just in case
|
|
call psb_exit(ictxt)
|
|
stop
|
|
endif
|
|
amroot = (iam==root)
|
|
|
|
|
|
name='df_sample'
|
|
if(psb_get_errstatus().ne.0) goto 9999
|
|
info=0
|
|
call psb_set_errverbosity(2)
|
|
call psb_set_erraction(0)
|
|
!
|
|
! get parameters
|
|
!
|
|
call get_parms(ictxt,mtrx_file,rhs_file,cmethd,ptype,&
|
|
& ipart,afmt,istopc,itmax,itrace,irst,eps)
|
|
|
|
call psb_barrier(ictxt)
|
|
t1 = psb_wtime()
|
|
! read the input matrix to be processed and (possibly) the rhs
|
|
nrhs = 1
|
|
|
|
if (amroot) then
|
|
call read_mat(mtrx_file, aux_a, ictxt)
|
|
|
|
m_problem = aux_a%m
|
|
call psb_bcast(ictxt,m_problem)
|
|
|
|
if(rhs_file /= 'NONE') then
|
|
! reading an rhs
|
|
call read_rhs(rhs_file,aux_b,ictxt)
|
|
end if
|
|
|
|
if (psb_size(aux_b,dim=1)==m_problem) then
|
|
! if any rhs were present, broadcast the first one
|
|
write(0,'("Ok, got an rhs ")')
|
|
b_col_glob =>aux_b(:,1)
|
|
else
|
|
write(*,'("Generating an rhs...")')
|
|
write(*,'(" ")')
|
|
call psb_realloc(m_problem,1,aux_b,ircode)
|
|
if (ircode /= 0) then
|
|
call psb_errpush(4000,name)
|
|
goto 9999
|
|
endif
|
|
|
|
b_col_glob => aux_b(:,1)
|
|
do i=1, m_problem
|
|
b_col_glob(i) = 1.d0
|
|
enddo
|
|
endif
|
|
call psb_bcast(ictxt,b_col_glob(1:m_problem))
|
|
else
|
|
call psb_bcast(ictxt,m_problem)
|
|
call psb_realloc(m_problem,1,aux_b,ircode)
|
|
if (ircode /= 0) then
|
|
call psb_errpush(4000,name)
|
|
goto 9999
|
|
endif
|
|
b_col_glob =>aux_b(:,1)
|
|
call psb_bcast(ictxt,b_col_glob(1:m_problem))
|
|
end if
|
|
|
|
! switch over different partition types
|
|
if (ipart.eq.0) then
|
|
call psb_barrier(ictxt)
|
|
if (amroot) write(*,'("Partition type: block")')
|
|
allocate(ivg(m_problem),ipv(np))
|
|
do i=1,m_problem
|
|
call part_block(i,m_problem,np,ipv,nv)
|
|
ivg(i) = ipv(1)
|
|
enddo
|
|
call psb_matdist(aux_a, a, ivg, ictxt, &
|
|
& desc_a,b_col_glob,b_col,info,fmt=afmt)
|
|
else if (ipart.eq.2) then
|
|
if (amroot) then
|
|
write(*,'("Partition type: graph")')
|
|
write(*,'(" ")')
|
|
! write(0,'("Build type: graph")')
|
|
call build_mtpart(aux_a%m,aux_a%fida,aux_a%ia1,aux_a%ia2,np)
|
|
endif
|
|
call psb_barrier(ictxt)
|
|
call distr_mtpart(root,ictxt)
|
|
call getv_mtpart(ivg)
|
|
call psb_matdist(aux_a, a, ivg, ictxt, &
|
|
& desc_a,b_col_glob,b_col,info,fmt=afmt)
|
|
else
|
|
if (amroot) write(*,'("Partition type: block")')
|
|
call psb_matdist(aux_a, a, part_block, ictxt, &
|
|
& desc_a,b_col_glob,b_col,info,fmt=afmt)
|
|
end if
|
|
|
|
call psb_geall(x_col,desc_a,info)
|
|
x_col(:) =0.0
|
|
call psb_geasb(x_col,desc_a,info)
|
|
call psb_geall(r_col,desc_a,info)
|
|
r_col(:) =0.0
|
|
call psb_geasb(r_col,desc_a,info)
|
|
t2 = psb_wtime() - t1
|
|
|
|
|
|
call psb_amx(ictxt, t2)
|
|
|
|
if (amroot) then
|
|
write(*,'(" ")')
|
|
write(*,'("Time to read and partition matrix : ",es10.4)')t2
|
|
write(*,'(" ")')
|
|
end if
|
|
|
|
!
|
|
|
|
call psb_precinit(prec,ptype,info)
|
|
|
|
! building the preconditioner
|
|
t1 = psb_wtime()
|
|
call psb_precbld(a,desc_a,prec,info)
|
|
tprec = psb_wtime()-t1
|
|
if (info /= 0) then
|
|
call psb_errpush(4010,name,a_err='psb_precbld')
|
|
goto 9999
|
|
end if
|
|
|
|
|
|
call psb_amx(ictxt, tprec)
|
|
|
|
if(amroot) then
|
|
write(*,'("Preconditioner time: ",es10.4)')tprec
|
|
write(*,'(" ")')
|
|
end if
|
|
|
|
iparm = 0
|
|
call psb_barrier(ictxt)
|
|
t1 = psb_wtime()
|
|
call psb_krylov(cmethd,a,prec,b_col,x_col,eps,desc_a,info,&
|
|
& itmax=itmax,iter=iter,err=err,itrace=itrace,istop=istopc,irst=irst)
|
|
call psb_barrier(ictxt)
|
|
t2 = psb_wtime() - t1
|
|
|
|
call psb_amx(ictxt,t2)
|
|
call psb_geaxpby(done,b_col,dzero,r_col,desc_a,info)
|
|
call psb_spmm(-done,a,x_col,done,r_col,desc_a,info)
|
|
call psb_genrm2s(resmx,r_col,desc_a,info)
|
|
call psb_geamaxs(resmxp,r_col,desc_a,info)
|
|
|
|
amatsize = psb_sizeof(a)
|
|
descsize = psb_sizeof(desc_a)
|
|
precsize = psb_sizeof(prec)
|
|
call psb_sum(ictxt,amatsize)
|
|
call psb_sum(ictxt,descsize)
|
|
call psb_sum(ictxt,precsize)
|
|
if (amroot) then
|
|
call psb_prec_descr(6,prec)
|
|
write(*,'("Matrix: ",a)')mtrx_file
|
|
write(*,'("Computed solution on ",i8," processors")')np
|
|
write(*,'("Iterations to convergence: ",i6)')iter
|
|
write(*,'("Error indicator on exit: ",f7.2)')err
|
|
write(*,'("Time to buil prec. : ",es10.4)')tprec
|
|
write(*,'("Time to solve matrix : ",es10.4)')t2
|
|
write(*,'("Time per iteration : ",es10.4)')t2/(iter)
|
|
write(*,'("Total time : ",es10.4)')t2+tprec
|
|
write(*,'("Residual norm 2 = ",es10.4)')resmx
|
|
write(*,'("Residual norm inf = ",es10.4)')resmxp
|
|
write(*,'("Total memory occupation for A: ",i10)')amatsize
|
|
write(*,'("Total memory occupation for DESC_A: ",i10)')descsize
|
|
write(*,'("Total memory occupation for PREC: ",i10)')precsize
|
|
end if
|
|
|
|
allocate(x_col_glob(m_problem),r_col_glob(m_problem),stat=ierr)
|
|
if (ierr.ne.0) then
|
|
write(0,*) 'allocation error: no data collection'
|
|
else
|
|
call psb_gather(x_col_glob,x_col,desc_a,info,root=0)
|
|
call psb_gather(r_col_glob,r_col,desc_a,info,root=0)
|
|
if (amroot) then
|
|
write(0,'(" ")')
|
|
write(0,'("Saving x on file")')
|
|
write(20,*) 'matrix: ',mtrx_file
|
|
write(20,*) 'computed solution on ',np,' processors.'
|
|
write(20,*) 'iterations to convergence: ',iter
|
|
write(20,*) 'error indicator (infinity norm) on exit:', &
|
|
& ' ||r||/(||a||||x||+||b||) = ',err
|
|
write(20,*) 'max residual = ',resmx, resmxp
|
|
write(20,'(a8,4(2x,a20))') 'I','X(I)','R(I)','B(I)'
|
|
do i=1,m_problem
|
|
write(20,998) i,x_col_glob(i),r_col_glob(i),b_col_glob(i)
|
|
enddo
|
|
end if
|
|
end if
|
|
998 format(i8,4(2x,g20.14))
|
|
993 format(i6,4(1x,e12.6))
|
|
|
|
|
|
call psb_gefree(b_col, desc_a,info)
|
|
call psb_gefree(x_col, desc_a,info)
|
|
call psb_spfree(a, desc_a,info)
|
|
call psb_precfree(prec,info)
|
|
call psb_cdfree(desc_a,info)
|
|
|
|
9999 continue
|
|
if(info /= 0) then
|
|
call psb_error(ictxt)
|
|
end if
|
|
call psb_exit(ictxt)
|
|
stop
|
|
|
|
end program df_sample
|
|
|
|
|
|
|
|
|
|
|