mirror of
https://github.com/sfilippone/amg4psblas.git
synced 2026-10-06 22:55:12 +00:00
mld2p4-2:
mlprec/impl/level/mld_c_base_onelev_descr.f90 mlprec/impl/level/mld_d_base_onelev_descr.f90 mlprec/impl/level/mld_s_base_onelev_descr.f90 mlprec/impl/level/mld_z_base_onelev_descr.f90 mlprec/impl/mld_c_smoothers_bld.f90 mlprec/impl/mld_cprecinit.F90 mlprec/impl/mld_d_smoothers_bld.f90 mlprec/impl/mld_dprecinit.F90 mlprec/impl/mld_s_smoothers_bld.f90 mlprec/impl/mld_sprecinit.F90 mlprec/impl/mld_z_smoothers_bld.f90 mlprec/impl/mld_zprecinit.F90 mlprec/mld_base_prec_type.F90 mlprec/mld_c_as_smoother.f90 mlprec/mld_c_diag_solver.f90 mlprec/mld_c_gs_solver.f90 mlprec/mld_c_id_solver.f90 mlprec/mld_c_ilu_solver.f90 mlprec/mld_c_jac_smoother.f90 mlprec/mld_c_mumps_solver.F90 mlprec/mld_c_prec_type.f90 mlprec/mld_c_slu_solver.F90 mlprec/mld_d_as_smoother.f90 mlprec/mld_d_diag_solver.f90 mlprec/mld_d_gs_solver.f90 mlprec/mld_d_id_solver.f90 mlprec/mld_d_ilu_solver.f90 mlprec/mld_d_jac_smoother.f90 mlprec/mld_d_mumps_solver.F90 mlprec/mld_d_prec_type.f90 mlprec/mld_d_slu_solver.F90 mlprec/mld_d_sludist_solver.F90 mlprec/mld_d_umf_solver.F90 mlprec/mld_s_as_smoother.f90 mlprec/mld_s_diag_solver.f90 mlprec/mld_s_gs_solver.f90 mlprec/mld_s_id_solver.f90 mlprec/mld_s_ilu_solver.f90 mlprec/mld_s_jac_smoother.f90 mlprec/mld_s_mumps_solver.F90 mlprec/mld_s_prec_type.f90 mlprec/mld_s_slu_solver.F90 mlprec/mld_z_as_smoother.f90 mlprec/mld_z_diag_solver.f90 mlprec/mld_z_gs_solver.f90 mlprec/mld_z_id_solver.f90 mlprec/mld_z_ilu_solver.f90 mlprec/mld_z_jac_smoother.f90 mlprec/mld_z_mumps_solver.F90 mlprec/mld_z_prec_type.f90 mlprec/mld_z_slu_solver.F90 mlprec/mld_z_sludist_solver.F90 mlprec/mld_z_umf_solver.F90 Cleanup old code in precinit. Fixes to informational messages.
This commit is contained in:
@@ -63,7 +63,7 @@ subroutine mld_c_base_onelev_descr(lv,il,nl,ilmin,info,iout)
|
||||
if (present(iout)) then
|
||||
iout_ = iout
|
||||
else
|
||||
iout_ = 6
|
||||
iout_ = psb_out_unit
|
||||
end if
|
||||
|
||||
write(iout_,*)
|
||||
|
||||
@@ -63,7 +63,7 @@ subroutine mld_d_base_onelev_descr(lv,il,nl,ilmin,info,iout)
|
||||
if (present(iout)) then
|
||||
iout_ = iout
|
||||
else
|
||||
iout_ = 6
|
||||
iout_ = psb_out_unit
|
||||
end if
|
||||
|
||||
write(iout_,*)
|
||||
|
||||
@@ -63,7 +63,7 @@ subroutine mld_s_base_onelev_descr(lv,il,nl,ilmin,info,iout)
|
||||
if (present(iout)) then
|
||||
iout_ = iout
|
||||
else
|
||||
iout_ = 6
|
||||
iout_ = psb_out_unit
|
||||
end if
|
||||
|
||||
write(iout_,*)
|
||||
|
||||
@@ -63,7 +63,7 @@ subroutine mld_z_base_onelev_descr(lv,il,nl,ilmin,info,iout)
|
||||
if (present(iout)) then
|
||||
iout_ = iout
|
||||
else
|
||||
iout_ = 6
|
||||
iout_ = psb_out_unit
|
||||
end if
|
||||
|
||||
write(iout_,*)
|
||||
|
||||
@@ -44,12 +44,13 @@
|
||||
! Subroutine: mld_c_smoothers_bld
|
||||
! Version: complex
|
||||
!
|
||||
! This routine performs the final phase of the multilevel preconditioner build process:
|
||||
! builds the "smoother" objects at each level, based on the matrix hierarchy prepared
|
||||
! by mld_c_hierarchy_bld.
|
||||
! This routine performs the final phase of the multilevel preconditioner
|
||||
! build process: builds the "smoother" objects at each level,
|
||||
! based on the matrix hierarchy prepared by mld_c_hierarchy_bld.
|
||||
!
|
||||
! A multilevel preconditioner is regarded as an array of 'one-level' data structures,
|
||||
! each containing the part of the preconditioner associated to a certain level,
|
||||
! A multilevel preconditioner is regarded as an array of 'one-level'
|
||||
! data structures, each containing the part of the
|
||||
! preconditioner associated to a certain level,
|
||||
! (for more details see the description of mld_Tonelev_type in mld_prec_type.f90).
|
||||
! The levels are numbered in increasing order starting from the finest one, i.e.
|
||||
! level 1 is the finest level. No transfer operators are associated to level 1.
|
||||
|
||||
@@ -164,8 +164,6 @@ subroutine mld_cprecinit(prec,ptype,info)
|
||||
ilev_ = 1
|
||||
allocate(prec%precv(nlev_),stat=info)
|
||||
|
||||
|
||||
#if 1
|
||||
do ilev_ = 1, nlev_
|
||||
call prec%precv(ilev_)%default()
|
||||
end do
|
||||
@@ -179,42 +177,7 @@ subroutine mld_cprecinit(prec,ptype,info)
|
||||
call prec%set('COARSE_SOLVE','ILU',info)
|
||||
#endif
|
||||
!call prec%precv(nlev_)%default()
|
||||
#else
|
||||
allocate(mld_c_as_smoother_type :: prec%precv(ilev_)%sm, stat=info)
|
||||
if (info /= psb_success_) return
|
||||
allocate(mld_c_ilu_solver_type :: prec%precv(ilev_)%sm%sv, stat=info)
|
||||
call prec%precv(ilev_)%default()
|
||||
|
||||
|
||||
if (nlev_ == 1) return
|
||||
do ilev_ = 2, nlev_ -1
|
||||
allocate(mld_c_as_smoother_type :: prec%precv(ilev_)%sm, stat=info)
|
||||
if (info /= psb_success_) return
|
||||
allocate(mld_c_ilu_solver_type :: prec%precv(ilev_)%sm%sv, stat=info)
|
||||
call prec%precv(ilev_)%default()
|
||||
|
||||
end do
|
||||
ilev_ = nlev_
|
||||
allocate(mld_c_jac_smoother_type :: prec%precv(ilev_)%sm, stat=info)
|
||||
if (info /= psb_success_) return
|
||||
#if defined(HAVE_SLU_)
|
||||
allocate(mld_c_slu_solver_type :: prec%precv(ilev_)%sm%sv, stat=info)
|
||||
#else
|
||||
allocate(mld_c_ilu_solver_type :: prec%precv(ilev_)%sm%sv, stat=info)
|
||||
#endif
|
||||
call prec%precv(ilev_)%default()
|
||||
prec%precv(ilev_)%parms%coarse_solve = mld_bjac_
|
||||
call prec%precv(ilev_)%set(mld_smoother_sweeps_,4_psb_ipk_,info)
|
||||
call prec%precv(ilev_)%set(mld_sub_restr_,psb_none_,info)
|
||||
call prec%precv(ilev_)%set(mld_sub_prol_,psb_none_,info)
|
||||
call prec%precv(ilev_)%set(mld_sub_ovr_,izero,info)
|
||||
|
||||
thr = 0.05_psb_spk_
|
||||
do ilev_=1,nlev_
|
||||
call prec%precv(ilev_)%set(mld_aggr_thresh_,thr,info)
|
||||
call prec%precv(ilev_)%set(mld_aggr_filter_,mld_filter_mat_,info)
|
||||
end do
|
||||
#endif
|
||||
case default
|
||||
write(psb_err_unit,*) name,&
|
||||
&': Warning: Unknown preconditioner type request "',ptype,'"'
|
||||
|
||||
@@ -44,12 +44,13 @@
|
||||
! Subroutine: mld_d_smoothers_bld
|
||||
! Version: real
|
||||
!
|
||||
! This routine performs the final phase of the multilevel preconditioner build process:
|
||||
! builds the "smoother" objects at each level, based on the matrix hierarchy prepared
|
||||
! by mld_d_hierarchy_bld.
|
||||
! This routine performs the final phase of the multilevel preconditioner
|
||||
! build process: builds the "smoother" objects at each level,
|
||||
! based on the matrix hierarchy prepared by mld_d_hierarchy_bld.
|
||||
!
|
||||
! A multilevel preconditioner is regarded as an array of 'one-level' data structures,
|
||||
! each containing the part of the preconditioner associated to a certain level,
|
||||
! A multilevel preconditioner is regarded as an array of 'one-level'
|
||||
! data structures, each containing the part of the
|
||||
! preconditioner associated to a certain level,
|
||||
! (for more details see the description of mld_Tonelev_type in mld_prec_type.f90).
|
||||
! The levels are numbered in increasing order starting from the finest one, i.e.
|
||||
! level 1 is the finest level. No transfer operators are associated to level 1.
|
||||
|
||||
@@ -167,8 +167,6 @@ subroutine mld_dprecinit(prec,ptype,info)
|
||||
ilev_ = 1
|
||||
allocate(prec%precv(nlev_),stat=info)
|
||||
|
||||
|
||||
#if 1
|
||||
do ilev_ = 1, nlev_
|
||||
call prec%precv(ilev_)%default()
|
||||
end do
|
||||
@@ -184,44 +182,7 @@ subroutine mld_dprecinit(prec,ptype,info)
|
||||
call prec%set('COARSE_SOLVE','ILU',info)
|
||||
#endif
|
||||
!call prec%precv(nlev_)%default()
|
||||
#else
|
||||
allocate(mld_d_as_smoother_type :: prec%precv(ilev_)%sm, stat=info)
|
||||
if (info /= psb_success_) return
|
||||
allocate(mld_d_ilu_solver_type :: prec%precv(ilev_)%sm%sv, stat=info)
|
||||
call prec%precv(ilev_)%default()
|
||||
|
||||
|
||||
if (nlev_ == 1) return
|
||||
do ilev_ = 2, nlev_ -1
|
||||
allocate(mld_d_as_smoother_type :: prec%precv(ilev_)%sm, stat=info)
|
||||
if (info /= psb_success_) return
|
||||
allocate(mld_d_ilu_solver_type :: prec%precv(ilev_)%sm%sv, stat=info)
|
||||
call prec%precv(ilev_)%default()
|
||||
|
||||
end do
|
||||
ilev_ = nlev_
|
||||
allocate(mld_d_jac_smoother_type :: prec%precv(ilev_)%sm, stat=info)
|
||||
if (info /= psb_success_) return
|
||||
#if defined(HAVE_UMF_)
|
||||
allocate(mld_d_umf_solver_type :: prec%precv(ilev_)%sm%sv, stat=info)
|
||||
#elif defined(HAVE_SLU_)
|
||||
allocate(mld_d_slu_solver_type :: prec%precv(ilev_)%sm%sv, stat=info)
|
||||
#else
|
||||
allocate(mld_d_ilu_solver_type :: prec%precv(ilev_)%sm%sv, stat=info)
|
||||
#endif
|
||||
call prec%precv(ilev_)%default()
|
||||
prec%precv(ilev_)%parms%coarse_solve = mld_bjac_
|
||||
call prec%precv(ilev_)%set(mld_smoother_sweeps_,4_psb_ipk_,info)
|
||||
call prec%precv(ilev_)%set(mld_sub_restr_,psb_none_,info)
|
||||
call prec%precv(ilev_)%set(mld_sub_prol_,psb_none_,info)
|
||||
call prec%precv(ilev_)%set(mld_sub_ovr_,izero,info)
|
||||
|
||||
thr = 0.05_psb_dpk_
|
||||
do ilev_=1,nlev_
|
||||
call prec%precv(ilev_)%set(mld_aggr_thresh_,thr,info)
|
||||
call prec%precv(ilev_)%set(mld_aggr_filter_,mld_filter_mat_,info)
|
||||
end do
|
||||
#endif
|
||||
case default
|
||||
write(psb_err_unit,*) name,&
|
||||
&': Warning: Unknown preconditioner type request "',ptype,'"'
|
||||
|
||||
@@ -44,12 +44,13 @@
|
||||
! Subroutine: mld_s_smoothers_bld
|
||||
! Version: real
|
||||
!
|
||||
! This routine performs the final phase of the multilevel preconditioner build process:
|
||||
! builds the "smoother" objects at each level, based on the matrix hierarchy prepared
|
||||
! by mld_s_hierarchy_bld.
|
||||
! This routine performs the final phase of the multilevel preconditioner
|
||||
! build process: builds the "smoother" objects at each level,
|
||||
! based on the matrix hierarchy prepared by mld_s_hierarchy_bld.
|
||||
!
|
||||
! A multilevel preconditioner is regarded as an array of 'one-level' data structures,
|
||||
! each containing the part of the preconditioner associated to a certain level,
|
||||
! A multilevel preconditioner is regarded as an array of 'one-level'
|
||||
! data structures, each containing the part of the
|
||||
! preconditioner associated to a certain level,
|
||||
! (for more details see the description of mld_Tonelev_type in mld_prec_type.f90).
|
||||
! The levels are numbered in increasing order starting from the finest one, i.e.
|
||||
! level 1 is the finest level. No transfer operators are associated to level 1.
|
||||
|
||||
@@ -164,8 +164,6 @@ subroutine mld_sprecinit(prec,ptype,info)
|
||||
ilev_ = 1
|
||||
allocate(prec%precv(nlev_),stat=info)
|
||||
|
||||
|
||||
#if 1
|
||||
do ilev_ = 1, nlev_
|
||||
call prec%precv(ilev_)%default()
|
||||
end do
|
||||
@@ -179,42 +177,7 @@ subroutine mld_sprecinit(prec,ptype,info)
|
||||
call prec%set('COARSE_SOLVE','ILU',info)
|
||||
#endif
|
||||
!call prec%precv(nlev_)%default()
|
||||
#else
|
||||
allocate(mld_s_as_smoother_type :: prec%precv(ilev_)%sm, stat=info)
|
||||
if (info /= psb_success_) return
|
||||
allocate(mld_s_ilu_solver_type :: prec%precv(ilev_)%sm%sv, stat=info)
|
||||
call prec%precv(ilev_)%default()
|
||||
|
||||
|
||||
if (nlev_ == 1) return
|
||||
do ilev_ = 2, nlev_ -1
|
||||
allocate(mld_s_as_smoother_type :: prec%precv(ilev_)%sm, stat=info)
|
||||
if (info /= psb_success_) return
|
||||
allocate(mld_s_ilu_solver_type :: prec%precv(ilev_)%sm%sv, stat=info)
|
||||
call prec%precv(ilev_)%default()
|
||||
|
||||
end do
|
||||
ilev_ = nlev_
|
||||
allocate(mld_s_jac_smoother_type :: prec%precv(ilev_)%sm, stat=info)
|
||||
if (info /= psb_success_) return
|
||||
#if defined(HAVE_SLU_)
|
||||
allocate(mld_s_slu_solver_type :: prec%precv(ilev_)%sm%sv, stat=info)
|
||||
#else
|
||||
allocate(mld_s_ilu_solver_type :: prec%precv(ilev_)%sm%sv, stat=info)
|
||||
#endif
|
||||
call prec%precv(ilev_)%default()
|
||||
prec%precv(ilev_)%parms%coarse_solve = mld_bjac_
|
||||
call prec%precv(ilev_)%set(mld_smoother_sweeps_,4_psb_ipk_,info)
|
||||
call prec%precv(ilev_)%set(mld_sub_restr_,psb_none_,info)
|
||||
call prec%precv(ilev_)%set(mld_sub_prol_,psb_none_,info)
|
||||
call prec%precv(ilev_)%set(mld_sub_ovr_,izero,info)
|
||||
|
||||
thr = 0.05_psb_spk_
|
||||
do ilev_=1,nlev_
|
||||
call prec%precv(ilev_)%set(mld_aggr_thresh_,thr,info)
|
||||
call prec%precv(ilev_)%set(mld_aggr_filter_,mld_filter_mat_,info)
|
||||
end do
|
||||
#endif
|
||||
case default
|
||||
write(psb_err_unit,*) name,&
|
||||
&': Warning: Unknown preconditioner type request "',ptype,'"'
|
||||
|
||||
@@ -44,12 +44,13 @@
|
||||
! Subroutine: mld_z_smoothers_bld
|
||||
! Version: complex
|
||||
!
|
||||
! This routine performs the final phase of the multilevel preconditioner build process:
|
||||
! builds the "smoother" objects at each level, based on the matrix hierarchy prepared
|
||||
! by mld_z_hierarchy_bld.
|
||||
! This routine performs the final phase of the multilevel preconditioner
|
||||
! build process: builds the "smoother" objects at each level,
|
||||
! based on the matrix hierarchy prepared by mld_z_hierarchy_bld.
|
||||
!
|
||||
! A multilevel preconditioner is regarded as an array of 'one-level' data structures,
|
||||
! each containing the part of the preconditioner associated to a certain level,
|
||||
! A multilevel preconditioner is regarded as an array of 'one-level'
|
||||
! data structures, each containing the part of the
|
||||
! preconditioner associated to a certain level,
|
||||
! (for more details see the description of mld_Tonelev_type in mld_prec_type.f90).
|
||||
! The levels are numbered in increasing order starting from the finest one, i.e.
|
||||
! level 1 is the finest level. No transfer operators are associated to level 1.
|
||||
|
||||
@@ -167,8 +167,6 @@ subroutine mld_zprecinit(prec,ptype,info)
|
||||
ilev_ = 1
|
||||
allocate(prec%precv(nlev_),stat=info)
|
||||
|
||||
|
||||
#if 1
|
||||
do ilev_ = 1, nlev_
|
||||
call prec%precv(ilev_)%default()
|
||||
end do
|
||||
@@ -184,44 +182,7 @@ subroutine mld_zprecinit(prec,ptype,info)
|
||||
call prec%set('COARSE_SOLVE','ILU',info)
|
||||
#endif
|
||||
!call prec%precv(nlev_)%default()
|
||||
#else
|
||||
allocate(mld_z_as_smoother_type :: prec%precv(ilev_)%sm, stat=info)
|
||||
if (info /= psb_success_) return
|
||||
allocate(mld_z_ilu_solver_type :: prec%precv(ilev_)%sm%sv, stat=info)
|
||||
call prec%precv(ilev_)%default()
|
||||
|
||||
|
||||
if (nlev_ == 1) return
|
||||
do ilev_ = 2, nlev_ -1
|
||||
allocate(mld_z_as_smoother_type :: prec%precv(ilev_)%sm, stat=info)
|
||||
if (info /= psb_success_) return
|
||||
allocate(mld_z_ilu_solver_type :: prec%precv(ilev_)%sm%sv, stat=info)
|
||||
call prec%precv(ilev_)%default()
|
||||
|
||||
end do
|
||||
ilev_ = nlev_
|
||||
allocate(mld_z_jac_smoother_type :: prec%precv(ilev_)%sm, stat=info)
|
||||
if (info /= psb_success_) return
|
||||
#if defined(HAVE_UMF_)
|
||||
allocate(mld_z_umf_solver_type :: prec%precv(ilev_)%sm%sv, stat=info)
|
||||
#elif defined(HAVE_SLU_)
|
||||
allocate(mld_z_slu_solver_type :: prec%precv(ilev_)%sm%sv, stat=info)
|
||||
#else
|
||||
allocate(mld_z_ilu_solver_type :: prec%precv(ilev_)%sm%sv, stat=info)
|
||||
#endif
|
||||
call prec%precv(ilev_)%default()
|
||||
prec%precv(ilev_)%parms%coarse_solve = mld_bjac_
|
||||
call prec%precv(ilev_)%set(mld_smoother_sweeps_,4_psb_ipk_,info)
|
||||
call prec%precv(ilev_)%set(mld_sub_restr_,psb_none_,info)
|
||||
call prec%precv(ilev_)%set(mld_sub_prol_,psb_none_,info)
|
||||
call prec%precv(ilev_)%set(mld_sub_ovr_,izero,info)
|
||||
|
||||
thr = 0.05_psb_dpk_
|
||||
do ilev_=1,nlev_
|
||||
call prec%precv(ilev_)%set(mld_aggr_thresh_,thr,info)
|
||||
call prec%precv(ilev_)%set(mld_aggr_filter_,mld_filter_mat_,info)
|
||||
end do
|
||||
#endif
|
||||
case default
|
||||
write(psb_err_unit,*) name,&
|
||||
&': Warning: Unknown preconditioner type request "',ptype,'"'
|
||||
|
||||
@@ -78,7 +78,7 @@ module mld_base_prec_type
|
||||
& psb_erractionsave, psb_erractionrestore, psb_error, psb_get_errstatus, &
|
||||
& psb_get_erraction, psb_success_, psb_err_alloc_dealloc_,&
|
||||
& psb_err_from_subroutine_, psb_err_missing_override_method_, &
|
||||
& psb_error_handler
|
||||
& psb_error_handler, psb_out_unit, psb_err_unit
|
||||
|
||||
!
|
||||
! Version numbers
|
||||
|
||||
@@ -437,7 +437,7 @@ contains
|
||||
if (present(iout)) then
|
||||
iout_ = iout
|
||||
else
|
||||
iout_ = 6
|
||||
iout_ = psb_out_unit
|
||||
endif
|
||||
|
||||
if (.not.coarse_) then
|
||||
|
||||
@@ -225,7 +225,7 @@ contains
|
||||
if (present(iout)) then
|
||||
iout_ = iout
|
||||
else
|
||||
iout_ = 6
|
||||
iout_ = psb_out_unit
|
||||
endif
|
||||
|
||||
write(iout_,*) ' Diagonal local solver '
|
||||
|
||||
@@ -519,7 +519,7 @@ contains
|
||||
if (present(iout)) then
|
||||
iout_ = iout
|
||||
else
|
||||
iout_ = 6
|
||||
iout_ = psb_out_unit
|
||||
endif
|
||||
|
||||
if (sv%eps<=dzero) then
|
||||
@@ -612,7 +612,7 @@ contains
|
||||
if (present(iout)) then
|
||||
iout_ = iout
|
||||
else
|
||||
iout_ = 6
|
||||
iout_ = psb_out_unit
|
||||
endif
|
||||
|
||||
if (sv%eps<=dzero) then
|
||||
|
||||
@@ -177,7 +177,7 @@ contains
|
||||
if (present(iout)) then
|
||||
iout_ = iout
|
||||
else
|
||||
iout_ = 6
|
||||
iout_ = psb_out_unit
|
||||
endif
|
||||
|
||||
write(iout_,*) ' Identity local solver '
|
||||
|
||||
@@ -491,7 +491,7 @@ contains
|
||||
if (present(iout)) then
|
||||
iout_ = iout
|
||||
else
|
||||
iout_ = 6
|
||||
iout_ = psb_out_unit
|
||||
endif
|
||||
|
||||
write(iout_,*) ' Incomplete factorization solver: ',&
|
||||
|
||||
@@ -240,7 +240,7 @@ contains
|
||||
if (present(iout)) then
|
||||
iout_ = iout
|
||||
else
|
||||
iout_ = 6
|
||||
iout_ = psb_out_unit
|
||||
endif
|
||||
|
||||
if (.not.coarse_) then
|
||||
|
||||
@@ -234,7 +234,7 @@ contains
|
||||
if (present(iout)) then
|
||||
iout_ = iout
|
||||
else
|
||||
iout_ = 6
|
||||
iout_ = psb_out_unit
|
||||
endif
|
||||
|
||||
write(iout_,*) ' MUMPS Solver. '
|
||||
|
||||
@@ -530,9 +530,9 @@ contains
|
||||
if (present(iout)) then
|
||||
iout_ = iout
|
||||
else
|
||||
iout_ = 6
|
||||
iout_ = psb_out_unit
|
||||
end if
|
||||
if (iout_ < 0) iout_ = 6
|
||||
if (iout_ < 0) iout_ = psb_out_unit
|
||||
|
||||
ictxt = prec%ictxt
|
||||
|
||||
|
||||
@@ -386,7 +386,7 @@ contains
|
||||
if (present(iout)) then
|
||||
iout_ = iout
|
||||
else
|
||||
iout_ = 6
|
||||
iout_ = psb_out_unit
|
||||
endif
|
||||
|
||||
write(iout_,*) ' SuperLU Sparse Factorization Solver. '
|
||||
|
||||
@@ -437,7 +437,7 @@ contains
|
||||
if (present(iout)) then
|
||||
iout_ = iout
|
||||
else
|
||||
iout_ = 6
|
||||
iout_ = psb_out_unit
|
||||
endif
|
||||
|
||||
if (.not.coarse_) then
|
||||
|
||||
@@ -225,7 +225,7 @@ contains
|
||||
if (present(iout)) then
|
||||
iout_ = iout
|
||||
else
|
||||
iout_ = 6
|
||||
iout_ = psb_out_unit
|
||||
endif
|
||||
|
||||
write(iout_,*) ' Diagonal local solver '
|
||||
|
||||
@@ -519,7 +519,7 @@ contains
|
||||
if (present(iout)) then
|
||||
iout_ = iout
|
||||
else
|
||||
iout_ = 6
|
||||
iout_ = psb_out_unit
|
||||
endif
|
||||
|
||||
if (sv%eps<=dzero) then
|
||||
@@ -612,7 +612,7 @@ contains
|
||||
if (present(iout)) then
|
||||
iout_ = iout
|
||||
else
|
||||
iout_ = 6
|
||||
iout_ = psb_out_unit
|
||||
endif
|
||||
|
||||
if (sv%eps<=dzero) then
|
||||
|
||||
@@ -177,7 +177,7 @@ contains
|
||||
if (present(iout)) then
|
||||
iout_ = iout
|
||||
else
|
||||
iout_ = 6
|
||||
iout_ = psb_out_unit
|
||||
endif
|
||||
|
||||
write(iout_,*) ' Identity local solver '
|
||||
|
||||
@@ -491,7 +491,7 @@ contains
|
||||
if (present(iout)) then
|
||||
iout_ = iout
|
||||
else
|
||||
iout_ = 6
|
||||
iout_ = psb_out_unit
|
||||
endif
|
||||
|
||||
write(iout_,*) ' Incomplete factorization solver: ',&
|
||||
|
||||
@@ -240,7 +240,7 @@ contains
|
||||
if (present(iout)) then
|
||||
iout_ = iout
|
||||
else
|
||||
iout_ = 6
|
||||
iout_ = psb_out_unit
|
||||
endif
|
||||
|
||||
if (.not.coarse_) then
|
||||
|
||||
@@ -234,7 +234,7 @@ contains
|
||||
if (present(iout)) then
|
||||
iout_ = iout
|
||||
else
|
||||
iout_ = 6
|
||||
iout_ = psb_out_unit
|
||||
endif
|
||||
|
||||
write(iout_,*) ' MUMPS Solver. '
|
||||
|
||||
@@ -530,9 +530,9 @@ contains
|
||||
if (present(iout)) then
|
||||
iout_ = iout
|
||||
else
|
||||
iout_ = 6
|
||||
iout_ = psb_out_unit
|
||||
end if
|
||||
if (iout_ < 0) iout_ = 6
|
||||
if (iout_ < 0) iout_ = psb_out_unit
|
||||
|
||||
ictxt = prec%ictxt
|
||||
|
||||
|
||||
@@ -386,7 +386,7 @@ contains
|
||||
if (present(iout)) then
|
||||
iout_ = iout
|
||||
else
|
||||
iout_ = 6
|
||||
iout_ = psb_out_unit
|
||||
endif
|
||||
|
||||
write(iout_,*) ' SuperLU Sparse Factorization Solver. '
|
||||
|
||||
@@ -395,7 +395,7 @@ contains
|
||||
if (present(iout)) then
|
||||
iout_ = iout
|
||||
else
|
||||
iout_ = 6
|
||||
iout_ = psb_out_unit
|
||||
endif
|
||||
|
||||
write(iout_,*) ' SuperLU_Dist Sparse Factorization Solver. '
|
||||
|
||||
@@ -390,7 +390,7 @@ contains
|
||||
if (present(iout)) then
|
||||
iout_ = iout
|
||||
else
|
||||
iout_ = 6
|
||||
iout_ = psb_out_unit
|
||||
endif
|
||||
|
||||
write(iout_,*) ' UMFPACK Sparse Factorization Solver. '
|
||||
|
||||
@@ -437,7 +437,7 @@ contains
|
||||
if (present(iout)) then
|
||||
iout_ = iout
|
||||
else
|
||||
iout_ = 6
|
||||
iout_ = psb_out_unit
|
||||
endif
|
||||
|
||||
if (.not.coarse_) then
|
||||
|
||||
@@ -225,7 +225,7 @@ contains
|
||||
if (present(iout)) then
|
||||
iout_ = iout
|
||||
else
|
||||
iout_ = 6
|
||||
iout_ = psb_out_unit
|
||||
endif
|
||||
|
||||
write(iout_,*) ' Diagonal local solver '
|
||||
|
||||
@@ -519,7 +519,7 @@ contains
|
||||
if (present(iout)) then
|
||||
iout_ = iout
|
||||
else
|
||||
iout_ = 6
|
||||
iout_ = psb_out_unit
|
||||
endif
|
||||
|
||||
if (sv%eps<=dzero) then
|
||||
@@ -612,7 +612,7 @@ contains
|
||||
if (present(iout)) then
|
||||
iout_ = iout
|
||||
else
|
||||
iout_ = 6
|
||||
iout_ = psb_out_unit
|
||||
endif
|
||||
|
||||
if (sv%eps<=dzero) then
|
||||
|
||||
@@ -177,7 +177,7 @@ contains
|
||||
if (present(iout)) then
|
||||
iout_ = iout
|
||||
else
|
||||
iout_ = 6
|
||||
iout_ = psb_out_unit
|
||||
endif
|
||||
|
||||
write(iout_,*) ' Identity local solver '
|
||||
|
||||
@@ -491,7 +491,7 @@ contains
|
||||
if (present(iout)) then
|
||||
iout_ = iout
|
||||
else
|
||||
iout_ = 6
|
||||
iout_ = psb_out_unit
|
||||
endif
|
||||
|
||||
write(iout_,*) ' Incomplete factorization solver: ',&
|
||||
|
||||
@@ -240,7 +240,7 @@ contains
|
||||
if (present(iout)) then
|
||||
iout_ = iout
|
||||
else
|
||||
iout_ = 6
|
||||
iout_ = psb_out_unit
|
||||
endif
|
||||
|
||||
if (.not.coarse_) then
|
||||
|
||||
@@ -234,7 +234,7 @@ contains
|
||||
if (present(iout)) then
|
||||
iout_ = iout
|
||||
else
|
||||
iout_ = 6
|
||||
iout_ = psb_out_unit
|
||||
endif
|
||||
|
||||
write(iout_,*) ' MUMPS Solver. '
|
||||
|
||||
@@ -530,9 +530,9 @@ contains
|
||||
if (present(iout)) then
|
||||
iout_ = iout
|
||||
else
|
||||
iout_ = 6
|
||||
iout_ = psb_out_unit
|
||||
end if
|
||||
if (iout_ < 0) iout_ = 6
|
||||
if (iout_ < 0) iout_ = psb_out_unit
|
||||
|
||||
ictxt = prec%ictxt
|
||||
|
||||
|
||||
@@ -386,7 +386,7 @@ contains
|
||||
if (present(iout)) then
|
||||
iout_ = iout
|
||||
else
|
||||
iout_ = 6
|
||||
iout_ = psb_out_unit
|
||||
endif
|
||||
|
||||
write(iout_,*) ' SuperLU Sparse Factorization Solver. '
|
||||
|
||||
@@ -437,7 +437,7 @@ contains
|
||||
if (present(iout)) then
|
||||
iout_ = iout
|
||||
else
|
||||
iout_ = 6
|
||||
iout_ = psb_out_unit
|
||||
endif
|
||||
|
||||
if (.not.coarse_) then
|
||||
|
||||
@@ -225,7 +225,7 @@ contains
|
||||
if (present(iout)) then
|
||||
iout_ = iout
|
||||
else
|
||||
iout_ = 6
|
||||
iout_ = psb_out_unit
|
||||
endif
|
||||
|
||||
write(iout_,*) ' Diagonal local solver '
|
||||
|
||||
@@ -519,7 +519,7 @@ contains
|
||||
if (present(iout)) then
|
||||
iout_ = iout
|
||||
else
|
||||
iout_ = 6
|
||||
iout_ = psb_out_unit
|
||||
endif
|
||||
|
||||
if (sv%eps<=dzero) then
|
||||
@@ -612,7 +612,7 @@ contains
|
||||
if (present(iout)) then
|
||||
iout_ = iout
|
||||
else
|
||||
iout_ = 6
|
||||
iout_ = psb_out_unit
|
||||
endif
|
||||
|
||||
if (sv%eps<=dzero) then
|
||||
|
||||
@@ -177,7 +177,7 @@ contains
|
||||
if (present(iout)) then
|
||||
iout_ = iout
|
||||
else
|
||||
iout_ = 6
|
||||
iout_ = psb_out_unit
|
||||
endif
|
||||
|
||||
write(iout_,*) ' Identity local solver '
|
||||
|
||||
@@ -491,7 +491,7 @@ contains
|
||||
if (present(iout)) then
|
||||
iout_ = iout
|
||||
else
|
||||
iout_ = 6
|
||||
iout_ = psb_out_unit
|
||||
endif
|
||||
|
||||
write(iout_,*) ' Incomplete factorization solver: ',&
|
||||
|
||||
@@ -240,7 +240,7 @@ contains
|
||||
if (present(iout)) then
|
||||
iout_ = iout
|
||||
else
|
||||
iout_ = 6
|
||||
iout_ = psb_out_unit
|
||||
endif
|
||||
|
||||
if (.not.coarse_) then
|
||||
|
||||
@@ -234,7 +234,7 @@ contains
|
||||
if (present(iout)) then
|
||||
iout_ = iout
|
||||
else
|
||||
iout_ = 6
|
||||
iout_ = psb_out_unit
|
||||
endif
|
||||
|
||||
write(iout_,*) ' MUMPS Solver. '
|
||||
|
||||
@@ -530,9 +530,9 @@ contains
|
||||
if (present(iout)) then
|
||||
iout_ = iout
|
||||
else
|
||||
iout_ = 6
|
||||
iout_ = psb_out_unit
|
||||
end if
|
||||
if (iout_ < 0) iout_ = 6
|
||||
if (iout_ < 0) iout_ = psb_out_unit
|
||||
|
||||
ictxt = prec%ictxt
|
||||
|
||||
|
||||
@@ -386,7 +386,7 @@ contains
|
||||
if (present(iout)) then
|
||||
iout_ = iout
|
||||
else
|
||||
iout_ = 6
|
||||
iout_ = psb_out_unit
|
||||
endif
|
||||
|
||||
write(iout_,*) ' SuperLU Sparse Factorization Solver. '
|
||||
|
||||
@@ -395,7 +395,7 @@ contains
|
||||
if (present(iout)) then
|
||||
iout_ = iout
|
||||
else
|
||||
iout_ = 6
|
||||
iout_ = psb_out_unit
|
||||
endif
|
||||
|
||||
write(iout_,*) ' SuperLU_Dist Sparse Factorization Solver. '
|
||||
|
||||
@@ -390,7 +390,7 @@ contains
|
||||
if (present(iout)) then
|
||||
iout_ = iout
|
||||
else
|
||||
iout_ = 6
|
||||
iout_ = psb_out_unit
|
||||
endif
|
||||
|
||||
write(iout_,*) ' UMFPACK Sparse Factorization Solver. '
|
||||
|
||||
Reference in New Issue
Block a user