diff --git a/test/scsr/Makefile b/test/scsr/Makefile new file mode 100644 index 00000000..77a65a09 --- /dev/null +++ b/test/scsr/Makefile @@ -0,0 +1,50 @@ +INSTALLDIR=../.. +INCDIR=$(INSTALLDIR)/include +MODDIR=$(INSTALLDIR)/modules/ +include $(INCDIR)/Make.inc.psblas +# +# Libraries used +LIBDIR=$(INSTALLDIR)/lib +PSBLAS_LIB= -L$(LIBDIR) -lpsb_util -lpsb_krylov -lpsb_prec -lpsb_base +LDLIBS=$(PSBLDLIBS) +# +# Compilers and such +# +CCOPT= -g +FINCLUDES=$(FMFLAG)$(MODDIR) $(FMFLAG). + + +EXEDIR=./runs + +all: psb_d_pde3d psb_s_pde3d psb_d_pde2d psb_s_pde2d + +psb_d_pde3d.o: psb_d_scsr_mat_mod.o +psb_d_pde3d: psb_d_pde3d.o psb_d_scsr_mat_mod.o psb_d_scsr_impl.o + $(FLINK) psb_d_pde3d.o psb_d_scsr_mat_mod.o psb_d_scsr_impl.o -o psb_d_pde3d $(PSBLAS_LIB) $(LDLIBS) + /bin/mv psb_d_pde3d $(EXEDIR) + + +psb_s_pde3d: psb_s_pde3d.o + $(FLINK) psb_s_pde3d.o -o psb_s_pde3d $(PSBLAS_LIB) $(LDLIBS) + /bin/mv psb_s_pde3d $(EXEDIR) + +psb_d_pde2d: psb_d_pde2d.o + $(FLINK) psb_d_pde2d.o -o psb_d_pde2d $(PSBLAS_LIB) $(LDLIBS) + /bin/mv psb_d_pde2d $(EXEDIR) + + +psb_s_pde2d: psb_s_pde2d.o + $(FLINK) psb_s_pde2d.o -o psb_s_pde2d $(PSBLAS_LIB) $(LDLIBS) + /bin/mv psb_s_pde2d $(EXEDIR) + + +clean: + /bin/rm -f psb_d_pde3d.o psb_s_pde3d.o psb_d_pde2d.o psb_s_pde2d.o *$(.mod) \ + $(EXEDIR)/psb_d_pde3d $(EXEDIR)/psb_s_pde3d $(EXEDIR)/psb_d_pde2d $(EXEDIR)/psb_s_pde2d +verycleanlib: + (cd ../..; make veryclean) +lib: + (cd ../../; make library) + + + diff --git a/test/scsr/psb_d_pde2d.f90 b/test/scsr/psb_d_pde2d.f90 new file mode 100644 index 00000000..955de6ef --- /dev/null +++ b/test/scsr/psb_d_pde2d.f90 @@ -0,0 +1,807 @@ +! +! Parallel Sparse BLAS version 3.5 +! (C) Copyright 2006-2018 +! Salvatore Filippone +! Alfredo Buttari +! +! 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_d_pde2d.f90 +! +! Program: psb_d_pde2d +! This sample program solves a linear system obtained by discretizing a +! PDE with Dirichlet BCs. +! +! +! The PDE is a general second order equation in 2d +! +! a1 dd(u) a2 dd(u) b1 d(u) b2 d(u) +! - ------ - ------ ----- + ------ + c u = f +! dxdx dydy dx dy +! +! with Dirichlet boundary conditions +! u = g +! +! on the unit square 0<=x,y<=1. +! +! +! Note that if b1=b2=c=0., the PDE is the Laplace equation. +! +! There are three choices available for data distribution: +! 1. A simple BLOCK distribution +! 2. A ditribution based on arbitrary assignment of indices to processes, +! typically from a graph partitioner +! 3. A 2D distribution in which the unit square is partitioned +! into rectangles, each one assigned to a process. +! +module psb_d_pde2d_mod + + use psb_base_mod, only : psb_dpk_, psb_ipk_, psb_desc_type,& + & psb_dspmat_type, psb_d_vect_type, dzero,& + & psb_d_base_sparse_mat, psb_d_base_vect_type, psb_i_base_vect_type + + interface + function d_func_2d(x,y) result(val) + import :: psb_dpk_ + real(psb_dpk_), intent(in) :: x,y + real(psb_dpk_) :: val + end function d_func_2d + end interface + + interface psb_gen_pde2d + module procedure psb_d_gen_pde2d + end interface psb_gen_pde2d + +contains + + function d_null_func_2d(x,y) result(val) + + real(psb_dpk_), intent(in) :: x,y + real(psb_dpk_) :: val + + val = dzero + + end function d_null_func_2d + + ! + ! functions parametrizing the differential equation + ! + + ! + ! Note: b1 and b2 are the coefficients of the first + ! derivative of the unknown function. The default + ! we apply here is to have them zero, so that the resulting + ! matrix is symmetric/hermitian and suitable for + ! testing with CG and FCG. + ! When testing methods for non-hermitian matrices you can + ! change the B1/B2 functions to e.g. done/sqrt((2*done)) + ! + function b1(x,y) + use psb_base_mod, only : psb_dpk_, done, dzero + implicit none + real(psb_dpk_) :: b1 + real(psb_dpk_), intent(in) :: x,y + b1=dzero + end function b1 + function b2(x,y) + use psb_base_mod, only : psb_dpk_, done, dzero + implicit none + real(psb_dpk_) :: b2 + real(psb_dpk_), intent(in) :: x,y + b2=dzero + end function b2 + function c(x,y) + use psb_base_mod, only : psb_dpk_, done, dzero + implicit none + real(psb_dpk_) :: c + real(psb_dpk_), intent(in) :: x,y + c=0.d0 + end function c + function a1(x,y) + use psb_base_mod, only : psb_dpk_, done, dzero + implicit none + real(psb_dpk_) :: a1 + real(psb_dpk_), intent(in) :: x,y + a1=done/80 + end function a1 + function a2(x,y) + use psb_base_mod, only : psb_dpk_, done, dzero + implicit none + real(psb_dpk_) :: a2 + real(psb_dpk_), intent(in) :: x,y + a2=done/80 + end function a2 + function g(x,y) + use psb_base_mod, only : psb_dpk_, done, dzero + implicit none + real(psb_dpk_) :: g + real(psb_dpk_), intent(in) :: x,y + g = dzero + if (x == done) then + g = done + else if (x == dzero) then + g = exp(-y**2) + end if + end function g + + + ! + ! subroutine to allocate and fill in the coefficient matrix and + ! the rhs. + ! + subroutine psb_d_gen_pde2d(ictxt,idim,a,bv,xv,desc_a,afmt,info,& + & f,amold,vmold,imold,partition,nrl,iv) + use psb_base_mod + use psb_util_mod + ! + ! Discretizes the partial differential equation + ! + ! a1 dd(u) a2 dd(u) b1 d(u) b2 d(u) + ! - ------ - ------ + ----- + ------ + c u = f + ! dxdx dydy dx dy + ! + ! with Dirichlet boundary conditions + ! u = g + ! + ! on the unit square 0<=x,y<=1. + ! + ! + ! Note that if b1=b2=c=0., the PDE is the Laplace equation. + ! + implicit none + integer(psb_ipk_) :: idim + type(psb_dspmat_type) :: a + type(psb_d_vect_type) :: xv,bv + type(psb_desc_type) :: desc_a + integer(psb_ipk_) :: ictxt, info + character(len=*) :: afmt + procedure(d_func_2d), optional :: f + class(psb_d_base_sparse_mat), optional :: amold + class(psb_d_base_vect_type), optional :: vmold + class(psb_i_base_vect_type), optional :: imold + integer(psb_ipk_), optional :: partition, nrl,iv(:) + + ! Local variables. + + integer(psb_ipk_), parameter :: nb=20 + type(psb_d_csc_sparse_mat) :: acsc + type(psb_d_coo_sparse_mat) :: acoo + type(psb_d_csr_sparse_mat) :: acsr + real(psb_dpk_) :: zt(nb),x,y,z + integer(psb_ipk_) :: m,n,nnz,nr,nt,glob_row,nlr,i,j,ii,ib,k, partition_ + integer(psb_ipk_) :: ix,iy,iz,ia,indx_owner + ! For 2D partition + integer(psb_ipk_) :: npx,npy,npdims(2),iamx,iamy,mynx,myny + integer(psb_ipk_), allocatable :: bndx(:),bndy(:) + ! Process grid + integer(psb_ipk_) :: np, iam + integer(psb_ipk_) :: icoeff + integer(psb_ipk_), allocatable :: irow(:),icol(:),myidx(:) + real(psb_dpk_), allocatable :: val(:) + ! deltah dimension of each grid cell + ! deltat discretization time + real(psb_dpk_) :: deltah, sqdeltah, deltah2 + real(psb_dpk_), parameter :: rhs=dzero,one=done,zero=dzero + real(psb_dpk_) :: t0, t1, t2, t3, tasb, talc, ttot, tgen, tcdasb + integer(psb_ipk_) :: err_act + procedure(d_func_2d), pointer :: f_ + character(len=20) :: name, ch_err,tmpfmt + + info = psb_success_ + name = 'create_matrix' + call psb_erractionsave(err_act) + + call psb_info(ictxt, iam, np) + + + if (present(f)) then + f_ => f + else + f_ => d_null_func_2d + end if + + deltah = done/(idim+2) + sqdeltah = deltah*deltah + deltah2 = (2*done)* deltah + + if (present(partition)) then + if ((1<= partition).and.(partition <= 3)) then + partition_ = partition + else + write(*,*) 'Invalid partition choice ',partition,' defaulting to 3' + partition_ = 3 + end if + else + partition_ = 3 + end if + + ! initialize array descriptor and sparse matrix storage. provide an + ! estimate of the number of non zeroes + + m = idim*idim + n = m + nnz = ((n*7)/(np)) + if(iam == psb_root_) write(psb_out_unit,'("Generating Matrix (size=",i0,")...")')n + t0 = psb_wtime() + select case(partition_) + case(1) + ! A BLOCK partition + if (present(nrl)) then + nr = nrl + else + ! + ! Using a simple BLOCK distribution. + ! + nt = (m+np-1)/np + nr = max(0,min(nt,m-(iam*nt))) + end if + + nt = nr + call psb_sum(ictxt,nt) + if (nt /= m) then + write(psb_err_unit,*) iam, 'Initialization error ',nr,nt,m + info = -1 + call psb_barrier(ictxt) + call psb_abort(ictxt) + return + end if + + ! + ! First example of use of CDALL: specify for each process a number of + ! contiguous rows + ! + call psb_cdall(ictxt,desc_a,info,nl=nr) + myidx = desc_a%get_global_indices() + nlr = size(myidx) + + case(2) + ! A partition defined by the user through IV + + if (present(iv)) then + if (size(iv) /= m) then + write(psb_err_unit,*) iam, 'Initialization error: wrong IV size',size(iv),m + info = -1 + call psb_barrier(ictxt) + call psb_abort(ictxt) + return + end if + else + write(psb_err_unit,*) iam, 'Initialization error: IV not present' + info = -1 + call psb_barrier(ictxt) + call psb_abort(ictxt) + return + end if + + ! + ! Second example of use of CDALL: specify for each row the + ! process that owns it + ! + call psb_cdall(ictxt,desc_a,info,vg=iv) + myidx = desc_a%get_global_indices() + nlr = size(myidx) + + case(3) + ! A 2-dimensional partition + + ! A nifty MPI function will split the process list + npdims = 0 + call mpi_dims_create(np,2,npdims,info) + npx = npdims(1) + npy = npdims(2) + + allocate(bndx(0:npx),bndy(0:npy)) + ! We can reuse idx2ijk for process indices as well. + call idx2ijk(iamx,iamy,iam,npx,npy,base=0) + ! Now let's split the 2D square in rectangles + call dist1Didx(bndx,idim,npx) + mynx = bndx(iamx+1)-bndx(iamx) + call dist1Didx(bndy,idim,npy) + myny = bndy(iamy+1)-bndy(iamy) + + ! How many indices do I own? + nlr = mynx*myny + allocate(myidx(nlr)) + ! Now, let's generate the list of indices I own + nr = 0 + do i=bndx(iamx),bndx(iamx+1)-1 + do j=bndy(iamy),bndy(iamy+1)-1 + nr = nr + 1 + call ijk2idx(myidx(nr),i,j,idim,idim) + end do + end do + if (nr /= nlr) then + write(psb_err_unit,*) iam,iamx,iamy, 'Initialization error: NR vs NLR ',& + & nr,nlr,mynx,myny + info = -1 + call psb_barrier(ictxt) + call psb_abort(ictxt) + end if + + ! + ! Third example of use of CDALL: specify for each process + ! the set of global indices it owns. + ! + call psb_cdall(ictxt,desc_a,info,vl=myidx) + + case default + write(psb_err_unit,*) iam, 'Initialization error: should not get here' + info = -1 + call psb_barrier(ictxt) + call psb_abort(ictxt) + return + end select + + + if (info == psb_success_) call psb_spall(a,desc_a,info,nnz=nnz) + ! define rhs from boundary conditions; also build initial guess + if (info == psb_success_) call psb_geall(xv,desc_a,info) + if (info == psb_success_) call psb_geall(bv,desc_a,info) + + call psb_barrier(ictxt) + talc = psb_wtime()-t0 + + if (info /= psb_success_) then + info=psb_err_from_subroutine_ + ch_err='allocation rout.' + call psb_errpush(info,name,a_err=ch_err) + goto 9999 + end if + + ! we build an auxiliary matrix consisting of one row at a + ! time; just a small matrix. might be extended to generate + ! a bunch of rows per call. + ! + allocate(val(20*nb),irow(20*nb),& + &icol(20*nb),stat=info) + if (info /= psb_success_ ) then + info=psb_err_alloc_dealloc_ + call psb_errpush(info,name) + goto 9999 + endif + + + ! loop over rows belonging to current process in a block + ! distribution. + + call psb_barrier(ictxt) + t1 = psb_wtime() + do ii=1, nlr,nb + ib = min(nb,nlr-ii+1) + icoeff = 1 + do k=1,ib + i=ii+k-1 + ! local matrix pointer + glob_row=myidx(i) + ! compute gridpoint coordinates + call idx2ijk(ix,iy,glob_row,idim,idim) + ! x, y coordinates + x = (ix-1)*deltah + y = (iy-1)*deltah + + zt(k) = f_(x,y) + ! internal point: build discretization + ! + ! term depending on (x-1,y) + ! + val(icoeff) = -a1(x,y)/sqdeltah-b1(x,y)/deltah2 + if (ix == 1) then + zt(k) = g(dzero,y)*(-val(icoeff)) + zt(k) + else + call ijk2idx(icol(icoeff),ix-1,iy,idim,idim) + irow(icoeff) = glob_row + icoeff = icoeff+1 + endif + ! term depending on (x,y-1) + val(icoeff) = -a2(x,y)/sqdeltah-b2(x,y)/deltah2 + if (iy == 1) then + zt(k) = g(x,dzero)*(-val(icoeff)) + zt(k) + else + call ijk2idx(icol(icoeff),ix,iy-1,idim,idim) + irow(icoeff) = glob_row + icoeff = icoeff+1 + endif + + ! term depending on (x,y) + val(icoeff)=(2*done)*(a1(x,y) + a2(x,y))/sqdeltah + c(x,y) + call ijk2idx(icol(icoeff),ix,iy,idim,idim) + irow(icoeff) = glob_row + icoeff = icoeff+1 + ! term depending on (x,y+1) + val(icoeff)=-a2(x,y)/sqdeltah+b2(x,y)/deltah2 + if (iy == idim) then + zt(k) = g(x,done)*(-val(icoeff)) + zt(k) + else + call ijk2idx(icol(icoeff),ix,iy+1,idim,idim) + irow(icoeff) = glob_row + icoeff = icoeff+1 + endif + ! term depending on (x+1,y) + val(icoeff)=-a1(x,y)/sqdeltah+b1(x,y)/deltah2 + if (ix==idim) then + zt(k) = g(done,y)*(-val(icoeff)) + zt(k) + else + call ijk2idx(icol(icoeff),ix+1,iy,idim,idim) + irow(icoeff) = glob_row + icoeff = icoeff+1 + endif + + end do + call psb_spins(icoeff-1,irow,icol,val,a,desc_a,info) + if(info /= psb_success_) exit + call psb_geins(ib,myidx(ii:ii+ib-1),zt(1:ib),bv,desc_a,info) + if(info /= psb_success_) exit + zt(:)=dzero + call psb_geins(ib,myidx(ii:ii+ib-1),zt(1:ib),xv,desc_a,info) + if(info /= psb_success_) exit + end do + + tgen = psb_wtime()-t1 + if(info /= psb_success_) then + info=psb_err_from_subroutine_ + ch_err='insert rout.' + call psb_errpush(info,name,a_err=ch_err) + goto 9999 + end if + + deallocate(val,irow,icol) + + call psb_barrier(ictxt) + t1 = psb_wtime() + call psb_cdasb(desc_a,info,mold=imold) + tcdasb = psb_wtime()-t1 + call psb_barrier(ictxt) + t1 = psb_wtime() + if (info == psb_success_) then + if (present(amold)) then + call psb_spasb(a,desc_a,info,dupl=psb_dupl_err_,mold=amold) + else + call psb_spasb(a,desc_a,info,dupl=psb_dupl_err_,afmt=afmt) + end if + end if + call psb_barrier(ictxt) + if(info /= psb_success_) then + info=psb_err_from_subroutine_ + ch_err='asb rout.' + call psb_errpush(info,name,a_err=ch_err) + goto 9999 + end if + if (info == psb_success_) call psb_geasb(xv,desc_a,info,mold=vmold) + if (info == psb_success_) call psb_geasb(bv,desc_a,info,mold=vmold) + if(info /= psb_success_) then + info=psb_err_from_subroutine_ + ch_err='asb rout.' + call psb_errpush(info,name,a_err=ch_err) + goto 9999 + end if + tasb = psb_wtime()-t1 + call psb_barrier(ictxt) + ttot = psb_wtime() - t0 + + call psb_amx(ictxt,talc) + call psb_amx(ictxt,tgen) + call psb_amx(ictxt,tasb) + call psb_amx(ictxt,ttot) + if(iam == psb_root_) then + tmpfmt = a%get_fmt() + write(psb_out_unit,'("The matrix has been generated and assembled in ",a3," format.")')& + & tmpfmt + write(psb_out_unit,'("-allocation time : ",es12.5)') talc + write(psb_out_unit,'("-coeff. gen. time : ",es12.5)') tgen + write(psb_out_unit,'("-desc asbly time : ",es12.5)') tcdasb + write(psb_out_unit,'("- mat asbly time : ",es12.5)') tasb + write(psb_out_unit,'("-total time : ",es12.5)') ttot + + end if + call psb_erractionrestore(err_act) + return + +9999 call psb_error_handler(ictxt,err_act) + + return + end subroutine psb_d_gen_pde2d + +end module psb_d_pde2d_mod + +program psb_d_pde2d + use psb_base_mod + use psb_prec_mod + use psb_krylov_mod + use psb_util_mod + use psb_d_pde2d_mod + implicit none + + ! input parameters + character(len=20) :: kmethd, ptype + character(len=5) :: afmt + integer(psb_ipk_) :: idim + + ! miscellaneous + real(psb_dpk_), parameter :: one = done + real(psb_dpk_) :: t1, t2, tprec + + ! sparse matrix and preconditioner + type(psb_dspmat_type) :: a + type(psb_dprec_type) :: prec + ! descriptor + type(psb_desc_type) :: desc_a + ! dense vectors + type(psb_d_vect_type) :: xxv,bv + ! parallel environment + integer(psb_ipk_) :: ictxt, iam, np + + ! solver parameters + integer(psb_ipk_) :: iter, itmax,itrace, istopc, irst + integer(psb_long_int_k_) :: amatsize, precsize, descsize, d2size + real(psb_dpk_) :: err, eps + + ! other variables + integer(psb_ipk_) :: info, i + character(len=20) :: name,ch_err + character(len=40) :: fname + + info=psb_success_ + + + 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 + if(psb_get_errstatus() /= 0) goto 9999 + name='pde2d90' + 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,kmethd,ptype,afmt,idim,istopc,itmax,itrace,irst) + + ! + ! allocate and fill in the coefficient matrix, rhs and initial guess + ! + call psb_barrier(ictxt) + t1 = psb_wtime() + call psb_gen_pde2d(ictxt,idim,a,bv,xxv,desc_a,afmt,info) + call psb_barrier(ictxt) + t2 = psb_wtime() - t1 + if(info /= psb_success_) then + info=psb_err_from_subroutine_ + ch_err='psb_gen_pde2d' + call psb_errpush(info,name,a_err=ch_err) + goto 9999 + end if + if (iam == psb_root_) write(psb_out_unit,'("Overall matrix creation time : ",es12.5)')t2 + if (iam == psb_root_) write(psb_out_unit,'(" ")') + ! + ! prepare the preconditioner. + ! + if(iam == psb_root_) write(psb_out_unit,'("Setting preconditioner to : ",a)')ptype + call prec%init(ptype,info) + + call psb_barrier(ictxt) + t1 = psb_wtime() + call prec%build(a,desc_a,info) + if(info /= psb_success_) then + info=psb_err_from_subroutine_ + ch_err='psb_precbld' + call psb_errpush(info,name,a_err=ch_err) + goto 9999 + end if + + tprec = psb_wtime()-t1 + + call psb_amx(ictxt,tprec) + + if (iam == psb_root_) write(psb_out_unit,'("Preconditioner time : ",es12.5)')tprec + if (iam == psb_root_) write(psb_out_unit,'(" ")') + call prec%descr() + ! + ! iterative method parameters + ! + if(iam == psb_root_) write(psb_out_unit,'("Calling iterative method ",a)')kmethd + call psb_barrier(ictxt) + t1 = psb_wtime() + eps = 1.d-6 + call psb_krylov(kmethd,a,prec,bv,xxv,eps,desc_a,info,& + & itmax=itmax,iter=iter,err=err,itrace=itrace,istop=istopc,irst=irst) + + if(info /= psb_success_) then + info=psb_err_from_subroutine_ + ch_err='solver routine' + call psb_errpush(info,name,a_err=ch_err) + goto 9999 + end if + + call psb_barrier(ictxt) + t2 = psb_wtime() - t1 + call psb_amx(ictxt,t2) + 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 + write(psb_out_unit,'(" ")') + write(psb_out_unit,'("Number of processes : ",i0)')np + 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,'("Number of iterations : ",i0)')iter + write(psb_out_unit,'("Convergence indicator on exit : ",es12.5)')err + write(psb_out_unit,'("Info on exit : ",i0)')info + 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 format for A: ",a)') a%get_fmt() + write(psb_out_unit,'("Storage format for DESC_A: ",a)') desc_a%get_fmt() + end if + + + ! + ! cleanup storage and exit + ! + call psb_gefree(bv,desc_a,info) + call psb_gefree(xxv,desc_a,info) + call psb_spfree(a,desc_a,info) + call prec%free(info) + call psb_cdfree(desc_a,info) + if(info /= psb_success_) then + info=psb_err_from_subroutine_ + ch_err='free routine' + call psb_errpush(info,name,a_err=ch_err) + goto 9999 + end if + + call psb_exit(ictxt) + stop + +9999 call psb_error(ictxt) + + stop + +contains + ! + ! get iteration parameters from standard input + ! + subroutine get_parms(ictxt,kmethd,ptype,afmt,idim,istopc,itmax,itrace,irst) + integer(psb_ipk_) :: ictxt + character(len=*) :: kmethd, ptype, afmt + integer(psb_ipk_) :: idim, istopc,itmax,itrace,irst + integer(psb_ipk_) :: np, iam + integer(psb_ipk_) :: ip, inp_unit + character(len=1024) :: filename + + call psb_info(ictxt, iam, np) + + if (iam == 0) then + if (command_argument_count()>0) then + call get_command_argument(1,filename) + inp_unit = 30 + open(inp_unit,file=filename,action='read',iostat=info) + if (info /= 0) then + write(psb_err_unit,*) 'Could not open file ',filename,' for input' + call psb_abort(ictxt) + stop + else + write(psb_err_unit,*) 'Opened file ',trim(filename),' for input' + end if + else + inp_unit=psb_inp_unit + end if + read(inp_unit,*) ip + if (ip >= 3) then + read(inp_unit,*) kmethd + read(inp_unit,*) ptype + read(inp_unit,*) afmt + + read(inp_unit,*) idim + if (ip >= 4) then + read(inp_unit,*) istopc + else + istopc=1 + endif + if (ip >= 5) then + read(inp_unit,*) itmax + else + itmax=500 + endif + if (ip >= 6) then + read(inp_unit,*) itrace + else + itrace=-1 + endif + if (ip >= 7) then + read(inp_unit,*) irst + else + irst=1 + endif + + write(psb_out_unit,'("Solving matrix : ell1")') + write(psb_out_unit,'("Grid dimensions : ",i5," x ",i5)')idim,idim + write(psb_out_unit,'("Number of processors : ",i0)')np + write(psb_out_unit,'("Data distribution : BLOCK")') + write(psb_out_unit,'("Preconditioner : ",a)') ptype + write(psb_out_unit,'("Iterative method : ",a)') kmethd + write(psb_out_unit,'(" ")') + else + ! wrong number of parameter, print an error message and exit + call pr_usage(izero) + call psb_abort(ictxt) + stop 1 + endif + if (inp_unit /= psb_inp_unit) then + close(inp_unit) + end if + + end if + ! broadcast parameters to all processors + call psb_bcast(ictxt,kmethd) + call psb_bcast(ictxt,afmt) + call psb_bcast(ictxt,ptype) + call psb_bcast(ictxt,idim) + call psb_bcast(ictxt,istopc) + call psb_bcast(ictxt,itmax) + call psb_bcast(ictxt,itrace) + call psb_bcast(ictxt,irst) + + return + + end subroutine get_parms + ! + ! print an error message + ! + subroutine pr_usage(iout) + integer(psb_ipk_) :: iout + write(iout,*)'incorrect parameter(s) found' + write(iout,*)' usage: pde2d90 methd prec dim & + &[istop itmax itrace]' + write(iout,*)' where:' + write(iout,*)' methd: cgstab cgs rgmres bicgstabl' + write(iout,*)' prec : bjac diag none' + write(iout,*)' dim number of points along each axis' + write(iout,*)' the size of the resulting linear ' + write(iout,*)' system is dim**3' + write(iout,*)' istop stopping criterion 1, 2 ' + write(iout,*)' itmax maximum number of iterations [500] ' + write(iout,*)' itrace <=0 (no tracing, default) or ' + write(iout,*)' >= 1 do tracing every itrace' + write(iout,*)' iterations ' + end subroutine pr_usage + +end program psb_d_pde2d + + diff --git a/test/scsr/psb_d_pde3d.f90 b/test/scsr/psb_d_pde3d.f90 new file mode 100644 index 00000000..360c6e3e --- /dev/null +++ b/test/scsr/psb_d_pde3d.f90 @@ -0,0 +1,873 @@ +! +! Parallel Sparse BLAS version 3.5 +! (C) Copyright 2006-2018 +! Salvatore Filippone +! Alfredo Buttari +! +! 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_d_pde3d.f90 +! +! Program: psb_d_pde3d +! This sample program solves a linear system obtained by discretizing a +! PDE with Dirichlet BCs. +! +! +! The PDE is a general second order equation in 3d +! +! a1 dd(u) a2 dd(u) a3 dd(u) b1 d(u) b2 d(u) b3 d(u) +! - ------ - ------ - ------ + ----- + ------ + ------ + c u = f +! dxdx dydy dzdz dx dy dz +! +! with Dirichlet boundary conditions +! u = g +! +! on the unit cube 0<=x,y,z<=1. +! +! +! Note that if b1=b2=b3=c=0., the PDE is the Laplace equation. +! +! There are three choices available for data distribution: +! 1. A simple BLOCK distribution +! 2. A ditribution based on arbitrary assignment of indices to processes, +! typically from a graph partitioner +! 3. A 3D distribution in which the unit cube is partitioned +! into subcubes, each one assigned to a process. +! +! +module psb_d_pde3d_mod + + + use psb_base_mod, only : psb_dpk_, psb_ipk_, psb_desc_type,& + & psb_dspmat_type, psb_d_vect_type, dzero,& + & psb_d_base_sparse_mat, psb_d_base_vect_type, psb_i_base_vect_type + + interface + function d_func_3d(x,y,z) result(val) + import :: psb_dpk_ + real(psb_dpk_), intent(in) :: x,y,z + real(psb_dpk_) :: val + end function d_func_3d + end interface + + interface psb_gen_pde3d + module procedure psb_d_gen_pde3d + end interface psb_gen_pde3d + +contains + + function d_null_func_3d(x,y,z) result(val) + + real(psb_dpk_), intent(in) :: x,y,z + real(psb_dpk_) :: val + + val = dzero + + end function d_null_func_3d + ! + ! functions parametrizing the differential equation + ! + + ! + ! Note: b1, b2 and b3 are the coefficients of the first + ! derivative of the unknown function. The default + ! we apply here is to have them zero, so that the resulting + ! matrix is symmetric/hermitian and suitable for + ! testing with CG and FCG. + ! When testing methods for non-hermitian matrices you can + ! change the B1/B2/B3 functions to e.g. done/sqrt((3*done)) + ! + function b1(x,y,z) + use psb_base_mod, only : psb_dpk_, done, dzero + implicit none + real(psb_dpk_) :: b1 + real(psb_dpk_), intent(in) :: x,y,z + b1=dzero + end function b1 + function b2(x,y,z) + use psb_base_mod, only : psb_dpk_, done, dzero + implicit none + real(psb_dpk_) :: b2 + real(psb_dpk_), intent(in) :: x,y,z + b2=dzero + end function b2 + function b3(x,y,z) + use psb_base_mod, only : psb_dpk_, done, dzero + implicit none + real(psb_dpk_) :: b3 + real(psb_dpk_), intent(in) :: x,y,z + b3=dzero + end function b3 + function c(x,y,z) + use psb_base_mod, only : psb_dpk_, done, dzero + implicit none + real(psb_dpk_) :: c + real(psb_dpk_), intent(in) :: x,y,z + c=dzero + end function c + function a1(x,y,z) + use psb_base_mod, only : psb_dpk_, done, dzero + implicit none + real(psb_dpk_) :: a1 + real(psb_dpk_), intent(in) :: x,y,z + a1=done/80 + end function a1 + function a2(x,y,z) + use psb_base_mod, only : psb_dpk_, done, dzero + implicit none + real(psb_dpk_) :: a2 + real(psb_dpk_), intent(in) :: x,y,z + a2=done/80 + end function a2 + function a3(x,y,z) + use psb_base_mod, only : psb_dpk_, done, dzero + implicit none + real(psb_dpk_) :: a3 + real(psb_dpk_), intent(in) :: x,y,z + a3=done/80 + end function a3 + function g(x,y,z) + use psb_base_mod, only : psb_dpk_, done, dzero + implicit none + real(psb_dpk_) :: g + real(psb_dpk_), intent(in) :: x,y,z + g = dzero + if (x == done) then + g = done + else if (x == dzero) then + g = exp(y**2-z**2) + end if + end function g + + + ! + ! subroutine to allocate and fill in the coefficient matrix and + ! the rhs. + ! + subroutine psb_d_gen_pde3d(ictxt,idim,a,bv,xv,desc_a,afmt,info,& + & f,amold,vmold,imold,partition,nrl,iv) + use psb_base_mod + use psb_util_mod + ! + ! Discretizes the partial differential equation + ! + ! a1 dd(u) a2 dd(u) a3 dd(u) b1 d(u) b2 d(u) b3 d(u) + ! - ------ - ------ - ------ + ----- + ------ + ------ + c u = f + ! dxdx dydy dzdz dx dy dz + ! + ! with Dirichlet boundary conditions + ! u = g + ! + ! on the unit cube 0<=x,y,z<=1. + ! + ! + ! Note that if b1=b2=b3=c=0., the PDE is the Laplace equation. + ! + implicit none + integer(psb_ipk_) :: idim + type(psb_dspmat_type) :: a + type(psb_d_vect_type) :: xv,bv + type(psb_desc_type) :: desc_a + integer(psb_ipk_) :: ictxt, info + character(len=*) :: afmt + procedure(d_func_3d), optional :: f + class(psb_d_base_sparse_mat), optional :: amold + class(psb_d_base_vect_type), optional :: vmold + class(psb_i_base_vect_type), optional :: imold + integer(psb_ipk_), optional :: partition, nrl,iv(:) + + ! Local variables. + + integer(psb_ipk_), parameter :: nb=20 + type(psb_d_csc_sparse_mat) :: acsc + type(psb_d_coo_sparse_mat) :: acoo + type(psb_d_csr_sparse_mat) :: acsr + real(psb_dpk_) :: zt(nb),x,y,z + integer(psb_ipk_) :: m,n,nnz,nr,nt,glob_row,nlr,i,j,ii,ib,k, partition_ + integer(psb_ipk_) :: ix,iy,iz,ia,indx_owner + ! For 3D partition + integer(psb_ipk_) :: npx,npy,npz, npdims(3),iamx,iamy,iamz,mynx,myny,mynz + integer(psb_ipk_), allocatable :: bndx(:),bndy(:),bndz(:) + ! Process grid + integer(psb_ipk_) :: np, iam + integer(psb_ipk_) :: icoeff + integer(psb_ipk_), allocatable :: irow(:),icol(:),myidx(:) + real(psb_dpk_), allocatable :: val(:) + ! deltah dimension of each grid cell + ! deltat discretization time + real(psb_dpk_) :: deltah, sqdeltah, deltah2 + real(psb_dpk_), parameter :: rhs=dzero,one=done,zero=dzero + real(psb_dpk_) :: t0, t1, t2, t3, tasb, talc, ttot, tgen, tcdasb + integer(psb_ipk_) :: err_act + procedure(d_func_3d), pointer :: f_ + character(len=20) :: name, ch_err,tmpfmt + + info = psb_success_ + name = 'create_matrix' + call psb_erractionsave(err_act) + + call psb_info(ictxt, iam, np) + + + if (present(f)) then + f_ => f + else + f_ => d_null_func_3d + end if + + deltah = done/(idim+2) + sqdeltah = deltah*deltah + deltah2 = (2*done)* deltah + + if (present(partition)) then + if ((1<= partition).and.(partition <= 3)) then + partition_ = partition + else + write(*,*) 'Invalid partition choice ',partition,' defaulting to 3' + partition_ = 3 + end if + else + partition_ = 3 + end if + + ! initialize array descriptor and sparse matrix storage. provide an + ! estimate of the number of non zeroes + + m = idim*idim*idim + n = m + nnz = ((n*7)/(np)) + if(iam == psb_root_) write(psb_out_unit,'("Generating Matrix (size=",i0,")...")')n + t0 = psb_wtime() + select case(partition_) + case(1) + ! A BLOCK partition + if (present(nrl)) then + nr = nrl + else + ! + ! Using a simple BLOCK distribution. + ! + nt = (m+np-1)/np + nr = max(0,min(nt,m-(iam*nt))) + end if + + nt = nr + call psb_sum(ictxt,nt) + if (nt /= m) then + write(psb_err_unit,*) iam, 'Initialization error ',nr,nt,m + info = -1 + call psb_barrier(ictxt) + call psb_abort(ictxt) + return + end if + + ! + ! First example of use of CDALL: specify for each process a number of + ! contiguous rows + ! + call psb_cdall(ictxt,desc_a,info,nl=nr) + myidx = desc_a%get_global_indices() + nlr = size(myidx) + + case(2) + ! A partition defined by the user through IV + + if (present(iv)) then + if (size(iv) /= m) then + write(psb_err_unit,*) iam, 'Initialization error: wrong IV size',size(iv),m + info = -1 + call psb_barrier(ictxt) + call psb_abort(ictxt) + return + end if + else + write(psb_err_unit,*) iam, 'Initialization error: IV not present' + info = -1 + call psb_barrier(ictxt) + call psb_abort(ictxt) + return + end if + + ! + ! Second example of use of CDALL: specify for each row the + ! process that owns it + ! + call psb_cdall(ictxt,desc_a,info,vg=iv) + myidx = desc_a%get_global_indices() + nlr = size(myidx) + + case(3) + ! A 3-dimensional partition + + ! A nifty MPI function will split the process list + npdims = 0 + call mpi_dims_create(np,3,npdims,info) + npx = npdims(1) + npy = npdims(2) + npz = npdims(3) + + allocate(bndx(0:npx),bndy(0:npy),bndz(0:npz)) + ! We can reuse idx2ijk for process indices as well. + call idx2ijk(iamx,iamy,iamz,iam,npx,npy,npz,base=0) + ! Now let's split the 3D cube in hexahedra + call dist1Didx(bndx,idim,npx) + mynx = bndx(iamx+1)-bndx(iamx) + call dist1Didx(bndy,idim,npy) + myny = bndy(iamy+1)-bndy(iamy) + call dist1Didx(bndz,idim,npz) + mynz = bndz(iamz+1)-bndz(iamz) + + ! How many indices do I own? + nlr = mynx*myny*mynz + allocate(myidx(nlr)) + ! Now, let's generate the list of indices I own + nr = 0 + do i=bndx(iamx),bndx(iamx+1)-1 + do j=bndy(iamy),bndy(iamy+1)-1 + do k=bndz(iamz),bndz(iamz+1)-1 + nr = nr + 1 + call ijk2idx(myidx(nr),i,j,k,idim,idim,idim) + end do + end do + end do + if (nr /= nlr) then + write(psb_err_unit,*) iam,iamx,iamy,iamz, 'Initialization error: NR vs NLR ',& + & nr,nlr,mynx,myny,mynz + info = -1 + call psb_barrier(ictxt) + call psb_abort(ictxt) + end if + + ! + ! Third example of use of CDALL: specify for each process + ! the set of global indices it owns. + ! + call psb_cdall(ictxt,desc_a,info,vl=myidx) + + case default + write(psb_err_unit,*) iam, 'Initialization error: should not get here' + info = -1 + call psb_barrier(ictxt) + call psb_abort(ictxt) + return + end select + + + if (info == psb_success_) call psb_spall(a,desc_a,info,nnz=nnz) + ! define rhs from boundary conditions; also build initial guess + if (info == psb_success_) call psb_geall(xv,desc_a,info) + if (info == psb_success_) call psb_geall(bv,desc_a,info) + + call psb_barrier(ictxt) + talc = psb_wtime()-t0 + + if (info /= psb_success_) then + info=psb_err_from_subroutine_ + ch_err='allocation rout.' + call psb_errpush(info,name,a_err=ch_err) + goto 9999 + end if + + ! we build an auxiliary matrix consisting of one row at a + ! time; just a small matrix. might be extended to generate + ! a bunch of rows per call. + ! + allocate(val(20*nb),irow(20*nb),& + &icol(20*nb),stat=info) + if (info /= psb_success_ ) then + info=psb_err_alloc_dealloc_ + call psb_errpush(info,name) + goto 9999 + endif + + + ! loop over rows belonging to current process in a block + ! distribution. + + call psb_barrier(ictxt) + t1 = psb_wtime() + do ii=1, nlr,nb + ib = min(nb,nlr-ii+1) + icoeff = 1 + do k=1,ib + i=ii+k-1 + ! local matrix pointer + glob_row=myidx(i) + ! compute gridpoint coordinates + call idx2ijk(ix,iy,iz,glob_row,idim,idim,idim) + ! x, y, z coordinates + x = (ix-1)*deltah + y = (iy-1)*deltah + z = (iz-1)*deltah + zt(k) = f_(x,y,z) + ! internal point: build discretization + ! + ! term depending on (x-1,y,z) + ! + val(icoeff) = -a1(x,y,z)/sqdeltah-b1(x,y,z)/deltah2 + if (ix == 1) then + zt(k) = g(dzero,y,z)*(-val(icoeff)) + zt(k) + else + call ijk2idx(icol(icoeff),ix-1,iy,iz,idim,idim,idim) + irow(icoeff) = glob_row + icoeff = icoeff+1 + endif + ! term depending on (x,y-1,z) + val(icoeff) = -a2(x,y,z)/sqdeltah-b2(x,y,z)/deltah2 + if (iy == 1) then + zt(k) = g(x,dzero,z)*(-val(icoeff)) + zt(k) + else + call ijk2idx(icol(icoeff),ix,iy-1,iz,idim,idim,idim) + irow(icoeff) = glob_row + icoeff = icoeff+1 + endif + ! term depending on (x,y,z-1) + val(icoeff)=-a3(x,y,z)/sqdeltah-b3(x,y,z)/deltah2 + if (iz == 1) then + zt(k) = g(x,y,dzero)*(-val(icoeff)) + zt(k) + else + call ijk2idx(icol(icoeff),ix,iy,iz-1,idim,idim,idim) + irow(icoeff) = glob_row + icoeff = icoeff+1 + endif + + ! term depending on (x,y,z) + val(icoeff)=(2*done)*(a1(x,y,z)+a2(x,y,z)+a3(x,y,z))/sqdeltah & + & + c(x,y,z) + call ijk2idx(icol(icoeff),ix,iy,iz,idim,idim,idim) + irow(icoeff) = glob_row + icoeff = icoeff+1 + ! term depending on (x,y,z+1) + val(icoeff)=-a3(x,y,z)/sqdeltah+b3(x,y,z)/deltah2 + if (iz == idim) then + zt(k) = g(x,y,done)*(-val(icoeff)) + zt(k) + else + call ijk2idx(icol(icoeff),ix,iy,iz+1,idim,idim,idim) + irow(icoeff) = glob_row + icoeff = icoeff+1 + endif + ! term depending on (x,y+1,z) + val(icoeff)=-a2(x,y,z)/sqdeltah+b2(x,y,z)/deltah2 + if (iy == idim) then + zt(k) = g(x,done,z)*(-val(icoeff)) + zt(k) + else + call ijk2idx(icol(icoeff),ix,iy+1,iz,idim,idim,idim) + irow(icoeff) = glob_row + icoeff = icoeff+1 + endif + ! term depending on (x+1,y,z) + val(icoeff)=-a1(x,y,z)/sqdeltah+b1(x,y,z)/deltah2 + if (ix==idim) then + zt(k) = g(done,y,z)*(-val(icoeff)) + zt(k) + else + call ijk2idx(icol(icoeff),ix+1,iy,iz,idim,idim,idim) + irow(icoeff) = glob_row + icoeff = icoeff+1 + endif + + end do + call psb_spins(icoeff-1,irow,icol,val,a,desc_a,info) + if(info /= psb_success_) exit + call psb_geins(ib,myidx(ii:ii+ib-1),zt(1:ib),bv,desc_a,info) + if(info /= psb_success_) exit + zt(:)=dzero + call psb_geins(ib,myidx(ii:ii+ib-1),zt(1:ib),xv,desc_a,info) + if(info /= psb_success_) exit + end do + + tgen = psb_wtime()-t1 + if(info /= psb_success_) then + info=psb_err_from_subroutine_ + ch_err='insert rout.' + call psb_errpush(info,name,a_err=ch_err) + goto 9999 + end if + + deallocate(val,irow,icol) + + call psb_barrier(ictxt) + t1 = psb_wtime() + call psb_cdasb(desc_a,info,mold=imold) + tcdasb = psb_wtime()-t1 + call psb_barrier(ictxt) + t1 = psb_wtime() + if (info == psb_success_) then + if (present(amold)) then + call psb_spasb(a,desc_a,info,dupl=psb_dupl_err_,mold=amold) + else + call psb_spasb(a,desc_a,info,dupl=psb_dupl_err_,afmt=afmt) + end if + end if + call psb_barrier(ictxt) + if(info /= psb_success_) then + info=psb_err_from_subroutine_ + ch_err='asb rout.' + call psb_errpush(info,name,a_err=ch_err) + goto 9999 + end if + if (info == psb_success_) call psb_geasb(xv,desc_a,info,mold=vmold) + if (info == psb_success_) call psb_geasb(bv,desc_a,info,mold=vmold) + if(info /= psb_success_) then + info=psb_err_from_subroutine_ + ch_err='asb rout.' + call psb_errpush(info,name,a_err=ch_err) + goto 9999 + end if + tasb = psb_wtime()-t1 + call psb_barrier(ictxt) + ttot = psb_wtime() - t0 + + call psb_amx(ictxt,talc) + call psb_amx(ictxt,tgen) + call psb_amx(ictxt,tasb) + call psb_amx(ictxt,ttot) + if(iam == psb_root_) then + tmpfmt = a%get_fmt() + write(psb_out_unit,'("The matrix has been generated and assembled in ",a3," format.")')& + & tmpfmt + write(psb_out_unit,'("-allocation time : ",es12.5)') talc + write(psb_out_unit,'("-coeff. gen. time : ",es12.5)') tgen + write(psb_out_unit,'("-desc asbly time : ",es12.5)') tcdasb + write(psb_out_unit,'("- mat asbly time : ",es12.5)') tasb + write(psb_out_unit,'("-total time : ",es12.5)') ttot + + end if + call psb_erractionrestore(err_act) + return + +9999 call psb_error_handler(ictxt,err_act) + + return + end subroutine psb_d_gen_pde3d + + +end module psb_d_pde3d_mod + +program psb_d_pde3d + use psb_base_mod + use psb_prec_mod + use psb_krylov_mod + use psb_util_mod + use psb_d_pde3d_mod + use psb_d_scsr_mat_mod + use psi_mod + implicit none + + ! input parameters + character(len=20) :: kmethd, ptype + character(len=5) :: afmt + integer(psb_ipk_) :: idim + + ! miscellaneous + real(psb_dpk_), parameter :: one = done + real(psb_dpk_) :: t1, t2, tprec, tt, tt1, tt2, flops, tflops, bdwdth + + ! sparse matrix and preconditioner + type(psb_dspmat_type) :: a, ad, and + type(psb_dprec_type) :: prec + type(psb_d_csr_sparse_mat) :: acsr + type(psb_d_scsr_sparse_mat) :: ascsr + + ! descriptor + type(psb_desc_type) :: desc_a + ! dense vectors + type(psb_d_vect_type) :: xv,bv, vtst + real(psb_dpk_), allocatable :: tst(:) + ! parallel environment + integer(psb_ipk_) :: ictxt, iam, np + + ! solver parameters + integer(psb_ipk_) :: iter, itmax,itrace, istopc, irst, annz, i, nr, nrl + integer(psb_long_int_k_) :: amatsize, precsize, descsize, d2size, nbytes + real(psb_dpk_) :: err, eps,work(1) + + ! other variables + integer(psb_ipk_) :: info + character(len=20) :: name,ch_err + character(len=40) :: fname + integer(psb_ipk_), parameter :: times=20 + + info=psb_success_ + + + 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 + if(psb_get_errstatus() /= 0) goto 9999 + name='pde3d90' + call psb_set_errverbosity(itwo) + call psb_cd_set_large_threshold(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,kmethd,ptype,afmt,idim,istopc,itmax,itrace,irst) + + ! + ! allocate and fill in the coefficient matrix, rhs and initial guess + ! + call psb_barrier(ictxt) + t1 = psb_wtime() + call psb_gen_pde3d(ictxt,idim,a,bv,xv,desc_a,afmt,info) + call psb_barrier(ictxt) + t2 = psb_wtime() - t1 + if(info /= psb_success_) then + info=psb_err_from_subroutine_ + ch_err='psb_gen_pde3d' + call psb_errpush(info,name,a_err=ch_err) + goto 9999 + end if + if (iam == psb_root_) write(psb_out_unit,'("Overall matrix creation time : ",es12.5)')t2 + if (iam == psb_root_) write(psb_out_unit,'(" ")') + call xv%set(done) + + nrl = a%get_nrows() + call a%csclip(ad,info,jmax=nrl) + call ad%cscnv(info, mold=acsr) + call a%csclip(and,info,jmin=nrl+1) + call and%mv_to(ascsr) + write(*,*) iam,' ND:',nrl,ascsr%nnerws + call and%mv_from(ascsr) + call psb_barrier(ictxt) + t1 = psb_wtime() + ! + ! Perform Ax multiple times to compute average performance + ! + do i=1,times + call psb_spmm(done,a,xv,dzero,bv,desc_a,info,'n') + end do + call psb_barrier(ictxt) + t2 = psb_wtime() - t1 + call psb_amx(ictxt,t2) + ! FIXME: cache flush needed here + call psb_barrier(ictxt) + tt1 = psb_wtime() + ! + ! Perform + ! + do i=1,times + call psi_swapdata(psb_swap_send_,& + & dzero,xv%v,desc_a,work,info,data=psb_comm_halo_) + call psb_csmm(done,ad,xv,dzero,bv,info) + call psi_swapdata(psb_swap_recv_,& + & dzero,xv%v,desc_a,work,info,data=psb_comm_halo_) + call psb_csmm(done,and,xv,done,bv,info) + end do + call psb_barrier(ictxt) + tt2 = psb_wtime() - tt1 + call psb_amx(ictxt,tt2) + + call psb_amx(ictxt,t2) + nr = desc_a%get_global_rows() + annz = a%get_nzeros() + amatsize = a%sizeof() + descsize = psb_sizeof(desc_a) + call psb_sum(ictxt,annz) + call psb_sum(ictxt,amatsize) + call psb_sum(ictxt,descsize) + + if (iam == psb_root_) then + flops = 2.d0*times*annz + tflops=flops + write(psb_out_unit,'("Matrix: ell1 ",i0)') idim + write(psb_out_unit,'("Test on : ",i20," processors")') np + write(psb_out_unit,'("Size of matrix : ",i20," ")') nr + write(psb_out_unit,'("Number of nonzeros : ",i20," ")') annz + write(psb_out_unit,'("Memory occupation : ",i20," ")') amatsize + write(psb_out_unit,'("Number of flops (",i0," prod) : ",F20.0," ")') times,flops + flops = flops / (t2) + tflops = tflops / (tt2) + write(psb_out_unit,'("Time for ",i0," products (s) : ",F20.3)')times, t2 + write(psb_out_unit,'("Time per product (ms) : ",F20.3)') t2*1.d3/(1.d0*times) + write(psb_out_unit,'("MFLOPS : ",F20.3)') flops/1.d6 + + write(psb_out_unit,'("Time for ",i0," products (s) (2step.): ",F20.3)') times,tt2 + write(psb_out_unit,'("Time per product (ms) (2step.): ",F20.3)') tt2*1.d3/(1.d0*times) + write(psb_out_unit,'("MFLOPS (2step.): ",F20.3)') tflops/1.d6 + + ! + ! This computation is valid for CSR + ! + nbytes = nr*(2*psb_sizeof_dp + psb_sizeof_int)+& + & annz*(psb_sizeof_dp + psb_sizeof_int) + bdwdth = times*nbytes/(t2*1.d6) + write(psb_out_unit,*) + write(psb_out_unit,'("MBYTES/S : ",F20.3)') bdwdth + bdwdth = times*nbytes/(tt2*1.d6) + write(psb_out_unit,'("MBYTES/S (trans): ",F20.3)') bdwdth + write(psb_out_unit,'("Storage type for DESC_A: ",a)') desc_a%get_fmt() + write(psb_out_unit,'("Total memory occupation for DESC_A: ",i12)')descsize + + end if + + ! + ! cleanup storage and exit + ! + call psb_gefree(bv,desc_a,info) + call psb_gefree(xv,desc_a,info) + call psb_spfree(a,desc_a,info) + call psb_cdfree(desc_a,info) + if(info /= psb_success_) then + info=psb_err_from_subroutine_ + ch_err='free routine' + call psb_errpush(info,name,a_err=ch_err) + goto 9999 + end if + + call psb_exit(ictxt) + stop + +9999 call psb_error(ictxt) + + stop + +contains + ! + ! get iteration parameters from standard input + ! + subroutine get_parms(ictxt,kmethd,ptype,afmt,idim,istopc,itmax,itrace,irst) + integer(psb_ipk_) :: ictxt + character(len=*) :: kmethd, ptype, afmt + integer(psb_ipk_) :: idim, istopc,itmax,itrace,irst + integer(psb_ipk_) :: np, iam + integer(psb_ipk_) :: ip, inp_unit + character(len=1024) :: filename + + call psb_info(ictxt, iam, np) + + if (iam == 0) then + if (command_argument_count()>0) then + call get_command_argument(1,filename) + inp_unit = 30 + open(inp_unit,file=filename,action='read',iostat=info) + if (info /= 0) then + write(psb_err_unit,*) 'Could not open file ',filename,' for input' + call psb_abort(ictxt) + stop + else + write(psb_err_unit,*) 'Opened file ',trim(filename),' for input' + end if + else + inp_unit=psb_inp_unit + end if + read(inp_unit,*) ip + if (ip >= 3) then + read(inp_unit,*) kmethd + read(inp_unit,*) ptype + read(inp_unit,*) afmt + + read(inp_unit,*) idim + if (ip >= 4) then + read(inp_unit,*) istopc + else + istopc=1 + endif + if (ip >= 5) then + read(inp_unit,*) itmax + else + itmax=500 + endif + if (ip >= 6) then + read(inp_unit,*) itrace + else + itrace=-1 + endif + if (ip >= 7) then + read(inp_unit,*) irst + else + irst=1 + endif + ! broadcast parameters to all processors + + + write(psb_out_unit,'("Solving matrix : ell1")') + write(psb_out_unit,& + & '("Grid dimensions : ",i4," x ",i4," x ",i4)') & + & idim,idim,idim + write(psb_out_unit,'("Number of processors : ",i0)')np + write(psb_out_unit,'("Data distribution : BLOCK")') + write(psb_out_unit,'("Preconditioner : ",a)') ptype + write(psb_out_unit,'("Iterative method : ",a)') kmethd + write(psb_out_unit,'(" ")') + else + ! wrong number of parameter, print an error message and exit + call pr_usage(izero) + call psb_abort(ictxt) + stop 1 + endif + if (inp_unit /= psb_inp_unit) then + close(inp_unit) + end if + + end if + ! broadcast parameters to all processors + call psb_bcast(ictxt,kmethd) + call psb_bcast(ictxt,afmt) + call psb_bcast(ictxt,ptype) + call psb_bcast(ictxt,idim) + call psb_bcast(ictxt,istopc) + call psb_bcast(ictxt,itmax) + call psb_bcast(ictxt,itrace) + call psb_bcast(ictxt,irst) + + return + + end subroutine get_parms + ! + ! print an error message + ! + subroutine pr_usage(iout) + integer(psb_ipk_) :: iout + write(iout,*)'incorrect parameter(s) found' + write(iout,*)' usage: pde3d90 methd prec dim & + &[istop itmax itrace]' + write(iout,*)' where:' + write(iout,*)' methd: cgstab cgs rgmres bicgstabl' + write(iout,*)' prec : bjac diag none' + write(iout,*)' dim number of points along each axis' + write(iout,*)' the size of the resulting linear ' + write(iout,*)' system is dim**3' + write(iout,*)' istop stopping criterion 1, 2 ' + write(iout,*)' itmax maximum number of iterations [500] ' + write(iout,*)' itrace <=0 (no tracing, default) or ' + write(iout,*)' >= 1 do tracing every itrace' + write(iout,*)' iterations ' + end subroutine pr_usage + +end program psb_d_pde3d + + diff --git a/test/scsr/psb_d_scsr_impl.f90 b/test/scsr/psb_d_scsr_impl.f90 new file mode 100644 index 00000000..58cefa08 --- /dev/null +++ b/test/scsr/psb_d_scsr_impl.f90 @@ -0,0 +1,2760 @@ +! +! Parallel Sparse BLAS version 3.5 +! (C) Copyright 2006-2018 +! Salvatore Filippone +! Alfredo Buttari +! +! 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. +! +! + +! == =================================== +! +! +! +! Computational routines +! +! +! +! +! +! +! == =================================== + +subroutine psb_d_scsr_csmv(alpha,a,x,beta,y,info,trans) + use psb_error_mod + use psb_string_mod + use psb_d_scsr_mat_mod, psb_protect_name => psb_d_scsr_csmv + implicit none + class(psb_d_scsr_sparse_mat), intent(in) :: a + real(psb_dpk_), intent(in) :: alpha, beta, x(:) + real(psb_dpk_), intent(inout) :: y(:) + integer(psb_ipk_), intent(out) :: info + character, optional, intent(in) :: trans + + character :: trans_ + integer(psb_ipk_) :: i,j,k,m,n, nnz, ir, jc + real(psb_dpk_) :: acc + logical :: tra, ctra + integer(psb_ipk_) :: err_act + integer(psb_ipk_) :: ierr(5) + character(len=20) :: name='d_scsr_csmv' + logical, parameter :: debug=.false. + + call psb_erractionsave(err_act) + info = psb_success_ + + ! This whole data structure is for the sake of a special + ! case with beta==one and A non unit, revert to base otherwise. + if ((beta /= done).or.(a%is_unit())) then + call a%psb_d_csr_sparse_mat%csmv(alpha,x,beta,y,info,trans) + if (info /= psb_success_) then + info = psb_err_internal_error_ + call psb_errpush(info,name) + goto 9999 + end if + end if + + if (present(trans)) then + trans_ = trans + else + trans_ = 'N' + end if + + if (.not.a%is_asb()) then + info = psb_err_invalid_mat_state_ + call psb_errpush(info,name) + goto 9999 + endif + + + tra = (psb_toupper(trans_) == 'T') + ctra = (psb_toupper(trans_) == 'C') + + if (tra.or.ctra) then + m = a%get_ncols() + n = a%get_nrows() + else + n = a%get_ncols() + m = a%get_nrows() + end if + + if (size(x,1) psb_d_scsr_csmm + implicit none + class(psb_d_scsr_sparse_mat), intent(in) :: a + real(psb_dpk_), intent(in) :: alpha, beta, x(:,:) + real(psb_dpk_), intent(inout) :: y(:,:) + integer(psb_ipk_), intent(out) :: info + character, optional, intent(in) :: trans + + character :: trans_ + integer(psb_ipk_) :: i,j,k,m,n, nnz, ir, jc, nc + real(psb_dpk_), allocatable :: acc(:) + logical :: tra, ctra + integer(psb_ipk_) :: err_act + integer(psb_ipk_) :: ierr(5) + character(len=20) :: name='d_scsr_csmm' + logical, parameter :: debug=.false. + + info = psb_success_ + call psb_erractionsave(err_act) + + + ! This whole data structure is for the sake of a special + ! case with beta==one and A non unit, revert to base otherwise. + if ((beta /= done).or.(a%is_unit())) then + call a%psb_d_csr_sparse_mat%csmm(alpha,x,beta,y,info,trans) + if (info /= psb_success_) then + info = psb_err_internal_error_ + call psb_errpush(info,name) + goto 9999 + end if + end if + + if (present(trans)) then + trans_ = trans + else + trans_ = 'N' + end if + + if (.not.a%is_asb()) then + info = psb_err_invalid_mat_state_ + call psb_errpush(info,name) + goto 9999 + endif + tra = (psb_toupper(trans_) == 'T') + ctra = (psb_toupper(trans_) == 'C') + + if (tra.or.ctra) then + m = a%get_ncols() + n = a%get_nrows() + else + n = a%get_ncols() + m = a%get_nrows() + end if + + if (size(x,1) psb_d_scsr_cssv +!!$ implicit none +!!$ class(psb_d_scsr_sparse_mat), intent(in) :: a +!!$ real(psb_dpk_), intent(in) :: alpha, beta, x(:) +!!$ real(psb_dpk_), intent(inout) :: y(:) +!!$ integer(psb_ipk_), intent(out) :: info +!!$ character, optional, intent(in) :: trans +!!$ +!!$ character :: trans_ +!!$ integer(psb_ipk_) :: i,j,k,m,n, nnz, ir, jc +!!$ real(psb_dpk_) :: acc +!!$ real(psb_dpk_), allocatable :: tmp(:) +!!$ logical :: tra,ctra +!!$ integer(psb_ipk_) :: err_act +!!$ integer(psb_ipk_) :: ierr(5) +!!$ character(len=20) :: name='d_scsr_cssv' +!!$ logical, parameter :: debug=.false. +!!$ +!!$ info = psb_success_ +!!$ call psb_erractionsave(err_act) +!!$ if (present(trans)) then +!!$ trans_ = trans +!!$ else +!!$ trans_ = 'N' +!!$ end if +!!$ if (.not.a%is_asb()) then +!!$ info = psb_err_invalid_mat_state_ +!!$ call psb_errpush(info,name) +!!$ goto 9999 +!!$ endif +!!$ +!!$ tra = (psb_toupper(trans_) == 'T') +!!$ ctra = (psb_toupper(trans_) == 'C') +!!$ m = a%get_nrows() +!!$ +!!$ if (.not. (a%is_triangle())) then +!!$ info = psb_err_invalid_mat_state_ +!!$ call psb_errpush(info,name) +!!$ goto 9999 +!!$ end if +!!$ +!!$ if (size(x) psb_d_scsr_cssm +!!$ implicit none +!!$ class(psb_d_scsr_sparse_mat), intent(in) :: a +!!$ real(psb_dpk_), intent(in) :: alpha, beta, x(:,:) +!!$ real(psb_dpk_), intent(inout) :: y(:,:) +!!$ integer(psb_ipk_), intent(out) :: info +!!$ character, optional, intent(in) :: trans +!!$ +!!$ character :: trans_ +!!$ integer(psb_ipk_) :: i,j,k,m,n, nnz, ir, jc, nc +!!$ real(psb_dpk_) :: acc +!!$ real(psb_dpk_), allocatable :: tmp(:,:) +!!$ logical :: tra, ctra +!!$ integer(psb_ipk_) :: err_act +!!$ integer(psb_ipk_) :: ierr(5) +!!$ character(len=20) :: name='d_scsr_cssm' +!!$ logical, parameter :: debug=.false. +!!$ +!!$ info = psb_success_ +!!$ call psb_erractionsave(err_act) +!!$ +!!$ if (present(trans)) then +!!$ trans_ = trans +!!$ else +!!$ trans_ = 'N' +!!$ end if +!!$ if (.not.a%is_asb()) then +!!$ info = psb_err_invalid_mat_state_ +!!$ call psb_errpush(info,name) +!!$ goto 9999 +!!$ endif +!!$ +!!$ +!!$ tra = (psb_toupper(trans_) == 'T') +!!$ ctra = (psb_toupper(trans_) == 'C') +!!$ +!!$ m = a%get_nrows() +!!$ nc = min(size(x,2) , size(y,2)) +!!$ +!!$ if (.not. (a%is_triangle())) then +!!$ info = psb_err_invalid_mat_state_ +!!$ call psb_errpush(info,name) +!!$ goto 9999 +!!$ end if +!!$ +!!$ +!!$ if (alpha == dzero) then +!!$ if (beta == dzero) then +!!$ do i = 1, m +!!$ y(i,:) = dzero +!!$ enddo +!!$ else +!!$ do i = 1, m +!!$ y(i,:) = beta*y(i,:) +!!$ end do +!!$ endif +!!$ return +!!$ end if +!!$ +!!$ if (beta == dzero) then +!!$ call inner_scsrsm(tra,ctra,a%is_lower(),a%is_unit(),a%get_nrows(),nc,& +!!$ & a%irp,a%ja,a%val,x,size(x,1,kind=psb_ipk_),y,size(y,1,kind=psb_ipk_),info) +!!$ do i = 1, m +!!$ y(i,1:nc) = alpha*y(i,1:nc) +!!$ end do +!!$ else +!!$ allocate(tmp(m,nc), stat=info) +!!$ if(info /= psb_success_) then +!!$ info=psb_err_from_subroutine_ +!!$ call psb_errpush(info,name,a_err='allocate') +!!$ goto 9999 +!!$ end if +!!$ +!!$ call inner_scsrsm(tra,ctra,a%is_lower(),a%is_unit(),a%get_nrows(),nc,& +!!$ & a%irp,a%ja,a%val,x,size(x,1,kind=psb_ipk_),tmp,size(tmp,1,kind=psb_ipk_),info) +!!$ do i = 1, m +!!$ y(i,1:nc) = alpha*tmp(i,1:nc) + beta*y(i,1:nc) +!!$ end do +!!$ end if +!!$ +!!$ if(info /= psb_success_) then +!!$ info=psb_err_from_subroutine_ +!!$ call psb_errpush(info,name,a_err='inner_scsrsm') +!!$ goto 9999 +!!$ end if +!!$ +!!$ call psb_erractionrestore(err_act) +!!$ return +!!$ +!!$ +!!$9999 call psb_error_handler(err_act) +!!$ return +!!$ +!!$ +!!$contains +!!$ +!!$ subroutine inner_scsrsm(tra,ctra,lower,unit,nr,nc,& +!!$ & irp,ja,val,x,ldx,y,ldy,info) +!!$ implicit none +!!$ logical, intent(in) :: tra,ctra,lower,unit +!!$ integer(psb_ipk_), intent(in) :: nr,nc,ldx,ldy,irp(*),ja(*) +!!$ real(psb_dpk_), intent(in) :: val(*), x(ldx,*) +!!$ real(psb_dpk_), intent(out) :: y(ldy,*) +!!$ integer(psb_ipk_), intent(out) :: info +!!$ integer(psb_ipk_) :: i,j,k,m, ir, jc +!!$ real(psb_dpk_), allocatable :: acc(:) +!!$ +!!$ info = psb_success_ +!!$ allocate(acc(nc), stat=info) +!!$ if(info /= psb_success_) then +!!$ info=psb_err_from_subroutine_ +!!$ return +!!$ end if +!!$ +!!$ +!!$ if ((.not.tra).and.(.not.ctra)) then +!!$ if (lower) then +!!$ if (unit) then +!!$ do i=1, nr +!!$ acc = dzero +!!$ do j=irp(i), irp(i+1)-1 +!!$ acc = acc + val(j)*y(ja(j),1:nc) +!!$ end do +!!$ y(i,1:nc) = x(i,1:nc) - acc +!!$ end do +!!$ else if (.not.unit) then +!!$ do i=1, nr +!!$ acc = dzero +!!$ do j=irp(i), irp(i+1)-2 +!!$ acc = acc + val(j)*y(ja(j),1:nc) +!!$ end do +!!$ y(i,1:nc) = (x(i,1:nc) - acc)/val(irp(i+1)-1) +!!$ end do +!!$ end if +!!$ else if (.not.lower) then +!!$ +!!$ if (unit) then +!!$ do i=nr, 1, -1 +!!$ acc = dzero +!!$ do j=irp(i), irp(i+1)-1 +!!$ acc = acc + val(j)*y(ja(j),1:nc) +!!$ end do +!!$ y(i,1:nc) = x(i,1:nc) - acc +!!$ end do +!!$ else if (.not.unit) then +!!$ do i=nr, 1, -1 +!!$ acc = dzero +!!$ do j=irp(i)+1, irp(i+1)-1 +!!$ acc = acc + val(j)*y(ja(j),1:nc) +!!$ end do +!!$ y(i,1:nc) = (x(i,1:nc) - acc)/val(irp(i)) +!!$ end do +!!$ end if +!!$ +!!$ end if +!!$ +!!$ else if (tra) then +!!$ +!!$ do i=1, nr +!!$ y(i,1:nc) = x(i,1:nc) +!!$ end do +!!$ +!!$ if (lower) then +!!$ if (unit) then +!!$ do i=nr, 1, -1 +!!$ acc = y(i,1:nc) +!!$ do j=irp(i), irp(i+1)-1 +!!$ jc = ja(j) +!!$ y(jc,1:nc) = y(jc,1:nc) - val(j)*acc +!!$ end do +!!$ end do +!!$ else if (.not.unit) then +!!$ do i=nr, 1, -1 +!!$ y(i,1:nc) = y(i,1:nc)/val(irp(i+1)-1) +!!$ acc = y(i,1:nc) +!!$ do j=irp(i), irp(i+1)-2 +!!$ jc = ja(j) +!!$ y(jc,1:nc) = y(jc,1:nc) - val(j)*acc +!!$ end do +!!$ end do +!!$ end if +!!$ else if (.not.lower) then +!!$ +!!$ if (unit) then +!!$ do i=1, nr +!!$ acc = y(i,1:nc) +!!$ do j=irp(i), irp(i+1)-1 +!!$ jc = ja(j) +!!$ y(jc,1:nc) = y(jc,1:nc) - val(j)*acc +!!$ end do +!!$ end do +!!$ else if (.not.unit) then +!!$ do i=1, nr +!!$ y(i,1:nc) = y(i,1:nc)/val(irp(i)) +!!$ acc = y(i,1:nc) +!!$ do j=irp(i)+1, irp(i+1)-1 +!!$ jc = ja(j) +!!$ y(jc,1:nc) = y(jc,1:nc) - val(j)*acc +!!$ end do +!!$ end do +!!$ end if +!!$ +!!$ end if +!!$ +!!$ else if (ctra) then +!!$ +!!$ do i=1, nr +!!$ y(i,1:nc) = x(i,1:nc) +!!$ end do +!!$ +!!$ if (lower) then +!!$ if (unit) then +!!$ do i=nr, 1, -1 +!!$ acc = y(i,1:nc) +!!$ do j=irp(i), irp(i+1)-1 +!!$ jc = ja(j) +!!$ y(jc,1:nc) = y(jc,1:nc) - (val(j))*acc +!!$ end do +!!$ end do +!!$ else if (.not.unit) then +!!$ do i=nr, 1, -1 +!!$ y(i,1:nc) = y(i,1:nc)/(val(irp(i+1)-1)) +!!$ acc = y(i,1:nc) +!!$ do j=irp(i), irp(i+1)-2 +!!$ jc = ja(j) +!!$ y(jc,1:nc) = y(jc,1:nc) - (val(j))*acc +!!$ end do +!!$ end do +!!$ end if +!!$ else if (.not.lower) then +!!$ +!!$ if (unit) then +!!$ do i=1, nr +!!$ acc = y(i,1:nc) +!!$ do j=irp(i), irp(i+1)-1 +!!$ jc = ja(j) +!!$ y(jc,1:nc) = y(jc,1:nc) - (val(j))*acc +!!$ end do +!!$ end do +!!$ else if (.not.unit) then +!!$ do i=1, nr +!!$ y(i,1:nc) = y(i,1:nc)/(val(irp(i))) +!!$ acc = y(i,1:nc) +!!$ do j=irp(i)+1, irp(i+1)-1 +!!$ jc = ja(j) +!!$ y(jc,1:nc) = y(jc,1:nc) - (val(j))*acc +!!$ end do +!!$ end do +!!$ end if +!!$ +!!$ end if +!!$ end if +!!$ end subroutine inner_scsrsm +!!$ +!!$end subroutine psb_d_scsr_cssm +!!$ +!!$function psb_d_scsr_maxval(a) result(res) +!!$ use psb_error_mod +!!$ use psb_d_scsr_mat_mod, psb_protect_name => psb_d_scsr_maxval +!!$ implicit none +!!$ class(psb_d_scsr_sparse_mat), intent(in) :: a +!!$ real(psb_dpk_) :: res +!!$ +!!$ integer(psb_ipk_) :: i,j,k,m,n, nnz, ir, jc, nc, info +!!$ integer(psb_ipk_) :: ierr(5) +!!$ character(len=20) :: name='d_scsr_maxval' +!!$ logical, parameter :: debug=.false. +!!$ +!!$ +!!$ res = dzero +!!$ nnz = a%get_nzeros() +!!$ if (allocated(a%val)) then +!!$ nnz = min(nnz,size(a%val)) +!!$ res = maxval(abs(a%val(1:nnz))) +!!$ end if +!!$end function psb_d_scsr_maxval +!!$ +!!$function psb_d_scsr_csnmi(a) result(res) +!!$ use psb_error_mod +!!$ use psb_d_scsr_mat_mod, psb_protect_name => psb_d_scsr_csnmi +!!$ implicit none +!!$ class(psb_d_scsr_sparse_mat), intent(in) :: a +!!$ real(psb_dpk_) :: res +!!$ +!!$ integer(psb_ipk_) :: i,j,k,m,n, nr, ir, jc, nc +!!$ real(psb_dpk_) :: acc +!!$ logical :: tra +!!$ integer(psb_ipk_) :: err_act +!!$ integer(psb_ipk_) :: ierr(5) +!!$ character(len=20) :: name='d_csnmi' +!!$ logical, parameter :: debug=.false. +!!$ +!!$ +!!$ res = dzero +!!$ +!!$ do i = 1, a%get_nrows() +!!$ acc = dzero +!!$ do j=a%irp(i),a%irp(i+1)-1 +!!$ acc = acc + abs(a%val(j)) +!!$ end do +!!$ res = max(res,acc) +!!$ end do +!!$ +!!$end function psb_d_scsr_csnmi +!!$ +!!$function psb_d_scsr_csnm1(a) result(res) +!!$ use psb_error_mod +!!$ use psb_const_mod +!!$ use psb_d_scsr_mat_mod, psb_protect_name => psb_d_scsr_csnm1 +!!$ +!!$ implicit none +!!$ class(psb_d_scsr_sparse_mat), intent(in) :: a +!!$ real(psb_dpk_) :: res +!!$ +!!$ integer(psb_ipk_) :: i,j,k,m,n, nnz, ir, jc, nc, info +!!$ real(psb_dpk_) :: acc +!!$ real(psb_dpk_), allocatable :: vt(:) +!!$ logical :: tra +!!$ integer(psb_ipk_) :: err_act +!!$ integer(psb_ipk_) :: ierr(5) +!!$ character(len=20) :: name='d_scsr_csnm1' +!!$ logical, parameter :: debug=.false. +!!$ +!!$ +!!$ res = dzero +!!$ nnz = a%get_nzeros() +!!$ m = a%get_nrows() +!!$ n = a%get_ncols() +!!$ allocate(vt(n),stat=info) +!!$ if (info /= 0) return +!!$ vt(:) = dzero +!!$ do i=1, m +!!$ do j=a%irp(i),a%irp(i+1)-1 +!!$ k = a%ja(j) +!!$ vt(k) = vt(k) + abs(a%val(j)) +!!$ end do +!!$ end do +!!$ res = maxval(vt(1:n)) +!!$ deallocate(vt,stat=info) +!!$ +!!$ return +!!$ +!!$end function psb_d_scsr_csnm1 +!!$ +!!$subroutine psb_d_scsr_rowsum(d,a) +!!$ use psb_error_mod +!!$ use psb_const_mod +!!$ use psb_d_scsr_mat_mod, psb_protect_name => psb_d_scsr_rowsum +!!$ class(psb_d_scsr_sparse_mat), intent(in) :: a +!!$ real(psb_dpk_), intent(out) :: d(:) +!!$ +!!$ integer(psb_ipk_) :: i,j,k,m,n, nnz, ir, jc, nc +!!$ real(psb_dpk_) :: acc +!!$ real(psb_dpk_), allocatable :: vt(:) +!!$ logical :: tra +!!$ integer(psb_ipk_) :: err_act, info +!!$ integer(psb_ipk_) :: ierr(5) +!!$ character(len=20) :: name='rowsum' +!!$ logical, parameter :: debug=.false. +!!$ +!!$ call psb_erractionsave(err_act) +!!$ +!!$ m = a%get_nrows() +!!$ if (size(d) < m) then +!!$ info=psb_err_input_asize_small_i_ +!!$ ierr(1) = 1; ierr(2) = size(d); ierr(3) = m +!!$ call psb_errpush(info,name,i_err=ierr) +!!$ goto 9999 +!!$ end if +!!$ +!!$ do i = 1, a%get_nrows() +!!$ d(i) = dzero +!!$ do j=a%irp(i),a%irp(i+1)-1 +!!$ d(i) = d(i) + (a%val(j)) +!!$ end do +!!$ end do +!!$ +!!$ if (a%is_unit()) then +!!$ do i=1, m +!!$ d(i) = d(i) + done +!!$ end do +!!$ end if +!!$ +!!$ return +!!$ call psb_erractionrestore(err_act) +!!$ return +!!$ +!!$9999 call psb_error_handler(err_act) +!!$ return +!!$ +!!$end subroutine psb_d_scsr_rowsum +!!$ +!!$subroutine psb_d_scsr_arwsum(d,a) +!!$ use psb_error_mod +!!$ use psb_const_mod +!!$ use psb_d_scsr_mat_mod, psb_protect_name => psb_d_scsr_arwsum +!!$ class(psb_d_scsr_sparse_mat), intent(in) :: a +!!$ real(psb_dpk_), intent(out) :: d(:) +!!$ +!!$ integer(psb_ipk_) :: i,j,k,m,n, nnz, ir, jc, nc +!!$ real(psb_dpk_) :: acc +!!$ real(psb_dpk_), allocatable :: vt(:) +!!$ logical :: tra +!!$ integer(psb_ipk_) :: err_act, info +!!$ integer(psb_ipk_) :: ierr(5) +!!$ character(len=20) :: name='rowsum' +!!$ logical, parameter :: debug=.false. +!!$ +!!$ call psb_erractionsave(err_act) +!!$ +!!$ m = a%get_nrows() +!!$ if (size(d) < m) then +!!$ info=psb_err_input_asize_small_i_ +!!$ ierr(1) = 1; ierr(2) = size(d); ierr(3) = m +!!$ call psb_errpush(info,name,i_err=ierr) +!!$ goto 9999 +!!$ end if +!!$ +!!$ +!!$ do i = 1, a%get_nrows() +!!$ d(i) = dzero +!!$ do j=a%irp(i),a%irp(i+1)-1 +!!$ d(i) = d(i) + abs(a%val(j)) +!!$ end do +!!$ end do +!!$ +!!$ if (a%is_unit()) then +!!$ do i=1, m +!!$ d(i) = d(i) + done +!!$ end do +!!$ end if +!!$ +!!$ call psb_erractionrestore(err_act) +!!$ return +!!$ +!!$9999 call psb_error_handler(err_act) +!!$ return +!!$ +!!$end subroutine psb_d_scsr_arwsum +!!$ +!!$subroutine psb_d_scsr_colsum(d,a) +!!$ use psb_error_mod +!!$ use psb_const_mod +!!$ use psb_d_scsr_mat_mod, psb_protect_name => psb_d_scsr_colsum +!!$ class(psb_d_scsr_sparse_mat), intent(in) :: a +!!$ real(psb_dpk_), intent(out) :: d(:) +!!$ +!!$ integer(psb_ipk_) :: i,j,k,m,n, nnz, ir, jc, nc +!!$ real(psb_dpk_) :: acc +!!$ real(psb_dpk_), allocatable :: vt(:) +!!$ logical :: tra +!!$ integer(psb_ipk_) :: err_act, info +!!$ integer(psb_ipk_) :: ierr(5) +!!$ character(len=20) :: name='colsum' +!!$ logical, parameter :: debug=.false. +!!$ +!!$ call psb_erractionsave(err_act) +!!$ +!!$ m = a%get_nrows() +!!$ n = a%get_ncols() +!!$ if (size(d) < n) then +!!$ info=psb_err_input_asize_small_i_ +!!$ ierr(1) = 1; ierr(2) = size(d); ierr(3) = n +!!$ call psb_errpush(info,name,i_err=ierr) +!!$ goto 9999 +!!$ end if +!!$ +!!$ d = dzero +!!$ +!!$ do i=1, m +!!$ do j=a%irp(i),a%irp(i+1)-1 +!!$ k = a%ja(j) +!!$ d(k) = d(k) + (a%val(j)) +!!$ end do +!!$ end do +!!$ +!!$ if (a%is_unit()) then +!!$ do i=1, n +!!$ d(i) = d(i) + done +!!$ end do +!!$ end if +!!$ +!!$ return +!!$ call psb_erractionrestore(err_act) +!!$ return +!!$ +!!$9999 call psb_error_handler(err_act) +!!$ return +!!$ +!!$end subroutine psb_d_scsr_colsum +!!$ +!!$subroutine psb_d_scsr_aclsum(d,a) +!!$ use psb_error_mod +!!$ use psb_const_mod +!!$ use psb_d_scsr_mat_mod, psb_protect_name => psb_d_scsr_aclsum +!!$ class(psb_d_scsr_sparse_mat), intent(in) :: a +!!$ real(psb_dpk_), intent(out) :: d(:) +!!$ +!!$ integer(psb_ipk_) :: i,j,k,m,n, nnz, ir, jc, nc +!!$ real(psb_dpk_) :: acc +!!$ real(psb_dpk_), allocatable :: vt(:) +!!$ logical :: tra +!!$ integer(psb_ipk_) :: err_act, info +!!$ integer(psb_ipk_) :: ierr(5) +!!$ character(len=20) :: name='aclsum' +!!$ logical, parameter :: debug=.false. +!!$ +!!$ call psb_erractionsave(err_act) +!!$ +!!$ m = a%get_nrows() +!!$ n = a%get_ncols() +!!$ if (size(d) < n) then +!!$ info=psb_err_input_asize_small_i_ +!!$ ierr(1) = 1; ierr(2) = size(d); ierr(3) = n +!!$ call psb_errpush(info,name,i_err=ierr) +!!$ goto 9999 +!!$ end if +!!$ +!!$ d = dzero +!!$ +!!$ do i=1, m +!!$ do j=a%irp(i),a%irp(i+1)-1 +!!$ k = a%ja(j) +!!$ d(k) = d(k) + abs(a%val(j)) +!!$ end do +!!$ end do +!!$ +!!$ if (a%is_unit()) then +!!$ do i=1, n +!!$ d(i) = d(i) + done +!!$ end do +!!$ end if +!!$ +!!$ return +!!$ call psb_erractionrestore(err_act) +!!$ return +!!$ +!!$9999 call psb_error_handler(err_act) +!!$ return +!!$ +!!$end subroutine psb_d_scsr_aclsum +!!$ +!!$subroutine psb_d_scsr_get_diag(a,d,info) +!!$ use psb_error_mod +!!$ use psb_const_mod +!!$ use psb_d_scsr_mat_mod, psb_protect_name => psb_d_scsr_get_diag +!!$ implicit none +!!$ class(psb_d_scsr_sparse_mat), intent(in) :: a +!!$ real(psb_dpk_), intent(out) :: d(:) +!!$ integer(psb_ipk_), intent(out) :: info +!!$ +!!$ integer(psb_ipk_) :: err_act, mnm, i, j, k +!!$ integer(psb_ipk_) :: ierr(5) +!!$ character(len=20) :: name='get_diag' +!!$ logical, parameter :: debug=.false. +!!$ +!!$ info = psb_success_ +!!$ call psb_erractionsave(err_act) +!!$ +!!$ mnm = min(a%get_nrows(),a%get_ncols()) +!!$ if (size(d) < mnm) then +!!$ info=psb_err_input_asize_invalid_i_ +!!$ ierr(1) = 2; ierr(2) = size(d); +!!$ call psb_errpush(info,name,i_err=ierr) +!!$ goto 9999 +!!$ end if +!!$ +!!$ +!!$ if (a%is_unit()) then +!!$ d(1:mnm) = done +!!$ else +!!$ do i=1, mnm +!!$ d(i) = dzero +!!$ do k=a%irp(i),a%irp(i+1)-1 +!!$ j=a%ja(k) +!!$ if ((j == i) .and.(j <= mnm )) then +!!$ d(i) = a%val(k) +!!$ endif +!!$ enddo +!!$ end do +!!$ end if +!!$ do i=mnm+1,size(d) +!!$ d(i) = dzero +!!$ end do +!!$ +!!$ call psb_erractionrestore(err_act) +!!$ return +!!$ +!!$9999 call psb_error_handler(err_act) +!!$ return +!!$ +!!$end subroutine psb_d_scsr_get_diag +!!$ +!!$ +!!$subroutine psb_d_scsr_scal(d,a,info,side) +!!$ use psb_error_mod +!!$ use psb_const_mod +!!$ use psb_d_scsr_mat_mod, psb_protect_name => psb_d_scsr_scal +!!$ use psb_string_mod +!!$ implicit none +!!$ class(psb_d_scsr_sparse_mat), intent(inout) :: a +!!$ real(psb_dpk_), intent(in) :: d(:) +!!$ integer(psb_ipk_), intent(out) :: info +!!$ character, intent(in), optional :: side +!!$ +!!$ integer(psb_ipk_) :: err_act,mnm, i, j, m +!!$ integer(psb_ipk_) :: ierr(5) +!!$ character(len=20) :: name='scal' +!!$ character :: side_ +!!$ logical :: left +!!$ logical, parameter :: debug=.false. +!!$ +!!$ info = psb_success_ +!!$ call psb_erractionsave(err_act) +!!$ +!!$ if (a%is_unit()) then +!!$ call a%make_nonunit() +!!$ end if +!!$ +!!$ side_ = 'L' +!!$ if (present(side)) then +!!$ side_ = psb_toupper(side) +!!$ end if +!!$ +!!$ left = (side_ == 'L') +!!$ +!!$ if (left) then +!!$ m = a%get_nrows() +!!$ if (size(d) < m) then +!!$ info=psb_err_input_asize_invalid_i_ +!!$ ierr(1) = 2; ierr(2) = size(d); +!!$ call psb_errpush(info,name,i_err=ierr) +!!$ goto 9999 +!!$ end if +!!$ +!!$ do i=1, m +!!$ do j = a%irp(i), a%irp(i+1) -1 +!!$ a%val(j) = a%val(j) * d(i) +!!$ end do +!!$ enddo +!!$ else +!!$ m = a%get_ncols() +!!$ if (size(d) < m) then +!!$ info=psb_err_input_asize_invalid_i_ +!!$ ierr(1) = 2; ierr(2) = size(d); +!!$ call psb_errpush(info,name,i_err=ierr) +!!$ goto 9999 +!!$ end if +!!$ +!!$ do i=1,a%get_nzeros() +!!$ j = a%ja(i) +!!$ a%val(i) = a%val(i) * d(j) +!!$ enddo +!!$ end if +!!$ +!!$ +!!$ +!!$ call psb_erractionrestore(err_act) +!!$ return +!!$ +!!$9999 call psb_error_handler(err_act) +!!$ return +!!$ +!!$end subroutine psb_d_scsr_scal +!!$ +!!$ +!!$subroutine psb_d_scsr_scals(d,a,info) +!!$ use psb_error_mod +!!$ use psb_const_mod +!!$ use psb_d_scsr_mat_mod, psb_protect_name => psb_d_scsr_scals +!!$ implicit none +!!$ class(psb_d_scsr_sparse_mat), intent(inout) :: a +!!$ real(psb_dpk_), intent(in) :: d +!!$ integer(psb_ipk_), intent(out) :: info +!!$ +!!$ integer(psb_ipk_) :: err_act,mnm, i, j, m +!!$ integer(psb_ipk_) :: ierr(5) +!!$ character(len=20) :: name='scal' +!!$ logical, parameter :: debug=.false. +!!$ +!!$ info = psb_success_ +!!$ call psb_erractionsave(err_act) +!!$ +!!$ if (a%is_unit()) then +!!$ call a%make_nonunit() +!!$ end if +!!$ +!!$ do i=1,a%get_nzeros() +!!$ a%val(i) = a%val(i) * d +!!$ enddo +!!$ +!!$ call psb_erractionrestore(err_act) +!!$ return +!!$ +!!$9999 call psb_error_handler(err_act) +!!$ return +!!$ +!!$end subroutine psb_d_scsr_scals +!!$ + + + +! == =================================== +! +! +! +! Data management +! +! +! +! +! +! == =================================== + +!!$ +!!$subroutine psb_d_scsr_reallocate_nz(nz,a) +!!$ use psb_error_mod +!!$ use psb_realloc_mod +!!$ use psb_d_scsr_mat_mod, psb_protect_name => psb_d_scsr_reallocate_nz +!!$ implicit none +!!$ integer(psb_ipk_), intent(in) :: nz +!!$ class(psb_d_scsr_sparse_mat), intent(inout) :: a +!!$ integer(psb_ipk_) :: err_act, info +!!$ integer(psb_ipk_) :: ierr(5) +!!$ character(len=20) :: name='d_scsr_reallocate_nz' +!!$ logical, parameter :: debug=.false. +!!$ +!!$ call psb_erractionsave(err_act) +!!$ +!!$ call psb_realloc(nz,a%ja,info) +!!$ if (info == psb_success_) call psb_realloc(nz,a%val,info) +!!$ if (info == psb_success_) call psb_realloc(& +!!$ & max(nz,a%get_nrows()+1,a%get_ncols()+1),a%irp,info) +!!$ if (info /= psb_success_) then +!!$ call psb_errpush(psb_err_alloc_dealloc_,name) +!!$ goto 9999 +!!$ end if +!!$ +!!$ call psb_erractionrestore(err_act) +!!$ return +!!$ +!!$9999 call psb_error_handler(err_act) +!!$ return +!!$ +!!$end subroutine psb_d_scsr_reallocate_nz + +subroutine psb_d_scsr_mold(a,b,info) + use psb_d_scsr_mat_mod, psb_protect_name => psb_d_scsr_mold + use psb_error_mod + implicit none + class(psb_d_scsr_sparse_mat), intent(in) :: a + class(psb_d_base_sparse_mat), intent(inout), allocatable :: b + integer(psb_ipk_), intent(out) :: info + integer(psb_ipk_) :: err_act + integer(psb_ipk_) :: ierr(5) + character(len=20) :: name='scsr_mold' + logical, parameter :: debug=.false. + + call psb_get_erraction(err_act) + + info = 0 + if (allocated(b)) then + call b%free() + deallocate(b,stat=info) + end if + if (info == 0) allocate(psb_d_scsr_sparse_mat :: b, stat=info) + + if (info /= 0) then + info = psb_err_alloc_dealloc_ + call psb_errpush(info, name) + goto 9999 + end if + return + +9999 call psb_error_handler(err_act) + return + +end subroutine psb_d_scsr_mold + +!!$subroutine psb_d_scsr_allocate_mnnz(m,n,a,nz) +!!$ use psb_error_mod +!!$ use psb_realloc_mod +!!$ use psb_d_scsr_mat_mod, psb_protect_name => psb_d_scsr_allocate_mnnz +!!$ implicit none +!!$ integer(psb_ipk_), intent(in) :: m,n +!!$ class(psb_d_scsr_sparse_mat), intent(inout) :: a +!!$ integer(psb_ipk_), intent(in), optional :: nz +!!$ integer(psb_ipk_) :: err_act, info, nz_ +!!$ integer(psb_ipk_) :: ierr(5) +!!$ character(len=20) :: name='allocate_mnz' +!!$ logical, parameter :: debug=.false. +!!$ +!!$ call psb_erractionsave(err_act) +!!$ info = psb_success_ +!!$ if (m < 0) then +!!$ info = psb_err_iarg_neg_ +!!$ ierr(1) = ione; ierr(2) = izero; +!!$ call psb_errpush(info,name,i_err=ierr) +!!$ goto 9999 +!!$ endif +!!$ if (n < 0) then +!!$ info = psb_err_iarg_neg_ +!!$ ierr(1) = 2; ierr(2) = izero; +!!$ call psb_errpush(info,name,i_err=ierr) +!!$ goto 9999 +!!$ endif +!!$ if (present(nz)) then +!!$ nz_ = nz +!!$ else +!!$ nz_ = max(7*m,7*n,1) +!!$ end if +!!$ if (nz_ < 0) then +!!$ info = psb_err_iarg_neg_ +!!$ ierr(1) = 3; ierr(2) = izero; +!!$ call psb_errpush(info,name,i_err=ierr) +!!$ goto 9999 +!!$ endif +!!$ +!!$ if (info == psb_success_) call psb_realloc(m+1,a%irp,info) +!!$ if (info == psb_success_) call psb_realloc(nz_,a%ja,info) +!!$ if (info == psb_success_) call psb_realloc(nz_,a%val,info) +!!$ if (info == psb_success_) then +!!$ a%irp=0 +!!$ call a%set_nrows(m) +!!$ call a%set_ncols(n) +!!$ call a%set_bld() +!!$ call a%set_triangle(.false.) +!!$ call a%set_unit(.false.) +!!$ call a%set_dupl(psb_dupl_def_) +!!$ end if +!!$ +!!$ call psb_erractionrestore(err_act) +!!$ return +!!$ +!!$9999 call psb_error_handler(err_act) +!!$ return +!!$ +!!$end subroutine psb_d_scsr_allocate_mnnz +!!$ +!!$ +!!$subroutine psb_d_scsr_csgetptn(imin,imax,a,nz,ia,ja,info,& +!!$ & jmin,jmax,iren,append,nzin,rscale,cscale) +!!$ ! Output is always in COO format +!!$ use psb_error_mod +!!$ use psb_const_mod +!!$ use psb_error_mod +!!$ use psb_d_base_mat_mod +!!$ use psb_d_scsr_mat_mod, psb_protect_name => psb_d_scsr_csgetptn +!!$ implicit none +!!$ +!!$ class(psb_d_scsr_sparse_mat), intent(in) :: a +!!$ integer(psb_ipk_), intent(in) :: imin,imax +!!$ integer(psb_ipk_), intent(out) :: nz +!!$ integer(psb_ipk_), allocatable, intent(inout) :: ia(:), ja(:) +!!$ integer(psb_ipk_),intent(out) :: info +!!$ logical, intent(in), optional :: append +!!$ integer(psb_ipk_), intent(in), optional :: iren(:) +!!$ integer(psb_ipk_), intent(in), optional :: jmin,jmax, nzin +!!$ logical, intent(in), optional :: rscale,cscale +!!$ +!!$ logical :: append_, rscale_, cscale_ +!!$ integer(psb_ipk_) :: nzin_, jmin_, jmax_, err_act, i +!!$ integer(psb_ipk_) :: ierr(5) +!!$ character(len=20) :: name='csget' +!!$ logical, parameter :: debug=.false. +!!$ +!!$ call psb_erractionsave(err_act) +!!$ info = psb_success_ +!!$ +!!$ if (present(jmin)) then +!!$ jmin_ = jmin +!!$ else +!!$ jmin_ = 1 +!!$ endif +!!$ if (present(jmax)) then +!!$ jmax_ = jmax +!!$ else +!!$ jmax_ = a%get_ncols() +!!$ endif +!!$ +!!$ if ((imax psb_d_scsr_csgetrow +!!$ implicit none +!!$ +!!$ class(psb_d_scsr_sparse_mat), intent(in) :: a +!!$ integer(psb_ipk_), intent(in) :: imin,imax +!!$ integer(psb_ipk_), intent(out) :: nz +!!$ integer(psb_ipk_), allocatable, intent(inout) :: ia(:), ja(:) +!!$ real(psb_dpk_), allocatable, intent(inout) :: val(:) +!!$ integer(psb_ipk_),intent(out) :: info +!!$ logical, intent(in), optional :: append +!!$ integer(psb_ipk_), intent(in), optional :: iren(:) +!!$ integer(psb_ipk_), intent(in), optional :: jmin,jmax, nzin +!!$ logical, intent(in), optional :: rscale,cscale +!!$ +!!$ logical :: append_, rscale_, cscale_ +!!$ integer(psb_ipk_) :: nzin_, jmin_, jmax_, err_act, i +!!$ integer(psb_ipk_) :: ierr(5) +!!$ character(len=20) :: name='csget' +!!$ logical, parameter :: debug=.false. +!!$ +!!$ call psb_erractionsave(err_act) +!!$ info = psb_success_ +!!$ +!!$ if (present(jmin)) then +!!$ jmin_ = jmin +!!$ else +!!$ jmin_ = 1 +!!$ endif +!!$ if (present(jmax)) then +!!$ jmax_ = jmax +!!$ else +!!$ jmax_ = a%get_ncols() +!!$ endif +!!$ +!!$ if ((imax psb_d_scsr_csgetblk +!!$ implicit none +!!$ +!!$ class(psb_d_scsr_sparse_mat), intent(in) :: a +!!$ class(psb_d_coo_sparse_mat), intent(inout) :: b +!!$ integer(psb_ipk_), intent(in) :: imin,imax +!!$ integer(psb_ipk_),intent(out) :: info +!!$ logical, intent(in), optional :: append +!!$ integer(psb_ipk_), intent(in), optional :: iren(:) +!!$ integer(psb_ipk_), intent(in), optional :: jmin,jmax +!!$ logical, intent(in), optional :: rscale,cscale +!!$ integer(psb_ipk_) :: err_act, nzin, nzout +!!$ integer(psb_ipk_) :: ierr(5) +!!$ character(len=20) :: name='csget' +!!$ logical :: append_ +!!$ logical, parameter :: debug=.false. +!!$ +!!$ call psb_erractionsave(err_act) +!!$ info = psb_success_ +!!$ +!!$ if (present(append)) then +!!$ append_ = append +!!$ else +!!$ append_ = .false. +!!$ endif +!!$ if (append_) then +!!$ nzin = a%get_nzeros() +!!$ else +!!$ nzin = 0 +!!$ endif +!!$ +!!$ call a%csget(imin,imax,nzout,b%ia,b%ja,b%val,info,& +!!$ & jmin=jmin, jmax=jmax, iren=iren, append=append_, & +!!$ & nzin=nzin, rscale=rscale, cscale=cscale) +!!$ +!!$ if (info /= psb_success_) goto 9999 +!!$ +!!$ call b%set_nzeros(nzin+nzout) +!!$ call b%fix(info) +!!$ if (info /= psb_success_) goto 9999 +!!$ +!!$ call psb_erractionrestore(err_act) +!!$ return +!!$ +!!$9999 call psb_error_handler(err_act) +!!$ return +!!$ +!!$end subroutine psb_d_scsr_csgetblk +!!$ +!!$ +!!$ +!!$subroutine psb_d_scsr_csput_a(nz,ia,ja,val,a,imin,imax,jmin,jmax,info,gtl) +!!$ use psb_error_mod +!!$ use psb_realloc_mod +!!$ use psb_d_scsr_mat_mod, psb_protect_name => psb_d_scsr_csput_a +!!$ implicit none +!!$ +!!$ class(psb_d_scsr_sparse_mat), intent(inout) :: a +!!$ real(psb_dpk_), intent(in) :: val(:) +!!$ integer(psb_ipk_), intent(in) :: nz, ia(:), ja(:), imin,imax,jmin,jmax +!!$ integer(psb_ipk_), intent(out) :: info +!!$ integer(psb_ipk_), intent(in), optional :: gtl(:) +!!$ +!!$ +!!$ integer(psb_ipk_) :: err_act +!!$ integer(psb_ipk_) :: ierr(5) +!!$ character(len=20) :: name='d_scsr_csput' +!!$ logical, parameter :: debug=.false. +!!$ integer(psb_ipk_) :: nza, i,j,k, nzl, isza +!!$ +!!$ +!!$ call psb_erractionsave(err_act) +!!$ info = psb_success_ +!!$ +!!$ if (nz <= 0) then +!!$ info = psb_err_iarg_neg_ +!!$ ierr(1)=1 +!!$ call psb_errpush(info,name,i_err=ierr) +!!$ goto 9999 +!!$ end if +!!$ if (size(ia) < nz) then +!!$ info = psb_err_input_asize_invalid_i_ +!!$ ierr(1)=2 +!!$ call psb_errpush(info,name,i_err=ierr) +!!$ goto 9999 +!!$ end if +!!$ +!!$ if (size(ja) < nz) then +!!$ info = psb_err_input_asize_invalid_i_ +!!$ ierr(1)=3 +!!$ call psb_errpush(info,name,i_err=ierr) +!!$ goto 9999 +!!$ end if +!!$ if (size(val) < nz) then +!!$ info = psb_err_input_asize_invalid_i_ +!!$ ierr(1)=4 +!!$ call psb_errpush(info,name,i_err=ierr) +!!$ goto 9999 +!!$ end if +!!$ +!!$ if (nz == 0) return +!!$ +!!$ nza = a%get_nzeros() +!!$ +!!$ if (a%is_bld()) then +!!$ ! Build phase should only ever be in COO +!!$ info = psb_err_invalid_mat_state_ +!!$ +!!$ else if (a%is_upd()) then +!!$ call psb_d_scsr_srch_upd(nz,ia,ja,val,a,& +!!$ & imin,imax,jmin,jmax,info,gtl) +!!$ +!!$ if (info /= psb_success_) then +!!$ +!!$ info = psb_err_invalid_mat_state_ +!!$ end if +!!$ +!!$ else +!!$ ! State is wrong. +!!$ info = psb_err_invalid_mat_state_ +!!$ end if +!!$ if (info /= psb_success_) then +!!$ call psb_errpush(info,name) +!!$ goto 9999 +!!$ end if +!!$ +!!$ call psb_erractionrestore(err_act) +!!$ return +!!$ +!!$9999 call psb_error_handler(err_act) +!!$ return +!!$ +!!$ +!!$contains +!!$ +!!$ subroutine psb_d_scsr_srch_upd(nz,ia,ja,val,a,& +!!$ & imin,imax,jmin,jmax,info,gtl) +!!$ +!!$ use psb_const_mod +!!$ use psb_realloc_mod +!!$ use psb_string_mod +!!$ use psb_sort_mod +!!$ implicit none +!!$ +!!$ class(psb_d_scsr_sparse_mat), intent(inout) :: a +!!$ integer(psb_ipk_), intent(in) :: nz, imin,imax,jmin,jmax +!!$ integer(psb_ipk_), intent(in) :: ia(:),ja(:) +!!$ real(psb_dpk_), intent(in) :: val(:) +!!$ integer(psb_ipk_), intent(out) :: info +!!$ integer(psb_ipk_), intent(in), optional :: gtl(:) +!!$ integer(psb_ipk_) :: i,ir,ic, ilr, ilc, ip, & +!!$ & i1,i2,nr,nc,nnz,dupl,ng +!!$ integer(psb_ipk_) :: debug_level, debug_unit +!!$ character(len=20) :: name='d_scsr_srch_upd' +!!$ +!!$ info = psb_success_ +!!$ debug_unit = psb_get_debug_unit() +!!$ debug_level = psb_get_debug_level() +!!$ +!!$ dupl = a%get_dupl() +!!$ +!!$ if (.not.a%is_sorted()) then +!!$ info = -4 +!!$ return +!!$ end if +!!$ +!!$ ilr = -1 +!!$ ilc = -1 +!!$ nnz = a%get_nzeros() +!!$ nr = a%get_nrows() +!!$ nc = a%get_ncols() +!!$ +!!$ if (present(gtl)) then +!!$ ng = size(gtl) +!!$ +!!$ select case(dupl) +!!$ case(psb_dupl_ovwrt_,psb_dupl_err_) +!!$ ! Overwrite. +!!$ ! Cannot test for error, should have been caught earlier. +!!$ +!!$ ilr = -1 +!!$ ilc = -1 +!!$ do i=1, nz +!!$ ir = ia(i) +!!$ ic = ja(i) +!!$ if ((ir >=1).and.(ir<=ng).and.(ic>=1).and.(ic<=ng)) then +!!$ ir = gtl(ir) +!!$ ic = gtl(ic) +!!$ if ((ir > 0).and.(ir <= nr)) then +!!$ i1 = a%irp(ir) +!!$ i2 = a%irp(ir+1) +!!$ nc=i2-i1 +!!$ +!!$ ip = psb_ibsrch(ic,nc,a%ja(i1:i2-1)) +!!$ if (ip>0) then +!!$ a%val(i1+ip-1) = val(i) +!!$ else +!!$ if (debug_level >= psb_debug_serial_) & +!!$ & write(debug_unit,*) trim(name),& +!!$ & ': Was searching ',ic,' in: ',i1,i2,& +!!$ & ' : ',a%ja(i1:i2-1) +!!$ info = i +!!$ return +!!$ end if +!!$ +!!$ else +!!$ +!!$ if (debug_level >= psb_debug_serial_) & +!!$ & write(debug_unit,*) trim(name),& +!!$ & ': Discarding row that does not belong to us.' +!!$ end if +!!$ end if +!!$ end do +!!$ +!!$ case(psb_dupl_add_) +!!$ ! Add +!!$ ilr = -1 +!!$ ilc = -1 +!!$ do i=1, nz +!!$ ir = ia(i) +!!$ ic = ja(i) +!!$ if ((ir >=1).and.(ir<=ng).and.(ic>=1).and.(ic<=ng)) then +!!$ ir = gtl(ir) +!!$ ic = gtl(ic) +!!$ if ((ir > 0).and.(ir <= nr)) then +!!$ i1 = a%irp(ir) +!!$ i2 = a%irp(ir+1) +!!$ nc = i2-i1 +!!$ ip = psb_ibsrch(ic,nc,a%ja(i1:i2-1)) +!!$ if (ip>0) then +!!$ a%val(i1+ip-1) = a%val(i1+ip-1) + val(i) +!!$ else +!!$ if (debug_level >= psb_debug_serial_) & +!!$ & write(debug_unit,*) trim(name),& +!!$ & ': Was searching ',ic,' in: ',i1,i2,& +!!$ & ' : ',a%ja(i1:i2-1) +!!$ info = i +!!$ return +!!$ end if +!!$ else +!!$ if (debug_level >= psb_debug_serial_) & +!!$ & write(debug_unit,*) trim(name),& +!!$ & ': Discarding row that does not belong to us.' +!!$ end if +!!$ +!!$ end if +!!$ end do +!!$ +!!$ case default +!!$ info = -3 +!!$ if (debug_level >= psb_debug_serial_) & +!!$ & write(debug_unit,*) trim(name),& +!!$ & ': Duplicate handling: ',dupl +!!$ end select +!!$ +!!$ else +!!$ +!!$ select case(dupl) +!!$ case(psb_dupl_ovwrt_,psb_dupl_err_) +!!$ ! Overwrite. +!!$ ! Cannot test for error, should have been caught earlier. +!!$ +!!$ ilr = -1 +!!$ ilc = -1 +!!$ do i=1, nz +!!$ ir = ia(i) +!!$ ic = ja(i) +!!$ +!!$ if ((ir > 0).and.(ir <= nr)) then +!!$ +!!$ i1 = a%irp(ir) +!!$ i2 = a%irp(ir+1) +!!$ nc=i2-i1 +!!$ +!!$ ip = psb_ibsrch(ic,nc,a%ja(i1:i2-1)) +!!$ if (ip>0) then +!!$ a%val(i1+ip-1) = val(i) +!!$ else +!!$ if (debug_level >= psb_debug_serial_) & +!!$ & write(debug_unit,*) trim(name),& +!!$ & ': Was searching ',ic,' in: ',i1,i2,& +!!$ & ' : ',a%ja(i1:i2-1) +!!$ info = i +!!$ return +!!$ end if +!!$ +!!$ else +!!$ if (debug_level >= psb_debug_serial_) & +!!$ & write(debug_unit,*) trim(name),& +!!$ & ': Discarding row that does not belong to us.' +!!$ end if +!!$ +!!$ end do +!!$ +!!$ case(psb_dupl_add_) +!!$ ! Add +!!$ ilr = -1 +!!$ ilc = -1 +!!$ do i=1, nz +!!$ ir = ia(i) +!!$ ic = ja(i) +!!$ if ((ir > 0).and.(ir <= nr)) then +!!$ i1 = a%irp(ir) +!!$ i2 = a%irp(ir+1) +!!$ nc = i2-i1 +!!$ ip = psb_ibsrch(ic,nc,a%ja(i1:i2-1)) +!!$ if (ip>0) then +!!$ a%val(i1+ip-1) = a%val(i1+ip-1) + val(i) +!!$ else +!!$ info = i +!!$ return +!!$ end if +!!$ else +!!$ if (debug_level >= psb_debug_serial_) & +!!$ & write(debug_unit,*) trim(name),& +!!$ & ': Discarding row that does not belong to us.' +!!$ end if +!!$ end do +!!$ +!!$ case default +!!$ info = -3 +!!$ if (debug_level >= psb_debug_serial_) & +!!$ & write(debug_unit,*) trim(name),& +!!$ & ': Duplicate handling: ',dupl +!!$ end select +!!$ +!!$ end if +!!$ +!!$ end subroutine psb_d_scsr_srch_upd +!!$ +!!$end subroutine psb_d_scsr_csput_a +!!$ +!!$ +!!$subroutine psb_d_scsr_reinit(a,clear) +!!$ use psb_error_mod +!!$ use psb_d_scsr_mat_mod, psb_protect_name => psb_d_scsr_reinit +!!$ implicit none +!!$ +!!$ class(psb_d_scsr_sparse_mat), intent(inout) :: a +!!$ logical, intent(in), optional :: clear +!!$ +!!$ integer(psb_ipk_) :: err_act, info +!!$ integer(psb_ipk_) :: ierr(5) +!!$ character(len=20) :: name='reinit' +!!$ logical :: clear_ +!!$ logical, parameter :: debug=.false. +!!$ +!!$ call psb_erractionsave(err_act) +!!$ info = psb_success_ +!!$ +!!$ +!!$ if (present(clear)) then +!!$ clear_ = clear +!!$ else +!!$ clear_ = .true. +!!$ end if +!!$ +!!$ if (a%is_bld() .or. a%is_upd()) then +!!$ ! do nothing +!!$ return +!!$ else if (a%is_asb()) then +!!$ if (clear_) a%val(:) = dzero +!!$ call a%set_upd() +!!$ else +!!$ info = psb_err_invalid_mat_state_ +!!$ call psb_errpush(info,name) +!!$ goto 9999 +!!$ end if +!!$ +!!$ call psb_erractionrestore(err_act) +!!$ return +!!$ +!!$9999 call psb_error_handler(err_act) +!!$ return +!!$ +!!$end subroutine psb_d_scsr_reinit + +subroutine psb_d_scsr_trim(a) + use psb_realloc_mod + use psb_error_mod + use psb_d_scsr_mat_mod, psb_protect_name => psb_d_scsr_trim + implicit none + class(psb_d_scsr_sparse_mat), intent(inout) :: a + integer(psb_ipk_) :: err_act, info, nz, m + integer(psb_ipk_) :: ierr(5) + character(len=20) :: name='trim' + logical, parameter :: debug=.false. + + call psb_erractionsave(err_act) + info = psb_success_ + call a%psb_d_csr_sparse_mat%trim() + call psb_realloc(a%nnerws,a%nerwids,info) + + if (info /= psb_success_) goto 9999 + call psb_erractionrestore(err_act) + return + +9999 call psb_error_handler(err_act) + return + +end subroutine psb_d_scsr_trim + +!!$subroutine psb_d_scsr_print(iout,a,iv,head,ivr,ivc) +!!$ use psb_string_mod +!!$ use psb_d_scsr_mat_mod, psb_protect_name => psb_d_scsr_print +!!$ implicit none +!!$ +!!$ integer(psb_ipk_), intent(in) :: iout +!!$ class(psb_d_scsr_sparse_mat), intent(in) :: a +!!$ integer(psb_ipk_), intent(in), optional :: iv(:) +!!$ character(len=*), optional :: head +!!$ integer(psb_ipk_), intent(in), optional :: ivr(:), ivc(:) +!!$ +!!$ integer(psb_ipk_) :: err_act +!!$ integer(psb_ipk_) :: ierr(5) +!!$ character(len=20) :: name='d_scsr_print' +!!$ logical, parameter :: debug=.false. +!!$ character(len=*), parameter :: datatype='real' +!!$ character(len=80) :: frmtv +!!$ integer(psb_ipk_) :: irs,ics,i,j, nmx, ni, nr, nc, nz +!!$ +!!$ if (present(head)) then +!!$ write(iout,'(a)') '%%MatrixMarket matrix coordinate real general' +!!$ write(iout,'(a,a)') '% ',head +!!$ write(iout,'(a)') '%' +!!$ write(iout,'(a,a)') '% COO' +!!$ endif +!!$ +!!$ nr = a%get_nrows() +!!$ nc = a%get_ncols() +!!$ nz = a%get_nzeros() +!!$ nmx = max(nr,nc,1) +!!$ ni = floor(log10(1.0*nmx)) + 1 +!!$ +!!$ if (datatype=='real') then +!!$ write(frmtv,'(a,i3.3,a,i3.3,a)') '(2(i',ni,',1x),es26.18,1x,2(i',ni,',1x))' +!!$ else +!!$ write(frmtv,'(a,i3.3,a,i3.3,a)') '(2(i',ni,',1x),2(es26.18,1x),2(i',ni,',1x))' +!!$ end if +!!$ write(iout,*) nr, nc, nz +!!$ if(present(iv)) then +!!$ do i=1, nr +!!$ do j=a%irp(i),a%irp(i+1)-1 +!!$ write(iout,frmtv) iv(i),iv(a%ja(j)),a%val(j) +!!$ end do +!!$ enddo +!!$ else +!!$ if (present(ivr).and..not.present(ivc)) then +!!$ do i=1, nr +!!$ do j=a%irp(i),a%irp(i+1)-1 +!!$ write(iout,frmtv) ivr(i),(a%ja(j)),a%val(j) +!!$ end do +!!$ enddo +!!$ else if (present(ivr).and.present(ivc)) then +!!$ do i=1, nr +!!$ do j=a%irp(i),a%irp(i+1)-1 +!!$ write(iout,frmtv) ivr(i),ivc(a%ja(j)),a%val(j) +!!$ end do +!!$ enddo +!!$ else if (.not.present(ivr).and.present(ivc)) then +!!$ do i=1, nr +!!$ do j=a%irp(i),a%irp(i+1)-1 +!!$ write(iout,frmtv) (i),ivc(a%ja(j)),a%val(j) +!!$ end do +!!$ enddo +!!$ else if (.not.present(ivr).and..not.present(ivc)) then +!!$ do i=1, nr +!!$ do j=a%irp(i),a%irp(i+1)-1 +!!$ write(iout,frmtv) (i),(a%ja(j)),a%val(j) +!!$ end do +!!$ enddo +!!$ endif +!!$ endif +!!$ +!!$end subroutine psb_d_scsr_print +!!$ +!!$ +!!$subroutine psb_d_cp_scsr_from_coo(a,b,info) +!!$ use psb_const_mod +!!$ use psb_realloc_mod +!!$ use psb_d_base_mat_mod +!!$ use psb_d_scsr_mat_mod, psb_protect_name => psb_d_cp_scsr_from_coo +!!$ implicit none +!!$ +!!$ class(psb_d_scsr_sparse_mat), intent(inout) :: a +!!$ class(psb_d_coo_sparse_mat), intent(in) :: b +!!$ integer(psb_ipk_), intent(out) :: info +!!$ +!!$ type(psb_d_coo_sparse_mat) :: tmp +!!$ integer(psb_ipk_), allocatable :: itemp(:) +!!$ !locals +!!$ logical :: rwshr_ +!!$ integer(psb_ipk_) :: nza, nr, i,j,irw, err_act, nc +!!$ integer(psb_ipk_), Parameter :: maxtry=8 +!!$ integer(psb_ipk_) :: debug_level, debug_unit +!!$ character(len=20) :: name +!!$ +!!$ info = psb_success_ +!!$ ! This is to have fix_coo called behind the scenes +!!$ call tmp%cp_from_coo(b,info) +!!$ if (info == psb_success_) call a%mv_from_coo(tmp,info) +!!$ +!!$end subroutine psb_d_cp_scsr_from_coo +!!$ +!!$ +!!$ +!!$subroutine psb_d_cp_scsr_to_coo(a,b,info) +!!$ use psb_const_mod +!!$ use psb_d_base_mat_mod +!!$ use psb_d_scsr_mat_mod, psb_protect_name => psb_d_cp_scsr_to_coo +!!$ implicit none +!!$ +!!$ class(psb_d_scsr_sparse_mat), intent(in) :: a +!!$ class(psb_d_coo_sparse_mat), intent(inout) :: b +!!$ integer(psb_ipk_), intent(out) :: info +!!$ +!!$ integer(psb_ipk_), allocatable :: itemp(:) +!!$ !locals +!!$ logical :: rwshr_ +!!$ integer(psb_ipk_) :: nza, nr, nc,i,j,irw, err_act +!!$ integer(psb_ipk_), Parameter :: maxtry=8 +!!$ integer(psb_ipk_) :: debug_level, debug_unit +!!$ character(len=20) :: name +!!$ +!!$ info = psb_success_ +!!$ +!!$ nr = a%get_nrows() +!!$ nc = a%get_ncols() +!!$ nza = a%get_nzeros() +!!$ +!!$ call b%allocate(nr,nc,nza) +!!$ b%psb_d_base_sparse_mat = a%psb_d_base_sparse_mat +!!$ +!!$ do i=1, nr +!!$ do j=a%irp(i),a%irp(i+1)-1 +!!$ b%ia(j) = i +!!$ b%ja(j) = a%ja(j) +!!$ b%val(j) = a%val(j) +!!$ end do +!!$ end do +!!$ call b%set_nzeros(a%get_nzeros()) +!!$ call b%fix(info) +!!$ +!!$ +!!$end subroutine psb_d_cp_scsr_to_coo +!!$ +!!$ +!!$subroutine psb_d_mv_scsr_to_coo(a,b,info) +!!$ use psb_const_mod +!!$ use psb_realloc_mod +!!$ use psb_d_base_mat_mod +!!$ use psb_d_scsr_mat_mod, psb_protect_name => psb_d_mv_scsr_to_coo +!!$ implicit none +!!$ +!!$ class(psb_d_scsr_sparse_mat), intent(inout) :: a +!!$ class(psb_d_coo_sparse_mat), intent(inout) :: b +!!$ integer(psb_ipk_), intent(out) :: info +!!$ +!!$ integer(psb_ipk_), allocatable :: itemp(:) +!!$ !locals +!!$ logical :: rwshr_ +!!$ integer(psb_ipk_) :: nza, nr, nc,i,j,irw, err_act +!!$ integer(psb_ipk_), Parameter :: maxtry=8 +!!$ integer(psb_ipk_) :: debug_level, debug_unit +!!$ character(len=20) :: name +!!$ +!!$ info = psb_success_ +!!$ +!!$ nr = a%get_nrows() +!!$ nc = a%get_ncols() +!!$ nza = a%get_nzeros() +!!$ +!!$ b%psb_d_base_sparse_mat = a%psb_d_base_sparse_mat +!!$ call b%set_nzeros(a%get_nzeros()) +!!$ call move_alloc(a%ja,b%ja) +!!$ call move_alloc(a%val,b%val) +!!$ call psb_realloc(nza,b%ia,info) +!!$ if (info /= psb_success_) return +!!$ do i=1, nr +!!$ do j=a%irp(i),a%irp(i+1)-1 +!!$ b%ia(j) = i +!!$ end do +!!$ end do +!!$ call a%free() +!!$ call b%fix(info) +!!$ +!!$ +!!$end subroutine psb_d_mv_scsr_to_coo +!!$ + + +subroutine psb_d_mv_scsr_from_coo(a,b,info) + use psb_const_mod + use psb_realloc_mod + use psb_error_mod + use psb_d_base_mat_mod + use psb_d_scsr_mat_mod, psb_protect_name => psb_d_mv_scsr_from_coo + implicit none + + class(psb_d_scsr_sparse_mat), intent(inout) :: a + class(psb_d_coo_sparse_mat), intent(inout) :: b + integer(psb_ipk_), intent(out) :: info + + integer(psb_ipk_), allocatable :: itemp(:) + !locals + logical :: rwshr_ + integer(psb_ipk_) :: nza, nr, i + integer(psb_ipk_), Parameter :: maxtry=8 + integer(psb_ipk_) :: debug_level, debug_unit + character(len=20) :: name='mv_from_coo' + + info = psb_success_ + debug_unit = psb_get_debug_unit() + debug_level = psb_get_debug_level() + + call a%psb_d_csr_sparse_mat%mv_from_coo(b,info) + if (info /= psb_success_) return + nr = a%get_nrows() + call psb_realloc(nr,a%nerwids,info) + if (info /= psb_success_) return + associate(nnerws => a%nnerws, irp => a%irp, nerwids => a%nerwids) + nnerws = 0 + do i=1, nr + if ((irp(i+1)-irp(i)) > 0) then + nnerws = nnerws + 1 + nerwids(nnerws) = i + end if + end do + end associate + +end subroutine psb_d_mv_scsr_from_coo + + +!!$subroutine psb_d_mv_scsr_to_fmt(a,b,info) +!!$ use psb_const_mod +!!$ use psb_d_base_mat_mod +!!$ use psb_d_scsr_mat_mod, psb_protect_name => psb_d_mv_scsr_to_fmt +!!$ implicit none +!!$ +!!$ class(psb_d_scsr_sparse_mat), intent(inout) :: a +!!$ class(psb_d_base_sparse_mat), intent(inout) :: b +!!$ integer(psb_ipk_), intent(out) :: info +!!$ +!!$ !locals +!!$ type(psb_d_coo_sparse_mat) :: tmp +!!$ logical :: rwshr_ +!!$ integer(psb_ipk_) :: nza, nr, i,j,irw, err_act, nc +!!$ integer(psb_ipk_), Parameter :: maxtry=8 +!!$ integer(psb_ipk_) :: debug_level, debug_unit +!!$ character(len=20) :: name +!!$ +!!$ info = psb_success_ +!!$ +!!$ select type (b) +!!$ type is (psb_d_coo_sparse_mat) +!!$ call a%mv_to_coo(b,info) +!!$ ! Need to fix trivial copies! +!!$ type is (psb_d_scsr_sparse_mat) +!!$ b%psb_d_base_sparse_mat = a%psb_d_base_sparse_mat +!!$ call move_alloc(a%irp, b%irp) +!!$ call move_alloc(a%ja, b%ja) +!!$ call move_alloc(a%val, b%val) +!!$ call a%free() +!!$ +!!$ class default +!!$ call a%mv_to_coo(tmp,info) +!!$ if (info == psb_success_) call b%mv_from_coo(tmp,info) +!!$ end select +!!$ +!!$end subroutine psb_d_mv_scsr_to_fmt + + +!!$subroutine psb_d_cp_scsr_to_fmt(a,b,info) +!!$ use psb_const_mod +!!$ use psb_d_base_mat_mod +!!$ use psb_realloc_mod +!!$ use psb_d_scsr_mat_mod, psb_protect_name => psb_d_cp_scsr_to_fmt +!!$ implicit none +!!$ +!!$ class(psb_d_scsr_sparse_mat), intent(in) :: a +!!$ class(psb_d_base_sparse_mat), intent(inout) :: b +!!$ integer(psb_ipk_), intent(out) :: info +!!$ +!!$ !locals +!!$ type(psb_d_coo_sparse_mat) :: tmp +!!$ logical :: rwshr_ +!!$ integer(psb_ipk_) :: nza, nr, i,j,irw, err_act, nc +!!$ integer(psb_ipk_), Parameter :: maxtry=8 +!!$ integer(psb_ipk_) :: debug_level, debug_unit +!!$ character(len=20) :: name +!!$ +!!$ info = psb_success_ +!!$ +!!$ +!!$ select type (b) +!!$ type is (psb_d_coo_sparse_mat) +!!$ call a%cp_to_coo(b,info) +!!$ +!!$ type is (psb_d_scsr_sparse_mat) +!!$ b%psb_d_base_sparse_mat = a%psb_d_base_sparse_mat +!!$ if (info == 0) call psb_safe_cpy( a%irp, b%irp , info) +!!$ if (info == 0) call psb_safe_cpy( a%ja , b%ja , info) +!!$ if (info == 0) call psb_safe_cpy( a%val, b%val , info) +!!$ +!!$ class default +!!$ call a%cp_to_coo(tmp,info) +!!$ if (info == psb_success_) call b%mv_from_coo(tmp,info) +!!$ end select +!!$ +!!$end subroutine psb_d_cp_scsr_to_fmt + + +subroutine psb_d_mv_scsr_from_fmt(a,b,info) + use psb_const_mod + use psb_d_base_mat_mod + use psb_d_scsr_mat_mod, psb_protect_name => psb_d_mv_scsr_from_fmt + implicit none + + class(psb_d_scsr_sparse_mat), intent(inout) :: a + class(psb_d_base_sparse_mat), intent(inout) :: b + integer(psb_ipk_), intent(out) :: info + + !locals + type(psb_d_coo_sparse_mat) :: tmp + logical :: rwshr_ + integer(psb_ipk_) :: nza, nr, i,j,irw, err_act, nc + integer(psb_ipk_), Parameter :: maxtry=8 + integer(psb_ipk_) :: debug_level, debug_unit + character(len=20) :: name + + info = psb_success_ + + select type (b) + type is (psb_d_coo_sparse_mat) + call a%mv_from_coo(b,info) + + type is (psb_d_scsr_sparse_mat) + a%psb_d_base_sparse_mat = b%psb_d_base_sparse_mat + a%nnerws = b%nnerws + call move_alloc(b%irp, a%irp) + call move_alloc(b%ja, a%ja) + call move_alloc(b%val, a%val) + call move_alloc(b%nerwids, a%nerwids) + call b%free() + + class is (psb_d_csr_sparse_mat) + a%psb_d_base_sparse_mat = b%psb_d_base_sparse_mat + call move_alloc(b%irp, a%irp) + call move_alloc(b%ja, a%ja) + call move_alloc(b%val, a%val) + nr = a%get_nrows() + call psb_realloc(nr,a%nerwids,info) + associate(nnerws => a%nnerws, irp => a%irp, nerwids => a%nerwids) + nnerws = 0 + do i=1, nr + if ((irp(i+1)-irp(i)) > 0) then + nnerws = nnerws + 1 + nerwids(nnerws) = i + end if + end do + end associate + + class default + call b%mv_to_coo(tmp,info) + if (info == psb_success_) call a%mv_from_coo(tmp,info) + end select + +end subroutine psb_d_mv_scsr_from_fmt + + + +subroutine psb_d_cp_scsr_from_fmt(a,b,info) + use psb_const_mod + use psb_d_base_mat_mod + use psb_realloc_mod + use psb_d_scsr_mat_mod, psb_protect_name => psb_d_cp_scsr_from_fmt + implicit none + + class(psb_d_scsr_sparse_mat), intent(inout) :: a + class(psb_d_base_sparse_mat), intent(in) :: b + integer(psb_ipk_), intent(out) :: info + + !locals + type(psb_d_coo_sparse_mat) :: tmp + logical :: rwshr_ + integer(psb_ipk_) :: nz, nr, i,j,irw, err_act, nc + integer(psb_ipk_), Parameter :: maxtry=8 + integer(psb_ipk_) :: debug_level, debug_unit + character(len=20) :: name + + info = psb_success_ + + select type (b) + type is (psb_d_coo_sparse_mat) + call a%cp_from_coo(b,info) + + type is (psb_d_scsr_sparse_mat) + a%psb_d_base_sparse_mat = b%psb_d_base_sparse_mat + a%nnerws = b%nnerws + if (info == 0) call psb_safe_cpy( b%irp, a%irp , info) + if (info == 0) call psb_safe_cpy( b%ja , a%ja , info) + if (info == 0) call psb_safe_cpy( b%val, a%val , info) + if (info == 0) call psb_safe_cpy( b%nerwids, a%nerwids , info) + + class is (psb_d_csr_sparse_mat) + a%psb_d_base_sparse_mat = b%psb_d_base_sparse_mat + if (info == 0) call psb_safe_cpy( b%irp, a%irp , info) + if (info == 0) call psb_safe_cpy( b%ja , a%ja , info) + if (info == 0) call psb_safe_cpy( b%val, a%val , info) + nr = a%get_nrows() + call psb_realloc(nr,a%nerwids,info) + associate(nnerws => a%nnerws, irp => a%irp, nerwids => a%nerwids) + nnerws = 0 + do i=1, nr + if ((irp(i+1)-irp(i)) > 0) then + nnerws = nnerws + 1 + nerwids(nnerws) = i + end if + end do + end associate + + class default + call b%cp_to_coo(tmp,info) + if (info == psb_success_) call a%mv_from_coo(tmp,info) + end select +end subroutine psb_d_cp_scsr_from_fmt diff --git a/test/scsr/psb_d_scsr_mat_mod.f90 b/test/scsr/psb_d_scsr_mat_mod.f90 new file mode 100644 index 00000000..a6d7f4c3 --- /dev/null +++ b/test/scsr/psb_d_scsr_mat_mod.f90 @@ -0,0 +1,611 @@ +! +! Parallel Sparse BLAS version 3.5 +! (C) Copyright 2006-2018 +! Salvatore Filippone +! Alfredo Buttari +! +! 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. +! +! +! +! package: psb_d_scsr_mat_mod +! +! This module contains the definition of the psb_d_scsr_sparse_mat type +! which is just an example of how to build a new storage format. +! Indeed this is simply CSR under a new name. +! +! Please refere to psb_d_base_mat_mod for a detailed description +! of the various methods, and to psb_d_scsr_impl for implementation details. +! +module psb_d_scsr_mat_mod + + use psb_d_csr_mat_mod + + !> \namespace psb_base_mod \class psb_d_scsr_sparse_mat + !! \extends psb_d_base_mat_mod::psb_d_base_sparse_mat + !! + !! psb_d_scsr_sparse_mat type and the related methods. + !! This is a very common storage type, and is the default for assembled + !! matrices in our library + type, extends(psb_d_csr_sparse_mat) :: psb_d_scsr_sparse_mat + + !> Number of non-empty rows + integer(psb_ipk_) :: nnerws=0 + !> Pointers to non-empty roows + integer(psb_ipk_), allocatable :: nerwids(:) + + contains +!!$ procedure, pass(a) :: get_size => d_scsr_get_size +!!$ procedure, pass(a) :: get_nzeros => d_scsr_get_nzeros + procedure, nopass :: get_fmt => d_scsr_get_fmt + procedure, pass(a) :: sizeof => d_scsr_sizeof + procedure, pass(a) :: csmm => psb_d_scsr_csmm + procedure, pass(a) :: csmv => psb_d_scsr_csmv +!!$ procedure, pass(a) :: inner_cssm => psb_d_scsr_cssm +!!$ procedure, pass(a) :: inner_cssv => psb_d_scsr_cssv +!!$ procedure, pass(a) :: scals => psb_d_scsr_scals +!!$ procedure, pass(a) :: scalv => psb_d_scsr_scal +!!$ procedure, pass(a) :: maxval => psb_d_scsr_maxval +!!$ procedure, pass(a) :: spnmi => psb_d_scsr_csnmi +!!$ procedure, pass(a) :: spnm1 => psb_d_scsr_csnm1 +!!$ procedure, pass(a) :: rowsum => psb_d_scsr_rowsum +!!$ procedure, pass(a) :: arwsum => psb_d_scsr_arwsum +!!$ procedure, pass(a) :: colsum => psb_d_scsr_colsum +!!$ procedure, pass(a) :: aclsum => psb_d_scsr_aclsum +!!$ procedure, pass(a) :: reallocate_nz => psb_d_scsr_reallocate_nz +!!$ procedure, pass(a) :: allocate_mnnz => psb_d_scsr_allocate_mnnz +!!$ procedure, pass(a) :: cp_to_coo => psb_d_cp_scsr_to_coo +!!$ procedure, pass(a) :: cp_from_coo => psb_d_cp_scsr_from_coo +!!$ procedure, pass(a) :: cp_to_fmt => psb_d_cp_scsr_to_fmt + procedure, pass(a) :: cp_from_fmt => psb_d_cp_scsr_from_fmt +!!$ procedure, pass(a) :: mv_to_coo => psb_d_mv_scsr_to_coo + procedure, pass(a) :: mv_from_coo => psb_d_mv_scsr_from_coo +!!$ procedure, pass(a) :: mv_to_fmt => psb_d_mv_scsr_to_fmt + procedure, pass(a) :: mv_from_fmt => psb_d_mv_scsr_from_fmt +!!$ procedure, pass(a) :: csput_a => psb_d_scsr_csput_a +!!$ procedure, pass(a) :: get_diag => psb_d_scsr_get_diag +!!$ procedure, pass(a) :: csgetptn => psb_d_scsr_csgetptn +!!$ procedure, pass(a) :: csgetrow => psb_d_scsr_csgetrow +!!$ procedure, pass(a) :: get_nz_row => d_scsr_get_nz_row +!!$ procedure, pass(a) :: reinit => psb_d_scsr_reinit + procedure, pass(a) :: trim => psb_d_scsr_trim +!!$ procedure, pass(a) :: print => psb_d_scsr_print + procedure, pass(a) :: free => d_scsr_free + procedure, pass(a) :: mold => psb_d_scsr_mold + + end type psb_d_scsr_sparse_mat + +!!$ private :: d_scsr_get_nzeros, d_scsr_free, d_scsr_get_fmt, & +!!$ & d_scsr_get_size, d_scsr_sizeof, d_scsr_get_nz_row + private :: d_scsr_free, d_scsr_get_fmt, & + & d_scsr_sizeof + + +!!$ !> \memberof psb_d_scsr_sparse_mat +!!$ !| \see psb_base_mat_mod::psb_base_reallocate_nz +!!$ interface +!!$ subroutine psb_d_scsr_reallocate_nz(nz,a) +!!$ import :: psb_ipk_, psb_d_scsr_sparse_mat +!!$ integer(psb_ipk_), intent(in) :: nz +!!$ class(psb_d_scsr_sparse_mat), intent(inout) :: a +!!$ end subroutine psb_d_scsr_reallocate_nz +!!$ end interface +!!$ +!!$ !> \memberof psb_d_scsr_sparse_mat +!!$ !| \see psb_base_mat_mod::psb_base_reinit +!!$ interface +!!$ subroutine psb_d_scsr_reinit(a,clear) +!!$ import :: psb_ipk_, psb_d_scsr_sparse_mat +!!$ class(psb_d_scsr_sparse_mat), intent(inout) :: a +!!$ logical, intent(in), optional :: clear +!!$ end subroutine psb_d_scsr_reinit +!!$ end interface + + !> \memberof psb_d_scsr_sparse_mat + !| \see psb_base_mat_mod::psb_base_trim + interface + subroutine psb_d_scsr_trim(a) + import :: psb_ipk_, psb_d_scsr_sparse_mat + class(psb_d_scsr_sparse_mat), intent(inout) :: a + end subroutine psb_d_scsr_trim + end interface + + + !> \memberof psb_d_scsr_sparse_mat + !| \see psb_base_mat_mod::psb_base_mold + interface + subroutine psb_d_scsr_mold(a,b,info) + import :: psb_ipk_, psb_d_scsr_sparse_mat, psb_d_base_sparse_mat, psb_long_int_k_ + class(psb_d_scsr_sparse_mat), intent(in) :: a + class(psb_d_base_sparse_mat), intent(inout), allocatable :: b + integer(psb_ipk_), intent(out) :: info + end subroutine psb_d_scsr_mold + end interface + +!!$ !> \memberof psb_d_scsr_sparse_mat +!!$ !| \see psb_base_mat_mod::psb_base_allocate_mnnz +!!$ interface +!!$ subroutine psb_d_scsr_allocate_mnnz(m,n,a,nz) +!!$ import :: psb_ipk_, psb_d_scsr_sparse_mat +!!$ integer(psb_ipk_), intent(in) :: m,n +!!$ class(psb_d_scsr_sparse_mat), intent(inout) :: a +!!$ integer(psb_ipk_), intent(in), optional :: nz +!!$ end subroutine psb_d_scsr_allocate_mnnz +!!$ end interface +!!$ +!!$ +!!$ !> \memberof psb_d_scsr_sparse_mat +!!$ !! \see psb_d_base_mat_mod::psb_d_base_print +!!$ interface +!!$ subroutine psb_d_scsr_print(iout,a,iv,head,ivr,ivc) +!!$ import :: psb_ipk_, psb_d_scsr_sparse_mat +!!$ integer(psb_ipk_), intent(in) :: iout +!!$ class(psb_d_scsr_sparse_mat), intent(in) :: a +!!$ integer(psb_ipk_), intent(in), optional :: iv(:) +!!$ character(len=*), optional :: head +!!$ integer(psb_ipk_), intent(in), optional :: ivr(:), ivc(:) +!!$ end subroutine psb_d_scsr_print +!!$ end interface +!!$ +!!$ !> \memberof psb_d_scsr_sparse_mat +!!$ !! \see psb_d_base_mat_mod::psb_d_base_cp_to_coo +!!$ interface +!!$ subroutine psb_d_cp_scsr_to_coo(a,b,info) +!!$ import :: psb_ipk_, psb_d_coo_sparse_mat, psb_d_scsr_sparse_mat +!!$ class(psb_d_scsr_sparse_mat), intent(in) :: a +!!$ class(psb_d_coo_sparse_mat), intent(inout) :: b +!!$ integer(psb_ipk_), intent(out) :: info +!!$ end subroutine psb_d_cp_scsr_to_coo +!!$ end interface + + !> \memberof psb_d_scsr_sparse_mat + !! \see psb_d_base_mat_mod::psb_d_base_cp_from_coo + interface + subroutine psb_d_cp_scsr_from_coo(a,b,info) + import :: psb_ipk_, psb_d_scsr_sparse_mat, psb_d_coo_sparse_mat + class(psb_d_scsr_sparse_mat), intent(inout) :: a + class(psb_d_coo_sparse_mat), intent(in) :: b + integer(psb_ipk_), intent(out) :: info + end subroutine psb_d_cp_scsr_from_coo + end interface + +!!$ !> \memberof psb_d_scsr_sparse_mat +!!$ !! \see psb_d_base_mat_mod::psb_d_base_cp_to_fmt +!!$ interface +!!$ subroutine psb_d_cp_scsr_to_fmt(a,b,info) +!!$ import :: psb_ipk_, psb_d_scsr_sparse_mat, psb_d_base_sparse_mat +!!$ class(psb_d_scsr_sparse_mat), intent(in) :: a +!!$ class(psb_d_base_sparse_mat), intent(inout) :: b +!!$ integer(psb_ipk_), intent(out) :: info +!!$ end subroutine psb_d_cp_scsr_to_fmt +!!$ end interface + + !> \memberof psb_d_scsr_sparse_mat + !! \see psb_d_base_mat_mod::psb_d_base_cp_from_fmt + interface + subroutine psb_d_cp_scsr_from_fmt(a,b,info) + import :: psb_ipk_, psb_d_scsr_sparse_mat, psb_d_base_sparse_mat + class(psb_d_scsr_sparse_mat), intent(inout) :: a + class(psb_d_base_sparse_mat), intent(in) :: b + integer(psb_ipk_), intent(out) :: info + end subroutine psb_d_cp_scsr_from_fmt + end interface + +!!$ !> \memberof psb_d_scsr_sparse_mat +!!$ !! \see psb_d_base_mat_mod::psb_d_base_mv_to_coo +!!$ interface +!!$ subroutine psb_d_mv_scsr_to_coo(a,b,info) +!!$ import :: psb_ipk_, psb_d_scsr_sparse_mat, psb_d_coo_sparse_mat +!!$ class(psb_d_scsr_sparse_mat), intent(inout) :: a +!!$ class(psb_d_coo_sparse_mat), intent(inout) :: b +!!$ integer(psb_ipk_), intent(out) :: info +!!$ end subroutine psb_d_mv_scsr_to_coo +!!$ end interface +!!$ + !> \memberof psb_d_scsr_sparse_mat + !! \see psb_d_base_mat_mod::psb_d_base_mv_from_coo + interface + subroutine psb_d_mv_scsr_from_coo(a,b,info) + import :: psb_ipk_, psb_d_scsr_sparse_mat, psb_d_coo_sparse_mat + class(psb_d_scsr_sparse_mat), intent(inout) :: a + class(psb_d_coo_sparse_mat), intent(inout) :: b + integer(psb_ipk_), intent(out) :: info + end subroutine psb_d_mv_scsr_from_coo + end interface + +!!$ !> \memberof psb_d_scsr_sparse_mat +!!$ !! \see psb_d_base_mat_mod::psb_d_base_mv_to_fmt +!!$ interface +!!$ subroutine psb_d_mv_scsr_to_fmt(a,b,info) +!!$ import :: psb_ipk_, psb_d_scsr_sparse_mat, psb_d_base_sparse_mat +!!$ class(psb_d_scsr_sparse_mat), intent(inout) :: a +!!$ class(psb_d_base_sparse_mat), intent(inout) :: b +!!$ integer(psb_ipk_), intent(out) :: info +!!$ end subroutine psb_d_mv_scsr_to_fmt +!!$ end interface + + !> \memberof psb_d_scsr_sparse_mat + !! \see psb_d_base_mat_mod::psb_d_base_mv_from_fmt + interface + subroutine psb_d_mv_scsr_from_fmt(a,b,info) + import :: psb_ipk_, psb_d_scsr_sparse_mat, psb_d_base_sparse_mat + class(psb_d_scsr_sparse_mat), intent(inout) :: a + class(psb_d_base_sparse_mat), intent(inout) :: b + integer(psb_ipk_), intent(out) :: info + end subroutine psb_d_mv_scsr_from_fmt + end interface + + !> \memberof psb_d_scsr_sparse_mat + !! \see psb_d_base_mat_mod::psb_d_base_cp_from + interface + subroutine psb_d_scsr_cp_from(a,b) + import :: psb_ipk_, psb_d_scsr_sparse_mat, psb_dpk_ + class(psb_d_scsr_sparse_mat), intent(inout) :: a + type(psb_d_scsr_sparse_mat), intent(in) :: b + end subroutine psb_d_scsr_cp_from + end interface + + !> \memberof psb_d_scsr_sparse_mat + !! \see psb_d_base_mat_mod::psb_d_base_mv_from + interface + subroutine psb_d_scsr_mv_from(a,b) + import :: psb_ipk_, psb_d_scsr_sparse_mat, psb_dpk_ + class(psb_d_scsr_sparse_mat), intent(inout) :: a + type(psb_d_scsr_sparse_mat), intent(inout) :: b + end subroutine psb_d_scsr_mv_from + end interface + + +!!$ !> \memberof psb_d_scsr_sparse_mat +!!$ !! \see psb_d_base_mat_mod::psb_d_base_csput +!!$ interface +!!$ subroutine psb_d_scsr_csput_a(nz,ia,ja,val,a,imin,imax,jmin,jmax,info,gtl) +!!$ import :: psb_ipk_, psb_d_scsr_sparse_mat, psb_dpk_ +!!$ class(psb_d_scsr_sparse_mat), intent(inout) :: a +!!$ real(psb_dpk_), intent(in) :: val(:) +!!$ integer(psb_ipk_), intent(in) :: nz,ia(:), ja(:),& +!!$ & imin,imax,jmin,jmax +!!$ integer(psb_ipk_), intent(out) :: info +!!$ integer(psb_ipk_), intent(in), optional :: gtl(:) +!!$ end subroutine psb_d_scsr_csput_a +!!$ end interface +!!$ +!!$ !> \memberof psb_d_scsr_sparse_mat +!!$ !! \see psb_base_mat_mod::psb_base_csgetptn +!!$ interface +!!$ subroutine psb_d_scsr_csgetptn(imin,imax,a,nz,ia,ja,info,& +!!$ & jmin,jmax,iren,append,nzin,rscale,cscale) +!!$ import :: psb_ipk_, psb_d_scsr_sparse_mat, psb_dpk_ +!!$ class(psb_d_scsr_sparse_mat), intent(in) :: a +!!$ integer(psb_ipk_), intent(in) :: imin,imax +!!$ integer(psb_ipk_), intent(out) :: nz +!!$ integer(psb_ipk_), allocatable, intent(inout) :: ia(:), ja(:) +!!$ integer(psb_ipk_),intent(out) :: info +!!$ logical, intent(in), optional :: append +!!$ integer(psb_ipk_), intent(in), optional :: iren(:) +!!$ integer(psb_ipk_), intent(in), optional :: jmin,jmax, nzin +!!$ logical, intent(in), optional :: rscale,cscale +!!$ end subroutine psb_d_scsr_csgetptn +!!$ end interface +!!$ +!!$ !> \memberof psb_d_scsr_sparse_mat +!!$ !! \see psb_d_base_mat_mod::psb_d_base_csgetrow +!!$ interface +!!$ subroutine psb_d_scsr_csgetrow(imin,imax,a,nz,ia,ja,val,info,& +!!$ & jmin,jmax,iren,append,nzin,rscale,cscale) +!!$ import :: psb_ipk_, psb_d_scsr_sparse_mat, psb_dpk_ +!!$ class(psb_d_scsr_sparse_mat), intent(in) :: a +!!$ integer(psb_ipk_), intent(in) :: imin,imax +!!$ integer(psb_ipk_), intent(out) :: nz +!!$ integer(psb_ipk_), allocatable, intent(inout) :: ia(:), ja(:) +!!$ real(psb_dpk_), allocatable, intent(inout) :: val(:) +!!$ integer(psb_ipk_),intent(out) :: info +!!$ logical, intent(in), optional :: append +!!$ integer(psb_ipk_), intent(in), optional :: iren(:) +!!$ integer(psb_ipk_), intent(in), optional :: jmin,jmax, nzin +!!$ logical, intent(in), optional :: rscale,cscale +!!$ end subroutine psb_d_scsr_csgetrow +!!$ end interface +!!$ +!!$ !> \memberof psb_d_scsr_sparse_mat +!!$ !! \see psb_d_base_mat_mod::psb_d_base_csgetblk +!!$ interface +!!$ subroutine psb_d_scsr_csgetblk(imin,imax,a,b,info,& +!!$ & jmin,jmax,iren,append,rscale,cscale) +!!$ import :: psb_ipk_, psb_d_scsr_sparse_mat, psb_dpk_, psb_d_coo_sparse_mat +!!$ class(psb_d_scsr_sparse_mat), intent(in) :: a +!!$ class(psb_d_coo_sparse_mat), intent(inout) :: b +!!$ integer(psb_ipk_), intent(in) :: imin,imax +!!$ integer(psb_ipk_),intent(out) :: info +!!$ logical, intent(in), optional :: append +!!$ integer(psb_ipk_), intent(in), optional :: iren(:) +!!$ integer(psb_ipk_), intent(in), optional :: jmin,jmax +!!$ logical, intent(in), optional :: rscale,cscale +!!$ end subroutine psb_d_scsr_csgetblk +!!$ end interface +!!$ +!!$ !> \memberof psb_d_scsr_sparse_mat +!!$ !! \see psb_d_base_mat_mod::psb_d_base_cssv +!!$ interface +!!$ subroutine psb_d_scsr_cssv(alpha,a,x,beta,y,info,trans) +!!$ import :: psb_ipk_, psb_d_scsr_sparse_mat, psb_dpk_ +!!$ class(psb_d_scsr_sparse_mat), intent(in) :: a +!!$ real(psb_dpk_), intent(in) :: alpha, beta, x(:) +!!$ real(psb_dpk_), intent(inout) :: y(:) +!!$ integer(psb_ipk_), intent(out) :: info +!!$ character, optional, intent(in) :: trans +!!$ end subroutine psb_d_scsr_cssv +!!$ end interface +!!$ !> \memberof psb_d_scsr_sparse_mat +!!$ !! \see psb_d_base_mat_mod::psb_d_base_cssm +!!$ interface +!!$ subroutine psb_d_scsr_cssm(alpha,a,x,beta,y,info,trans) +!!$ import :: psb_ipk_, psb_d_scsr_sparse_mat, psb_dpk_ +!!$ class(psb_d_scsr_sparse_mat), intent(in) :: a +!!$ real(psb_dpk_), intent(in) :: alpha, beta, x(:,:) +!!$ real(psb_dpk_), intent(inout) :: y(:,:) +!!$ integer(psb_ipk_), intent(out) :: info +!!$ character, optional, intent(in) :: trans +!!$ end subroutine psb_d_scsr_cssm +!!$ end interface + + !> \memberof psb_d_scsr_sparse_mat + !! \see psb_d_base_mat_mod::psb_d_base_csmv + interface + subroutine psb_d_scsr_csmv(alpha,a,x,beta,y,info,trans) + import :: psb_ipk_, psb_d_scsr_sparse_mat, psb_dpk_ + class(psb_d_scsr_sparse_mat), intent(in) :: a + real(psb_dpk_), intent(in) :: alpha, beta, x(:) + real(psb_dpk_), intent(inout) :: y(:) + integer(psb_ipk_), intent(out) :: info + character, optional, intent(in) :: trans + end subroutine psb_d_scsr_csmv + end interface + + !> \memberof psb_d_scsr_sparse_mat + !! \see psb_d_base_mat_mod::psb_d_base_csmm + interface + subroutine psb_d_scsr_csmm(alpha,a,x,beta,y,info,trans) + import :: psb_ipk_, psb_d_scsr_sparse_mat, psb_dpk_ + class(psb_d_scsr_sparse_mat), intent(in) :: a + real(psb_dpk_), intent(in) :: alpha, beta, x(:,:) + real(psb_dpk_), intent(inout) :: y(:,:) + integer(psb_ipk_), intent(out) :: info + character, optional, intent(in) :: trans + end subroutine psb_d_scsr_csmm + end interface + + +!!$ !> \memberof psb_d_scsr_sparse_mat +!!$ !! \see psb_d_base_mat_mod::psb_d_base_maxval +!!$ interface +!!$ function psb_d_scsr_maxval(a) result(res) +!!$ import :: psb_ipk_, psb_d_scsr_sparse_mat, psb_dpk_ +!!$ class(psb_d_scsr_sparse_mat), intent(in) :: a +!!$ real(psb_dpk_) :: res +!!$ end function psb_d_scsr_maxval +!!$ end interface +!!$ +!!$ !> \memberof psb_d_scsr_sparse_mat +!!$ !! \see psb_d_base_mat_mod::psb_d_base_csnmi +!!$ interface +!!$ function psb_d_scsr_csnmi(a) result(res) +!!$ import :: psb_ipk_, psb_d_scsr_sparse_mat, psb_dpk_ +!!$ class(psb_d_scsr_sparse_mat), intent(in) :: a +!!$ real(psb_dpk_) :: res +!!$ end function psb_d_scsr_csnmi +!!$ end interface +!!$ +!!$ !> \memberof psb_d_scsr_sparse_mat +!!$ !! \see psb_d_base_mat_mod::psb_d_base_csnm1 +!!$ interface +!!$ function psb_d_scsr_csnm1(a) result(res) +!!$ import :: psb_ipk_, psb_d_scsr_sparse_mat, psb_dpk_ +!!$ class(psb_d_scsr_sparse_mat), intent(in) :: a +!!$ real(psb_dpk_) :: res +!!$ end function psb_d_scsr_csnm1 +!!$ end interface +!!$ +!!$ !> \memberof psb_d_scsr_sparse_mat +!!$ !! \see psb_d_base_mat_mod::psb_d_base_rowsum +!!$ interface +!!$ subroutine psb_d_scsr_rowsum(d,a) +!!$ import :: psb_ipk_, psb_d_scsr_sparse_mat, psb_dpk_ +!!$ class(psb_d_scsr_sparse_mat), intent(in) :: a +!!$ real(psb_dpk_), intent(out) :: d(:) +!!$ end subroutine psb_d_scsr_rowsum +!!$ end interface +!!$ +!!$ !> \memberof psb_d_scsr_sparse_mat +!!$ !! \see psb_d_base_mat_mod::psb_d_base_arwsum +!!$ interface +!!$ subroutine psb_d_scsr_arwsum(d,a) +!!$ import :: psb_ipk_, psb_d_scsr_sparse_mat, psb_dpk_ +!!$ class(psb_d_scsr_sparse_mat), intent(in) :: a +!!$ real(psb_dpk_), intent(out) :: d(:) +!!$ end subroutine psb_d_scsr_arwsum +!!$ end interface +!!$ +!!$ !> \memberof psb_d_scsr_sparse_mat +!!$ !! \see psb_d_base_mat_mod::psb_d_base_colsum +!!$ interface +!!$ subroutine psb_d_scsr_colsum(d,a) +!!$ import :: psb_ipk_, psb_d_scsr_sparse_mat, psb_dpk_ +!!$ class(psb_d_scsr_sparse_mat), intent(in) :: a +!!$ real(psb_dpk_), intent(out) :: d(:) +!!$ end subroutine psb_d_scsr_colsum +!!$ end interface +!!$ +!!$ !> \memberof psb_d_scsr_sparse_mat +!!$ !! \see psb_d_base_mat_mod::psb_d_base_aclsum +!!$ interface +!!$ subroutine psb_d_scsr_aclsum(d,a) +!!$ import :: psb_ipk_, psb_d_scsr_sparse_mat, psb_dpk_ +!!$ class(psb_d_scsr_sparse_mat), intent(in) :: a +!!$ real(psb_dpk_), intent(out) :: d(:) +!!$ end subroutine psb_d_scsr_aclsum +!!$ end interface +!!$ +!!$ !> \memberof psb_d_scsr_sparse_mat +!!$ !! \see psb_d_base_mat_mod::psb_d_base_get_diag +!!$ interface +!!$ subroutine psb_d_scsr_get_diag(a,d,info) +!!$ import :: psb_ipk_, psb_d_scsr_sparse_mat, psb_dpk_ +!!$ class(psb_d_scsr_sparse_mat), intent(in) :: a +!!$ real(psb_dpk_), intent(out) :: d(:) +!!$ integer(psb_ipk_), intent(out) :: info +!!$ end subroutine psb_d_scsr_get_diag +!!$ end interface +!!$ +!!$ !> \memberof psb_d_scsr_sparse_mat +!!$ !! \see psb_d_base_mat_mod::psb_d_base_scal +!!$ interface +!!$ subroutine psb_d_scsr_scal(d,a,info,side) +!!$ import :: psb_ipk_, psb_d_scsr_sparse_mat, psb_dpk_ +!!$ class(psb_d_scsr_sparse_mat), intent(inout) :: a +!!$ real(psb_dpk_), intent(in) :: d(:) +!!$ integer(psb_ipk_), intent(out) :: info +!!$ character, intent(in), optional :: side +!!$ end subroutine psb_d_scsr_scal +!!$ end interface +!!$ +!!$ !> \memberof psb_d_scsr_sparse_mat +!!$ !! \see psb_d_base_mat_mod::psb_d_base_scals +!!$ interface +!!$ subroutine psb_d_scsr_scals(d,a,info) +!!$ import :: psb_ipk_, psb_d_scsr_sparse_mat, psb_dpk_ +!!$ class(psb_d_scsr_sparse_mat), intent(inout) :: a +!!$ real(psb_dpk_), intent(in) :: d +!!$ integer(psb_ipk_), intent(out) :: info +!!$ end subroutine psb_d_scsr_scals +!!$ end interface + + + +contains + + ! == =================================== + ! + ! + ! + ! Getters + ! + ! + ! + ! + ! + ! == =================================== + + + function d_scsr_sizeof(a) result(res) + implicit none + class(psb_d_scsr_sparse_mat), intent(in) :: a + integer(psb_long_int_k_) :: res + res = a%psb_d_csr_sparse_mat%sizeof() + res = res + psb_sizeof_int * size(a%nerwids) + res = res + psb_sizeof_int + + end function d_scsr_sizeof + + function d_scsr_get_fmt() result(res) + implicit none + character(len=5) :: res + res = 'SCSR' + end function d_scsr_get_fmt + +!!$ function d_scsr_get_nzeros(a) result(res) +!!$ implicit none +!!$ class(psb_d_scsr_sparse_mat), intent(in) :: a +!!$ integer(psb_ipk_) :: res +!!$ res = a%irp(a%get_nrows()+1)-1 +!!$ end function d_scsr_get_nzeros +!!$ +!!$ function d_scsr_get_size(a) result(res) +!!$ implicit none +!!$ class(psb_d_scsr_sparse_mat), intent(in) :: a +!!$ integer(psb_ipk_) :: res +!!$ +!!$ res = -1 +!!$ +!!$ if (allocated(a%ja)) then +!!$ res = size(a%ja) +!!$ end if +!!$ if (allocated(a%val)) then +!!$ if (res >= 0) then +!!$ res = min(res,size(a%val)) +!!$ else +!!$ res = size(a%val) +!!$ end if +!!$ end if +!!$ +!!$ end function d_scsr_get_size +!!$ +!!$ +!!$ +!!$ function d_scsr_get_nz_row(idx,a) result(res) +!!$ +!!$ implicit none +!!$ +!!$ class(psb_d_scsr_sparse_mat), intent(in) :: a +!!$ integer(psb_ipk_), intent(in) :: idx +!!$ integer(psb_ipk_) :: res +!!$ +!!$ res = 0 +!!$ +!!$ if ((1<=idx).and.(idx<=a%get_nrows())) then +!!$ res = a%irp(idx+1)-a%irp(idx) +!!$ end if +!!$ +!!$ end function d_scsr_get_nz_row + + + + ! == =================================== + ! + ! + ! + ! Data management + ! + ! + ! + ! + ! + ! == =================================== + + subroutine d_scsr_free(a) + implicit none + + class(psb_d_scsr_sparse_mat), intent(inout) :: a + + if (allocated(a%nerwids)) deallocate(a%nerwids) + a%nnerws = 0 + call a%psb_d_csr_sparse_mat%free() + + return + + end subroutine d_scsr_free + + +end module psb_d_scsr_mat_mod diff --git a/test/scsr/psb_s_pde2d.f90 b/test/scsr/psb_s_pde2d.f90 new file mode 100644 index 00000000..f4a80d0c --- /dev/null +++ b/test/scsr/psb_s_pde2d.f90 @@ -0,0 +1,807 @@ +! +! Parallel Sparse BLAS version 3.5 +! (C) Copyright 2006-2018 +! Salvatore Filippone +! Alfredo Buttari +! +! 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_s_pde2d.f90 +! +! Program: psb_s_pde2d +! This sample program solves a linear system obtained by discretizing a +! PDE with Dirichlet BCs. +! +! +! The PDE is a general second order equation in 2d +! +! a1 dd(u) a2 dd(u) b1 d(u) b2 d(u) +! - ------ - ------ ----- + ------ + c u = f +! dxdx dydy dx dy +! +! with Dirichlet boundary conditions +! u = g +! +! on the unit square 0<=x,y<=1. +! +! +! Note that if b1=b2=c=0., the PDE is the Laplace equation. +! +! There are three choices available for data distribution: +! 1. A simple BLOCK distribution +! 2. A ditribution based on arbitrary assignment of indices to processes, +! typically from a graph partitioner +! 3. A 2D distribution in which the unit square is partitioned +! into rectangles, each one assigned to a process. +! +module psb_s_pde2d_mod + + use psb_base_mod, only : psb_spk_, psb_ipk_, psb_desc_type,& + & psb_sspmat_type, psb_s_vect_type, szero,& + & psb_s_base_sparse_mat, psb_s_base_vect_type, psb_i_base_vect_type + + interface + function s_func_2d(x,y) result(val) + import :: psb_spk_ + real(psb_spk_), intent(in) :: x,y + real(psb_spk_) :: val + end function s_func_2d + end interface + + interface psb_gen_pde2d + module procedure psb_s_gen_pde2d + end interface psb_gen_pde2d + +contains + + function s_null_func_2d(x,y) result(val) + + real(psb_spk_), intent(in) :: x,y + real(psb_spk_) :: val + + val = szero + + end function s_null_func_2d + + ! + ! functions parametrizing the differential equation + ! + + ! + ! Note: b1 and b2 are the coefficients of the first + ! derivative of the unknown function. The default + ! we apply here is to have them zero, so that the resulting + ! matrix is symmetric/hermitian and suitable for + ! testing with CG and FCG. + ! When testing methods for non-hermitian matrices you can + ! change the B1/B2 functions to e.g. sone/sqrt((2*sone)) + ! + function b1(x,y) + use psb_base_mod, only : psb_spk_, sone, szero + implicit none + real(psb_spk_) :: b1 + real(psb_spk_), intent(in) :: x,y + b1=szero + end function b1 + function b2(x,y) + use psb_base_mod, only : psb_spk_, sone, szero + implicit none + real(psb_spk_) :: b2 + real(psb_spk_), intent(in) :: x,y + b2=szero + end function b2 + function c(x,y) + use psb_base_mod, only : psb_spk_, sone, szero + implicit none + real(psb_spk_) :: c + real(psb_spk_), intent(in) :: x,y + c=0.d0 + end function c + function a1(x,y) + use psb_base_mod, only : psb_spk_, sone, szero + implicit none + real(psb_spk_) :: a1 + real(psb_spk_), intent(in) :: x,y + a1=sone/80 + end function a1 + function a2(x,y) + use psb_base_mod, only : psb_spk_, sone, szero + implicit none + real(psb_spk_) :: a2 + real(psb_spk_), intent(in) :: x,y + a2=sone/80 + end function a2 + function g(x,y) + use psb_base_mod, only : psb_spk_, sone, szero + implicit none + real(psb_spk_) :: g + real(psb_spk_), intent(in) :: x,y + g = szero + if (x == sone) then + g = sone + else if (x == szero) then + g = exp(-y**2) + end if + end function g + + + ! + ! subroutine to allocate and fill in the coefficient matrix and + ! the rhs. + ! + subroutine psb_s_gen_pde2d(ictxt,idim,a,bv,xv,desc_a,afmt,info,& + & f,amold,vmold,imold,partition,nrl,iv) + use psb_base_mod + use psb_util_mod + ! + ! Discretizes the partial differential equation + ! + ! a1 dd(u) a2 dd(u) b1 d(u) b2 d(u) + ! - ------ - ------ + ----- + ------ + c u = f + ! dxdx dydy dx dy + ! + ! with Dirichlet boundary conditions + ! u = g + ! + ! on the unit square 0<=x,y<=1. + ! + ! + ! Note that if b1=b2=c=0., the PDE is the Laplace equation. + ! + implicit none + integer(psb_ipk_) :: idim + type(psb_sspmat_type) :: a + type(psb_s_vect_type) :: xv,bv + type(psb_desc_type) :: desc_a + integer(psb_ipk_) :: ictxt, info + character(len=*) :: afmt + procedure(s_func_2d), optional :: f + class(psb_s_base_sparse_mat), optional :: amold + class(psb_s_base_vect_type), optional :: vmold + class(psb_i_base_vect_type), optional :: imold + integer(psb_ipk_), optional :: partition, nrl,iv(:) + + ! Local variables. + + integer(psb_ipk_), parameter :: nb=20 + type(psb_s_csc_sparse_mat) :: acsc + type(psb_s_coo_sparse_mat) :: acoo + type(psb_s_csr_sparse_mat) :: acsr + real(psb_spk_) :: zt(nb),x,y,z + integer(psb_ipk_) :: m,n,nnz,nr,nt,glob_row,nlr,i,j,ii,ib,k, partition_ + integer(psb_ipk_) :: ix,iy,iz,ia,indx_owner + ! For 2D partition + integer(psb_ipk_) :: npx,npy,npdims(2),iamx,iamy,mynx,myny + integer(psb_ipk_), allocatable :: bndx(:),bndy(:) + ! Process grid + integer(psb_ipk_) :: np, iam + integer(psb_ipk_) :: icoeff + integer(psb_ipk_), allocatable :: irow(:),icol(:),myidx(:) + real(psb_spk_), allocatable :: val(:) + ! deltah dimension of each grid cell + ! deltat discretization time + real(psb_spk_) :: deltah, sqdeltah, deltah2 + real(psb_spk_), parameter :: rhs=szero,one=sone,zero=szero + real(psb_dpk_) :: t0, t1, t2, t3, tasb, talc, ttot, tgen, tcdasb + integer(psb_ipk_) :: err_act + procedure(s_func_2d), pointer :: f_ + character(len=20) :: name, ch_err,tmpfmt + + info = psb_success_ + name = 'create_matrix' + call psb_erractionsave(err_act) + + call psb_info(ictxt, iam, np) + + + if (present(f)) then + f_ => f + else + f_ => s_null_func_2d + end if + + deltah = sone/(idim+2) + sqdeltah = deltah*deltah + deltah2 = (2*sone)* deltah + + if (present(partition)) then + if ((1<= partition).and.(partition <= 3)) then + partition_ = partition + else + write(*,*) 'Invalid partition choice ',partition,' defaulting to 3' + partition_ = 3 + end if + else + partition_ = 3 + end if + + ! initialize array descriptor and sparse matrix storage. provide an + ! estimate of the number of non zeroes + + m = idim*idim + n = m + nnz = ((n*7)/(np)) + if(iam == psb_root_) write(psb_out_unit,'("Generating Matrix (size=",i0,")...")')n + t0 = psb_wtime() + select case(partition_) + case(1) + ! A BLOCK partition + if (present(nrl)) then + nr = nrl + else + ! + ! Using a simple BLOCK distribution. + ! + nt = (m+np-1)/np + nr = max(0,min(nt,m-(iam*nt))) + end if + + nt = nr + call psb_sum(ictxt,nt) + if (nt /= m) then + write(psb_err_unit,*) iam, 'Initialization error ',nr,nt,m + info = -1 + call psb_barrier(ictxt) + call psb_abort(ictxt) + return + end if + + ! + ! First example of use of CDALL: specify for each process a number of + ! contiguous rows + ! + call psb_cdall(ictxt,desc_a,info,nl=nr) + myidx = desc_a%get_global_indices() + nlr = size(myidx) + + case(2) + ! A partition defined by the user through IV + + if (present(iv)) then + if (size(iv) /= m) then + write(psb_err_unit,*) iam, 'Initialization error: wrong IV size',size(iv),m + info = -1 + call psb_barrier(ictxt) + call psb_abort(ictxt) + return + end if + else + write(psb_err_unit,*) iam, 'Initialization error: IV not present' + info = -1 + call psb_barrier(ictxt) + call psb_abort(ictxt) + return + end if + + ! + ! Second example of use of CDALL: specify for each row the + ! process that owns it + ! + call psb_cdall(ictxt,desc_a,info,vg=iv) + myidx = desc_a%get_global_indices() + nlr = size(myidx) + + case(3) + ! A 2-dimensional partition + + ! A nifty MPI function will split the process list + npdims = 0 + call mpi_dims_create(np,2,npdims,info) + npx = npdims(1) + npy = npdims(2) + + allocate(bndx(0:npx),bndy(0:npy)) + ! We can reuse idx2ijk for process indices as well. + call idx2ijk(iamx,iamy,iam,npx,npy,base=0) + ! Now let's split the 2D square in rectangles + call dist1Didx(bndx,idim,npx) + mynx = bndx(iamx+1)-bndx(iamx) + call dist1Didx(bndy,idim,npy) + myny = bndy(iamy+1)-bndy(iamy) + + ! How many indices do I own? + nlr = mynx*myny + allocate(myidx(nlr)) + ! Now, let's generate the list of indices I own + nr = 0 + do i=bndx(iamx),bndx(iamx+1)-1 + do j=bndy(iamy),bndy(iamy+1)-1 + nr = nr + 1 + call ijk2idx(myidx(nr),i,j,idim,idim) + end do + end do + if (nr /= nlr) then + write(psb_err_unit,*) iam,iamx,iamy, 'Initialization error: NR vs NLR ',& + & nr,nlr,mynx,myny + info = -1 + call psb_barrier(ictxt) + call psb_abort(ictxt) + end if + + ! + ! Third example of use of CDALL: specify for each process + ! the set of global indices it owns. + ! + call psb_cdall(ictxt,desc_a,info,vl=myidx) + + case default + write(psb_err_unit,*) iam, 'Initialization error: should not get here' + info = -1 + call psb_barrier(ictxt) + call psb_abort(ictxt) + return + end select + + + if (info == psb_success_) call psb_spall(a,desc_a,info,nnz=nnz) + ! define rhs from boundary conditions; also build initial guess + if (info == psb_success_) call psb_geall(xv,desc_a,info) + if (info == psb_success_) call psb_geall(bv,desc_a,info) + + call psb_barrier(ictxt) + talc = psb_wtime()-t0 + + if (info /= psb_success_) then + info=psb_err_from_subroutine_ + ch_err='allocation rout.' + call psb_errpush(info,name,a_err=ch_err) + goto 9999 + end if + + ! we build an auxiliary matrix consisting of one row at a + ! time; just a small matrix. might be extended to generate + ! a bunch of rows per call. + ! + allocate(val(20*nb),irow(20*nb),& + &icol(20*nb),stat=info) + if (info /= psb_success_ ) then + info=psb_err_alloc_dealloc_ + call psb_errpush(info,name) + goto 9999 + endif + + + ! loop over rows belonging to current process in a block + ! distribution. + + call psb_barrier(ictxt) + t1 = psb_wtime() + do ii=1, nlr,nb + ib = min(nb,nlr-ii+1) + icoeff = 1 + do k=1,ib + i=ii+k-1 + ! local matrix pointer + glob_row=myidx(i) + ! compute gridpoint coordinates + call idx2ijk(ix,iy,glob_row,idim,idim) + ! x, y coordinates + x = (ix-1)*deltah + y = (iy-1)*deltah + + zt(k) = f_(x,y) + ! internal point: build discretization + ! + ! term depending on (x-1,y) + ! + val(icoeff) = -a1(x,y)/sqdeltah-b1(x,y)/deltah2 + if (ix == 1) then + zt(k) = g(szero,y)*(-val(icoeff)) + zt(k) + else + call ijk2idx(icol(icoeff),ix-1,iy,idim,idim) + irow(icoeff) = glob_row + icoeff = icoeff+1 + endif + ! term depending on (x,y-1) + val(icoeff) = -a2(x,y)/sqdeltah-b2(x,y)/deltah2 + if (iy == 1) then + zt(k) = g(x,szero)*(-val(icoeff)) + zt(k) + else + call ijk2idx(icol(icoeff),ix,iy-1,idim,idim) + irow(icoeff) = glob_row + icoeff = icoeff+1 + endif + + ! term depending on (x,y) + val(icoeff)=(2*sone)*(a1(x,y) + a2(x,y))/sqdeltah + c(x,y) + call ijk2idx(icol(icoeff),ix,iy,idim,idim) + irow(icoeff) = glob_row + icoeff = icoeff+1 + ! term depending on (x,y+1) + val(icoeff)=-a2(x,y)/sqdeltah+b2(x,y)/deltah2 + if (iy == idim) then + zt(k) = g(x,sone)*(-val(icoeff)) + zt(k) + else + call ijk2idx(icol(icoeff),ix,iy+1,idim,idim) + irow(icoeff) = glob_row + icoeff = icoeff+1 + endif + ! term depending on (x+1,y) + val(icoeff)=-a1(x,y)/sqdeltah+b1(x,y)/deltah2 + if (ix==idim) then + zt(k) = g(sone,y)*(-val(icoeff)) + zt(k) + else + call ijk2idx(icol(icoeff),ix+1,iy,idim,idim) + irow(icoeff) = glob_row + icoeff = icoeff+1 + endif + + end do + call psb_spins(icoeff-1,irow,icol,val,a,desc_a,info) + if(info /= psb_success_) exit + call psb_geins(ib,myidx(ii:ii+ib-1),zt(1:ib),bv,desc_a,info) + if(info /= psb_success_) exit + zt(:)=szero + call psb_geins(ib,myidx(ii:ii+ib-1),zt(1:ib),xv,desc_a,info) + if(info /= psb_success_) exit + end do + + tgen = psb_wtime()-t1 + if(info /= psb_success_) then + info=psb_err_from_subroutine_ + ch_err='insert rout.' + call psb_errpush(info,name,a_err=ch_err) + goto 9999 + end if + + deallocate(val,irow,icol) + + call psb_barrier(ictxt) + t1 = psb_wtime() + call psb_cdasb(desc_a,info,mold=imold) + tcdasb = psb_wtime()-t1 + call psb_barrier(ictxt) + t1 = psb_wtime() + if (info == psb_success_) then + if (present(amold)) then + call psb_spasb(a,desc_a,info,dupl=psb_dupl_err_,mold=amold) + else + call psb_spasb(a,desc_a,info,dupl=psb_dupl_err_,afmt=afmt) + end if + end if + call psb_barrier(ictxt) + if(info /= psb_success_) then + info=psb_err_from_subroutine_ + ch_err='asb rout.' + call psb_errpush(info,name,a_err=ch_err) + goto 9999 + end if + if (info == psb_success_) call psb_geasb(xv,desc_a,info,mold=vmold) + if (info == psb_success_) call psb_geasb(bv,desc_a,info,mold=vmold) + if(info /= psb_success_) then + info=psb_err_from_subroutine_ + ch_err='asb rout.' + call psb_errpush(info,name,a_err=ch_err) + goto 9999 + end if + tasb = psb_wtime()-t1 + call psb_barrier(ictxt) + ttot = psb_wtime() - t0 + + call psb_amx(ictxt,talc) + call psb_amx(ictxt,tgen) + call psb_amx(ictxt,tasb) + call psb_amx(ictxt,ttot) + if(iam == psb_root_) then + tmpfmt = a%get_fmt() + write(psb_out_unit,'("The matrix has been generated and assembled in ",a3," format.")')& + & tmpfmt + write(psb_out_unit,'("-allocation time : ",es12.5)') talc + write(psb_out_unit,'("-coeff. gen. time : ",es12.5)') tgen + write(psb_out_unit,'("-desc asbly time : ",es12.5)') tcdasb + write(psb_out_unit,'("- mat asbly time : ",es12.5)') tasb + write(psb_out_unit,'("-total time : ",es12.5)') ttot + + end if + call psb_erractionrestore(err_act) + return + +9999 call psb_error_handler(ictxt,err_act) + + return + end subroutine psb_s_gen_pde2d + +end module psb_s_pde2d_mod + +program psb_s_pde2d + use psb_base_mod + use psb_prec_mod + use psb_krylov_mod + use psb_util_mod + use psb_s_pde2d_mod + implicit none + + ! input parameters + character(len=20) :: kmethd, ptype + character(len=5) :: afmt + integer(psb_ipk_) :: idim + + ! miscellaneous + real(psb_spk_), parameter :: one = sone + real(psb_dpk_) :: t1, t2, tprec + + ! sparse matrix and preconditioner + type(psb_sspmat_type) :: a + type(psb_sprec_type) :: prec + ! descriptor + type(psb_desc_type) :: desc_a + ! dense vectors + type(psb_s_vect_type) :: xxv,bv + ! parallel environment + integer(psb_ipk_) :: ictxt, iam, np + + ! solver parameters + integer(psb_ipk_) :: iter, itmax,itrace, istopc, irst + integer(psb_long_int_k_) :: amatsize, precsize, descsize, d2size + real(psb_spk_) :: err, eps + + ! other variables + integer(psb_ipk_) :: info, i + character(len=20) :: name,ch_err + character(len=40) :: fname + + info=psb_success_ + + + 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 + if(psb_get_errstatus() /= 0) goto 9999 + name='pde2d90' + 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,kmethd,ptype,afmt,idim,istopc,itmax,itrace,irst) + + ! + ! allocate and fill in the coefficient matrix, rhs and initial guess + ! + call psb_barrier(ictxt) + t1 = psb_wtime() + call psb_gen_pde2d(ictxt,idim,a,bv,xxv,desc_a,afmt,info) + call psb_barrier(ictxt) + t2 = psb_wtime() - t1 + if(info /= psb_success_) then + info=psb_err_from_subroutine_ + ch_err='psb_gen_pde2d' + call psb_errpush(info,name,a_err=ch_err) + goto 9999 + end if + if (iam == psb_root_) write(psb_out_unit,'("Overall matrix creation time : ",es12.5)')t2 + if (iam == psb_root_) write(psb_out_unit,'(" ")') + ! + ! prepare the preconditioner. + ! + if(iam == psb_root_) write(psb_out_unit,'("Setting preconditioner to : ",a)')ptype + call prec%init(ptype,info) + + call psb_barrier(ictxt) + t1 = psb_wtime() + call prec%build(a,desc_a,info) + if(info /= psb_success_) then + info=psb_err_from_subroutine_ + ch_err='psb_precbld' + call psb_errpush(info,name,a_err=ch_err) + goto 9999 + end if + + tprec = psb_wtime()-t1 + + call psb_amx(ictxt,tprec) + + if (iam == psb_root_) write(psb_out_unit,'("Preconditioner time : ",es12.5)')tprec + if (iam == psb_root_) write(psb_out_unit,'(" ")') + call prec%descr() + ! + ! iterative method parameters + ! + if(iam == psb_root_) write(psb_out_unit,'("Calling iterative method ",a)')kmethd + call psb_barrier(ictxt) + t1 = psb_wtime() + eps = 1.d-6 + call psb_krylov(kmethd,a,prec,bv,xxv,eps,desc_a,info,& + & itmax=itmax,iter=iter,err=err,itrace=itrace,istop=istopc,irst=irst) + + if(info /= psb_success_) then + info=psb_err_from_subroutine_ + ch_err='solver routine' + call psb_errpush(info,name,a_err=ch_err) + goto 9999 + end if + + call psb_barrier(ictxt) + t2 = psb_wtime() - t1 + call psb_amx(ictxt,t2) + 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 + write(psb_out_unit,'(" ")') + write(psb_out_unit,'("Number of processes : ",i0)')np + 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,'("Number of iterations : ",i0)')iter + write(psb_out_unit,'("Convergence indicator on exit : ",es12.5)')err + write(psb_out_unit,'("Info on exit : ",i0)')info + 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 format for A: ",a)') a%get_fmt() + write(psb_out_unit,'("Storage format for DESC_A: ",a)') desc_a%get_fmt() + end if + + + ! + ! cleanup storage and exit + ! + call psb_gefree(bv,desc_a,info) + call psb_gefree(xxv,desc_a,info) + call psb_spfree(a,desc_a,info) + call prec%free(info) + call psb_cdfree(desc_a,info) + if(info /= psb_success_) then + info=psb_err_from_subroutine_ + ch_err='free routine' + call psb_errpush(info,name,a_err=ch_err) + goto 9999 + end if + + call psb_exit(ictxt) + stop + +9999 call psb_error(ictxt) + + stop + +contains + ! + ! get iteration parameters from standard input + ! + subroutine get_parms(ictxt,kmethd,ptype,afmt,idim,istopc,itmax,itrace,irst) + integer(psb_ipk_) :: ictxt + character(len=*) :: kmethd, ptype, afmt + integer(psb_ipk_) :: idim, istopc,itmax,itrace,irst + integer(psb_ipk_) :: np, iam + integer(psb_ipk_) :: ip, inp_unit + character(len=1024) :: filename + + call psb_info(ictxt, iam, np) + + if (iam == 0) then + if (command_argument_count()>0) then + call get_command_argument(1,filename) + inp_unit = 30 + open(inp_unit,file=filename,action='read',iostat=info) + if (info /= 0) then + write(psb_err_unit,*) 'Could not open file ',filename,' for input' + call psb_abort(ictxt) + stop + else + write(psb_err_unit,*) 'Opened file ',trim(filename),' for input' + end if + else + inp_unit=psb_inp_unit + end if + read(inp_unit,*) ip + if (ip >= 3) then + read(inp_unit,*) kmethd + read(inp_unit,*) ptype + read(inp_unit,*) afmt + + read(inp_unit,*) idim + if (ip >= 4) then + read(inp_unit,*) istopc + else + istopc=1 + endif + if (ip >= 5) then + read(inp_unit,*) itmax + else + itmax=500 + endif + if (ip >= 6) then + read(inp_unit,*) itrace + else + itrace=-1 + endif + if (ip >= 7) then + read(inp_unit,*) irst + else + irst=1 + endif + + write(psb_out_unit,'("Solving matrix : ell1")') + write(psb_out_unit,'("Grid dimensions : ",i5," x ",i5)')idim,idim + write(psb_out_unit,'("Number of processors : ",i0)')np + write(psb_out_unit,'("Data distribution : BLOCK")') + write(psb_out_unit,'("Preconditioner : ",a)') ptype + write(psb_out_unit,'("Iterative method : ",a)') kmethd + write(psb_out_unit,'(" ")') + else + ! wrong number of parameter, print an error message and exit + call pr_usage(izero) + call psb_abort(ictxt) + stop 1 + endif + if (inp_unit /= psb_inp_unit) then + close(inp_unit) + end if + + end if + ! broadcast parameters to all processors + call psb_bcast(ictxt,kmethd) + call psb_bcast(ictxt,afmt) + call psb_bcast(ictxt,ptype) + call psb_bcast(ictxt,idim) + call psb_bcast(ictxt,istopc) + call psb_bcast(ictxt,itmax) + call psb_bcast(ictxt,itrace) + call psb_bcast(ictxt,irst) + + return + + end subroutine get_parms + ! + ! print an error message + ! + subroutine pr_usage(iout) + integer(psb_ipk_) :: iout + write(iout,*)'incorrect parameter(s) found' + write(iout,*)' usage: pde2d90 methd prec dim & + &[istop itmax itrace]' + write(iout,*)' where:' + write(iout,*)' methd: cgstab cgs rgmres bicgstabl' + write(iout,*)' prec : bjac diag none' + write(iout,*)' dim number of points along each axis' + write(iout,*)' the size of the resulting linear ' + write(iout,*)' system is dim**3' + write(iout,*)' istop stopping criterion 1, 2 ' + write(iout,*)' itmax maximum number of iterations [500] ' + write(iout,*)' itrace <=0 (no tracing, default) or ' + write(iout,*)' >= 1 do tracing every itrace' + write(iout,*)' iterations ' + end subroutine pr_usage + +end program psb_s_pde2d + + diff --git a/test/scsr/psb_s_pde3d.f90 b/test/scsr/psb_s_pde3d.f90 new file mode 100644 index 00000000..0ca70230 --- /dev/null +++ b/test/scsr/psb_s_pde3d.f90 @@ -0,0 +1,852 @@ +! +! Parallel Sparse BLAS version 3.5 +! (C) Copyright 2006-2018 +! Salvatore Filippone +! Alfredo Buttari +! +! 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_s_pde3d.f90 +! +! Program: psb_s_pde3d +! This sample program solves a linear system obtained by discretizing a +! PDE with Dirichlet BCs. +! +! +! The PDE is a general second order equation in 3d +! +! a1 dd(u) a2 dd(u) a3 dd(u) b1 d(u) b2 d(u) b3 d(u) +! - ------ - ------ - ------ + ----- + ------ + ------ + c u = f +! dxdx dydy dzdz dx dy dz +! +! with Dirichlet boundary conditions +! u = g +! +! on the unit cube 0<=x,y,z<=1. +! +! +! Note that if b1=b2=b3=c=0., the PDE is the Laplace equation. +! +! There are three choices available for data distribution: +! 1. A simple BLOCK distribution +! 2. A ditribution based on arbitrary assignment of indices to processes, +! typically from a graph partitioner +! 3. A 3D distribution in which the unit cube is partitioned +! into subcubes, each one assigned to a process. +! +! +module psb_s_pde3d_mod + + + use psb_base_mod, only : psb_spk_, psb_ipk_, psb_desc_type,& + & psb_sspmat_type, psb_s_vect_type, szero,& + & psb_s_base_sparse_mat, psb_s_base_vect_type, psb_i_base_vect_type + + interface + function s_func_3d(x,y,z) result(val) + import :: psb_spk_ + real(psb_spk_), intent(in) :: x,y,z + real(psb_spk_) :: val + end function s_func_3d + end interface + + interface psb_gen_pde3d + module procedure psb_s_gen_pde3d + end interface psb_gen_pde3d + +contains + + function s_null_func_3d(x,y,z) result(val) + + real(psb_spk_), intent(in) :: x,y,z + real(psb_spk_) :: val + + val = szero + + end function s_null_func_3d + ! + ! functions parametrizing the differential equation + ! + + ! + ! Note: b1, b2 and b3 are the coefficients of the first + ! derivative of the unknown function. The default + ! we apply here is to have them zero, so that the resulting + ! matrix is symmetric/hermitian and suitable for + ! testing with CG and FCG. + ! When testing methods for non-hermitian matrices you can + ! change the B1/B2/B3 functions to e.g. sone/sqrt((3*sone)) + ! + function b1(x,y,z) + use psb_base_mod, only : psb_spk_, sone, szero + implicit none + real(psb_spk_) :: b1 + real(psb_spk_), intent(in) :: x,y,z + b1=szero + end function b1 + function b2(x,y,z) + use psb_base_mod, only : psb_spk_, sone, szero + implicit none + real(psb_spk_) :: b2 + real(psb_spk_), intent(in) :: x,y,z + b2=szero + end function b2 + function b3(x,y,z) + use psb_base_mod, only : psb_spk_, sone, szero + implicit none + real(psb_spk_) :: b3 + real(psb_spk_), intent(in) :: x,y,z + b3=szero + end function b3 + function c(x,y,z) + use psb_base_mod, only : psb_spk_, sone, szero + implicit none + real(psb_spk_) :: c + real(psb_spk_), intent(in) :: x,y,z + c=szero + end function c + function a1(x,y,z) + use psb_base_mod, only : psb_spk_, sone, szero + implicit none + real(psb_spk_) :: a1 + real(psb_spk_), intent(in) :: x,y,z + a1=sone/80 + end function a1 + function a2(x,y,z) + use psb_base_mod, only : psb_spk_, sone, szero + implicit none + real(psb_spk_) :: a2 + real(psb_spk_), intent(in) :: x,y,z + a2=sone/80 + end function a2 + function a3(x,y,z) + use psb_base_mod, only : psb_spk_, sone, szero + implicit none + real(psb_spk_) :: a3 + real(psb_spk_), intent(in) :: x,y,z + a3=sone/80 + end function a3 + function g(x,y,z) + use psb_base_mod, only : psb_spk_, sone, szero + implicit none + real(psb_spk_) :: g + real(psb_spk_), intent(in) :: x,y,z + g = szero + if (x == sone) then + g = sone + else if (x == szero) then + g = exp(y**2-z**2) + end if + end function g + + + ! + ! subroutine to allocate and fill in the coefficient matrix and + ! the rhs. + ! + subroutine psb_s_gen_pde3d(ictxt,idim,a,bv,xv,desc_a,afmt,info,& + & f,amold,vmold,imold,partition,nrl,iv) + use psb_base_mod + use psb_util_mod + ! + ! Discretizes the partial differential equation + ! + ! a1 dd(u) a2 dd(u) a3 dd(u) b1 d(u) b2 d(u) b3 d(u) + ! - ------ - ------ - ------ + ----- + ------ + ------ + c u = f + ! dxdx dydy dzdz dx dy dz + ! + ! with Dirichlet boundary conditions + ! u = g + ! + ! on the unit cube 0<=x,y,z<=1. + ! + ! + ! Note that if b1=b2=b3=c=0., the PDE is the Laplace equation. + ! + implicit none + integer(psb_ipk_) :: idim + type(psb_sspmat_type) :: a + type(psb_s_vect_type) :: xv,bv + type(psb_desc_type) :: desc_a + integer(psb_ipk_) :: ictxt, info + character(len=*) :: afmt + procedure(s_func_3d), optional :: f + class(psb_s_base_sparse_mat), optional :: amold + class(psb_s_base_vect_type), optional :: vmold + class(psb_i_base_vect_type), optional :: imold + integer(psb_ipk_), optional :: partition, nrl,iv(:) + + ! Local variables. + + integer(psb_ipk_), parameter :: nb=20 + type(psb_s_csc_sparse_mat) :: acsc + type(psb_s_coo_sparse_mat) :: acoo + type(psb_s_csr_sparse_mat) :: acsr + real(psb_spk_) :: zt(nb),x,y,z + integer(psb_ipk_) :: m,n,nnz,nr,nt,glob_row,nlr,i,j,ii,ib,k, partition_ + integer(psb_ipk_) :: ix,iy,iz,ia,indx_owner + ! For 3D partition + integer(psb_ipk_) :: npx,npy,npz, npdims(3),iamx,iamy,iamz,mynx,myny,mynz + integer(psb_ipk_), allocatable :: bndx(:),bndy(:),bndz(:) + ! Process grid + integer(psb_ipk_) :: np, iam + integer(psb_ipk_) :: icoeff + integer(psb_ipk_), allocatable :: irow(:),icol(:),myidx(:) + real(psb_spk_), allocatable :: val(:) + ! deltah dimension of each grid cell + ! deltat discretization time + real(psb_spk_) :: deltah, sqdeltah, deltah2 + real(psb_spk_), parameter :: rhs=szero,one=sone,zero=szero + real(psb_dpk_) :: t0, t1, t2, t3, tasb, talc, ttot, tgen, tcdasb + integer(psb_ipk_) :: err_act + procedure(s_func_3d), pointer :: f_ + character(len=20) :: name, ch_err,tmpfmt + + info = psb_success_ + name = 'create_matrix' + call psb_erractionsave(err_act) + + call psb_info(ictxt, iam, np) + + + if (present(f)) then + f_ => f + else + f_ => s_null_func_3d + end if + + deltah = sone/(idim+2) + sqdeltah = deltah*deltah + deltah2 = (2*sone)* deltah + + if (present(partition)) then + if ((1<= partition).and.(partition <= 3)) then + partition_ = partition + else + write(*,*) 'Invalid partition choice ',partition,' defaulting to 3' + partition_ = 3 + end if + else + partition_ = 3 + end if + + ! initialize array descriptor and sparse matrix storage. provide an + ! estimate of the number of non zeroes + + m = idim*idim*idim + n = m + nnz = ((n*7)/(np)) + if(iam == psb_root_) write(psb_out_unit,'("Generating Matrix (size=",i0,")...")')n + t0 = psb_wtime() + select case(partition_) + case(1) + ! A BLOCK partition + if (present(nrl)) then + nr = nrl + else + ! + ! Using a simple BLOCK distribution. + ! + nt = (m+np-1)/np + nr = max(0,min(nt,m-(iam*nt))) + end if + + nt = nr + call psb_sum(ictxt,nt) + if (nt /= m) then + write(psb_err_unit,*) iam, 'Initialization error ',nr,nt,m + info = -1 + call psb_barrier(ictxt) + call psb_abort(ictxt) + return + end if + + ! + ! First example of use of CDALL: specify for each process a number of + ! contiguous rows + ! + call psb_cdall(ictxt,desc_a,info,nl=nr) + myidx = desc_a%get_global_indices() + nlr = size(myidx) + + case(2) + ! A partition defined by the user through IV + + if (present(iv)) then + if (size(iv) /= m) then + write(psb_err_unit,*) iam, 'Initialization error: wrong IV size',size(iv),m + info = -1 + call psb_barrier(ictxt) + call psb_abort(ictxt) + return + end if + else + write(psb_err_unit,*) iam, 'Initialization error: IV not present' + info = -1 + call psb_barrier(ictxt) + call psb_abort(ictxt) + return + end if + + ! + ! Second example of use of CDALL: specify for each row the + ! process that owns it + ! + call psb_cdall(ictxt,desc_a,info,vg=iv) + myidx = desc_a%get_global_indices() + nlr = size(myidx) + + case(3) + ! A 3-dimensional partition + + ! A nifty MPI function will split the process list + npdims = 0 + call mpi_dims_create(np,3,npdims,info) + npx = npdims(1) + npy = npdims(2) + npz = npdims(3) + + allocate(bndx(0:npx),bndy(0:npy),bndz(0:npz)) + ! We can reuse idx2ijk for process indices as well. + call idx2ijk(iamx,iamy,iamz,iam,npx,npy,npz,base=0) + ! Now let's split the 3D cube in hexahedra + call dist1Didx(bndx,idim,npx) + mynx = bndx(iamx+1)-bndx(iamx) + call dist1Didx(bndy,idim,npy) + myny = bndy(iamy+1)-bndy(iamy) + call dist1Didx(bndz,idim,npz) + mynz = bndz(iamz+1)-bndz(iamz) + + ! How many indices do I own? + nlr = mynx*myny*mynz + allocate(myidx(nlr)) + ! Now, let's generate the list of indices I own + nr = 0 + do i=bndx(iamx),bndx(iamx+1)-1 + do j=bndy(iamy),bndy(iamy+1)-1 + do k=bndz(iamz),bndz(iamz+1)-1 + nr = nr + 1 + call ijk2idx(myidx(nr),i,j,k,idim,idim,idim) + end do + end do + end do + if (nr /= nlr) then + write(psb_err_unit,*) iam,iamx,iamy,iamz, 'Initialization error: NR vs NLR ',& + & nr,nlr,mynx,myny,mynz + info = -1 + call psb_barrier(ictxt) + call psb_abort(ictxt) + end if + + ! + ! Third example of use of CDALL: specify for each process + ! the set of global indices it owns. + ! + call psb_cdall(ictxt,desc_a,info,vl=myidx) + + case default + write(psb_err_unit,*) iam, 'Initialization error: should not get here' + info = -1 + call psb_barrier(ictxt) + call psb_abort(ictxt) + return + end select + + + if (info == psb_success_) call psb_spall(a,desc_a,info,nnz=nnz) + ! define rhs from boundary conditions; also build initial guess + if (info == psb_success_) call psb_geall(xv,desc_a,info) + if (info == psb_success_) call psb_geall(bv,desc_a,info) + + call psb_barrier(ictxt) + talc = psb_wtime()-t0 + + if (info /= psb_success_) then + info=psb_err_from_subroutine_ + ch_err='allocation rout.' + call psb_errpush(info,name,a_err=ch_err) + goto 9999 + end if + + ! we build an auxiliary matrix consisting of one row at a + ! time; just a small matrix. might be extended to generate + ! a bunch of rows per call. + ! + allocate(val(20*nb),irow(20*nb),& + &icol(20*nb),stat=info) + if (info /= psb_success_ ) then + info=psb_err_alloc_dealloc_ + call psb_errpush(info,name) + goto 9999 + endif + + + ! loop over rows belonging to current process in a block + ! distribution. + + call psb_barrier(ictxt) + t1 = psb_wtime() + do ii=1, nlr,nb + ib = min(nb,nlr-ii+1) + icoeff = 1 + do k=1,ib + i=ii+k-1 + ! local matrix pointer + glob_row=myidx(i) + ! compute gridpoint coordinates + call idx2ijk(ix,iy,iz,glob_row,idim,idim,idim) + ! x, y, z coordinates + x = (ix-1)*deltah + y = (iy-1)*deltah + z = (iz-1)*deltah + zt(k) = f_(x,y,z) + ! internal point: build discretization + ! + ! term depending on (x-1,y,z) + ! + val(icoeff) = -a1(x,y,z)/sqdeltah-b1(x,y,z)/deltah2 + if (ix == 1) then + zt(k) = g(szero,y,z)*(-val(icoeff)) + zt(k) + else + call ijk2idx(icol(icoeff),ix-1,iy,iz,idim,idim,idim) + irow(icoeff) = glob_row + icoeff = icoeff+1 + endif + ! term depending on (x,y-1,z) + val(icoeff) = -a2(x,y,z)/sqdeltah-b2(x,y,z)/deltah2 + if (iy == 1) then + zt(k) = g(x,szero,z)*(-val(icoeff)) + zt(k) + else + call ijk2idx(icol(icoeff),ix,iy-1,iz,idim,idim,idim) + irow(icoeff) = glob_row + icoeff = icoeff+1 + endif + ! term depending on (x,y,z-1) + val(icoeff)=-a3(x,y,z)/sqdeltah-b3(x,y,z)/deltah2 + if (iz == 1) then + zt(k) = g(x,y,szero)*(-val(icoeff)) + zt(k) + else + call ijk2idx(icol(icoeff),ix,iy,iz-1,idim,idim,idim) + irow(icoeff) = glob_row + icoeff = icoeff+1 + endif + + ! term depending on (x,y,z) + val(icoeff)=(2*sone)*(a1(x,y,z)+a2(x,y,z)+a3(x,y,z))/sqdeltah & + & + c(x,y,z) + call ijk2idx(icol(icoeff),ix,iy,iz,idim,idim,idim) + irow(icoeff) = glob_row + icoeff = icoeff+1 + ! term depending on (x,y,z+1) + val(icoeff)=-a3(x,y,z)/sqdeltah+b3(x,y,z)/deltah2 + if (iz == idim) then + zt(k) = g(x,y,sone)*(-val(icoeff)) + zt(k) + else + call ijk2idx(icol(icoeff),ix,iy,iz+1,idim,idim,idim) + irow(icoeff) = glob_row + icoeff = icoeff+1 + endif + ! term depending on (x,y+1,z) + val(icoeff)=-a2(x,y,z)/sqdeltah+b2(x,y,z)/deltah2 + if (iy == idim) then + zt(k) = g(x,sone,z)*(-val(icoeff)) + zt(k) + else + call ijk2idx(icol(icoeff),ix,iy+1,iz,idim,idim,idim) + irow(icoeff) = glob_row + icoeff = icoeff+1 + endif + ! term depending on (x+1,y,z) + val(icoeff)=-a1(x,y,z)/sqdeltah+b1(x,y,z)/deltah2 + if (ix==idim) then + zt(k) = g(sone,y,z)*(-val(icoeff)) + zt(k) + else + call ijk2idx(icol(icoeff),ix+1,iy,iz,idim,idim,idim) + irow(icoeff) = glob_row + icoeff = icoeff+1 + endif + + end do + call psb_spins(icoeff-1,irow,icol,val,a,desc_a,info) + if(info /= psb_success_) exit + call psb_geins(ib,myidx(ii:ii+ib-1),zt(1:ib),bv,desc_a,info) + if(info /= psb_success_) exit + zt(:)=szero + call psb_geins(ib,myidx(ii:ii+ib-1),zt(1:ib),xv,desc_a,info) + if(info /= psb_success_) exit + end do + + tgen = psb_wtime()-t1 + if(info /= psb_success_) then + info=psb_err_from_subroutine_ + ch_err='insert rout.' + call psb_errpush(info,name,a_err=ch_err) + goto 9999 + end if + + deallocate(val,irow,icol) + + call psb_barrier(ictxt) + t1 = psb_wtime() + call psb_cdasb(desc_a,info,mold=imold) + tcdasb = psb_wtime()-t1 + call psb_barrier(ictxt) + t1 = psb_wtime() + if (info == psb_success_) then + if (present(amold)) then + call psb_spasb(a,desc_a,info,dupl=psb_dupl_err_,mold=amold) + else + call psb_spasb(a,desc_a,info,dupl=psb_dupl_err_,afmt=afmt) + end if + end if + call psb_barrier(ictxt) + if(info /= psb_success_) then + info=psb_err_from_subroutine_ + ch_err='asb rout.' + call psb_errpush(info,name,a_err=ch_err) + goto 9999 + end if + if (info == psb_success_) call psb_geasb(xv,desc_a,info,mold=vmold) + if (info == psb_success_) call psb_geasb(bv,desc_a,info,mold=vmold) + if(info /= psb_success_) then + info=psb_err_from_subroutine_ + ch_err='asb rout.' + call psb_errpush(info,name,a_err=ch_err) + goto 9999 + end if + tasb = psb_wtime()-t1 + call psb_barrier(ictxt) + ttot = psb_wtime() - t0 + + call psb_amx(ictxt,talc) + call psb_amx(ictxt,tgen) + call psb_amx(ictxt,tasb) + call psb_amx(ictxt,ttot) + if(iam == psb_root_) then + tmpfmt = a%get_fmt() + write(psb_out_unit,'("The matrix has been generated and assembled in ",a3," format.")')& + & tmpfmt + write(psb_out_unit,'("-allocation time : ",es12.5)') talc + write(psb_out_unit,'("-coeff. gen. time : ",es12.5)') tgen + write(psb_out_unit,'("-desc asbly time : ",es12.5)') tcdasb + write(psb_out_unit,'("- mat asbly time : ",es12.5)') tasb + write(psb_out_unit,'("-total time : ",es12.5)') ttot + + end if + call psb_erractionrestore(err_act) + return + +9999 call psb_error_handler(ictxt,err_act) + + return + end subroutine psb_s_gen_pde3d + + +end module psb_s_pde3d_mod + +program psb_s_pde3d + use psb_base_mod + use psb_prec_mod + use psb_krylov_mod + use psb_util_mod + use psb_s_pde3d_mod + implicit none + + ! input parameters + character(len=20) :: kmethd, ptype + character(len=5) :: afmt + integer(psb_ipk_) :: idim + + ! miscellaneous + real(psb_spk_), parameter :: one = sone + real(psb_dpk_) :: t1, t2, tprec + + ! sparse matrix and preconditioner + type(psb_sspmat_type) :: a + type(psb_sprec_type) :: prec + ! descriptor + type(psb_desc_type) :: desc_a + ! dense vectors + type(psb_s_vect_type) :: xxv,bv + ! parallel environment + integer(psb_ipk_) :: ictxt, iam, np + + ! solver parameters + integer(psb_ipk_) :: iter, itmax,itrace, istopc, irst + integer(psb_long_int_k_) :: amatsize, precsize, descsize, d2size + real(psb_spk_) :: err, eps + + ! other variables + integer(psb_ipk_) :: info, i + character(len=20) :: name,ch_err + character(len=40) :: fname + + info=psb_success_ + + + 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 + if(psb_get_errstatus() /= 0) goto 9999 + name='pde3d90' + call psb_set_errverbosity(itwo) + call psb_cd_set_large_threshold(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,kmethd,ptype,afmt,idim,istopc,itmax,itrace,irst) + + ! + ! allocate and fill in the coefficient matrix, rhs and initial guess + ! + call psb_barrier(ictxt) + t1 = psb_wtime() + call psb_gen_pde3d(ictxt,idim,a,bv,xxv,desc_a,afmt,info) + call psb_barrier(ictxt) + t2 = psb_wtime() - t1 + if(info /= psb_success_) then + info=psb_err_from_subroutine_ + ch_err='psb_gen_pde3d' + call psb_errpush(info,name,a_err=ch_err) + goto 9999 + end if + if (iam == psb_root_) write(psb_out_unit,'("Overall matrix creation time : ",es12.5)')t2 + if (iam == psb_root_) write(psb_out_unit,'(" ")') + ! + ! prepare the preconditioner. + ! + if(iam == psb_root_) write(psb_out_unit,'("Setting preconditioner to : ",a)')ptype + call prec%init(ptype,info) + + call psb_barrier(ictxt) + t1 = psb_wtime() + call prec%build(a,desc_a,info) + if(info /= psb_success_) then + info=psb_err_from_subroutine_ + ch_err='psb_precbld' + call psb_errpush(info,name,a_err=ch_err) + goto 9999 + end if + + tprec = psb_wtime()-t1 + + call psb_amx(ictxt,tprec) + + if (iam == psb_root_) write(psb_out_unit,'("Preconditioner time : ",es12.5)')tprec + if (iam == psb_root_) write(psb_out_unit,'(" ")') + call prec%descr() + ! + ! iterative method parameters + ! + if(iam == psb_root_) write(psb_out_unit,'("Calling iterative method ",a)')kmethd + call psb_barrier(ictxt) + t1 = psb_wtime() + eps = 1.d-6 + call psb_krylov(kmethd,a,prec,bv,xxv,eps,desc_a,info,& + & itmax=itmax,iter=iter,err=err,itrace=itrace,istop=istopc,irst=irst) + + if(info /= psb_success_) then + info=psb_err_from_subroutine_ + ch_err='solver routine' + call psb_errpush(info,name,a_err=ch_err) + goto 9999 + end if + + call psb_barrier(ictxt) + t2 = psb_wtime() - t1 + call psb_amx(ictxt,t2) + 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 + write(psb_out_unit,'(" ")') + write(psb_out_unit,'("Number of processes : ",i0)')np + 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,'("Number of iterations : ",i0)')iter + write(psb_out_unit,'("Convergence indicator on exit : ",es12.5)')err + write(psb_out_unit,'("Info on exit : ",i0)')info + 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 format for A: ",a)') a%get_fmt() + write(psb_out_unit,'("Storage format for DESC_A: ",a)') desc_a%get_fmt() + end if + + + ! + ! cleanup storage and exit + ! + call psb_gefree(bv,desc_a,info) + call psb_gefree(xxv,desc_a,info) + call psb_spfree(a,desc_a,info) + call prec%free(info) + call psb_cdfree(desc_a,info) + if(info /= psb_success_) then + info=psb_err_from_subroutine_ + ch_err='free routine' + call psb_errpush(info,name,a_err=ch_err) + goto 9999 + end if + + call psb_exit(ictxt) + stop + +9999 call psb_error(ictxt) + + stop + +contains + ! + ! get iteration parameters from standard input + ! + subroutine get_parms(ictxt,kmethd,ptype,afmt,idim,istopc,itmax,itrace,irst) + integer(psb_ipk_) :: ictxt + character(len=*) :: kmethd, ptype, afmt + integer(psb_ipk_) :: idim, istopc,itmax,itrace,irst + integer(psb_ipk_) :: np, iam + integer(psb_ipk_) :: ip, inp_unit + character(len=1024) :: filename + + call psb_info(ictxt, iam, np) + + if (iam == 0) then + if (command_argument_count()>0) then + call get_command_argument(1,filename) + inp_unit = 30 + open(inp_unit,file=filename,action='read',iostat=info) + if (info /= 0) then + write(psb_err_unit,*) 'Could not open file ',filename,' for input' + call psb_abort(ictxt) + stop + else + write(psb_err_unit,*) 'Opened file ',trim(filename),' for input' + end if + else + inp_unit=psb_inp_unit + end if + read(inp_unit,*) ip + if (ip >= 3) then + read(inp_unit,*) kmethd + read(inp_unit,*) ptype + read(inp_unit,*) afmt + + read(inp_unit,*) idim + if (ip >= 4) then + read(inp_unit,*) istopc + else + istopc=1 + endif + if (ip >= 5) then + read(inp_unit,*) itmax + else + itmax=500 + endif + if (ip >= 6) then + read(inp_unit,*) itrace + else + itrace=-1 + endif + if (ip >= 7) then + read(inp_unit,*) irst + else + irst=1 + endif + ! broadcast parameters to all processors + + + write(psb_out_unit,'("Solving matrix : ell1")') + write(psb_out_unit,& + & '("Grid dimensions : ",i4," x ",i4," x ",i4)') & + & idim,idim,idim + write(psb_out_unit,'("Number of processors : ",i0)')np + write(psb_out_unit,'("Data distribution : BLOCK")') + write(psb_out_unit,'("Preconditioner : ",a)') ptype + write(psb_out_unit,'("Iterative method : ",a)') kmethd + write(psb_out_unit,'(" ")') + else + ! wrong number of parameter, print an error message and exit + call pr_usage(izero) + call psb_abort(ictxt) + stop 1 + endif + if (inp_unit /= psb_inp_unit) then + close(inp_unit) + end if + + end if + ! broadcast parameters to all processors + call psb_bcast(ictxt,kmethd) + call psb_bcast(ictxt,afmt) + call psb_bcast(ictxt,ptype) + call psb_bcast(ictxt,idim) + call psb_bcast(ictxt,istopc) + call psb_bcast(ictxt,itmax) + call psb_bcast(ictxt,itrace) + call psb_bcast(ictxt,irst) + + return + + end subroutine get_parms + ! + ! print an error message + ! + subroutine pr_usage(iout) + integer(psb_ipk_) :: iout + write(iout,*)'incorrect parameter(s) found' + write(iout,*)' usage: pde3d90 methd prec dim & + &[istop itmax itrace]' + write(iout,*)' where:' + write(iout,*)' methd: cgstab cgs rgmres bicgstabl' + write(iout,*)' prec : bjac diag none' + write(iout,*)' dim number of points along each axis' + write(iout,*)' the size of the resulting linear ' + write(iout,*)' system is dim**3' + write(iout,*)' istop stopping criterion 1, 2 ' + write(iout,*)' itmax maximum number of iterations [500] ' + write(iout,*)' itrace <=0 (no tracing, default) or ' + write(iout,*)' >= 1 do tracing every itrace' + write(iout,*)' iterations ' + end subroutine pr_usage + +end program psb_s_pde3d + +