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.
cmake
openacc
repackage
repack-newsolve
oacc_loloum
development
psblas-bgmres
repack-csga
dev-openmp
cuda-multivect
repack-ovrlp
repack-llvm
repack-nvid
repack-track
nond-rep
psblas-anderson
non-diag
rename-cuda
tcud
maint-3.8.1
anderson
repack-precuda
master
omp-walther
sp3mm-interface
omp-threadsafe
lambdaI
maint-3.8.0
tspmm
maint-3.7.1
remotebuild
split_sum
maint-3.7.0
remap-coarse
newG2L
new-context
implement-ainv
mat-allocate
unify_aggr_bld
pizdaint-runs
psblas-3.6-maint
merge-paraggr-newops
fnd_owner
merge-paraggr
psblas-paraggr
psblas-3.6-openmp
scr-persistent-collective
new-parstruct
3.6-recursive
sphalo-a2av
MixedI8
psblas-3.5-maint
ILmat
scsr
waitall
test-fcg
CGS2
scrasmussen/test-restructuring
psblas3-mcbind
psblas-caf-xp
psblas-caf
psblas-caf-ext
psblas-caf-csr
trunk
psblas3-caf
psblas-3.4-maint
psblas3-dense
psblas3-newdesc
psblas3-pattern
psblas-3.3-maint
psblas3-submodules
psblas3-accel
psblas-3.3.1-1
tamestoy
psblas-3.2.0
psblas-3.2.0-maint
psblas-3.1-maint
psblas3-openmp
psblas-testmv
psblas3-final
psblas3-type-indexed
psblas-3.0-maint
v3.5.0
3.7.0-rc1
V3.5.2-2
V3.6.0
V3.6.0-RC2
V3.6.1-1
V3.6.1-2
V3.6.1-3
V3.6.1-4
V3.7.0-1
V3.7.0.1
V3.7.1
v3.5.0-1
v3.5.0-2
v3.5.0-3
v3.5.1
v3.5.1-1
v3.5.2
v3.5.2-1
v3.6.0-1
v3.6.0-rc1
v3.6.1
v3.6.1-rc1
v3.6.1-rc2
v3.7.0
v3.7.0.2
v3.8.0
v3.8.0-1
v3.8.0-2
v3.8.1
v3.8.1-2
v3.8.1-rc1-1
v3.8.1-rc1-2
v3.8.1-rc1-3
${ noResults }
329 lines
11 KiB
Fortran
329 lines
11 KiB
Fortran
!!$
|
|||
!!$ Parallel Sparse BLAS version 3.4
|
|||
!!$ (C) Copyright 2006, 2010, 2015
|
|||
!!$ Salvatore Filippone University of Rome Tor Vergata
|
|||
!!$ Alfredo Buttari CNRS-IRIT, Toulouse
|
|||
!!$
|
|||
!!$ 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 psb_cf_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) :: kmethd, ptype, mtrx_file, rhs_file
|
|||
|
|||
! sparse matrices
|
|||
type(psb_cspmat_type) :: a, aux_a
|
|||
|
|||
! preconditioner data
|
|||
type(psb_cprec_type) :: prec
|
|||
|
|||
! dense matrices
|
|||
complex(psb_spk_), allocatable, target :: aux_b(:,:), d(:)
|
|||
complex(psb_spk_), allocatable , save :: x_col_glob(:), r_col_glob(:)
|
|||
complex(psb_spk_), pointer :: b_col_glob(:)
|
|||
type(psb_c_vect_type) :: b_col, x_col, r_col
|
|||
|
|||
! communications data structure
|
|||
type(psb_desc_type):: desc_a
|
|||
|
|||
integer(psb_ipk_) :: ictxt, iam, np
|
|||
|
|||
! solver paramters
|
|||
integer(psb_ipk_) :: iter, itmax, ierr, itrace, ircode, ipart,&
|
|||
& methd, istopc, irst
|
|||
integer(psb_long_int_k_) :: amatsize, precsize, descsize
|
|||
real(psb_spk_) :: err, eps
|
|||
|
|||
character(len=5) :: afmt
|
|||
character(len=20) :: name
|
|||
character(len=2) :: filefmt
|
|||
integer(psb_ipk_), parameter :: iunit=12
|
|||
integer(psb_ipk_) :: iparm(20)
|
|||
|
|||
! other variables
|
|||
integer(psb_ipk_) :: i,info,j,m_problem, err_act
|
|||
integer(psb_ipk_) :: internal, m,ii,nnzero
|
|||
real(psb_dpk_) :: t1, t2, tprec
|
|||
real(psb_spk_) :: r_amax, b_amax, scale,resmx,resmxp
|
|||
integer(psb_ipk_) :: nrhs, nrow, n_row, dim, ne, nv
|
|||
integer(psb_ipk_), allocatable :: ivg(:), perm(:)
|
|||
integer(psb_ipk_), allocatable :: ipv(:)
|
|||
character(len=40) :: fname, fnout
|
|||
|
|||
|
|||
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
|
|||
|
|||
|
|||
name='psb_cf_sample'
|
|||
if(psb_get_errstatus() /= 0) goto 9999
|
|||
info=psb_success_
|
|||
|
call psb_set_errverbosity(itwo)
|
||
!
|
|||
|
! Hello world
|
||
!
|
|||
if (iam == psb_root_) then
|
|||
write(*,*) 'Welcome to PSBLAS version: ',psb_version_string_
|
|||
|
write(*,*) 'This is the ',trim(name),' sample program'
|
||
|
end if
|
||
!
|
|||
! get parameters
|
|||
!
|
|||
call get_parms(ictxt,mtrx_file,rhs_file,filefmt,kmethd,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 (iam == psb_root_) then
|
|||
select case(psb_toupper(filefmt))
|
|||
case('MM')
|
|||
! For Matrix Market we have an input file for the matrix
|
|||
! and an (optional) second file for the RHS.
|
|||
call mm_mat_read(aux_a,info,iunit=iunit,filename=mtrx_file)
|
|||
if (info == psb_success_) then
|
|||
if (rhs_file /= 'NONE') then
|
|||
call mm_array_read(aux_b,info,iunit=iunit,filename=rhs_file)
|
|||
end if
|
|||
end if
|
|||
|
|||
case ('HB')
|
|||
! For Harwell-Boeing we have a single file which may or may not
|
|||
! contain an RHS.
|
|||
call hb_read(aux_a,info,iunit=iunit,b=aux_b,filename=mtrx_file)
|
|||
|
|||
case default
|
|||
info = -1
|
|||
write(psb_err_unit,*) 'Wrong choice for fileformat ', filefmt
|
|||
end select
|
|||
if (info /= psb_success_) then
|
|||
write(psb_err_unit,*) 'Error while reading input matrix '
|
|||
call psb_abort(ictxt)
|
|||
end if
|
|||
|
|||
m_problem = aux_a%get_nrows()
|
|||
call psb_bcast(ictxt,m_problem)
|
|||
call psb_mat_renum(psb_mat_renum_identity_,aux_a,info,perm)
|
|||
|
|||
! At this point aux_b may still be unallocated
|
|||
|
if (size(aux_b,dim=1) == m_problem) then
|
||
! if any rhs were present, broadcast the first one
|
|||
write(psb_err_unit,'("Ok, got an rhs ")')
|
|||
b_col_glob =>aux_b(:,1)
|
|||
call psb_gelp('N',perm(1:m_problem),&
|
|||
& b_col_glob(1:m_problem),info)
|
|||
else
|
|||
write(psb_out_unit,'("Generating an rhs...")')
|
|||
write(psb_out_unit,'(" ")')
|
|||
call psb_realloc(m_problem,1,aux_b,ircode)
|
|||
if (ircode /= 0) then
|
|||
call psb_errpush(psb_err_alloc_dealloc_,name)
|
|||
goto 9999
|
|||
endif
|
|||
|
|||
b_col_glob => aux_b(:,1)
|
|||
do i=1, m_problem
|
|||
b_col_glob(i) = (1.0,1.0)
|
|||
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(psb_err_alloc_dealloc_,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 == 0) then
|
|||
call psb_barrier(ictxt)
|
|||
if (iam == psb_root_) write(psb_out_unit,'("Partition type: block vector")')
|
|||
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, ictxt, &
|
|||
& desc_a,info,b_glob=b_col_glob,b=b_col,fmt=afmt,v=ivg)
|
|||
|
|||
else if (ipart == 2) then
|
|||
if (iam == psb_root_) then
|
|||
write(psb_out_unit,'("Partition type: graph vector")')
|
|||
write(psb_out_unit,'(" ")')
|
|||
! write(psb_err_unit,'("Build type: graph")')
|
|||
call build_mtpart(aux_a,np)
|
|||
|
|||
endif
|
|||
call psb_barrier(ictxt)
|
|||
call distr_mtpart(psb_root_,ictxt)
|
|||
call getv_mtpart(ivg)
|
|||
call psb_matdist(aux_a, a, ictxt, &
|
|||
& desc_a,info,b_glob=b_col_glob,b=b_col,fmt=afmt,v=ivg)
|
|||
|
|||
else
|
|||
if (iam == psb_root_) write(psb_out_unit,'("Partition type: block subroutine")')
|
|||
call psb_matdist(aux_a, a, ictxt, &
|
|||
& desc_a,info,b_glob=b_col_glob,b=b_col,fmt=afmt,parts=part_block)
|
|||
end if
|
|||
|
|||
call psb_geall(x_col,desc_a,info)
|
|||
call x_col%set(czero)
|
|||
call psb_geasb(x_col,desc_a,info)
|
|||
call psb_geall(r_col,desc_a,info)
|
|||
call r_col%set(czero)
|
|||
call psb_geasb(r_col,desc_a,info)
|
|||
t2 = psb_wtime() - t1
|
|||
|
|||
|
|||
call psb_amx(ictxt, t2)
|
|||
|
|||
if (iam == psb_root_) then
|
|||
write(psb_out_unit,'(" ")')
|
|||
write(psb_out_unit,'("Time to read and partition matrix : ",es12.5)')t2
|
|||
write(psb_out_unit,'(" ")')
|
|||
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 /= psb_success_) then
|
|||
call psb_errpush(psb_err_from_subroutine_,name,a_err='psb_precbld')
|
|||
goto 9999
|
|||
end if
|
|||
|
|||
|
|||
call psb_amx(ictxt,tprec)
|
|||
|
|||
if(iam == psb_root_) then
|
|||
write(psb_out_unit,'("Preconditioner time: ",es12.5)')tprec
|
|||
write(psb_out_unit,'(" ")')
|
|||
end if
|
|||
|
|||
iparm = 0
|
|||
call psb_barrier(ictxt)
|
|||
t1 = psb_wtime()
|
|||
call psb_krylov(kmethd,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(cone,b_col,czero,r_col,desc_a,info)
|
|||
call psb_spmm(-cone,a,x_col,cone,r_col,desc_a,info)
|
|||
resmx = psb_genrm2(r_col,desc_a,info)
|
|||
resmxp = psb_geamax(r_col,desc_a,info)
|
|||
|
|||
amatsize = a%sizeof()
|
|||
descsize = desc_a%sizeof()
|
|||
precsize = prec%sizeof()
|
|||
call psb_sum(ictxt,amatsize)
|
|||
call psb_sum(ictxt,descsize)
|
|||
call psb_sum(ictxt,precsize)
|
|||
if (iam == psb_root_) then
|
|||
call psb_precdescr(prec)
|
|||
write(psb_out_unit,'("Matrix: ",a)')mtrx_file
|
|||
write(psb_out_unit,'("Computed solution on ",i8," processors")')np
|
|||
write(psb_out_unit,'("Iterations to convergence: ",i6)')iter
|
|||
write(psb_out_unit,'("Error estimate on exit : ",es12.5)') err
|
|||
write(psb_out_unit,'("Time to buil prec. : ",es12.5)')tprec
|
|||
write(psb_out_unit,'("Time to solve system : ",es12.5)')t2
|
|||
write(psb_out_unit,'("Time per iteration : ",es12.5)')t2/(iter)
|
|||
write(psb_out_unit,'("Total time : ",es12.5)')t2+tprec
|
|||
write(psb_out_unit,'("Residual norm 2 : ",es12.5)')resmx
|
|||
write(psb_out_unit,'("Residual norm inf : ",es12.5)')resmxp
|
|||
!!$ write(psb_out_unit,*)"Condition number : ",cond
|
|||
write(psb_out_unit,'("Total memory occupation for A: ",i12)')amatsize
|
|||
write(psb_out_unit,'("Total memory occupation for PREC: ",i12)')precsize
|
|||
write(psb_out_unit,'("Total memory occupation for DESC_A: ",i12)')descsize
|
|||
write(psb_out_unit,'("Storage type for DESC_A : ",a)')&
|
|||
& desc_a%get_fmt()
|
|||
end if
|
|||
|
|||
call psb_gather(x_col_glob,x_col,desc_a,info,root=psb_root_)
|
|||
if (info == psb_success_) &
|
|||
& call psb_gather(r_col_glob,r_col,desc_a,info,root=psb_root_)
|
|||
if (info /= psb_success_) goto 9999
|
|||
if (iam == psb_root_) then
|
|||
write(psb_err_unit,'(" ")')
|
|||
write(psb_err_unit,'("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 estimate (infinity norm) on exit:', &
|
|||
& ' ||r||/(||a||||x||+||b||) = ',err
|
|||
write(20,'("Residual norm 2 : ",es12.5)')resmx
|
|||
write(20,'("Residual norm inf : ",es12.5)')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
|
|||
998 format(i8,6(1x,g11.5))
|
|||
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)
|
|||
call psb_exit(ictxt)
|
|||
stop
|
|||
|
|||
9999 call psb_error(ictxt)
|
|||
|
|||
stop
|
|||
end program psb_cf_sample
|
|||
|
|||
|
|||
|
|||
|
|||
|