fdurastante
/
amg4psblas
mirror of https://github.com/sfilippone/amg4psblas.git
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

Include solver_sweeps in test program

Browse Source
maint-1.1
sfilippone 1 year ago
parent 84ea60c94c
commit 1dcb542e4a
6 changed files with 172 additions and 138 deletions
Show Stats Download Patch File Download Diff File

56
samples/advanced/pdegen/amg_d_pde2d.F90
Unescape Escape View File

@ -141,30 +141,32 @@ program amg_d_pde2d
integer(psb_ipk_) :: csizepp ! minimum size of coarsest matrix per process integer(psb_ipk_) :: csizepp ! minimum size of coarsest matrix per process
! AMG smoother or pre-smoother; also 1-lev preconditioner ! AMG smoother or pre-smoother; also 1-lev preconditioner
character(len=16) :: smther ! (pre-)smoother type: BJAC, AS character(len=16) :: smther ! (pre-)smoother type: BJAC, AS
integer(psb_ipk_) :: jsweeps ! (pre-)smoother / 1-lev prec. sweeps integer(psb_ipk_) :: jsweeps ! (pre-)smoother / 1-lev prec. sweeps
integer(psb_ipk_) :: novr ! number of overlap layers integer(psb_ipk_) :: novr ! number of overlap layers
character(len=16) :: restr ! restriction over application of AS character(len=16) :: restr ! restriction over application of AS
character(len=16) :: prol ! prolongation over application of AS character(len=16) :: prol ! prolongation over application of AS
character(len=16) :: solve ! local subsolver type: ILU, MILU, ILUT, character(len=16) :: solve ! local subsolver type: ILU, MILU, ILUT,
! UMF, MUMPS, SLU, FWGS, BWGS, JAC ! UMF, MUMPS, SLU, FWGS, BWGS, JAC
character(len=16) :: variant ! AINV variant: LLK, etc integer(psb_ipk_) :: ssweeps ! inner solver sweeps
integer(psb_ipk_) :: fill ! fill-in for incomplete LU factorization character(len=16) :: variant ! AINV variant: LLK, etc
integer(psb_ipk_) :: invfill ! Inverse fill-in for INVK integer(psb_ipk_) :: fill ! fill-in for incomplete LU factorization
real(psb_dpk_) :: thr ! threshold for ILUT factorization integer(psb_ipk_) :: invfill ! Inverse fill-in for INVK
real(psb_dpk_) :: thr ! threshold for ILUT factorization
! AMG post-smoother; ignored by 1-lev preconditioner ! AMG post-smoother; ignored by 1-lev preconditioner
character(len=16) :: smther2 ! post-smoother type: BJAC, AS character(len=16) :: smther2 ! post-smoother type: BJAC, AS
integer(psb_ipk_) :: jsweeps2 ! post-smoother sweeps integer(psb_ipk_) :: jsweeps2 ! post-smoother sweeps
integer(psb_ipk_) :: novr2 ! number of overlap layers integer(psb_ipk_) :: novr2 ! number of overlap layers
character(len=16) :: restr2 ! restriction over application of AS character(len=16) :: restr2 ! restriction over application of AS
character(len=16) :: prol2 ! prolongation over application of AS character(len=16) :: prol2 ! prolongation over application of AS
character(len=16) :: solve2 ! local subsolver type: ILU, MILU, ILUT, character(len=16) :: solve2 ! local subsolver type: ILU, MILU, ILUT,
! UMF, MUMPS, SLU, FWGS, BWGS, JAC ! UMF, MUMPS, SLU, FWGS, BWGS, JAC
character(len=16) :: variant2 ! AINV variant: LLK, etc integer(psb_ipk_) :: ssweeps2 ! inner solver sweeps
integer(psb_ipk_) :: fill2 ! fill-in for incomplete LU factorization character(len=16) :: variant2 ! AINV variant: LLK, etc
integer(psb_ipk_) :: invfill2 ! Inverse fill-in for INVK integer(psb_ipk_) :: fill2 ! fill-in for incomplete LU factorization
real(psb_dpk_) :: thr2 ! threshold for ILUT factorization integer(psb_ipk_) :: invfill2 ! Inverse fill-in for INVK
real(psb_dpk_) :: thr2 ! threshold for ILUT factorization
! coarsest-level solver ! coarsest-level solver
character(len=16) :: cmat ! coarsest matrix layout: REPL, DIST character(len=16) :: cmat ! coarsest matrix layout: REPL, DIST
@ -282,6 +284,7 @@ program amg_d_pde2d
case ('BJAC') case ('BJAC')
call prec%set('smoother_sweeps', p_choice%jsweeps, info) call prec%set('smoother_sweeps', p_choice%jsweeps, info)
call prec%set('sub_solve', p_choice%solve, info) call prec%set('sub_solve', p_choice%solve, info)
call prec%set('solver_sweeps', p_choice%ssweeps, info)
if (psb_toupper(p_choice%solve)=='MUMPS') & if (psb_toupper(p_choice%solve)=='MUMPS') &
& call prec%set('mumps_loc_glob','local_solver',info) & call prec%set('mumps_loc_glob','local_solver',info)
call prec%set('sub_fillin', p_choice%fill, info) call prec%set('sub_fillin', p_choice%fill, info)
@ -293,6 +296,7 @@ program amg_d_pde2d
call prec%set('sub_restr', p_choice%restr, info) call prec%set('sub_restr', p_choice%restr, info)
call prec%set('sub_prol', p_choice%prol, info) call prec%set('sub_prol', p_choice%prol, info)
call prec%set('sub_solve', p_choice%solve, info) call prec%set('sub_solve', p_choice%solve, info)
call prec%set('solver_sweeps', p_choice%ssweeps, info)
if (psb_toupper(p_choice%solve)=='MUMPS') & if (psb_toupper(p_choice%solve)=='MUMPS') &
& call prec%set('mumps_loc_glob','local_solver',info) & call prec%set('mumps_loc_glob','local_solver',info)
call prec%set('sub_fillin', p_choice%fill, info) call prec%set('sub_fillin', p_choice%fill, info)
@ -349,7 +353,7 @@ program amg_d_pde2d
if (psb_toupper(p_choice%solve)=='MUMPS') & if (psb_toupper(p_choice%solve)=='MUMPS') &
& call prec%set('mumps_loc_glob','local_solver',info) & call prec%set('mumps_loc_glob','local_solver',info)
end select end select
call prec%set('solver_sweeps', p_choice%ssweeps, info)
call prec%set('sub_fillin', p_choice%fill, info) call prec%set('sub_fillin', p_choice%fill, info)
call prec%set('inv_fillin', p_choice%invfill, info) call prec%set('inv_fillin', p_choice%invfill, info)
call prec%set('sub_iluthrs', p_choice%thr, info) call prec%set('sub_iluthrs', p_choice%thr, info)
@ -378,7 +382,7 @@ program amg_d_pde2d
if (psb_toupper(p_choice%solve2)=='MUMPS') & if (psb_toupper(p_choice%solve2)=='MUMPS') &
& call prec%set('mumps_loc_glob','local_solver',info) & call prec%set('mumps_loc_glob','local_solver',info)
end select end select
call prec%set('solver_sweeps', p_choice%ssweeps2, info,pos='post')
call prec%set('sub_fillin', p_choice%fill2, info,pos='post') call prec%set('sub_fillin', p_choice%fill2, info,pos='post')
call prec%set('inv_fillin', p_choice%invfill2, info,pos='post') call prec%set('inv_fillin', p_choice%invfill2, info,pos='post')
call prec%set('sub_iluthrs', p_choice%thr2, info,pos='post') call prec%set('sub_iluthrs', p_choice%thr2, info,pos='post')
@ -577,6 +581,7 @@ contains
call read_data(prec%restr,inp_unit) ! restriction over application of AS call read_data(prec%restr,inp_unit) ! restriction over application of AS
call read_data(prec%prol,inp_unit) ! prolongation over application of AS call read_data(prec%prol,inp_unit) ! prolongation over application of AS
call read_data(prec%solve,inp_unit) ! local subsolver call read_data(prec%solve,inp_unit) ! local subsolver
call read_data(prec%ssweeps,inp_unit) ! inner solver sweeps
call read_data(prec%variant,inp_unit) ! AINV variant call read_data(prec%variant,inp_unit) ! AINV variant
call read_data(prec%fill,inp_unit) ! fill-in for incomplete LU call read_data(prec%fill,inp_unit) ! fill-in for incomplete LU
call read_data(prec%invfill,inp_unit) !Inverse fill-in for INVK call read_data(prec%invfill,inp_unit) !Inverse fill-in for INVK
@ -588,6 +593,7 @@ contains
call read_data(prec%restr2,inp_unit) ! restriction over application of AS call read_data(prec%restr2,inp_unit) ! restriction over application of AS
call read_data(prec%prol2,inp_unit) ! prolongation over application of AS call read_data(prec%prol2,inp_unit) ! prolongation over application of AS
call read_data(prec%solve2,inp_unit) ! local subsolver call read_data(prec%solve2,inp_unit) ! local subsolver
call read_data(prec%ssweeps2,inp_unit) ! inner solver sweeps
call read_data(prec%variant2,inp_unit) ! AINV variant call read_data(prec%variant2,inp_unit) ! AINV variant
call read_data(prec%fill2,inp_unit) ! fill-in for incomplete LU call read_data(prec%fill2,inp_unit) ! fill-in for incomplete LU
call read_data(prec%invfill2,inp_unit) !Inverse fill-in for INVK call read_data(prec%invfill2,inp_unit) !Inverse fill-in for INVK
@ -657,6 +663,7 @@ contains
call psb_bcast(ctxt,prec%restr) call psb_bcast(ctxt,prec%restr)
call psb_bcast(ctxt,prec%prol) call psb_bcast(ctxt,prec%prol)
call psb_bcast(ctxt,prec%solve) call psb_bcast(ctxt,prec%solve)
call psb_bcast(ctxt,prec%ssweeps)
call psb_bcast(ctxt,prec%variant) call psb_bcast(ctxt,prec%variant)
call psb_bcast(ctxt,prec%fill) call psb_bcast(ctxt,prec%fill)
call psb_bcast(ctxt,prec%invfill) call psb_bcast(ctxt,prec%invfill)
@ -668,6 +675,7 @@ contains
call psb_bcast(ctxt,prec%restr2) call psb_bcast(ctxt,prec%restr2)
call psb_bcast(ctxt,prec%prol2) call psb_bcast(ctxt,prec%prol2)
call psb_bcast(ctxt,prec%solve2) call psb_bcast(ctxt,prec%solve2)
call psb_bcast(ctxt,prec%ssweeps2)
call psb_bcast(ctxt,prec%variant2) call psb_bcast(ctxt,prec%variant2)
call psb_bcast(ctxt,prec%fill2) call psb_bcast(ctxt,prec%fill2)
call psb_bcast(ctxt,prec%invfill2) call psb_bcast(ctxt,prec%invfill2)

98
samples/advanced/pdegen/amg_d_pde3d.F90
Unescape Escape View File

@ -126,62 +126,64 @@ program amg_d_pde3d
! AMG cycles for ML ! AMG cycles for ML
! general AMG data ! general AMG data
character(len=16) :: mlcycle ! AMG cycle type character(len=16) :: mlcycle ! AMG cycle type
integer(psb_ipk_) :: maxlevs ! maximum number of levels in AMG preconditioner integer(psb_ipk_) :: maxlevs ! maximum number of levels in AMG preconditioner
! AMG aggregation ! AMG aggregation
character(len=16) :: aggr_prol ! aggregation type: SMOOTHED, NONSMOOTHED character(len=16) :: aggr_prol ! aggregation type: SMOOTHED, NONSMOOTHED
character(len=16) :: par_aggr_alg ! parallel aggregation algorithm: DEC, SYMDEC character(len=16) :: par_aggr_alg ! parallel aggregation algorithm: DEC, SYMDEC
character(len=16) :: aggr_type ! Type of aggregation SOC1, SOC2, MATCHBOXP character(len=16) :: aggr_type ! Type of aggregation SOC1, SOC2, MATCHBOXP
integer(psb_ipk_) :: aggr_size ! Requested size of the aggregates for MATCHBOXP integer(psb_ipk_) :: aggr_size ! Requested size of the aggregates for MATCHBOXP
character(len=16) :: aggr_ord ! ordering for aggregation: NATURAL, DEGREE character(len=16) :: aggr_ord ! ordering for aggregation: NATURAL, DEGREE
character(len=16) :: aggr_filter ! filtering: FILTER, NO_FILTER character(len=16) :: aggr_filter ! filtering: FILTER, NO_FILTER
real(psb_dpk_) :: mncrratio ! minimum aggregation ratio real(psb_dpk_) :: mncrratio ! minimum aggregation ratio
real(psb_dpk_), allocatable :: athresv(:) ! smoothed aggregation threshold vector real(psb_dpk_), allocatable :: athresv(:) ! smoothed aggregation threshold vector
integer(psb_ipk_) :: thrvsz ! size of threshold vector integer(psb_ipk_) :: thrvsz ! size of threshold vector
real(psb_dpk_) :: athres ! smoothed aggregation threshold real(psb_dpk_) :: athres ! smoothed aggregation threshold
integer(psb_ipk_) :: csizepp ! minimum size of coarsest matrix per process integer(psb_ipk_) :: csizepp ! minimum size of coarsest matrix per process
! AMG smoother or pre-smoother; also 1-lev preconditioner ! AMG smoother or pre-smoother; also 1-lev preconditioner
character(len=16) :: smther ! (pre-)smoother type: BJAC, AS character(len=16) :: smther ! (pre-)smoother type: BJAC, AS
integer(psb_ipk_) :: jsweeps ! (pre-)smoother / 1-lev prec. sweeps integer(psb_ipk_) :: jsweeps ! (pre-)smoother / 1-lev prec. sweeps
integer(psb_ipk_) :: novr ! number of overlap layers integer(psb_ipk_) :: novr ! number of overlap layers
character(len=16) :: restr ! restriction over application of AS character(len=16) :: restr ! restriction over application of AS
character(len=16) :: prol ! prolongation over application of AS character(len=16) :: prol ! prolongation over application of AS
character(len=16) :: solve ! local subsolver type: ILU, MILU, ILUT, character(len=16) :: solve ! local subsolver type: ILU, MILU, ILUT,
! UMF, MUMPS, SLU, FWGS, BWGS, JAC ! UMF, MUMPS, SLU, FWGS, BWGS, JAC
character(len=16) :: variant ! AINV variant: LLK, etc integer(psb_ipk_) :: ssweeps ! inner solver sweeps
integer(psb_ipk_) :: fill ! fill-in for incomplete LU factorization character(len=16) :: variant ! AINV variant: LLK, etc
integer(psb_ipk_) :: invfill ! Inverse fill-in for INVK integer(psb_ipk_) :: fill ! fill-in for incomplete LU factorization
real(psb_dpk_) :: thr ! threshold for ILUT factorization integer(psb_ipk_) :: invfill ! Inverse fill-in for INVK
real(psb_dpk_) :: thr ! threshold for ILUT factorization
! AMG post-smoother; ignored by 1-lev preconditioner ! AMG post-smoother; ignored by 1-lev preconditioner
character(len=16) :: smther2 ! post-smoother type: BJAC, AS character(len=16) :: smther2 ! post-smoother type: BJAC, AS
integer(psb_ipk_) :: jsweeps2 ! post-smoother sweeps integer(psb_ipk_) :: jsweeps2 ! post-smoother sweeps
integer(psb_ipk_) :: novr2 ! number of overlap layers integer(psb_ipk_) :: novr2 ! number of overlap layers
character(len=16) :: restr2 ! restriction over application of AS character(len=16) :: restr2 ! restriction over application of AS
character(len=16) :: prol2 ! prolongation over application of AS character(len=16) :: prol2 ! prolongation over application of AS
character(len=16) :: solve2 ! local subsolver type: ILU, MILU, ILUT, character(len=16) :: solve2 ! local subsolver type: ILU, MILU, ILUT,
! UMF, MUMPS, SLU, FWGS, BWGS, JAC ! UMF, MUMPS, SLU, FWGS, BWGS, JAC
character(len=16) :: variant2 ! AINV variant: LLK, etc integer(psb_ipk_) :: ssweeps2 ! inner solver sweeps
integer(psb_ipk_) :: fill2 ! fill-in for incomplete LU factorization character(len=16) :: variant2 ! AINV variant: LLK, etc
integer(psb_ipk_) :: invfill2 ! Inverse fill-in for INVK integer(psb_ipk_) :: fill2 ! fill-in for incomplete LU factorization
real(psb_dpk_) :: thr2 ! threshold for ILUT factorization integer(psb_ipk_) :: invfill2 ! Inverse fill-in for INVK
real(psb_dpk_) :: thr2 ! threshold for ILUT factorization
! coarsest-level solver ! coarsest-level solver
character(len=16) :: cmat ! coarsest matrix layout: REPL, DIST character(len=16) :: cmat ! coarsest matrix layout: REPL, DIST
character(len=16) :: csolve ! coarsest-lev solver: BJAC, SLUDIST (distr. character(len=16) :: csolve ! coarsest-lev solver: BJAC, SLUDIST (distr.
! mat.); UMF, MUMPS, SLU, ILU, ILUT, MILU ! mat.); UMF, MUMPS, SLU, ILU, ILUT, MILU
! (repl. mat.) ! (repl. mat.)
character(len=16) :: csbsolve ! coarsest-lev local subsolver: ILU, ILUT, character(len=16) :: csbsolve ! coarsest-lev local subsolver: ILU, ILUT,
! MILU, UMF, MUMPS, SLU ! MILU, UMF, MUMPS, SLU
integer(psb_ipk_) :: cfill ! fill-in for incomplete LU factorization integer(psb_ipk_) :: cfill ! fill-in for incomplete LU factorization
real(psb_dpk_) :: cthres ! threshold for ILUT factorization real(psb_dpk_) :: cthres ! threshold for ILUT factorization
integer(psb_ipk_) :: cjswp ! sweeps for GS or JAC coarsest-lev subsolver integer(psb_ipk_) :: cjswp ! sweeps for GS or JAC coarsest-lev subsolver
! Dump data ! Dump data
logical :: dump = .false. logical :: dump = .false.
integer(psb_ipk_) :: dlmin ! Minimum level to dump integer(psb_ipk_) :: dlmin ! Minimum level to dump
integer(psb_ipk_) :: dlmax ! Maximum level to dump integer(psb_ipk_) :: dlmax ! Maximum level to dump
logical :: dump_ac = .false. logical :: dump_ac = .false.
logical :: dump_rp = .false. logical :: dump_rp = .false.
logical :: dump_tprol = .false. logical :: dump_tprol = .false.
@ -286,10 +288,9 @@ program amg_d_pde3d
case ('BJAC') case ('BJAC')
call prec%set('smoother_sweeps', p_choice%jsweeps, info) call prec%set('smoother_sweeps', p_choice%jsweeps, info)
call prec%set('sub_solve', p_choice%solve, info) call prec%set('sub_solve', p_choice%solve, info)
call prec%set('solver_sweeps', p_choice%ssweeps, info)
if (psb_toupper(p_choice%solve)=='MUMPS') & if (psb_toupper(p_choice%solve)=='MUMPS') &
& call prec%set('mumps_loc_glob','local_solver',info) & call prec%set('mumps_loc_glob','local_solver',info)
if ((psb_toupper(p_choice%solve)=='JACOBI').or.(psb_toupper(p_choice%solve)=='L1-JACOBI')) &
& call prec%set('solver_sweeps',8,info)
call prec%set('sub_fillin', p_choice%fill, info) call prec%set('sub_fillin', p_choice%fill, info)
call prec%set('sub_iluthrs', p_choice%thr, info) call prec%set('sub_iluthrs', p_choice%thr, info)
@ -299,6 +300,7 @@ program amg_d_pde3d
call prec%set('sub_restr', p_choice%restr, info) call prec%set('sub_restr', p_choice%restr, info)
call prec%set('sub_prol', p_choice%prol, info) call prec%set('sub_prol', p_choice%prol, info)
call prec%set('sub_solve', p_choice%solve, info) call prec%set('sub_solve', p_choice%solve, info)
call prec%set('solver_sweeps', p_choice%ssweeps, info)
if (psb_toupper(p_choice%solve)=='MUMPS') & if (psb_toupper(p_choice%solve)=='MUMPS') &
& call prec%set('mumps_loc_glob','local_solver',info) & call prec%set('mumps_loc_glob','local_solver',info)
call prec%set('sub_fillin', p_choice%fill, info) call prec%set('sub_fillin', p_choice%fill, info)
@ -355,7 +357,7 @@ program amg_d_pde3d
if (psb_toupper(p_choice%solve)=='MUMPS') & if (psb_toupper(p_choice%solve)=='MUMPS') &
& call prec%set('mumps_loc_glob','local_solver',info) & call prec%set('mumps_loc_glob','local_solver',info)
end select end select
call prec%set('solver_sweeps', p_choice%ssweeps, info)
call prec%set('sub_fillin', p_choice%fill, info) call prec%set('sub_fillin', p_choice%fill, info)
call prec%set('inv_fillin', p_choice%invfill, info) call prec%set('inv_fillin', p_choice%invfill, info)
call prec%set('sub_iluthrs', p_choice%thr, info) call prec%set('sub_iluthrs', p_choice%thr, info)
@ -384,7 +386,7 @@ program amg_d_pde3d
if (psb_toupper(p_choice%solve2)=='MUMPS') & if (psb_toupper(p_choice%solve2)=='MUMPS') &
& call prec%set('mumps_loc_glob','local_solver',info) & call prec%set('mumps_loc_glob','local_solver',info)
end select end select
call prec%set('solver_sweeps', p_choice%ssweeps2, info,pos='post')
call prec%set('sub_fillin', p_choice%fill2, info,pos='post') call prec%set('sub_fillin', p_choice%fill2, info,pos='post')
call prec%set('inv_fillin', p_choice%invfill2, info,pos='post') call prec%set('inv_fillin', p_choice%invfill2, info,pos='post')
call prec%set('sub_iluthrs', p_choice%thr2, info,pos='post') call prec%set('sub_iluthrs', p_choice%thr2, info,pos='post')
@ -583,6 +585,7 @@ contains
call read_data(prec%restr,inp_unit) ! restriction over application of AS call read_data(prec%restr,inp_unit) ! restriction over application of AS
call read_data(prec%prol,inp_unit) ! prolongation over application of AS call read_data(prec%prol,inp_unit) ! prolongation over application of AS
call read_data(prec%solve,inp_unit) ! local subsolver call read_data(prec%solve,inp_unit) ! local subsolver
call read_data(prec%ssweeps,inp_unit) ! inner solver sweeps
call read_data(prec%variant,inp_unit) ! AINV variant call read_data(prec%variant,inp_unit) ! AINV variant
call read_data(prec%fill,inp_unit) ! fill-in for incomplete LU call read_data(prec%fill,inp_unit) ! fill-in for incomplete LU
call read_data(prec%invfill,inp_unit) !Inverse fill-in for INVK call read_data(prec%invfill,inp_unit) !Inverse fill-in for INVK
@ -594,6 +597,7 @@ contains
call read_data(prec%restr2,inp_unit) ! restriction over application of AS call read_data(prec%restr2,inp_unit) ! restriction over application of AS
call read_data(prec%prol2,inp_unit) ! prolongation over application of AS call read_data(prec%prol2,inp_unit) ! prolongation over application of AS
call read_data(prec%solve2,inp_unit) ! local subsolver call read_data(prec%solve2,inp_unit) ! local subsolver
call read_data(prec%ssweeps2,inp_unit) ! inner solver sweeps
call read_data(prec%variant2,inp_unit) ! AINV variant call read_data(prec%variant2,inp_unit) ! AINV variant
call read_data(prec%fill2,inp_unit) ! fill-in for incomplete LU call read_data(prec%fill2,inp_unit) ! fill-in for incomplete LU
call read_data(prec%invfill2,inp_unit) !Inverse fill-in for INVK call read_data(prec%invfill2,inp_unit) !Inverse fill-in for INVK
@ -663,6 +667,7 @@ contains
call psb_bcast(ctxt,prec%restr) call psb_bcast(ctxt,prec%restr)
call psb_bcast(ctxt,prec%prol) call psb_bcast(ctxt,prec%prol)
call psb_bcast(ctxt,prec%solve) call psb_bcast(ctxt,prec%solve)
call psb_bcast(ctxt,prec%ssweeps)
call psb_bcast(ctxt,prec%variant) call psb_bcast(ctxt,prec%variant)
call psb_bcast(ctxt,prec%fill) call psb_bcast(ctxt,prec%fill)
call psb_bcast(ctxt,prec%invfill) call psb_bcast(ctxt,prec%invfill)
@ -674,6 +679,7 @@ contains
call psb_bcast(ctxt,prec%restr2) call psb_bcast(ctxt,prec%restr2)
call psb_bcast(ctxt,prec%prol2) call psb_bcast(ctxt,prec%prol2)
call psb_bcast(ctxt,prec%solve2) call psb_bcast(ctxt,prec%solve2)
call psb_bcast(ctxt,prec%ssweeps2)
call psb_bcast(ctxt,prec%variant2) call psb_bcast(ctxt,prec%variant2)
call psb_bcast(ctxt,prec%fill2) call psb_bcast(ctxt,prec%fill2)
call psb_bcast(ctxt,prec%invfill2) call psb_bcast(ctxt,prec%invfill2)

56
samples/advanced/pdegen/amg_s_pde2d.F90
Unescape Escape View File

@ -141,30 +141,32 @@ program amg_s_pde2d
integer(psb_ipk_) :: csizepp ! minimum size of coarsest matrix per process integer(psb_ipk_) :: csizepp ! minimum size of coarsest matrix per process
! AMG smoother or pre-smoother; also 1-lev preconditioner ! AMG smoother or pre-smoother; also 1-lev preconditioner
character(len=16) :: smther ! (pre-)smoother type: BJAC, AS character(len=16) :: smther ! (pre-)smoother type: BJAC, AS
integer(psb_ipk_) :: jsweeps ! (pre-)smoother / 1-lev prec. sweeps integer(psb_ipk_) :: jsweeps ! (pre-)smoother / 1-lev prec. sweeps
integer(psb_ipk_) :: novr ! number of overlap layers integer(psb_ipk_) :: novr ! number of overlap layers
character(len=16) :: restr ! restriction over application of AS character(len=16) :: restr ! restriction over application of AS
character(len=16) :: prol ! prolongation over application of AS character(len=16) :: prol ! prolongation over application of AS
character(len=16) :: solve ! local subsolver type: ILU, MILU, ILUT, character(len=16) :: solve ! local subsolver type: ILU, MILU, ILUT,
! UMF, MUMPS, SLU, FWGS, BWGS, JAC ! UMF, MUMPS, SLU, FWGS, BWGS, JAC
character(len=16) :: variant ! AINV variant: LLK, etc integer(psb_ipk_) :: ssweeps ! inner solver sweeps
integer(psb_ipk_) :: fill ! fill-in for incomplete LU factorization character(len=16) :: variant ! AINV variant: LLK, etc
integer(psb_ipk_) :: invfill ! Inverse fill-in for INVK integer(psb_ipk_) :: fill ! fill-in for incomplete LU factorization
real(psb_spk_) :: thr ! threshold for ILUT factorization integer(psb_ipk_) :: invfill ! Inverse fill-in for INVK
real(psb_spk_) :: thr ! threshold for ILUT factorization
! AMG post-smoother; ignored by 1-lev preconditioner ! AMG post-smoother; ignored by 1-lev preconditioner
character(len=16) :: smther2 ! post-smoother type: BJAC, AS character(len=16) :: smther2 ! post-smoother type: BJAC, AS
integer(psb_ipk_) :: jsweeps2 ! post-smoother sweeps integer(psb_ipk_) :: jsweeps2 ! post-smoother sweeps
integer(psb_ipk_) :: novr2 ! number of overlap layers integer(psb_ipk_) :: novr2 ! number of overlap layers
character(len=16) :: restr2 ! restriction over application of AS character(len=16) :: restr2 ! restriction over application of AS
character(len=16) :: prol2 ! prolongation over application of AS character(len=16) :: prol2 ! prolongation over application of AS
character(len=16) :: solve2 ! local subsolver type: ILU, MILU, ILUT, character(len=16) :: solve2 ! local subsolver type: ILU, MILU, ILUT,
! UMF, MUMPS, SLU, FWGS, BWGS, JAC ! UMF, MUMPS, SLU, FWGS, BWGS, JAC
character(len=16) :: variant2 ! AINV variant: LLK, etc integer(psb_ipk_) :: ssweeps2 ! inner solver sweeps
integer(psb_ipk_) :: fill2 ! fill-in for incomplete LU factorization character(len=16) :: variant2 ! AINV variant: LLK, etc
integer(psb_ipk_) :: invfill2 ! Inverse fill-in for INVK integer(psb_ipk_) :: fill2 ! fill-in for incomplete LU factorization
real(psb_spk_) :: thr2 ! threshold for ILUT factorization integer(psb_ipk_) :: invfill2 ! Inverse fill-in for INVK
real(psb_spk_) :: thr2 ! threshold for ILUT factorization
! coarsest-level solver ! coarsest-level solver
character(len=16) :: cmat ! coarsest matrix layout: REPL, DIST character(len=16) :: cmat ! coarsest matrix layout: REPL, DIST
@ -282,6 +284,7 @@ program amg_s_pde2d
case ('BJAC') case ('BJAC')
call prec%set('smoother_sweeps', p_choice%jsweeps, info) call prec%set('smoother_sweeps', p_choice%jsweeps, info)
call prec%set('sub_solve', p_choice%solve, info) call prec%set('sub_solve', p_choice%solve, info)
call prec%set('solver_sweeps', p_choice%ssweeps, info)
if (psb_toupper(p_choice%solve)=='MUMPS') & if (psb_toupper(p_choice%solve)=='MUMPS') &
& call prec%set('mumps_loc_glob','local_solver',info) & call prec%set('mumps_loc_glob','local_solver',info)
call prec%set('sub_fillin', p_choice%fill, info) call prec%set('sub_fillin', p_choice%fill, info)
@ -293,6 +296,7 @@ program amg_s_pde2d
call prec%set('sub_restr', p_choice%restr, info) call prec%set('sub_restr', p_choice%restr, info)
call prec%set('sub_prol', p_choice%prol, info) call prec%set('sub_prol', p_choice%prol, info)
call prec%set('sub_solve', p_choice%solve, info) call prec%set('sub_solve', p_choice%solve, info)
call prec%set('solver_sweeps', p_choice%ssweeps, info)
if (psb_toupper(p_choice%solve)=='MUMPS') & if (psb_toupper(p_choice%solve)=='MUMPS') &
& call prec%set('mumps_loc_glob','local_solver',info) & call prec%set('mumps_loc_glob','local_solver',info)
call prec%set('sub_fillin', p_choice%fill, info) call prec%set('sub_fillin', p_choice%fill, info)
@ -349,7 +353,7 @@ program amg_s_pde2d
if (psb_toupper(p_choice%solve)=='MUMPS') & if (psb_toupper(p_choice%solve)=='MUMPS') &
& call prec%set('mumps_loc_glob','local_solver',info) & call prec%set('mumps_loc_glob','local_solver',info)
end select end select
call prec%set('solver_sweeps', p_choice%ssweeps, info)
call prec%set('sub_fillin', p_choice%fill, info) call prec%set('sub_fillin', p_choice%fill, info)
call prec%set('inv_fillin', p_choice%invfill, info) call prec%set('inv_fillin', p_choice%invfill, info)
call prec%set('sub_iluthrs', p_choice%thr, info) call prec%set('sub_iluthrs', p_choice%thr, info)
@ -378,7 +382,7 @@ program amg_s_pde2d
if (psb_toupper(p_choice%solve2)=='MUMPS') & if (psb_toupper(p_choice%solve2)=='MUMPS') &
& call prec%set('mumps_loc_glob','local_solver',info) & call prec%set('mumps_loc_glob','local_solver',info)
end select end select
call prec%set('solver_sweeps', p_choice%ssweeps2, info,pos='post')
call prec%set('sub_fillin', p_choice%fill2, info,pos='post') call prec%set('sub_fillin', p_choice%fill2, info,pos='post')
call prec%set('inv_fillin', p_choice%invfill2, info,pos='post') call prec%set('inv_fillin', p_choice%invfill2, info,pos='post')
call prec%set('sub_iluthrs', p_choice%thr2, info,pos='post') call prec%set('sub_iluthrs', p_choice%thr2, info,pos='post')
@ -577,6 +581,7 @@ contains
call read_data(prec%restr,inp_unit) ! restriction over application of AS call read_data(prec%restr,inp_unit) ! restriction over application of AS
call read_data(prec%prol,inp_unit) ! prolongation over application of AS call read_data(prec%prol,inp_unit) ! prolongation over application of AS
call read_data(prec%solve,inp_unit) ! local subsolver call read_data(prec%solve,inp_unit) ! local subsolver
call read_data(prec%ssweeps,inp_unit) ! inner solver sweeps
call read_data(prec%variant,inp_unit) ! AINV variant call read_data(prec%variant,inp_unit) ! AINV variant
call read_data(prec%fill,inp_unit) ! fill-in for incomplete LU call read_data(prec%fill,inp_unit) ! fill-in for incomplete LU
call read_data(prec%invfill,inp_unit) !Inverse fill-in for INVK call read_data(prec%invfill,inp_unit) !Inverse fill-in for INVK
@ -588,6 +593,7 @@ contains
call read_data(prec%restr2,inp_unit) ! restriction over application of AS call read_data(prec%restr2,inp_unit) ! restriction over application of AS
call read_data(prec%prol2,inp_unit) ! prolongation over application of AS call read_data(prec%prol2,inp_unit) ! prolongation over application of AS
call read_data(prec%solve2,inp_unit) ! local subsolver call read_data(prec%solve2,inp_unit) ! local subsolver
call read_data(prec%ssweeps2,inp_unit) ! inner solver sweeps
call read_data(prec%variant2,inp_unit) ! AINV variant call read_data(prec%variant2,inp_unit) ! AINV variant
call read_data(prec%fill2,inp_unit) ! fill-in for incomplete LU call read_data(prec%fill2,inp_unit) ! fill-in for incomplete LU
call read_data(prec%invfill2,inp_unit) !Inverse fill-in for INVK call read_data(prec%invfill2,inp_unit) !Inverse fill-in for INVK
@ -657,6 +663,7 @@ contains
call psb_bcast(ctxt,prec%restr) call psb_bcast(ctxt,prec%restr)
call psb_bcast(ctxt,prec%prol) call psb_bcast(ctxt,prec%prol)
call psb_bcast(ctxt,prec%solve) call psb_bcast(ctxt,prec%solve)
call psb_bcast(ctxt,prec%ssweeps)
call psb_bcast(ctxt,prec%variant) call psb_bcast(ctxt,prec%variant)
call psb_bcast(ctxt,prec%fill) call psb_bcast(ctxt,prec%fill)
call psb_bcast(ctxt,prec%invfill) call psb_bcast(ctxt,prec%invfill)
@ -668,6 +675,7 @@ contains
call psb_bcast(ctxt,prec%restr2) call psb_bcast(ctxt,prec%restr2)
call psb_bcast(ctxt,prec%prol2) call psb_bcast(ctxt,prec%prol2)
call psb_bcast(ctxt,prec%solve2) call psb_bcast(ctxt,prec%solve2)
call psb_bcast(ctxt,prec%ssweeps2)
call psb_bcast(ctxt,prec%variant2) call psb_bcast(ctxt,prec%variant2)
call psb_bcast(ctxt,prec%fill2) call psb_bcast(ctxt,prec%fill2)
call psb_bcast(ctxt,prec%invfill2) call psb_bcast(ctxt,prec%invfill2)

96
samples/advanced/pdegen/amg_s_pde3d.F90
Unescape Escape View File

@ -126,62 +126,64 @@ program amg_s_pde3d
! AMG cycles for ML ! AMG cycles for ML
! general AMG data ! general AMG data
character(len=16) :: mlcycle ! AMG cycle type character(len=16) :: mlcycle ! AMG cycle type
integer(psb_ipk_) :: maxlevs ! maximum number of levels in AMG preconditioner integer(psb_ipk_) :: maxlevs ! maximum number of levels in AMG preconditioner
! AMG aggregation ! AMG aggregation
character(len=16) :: aggr_prol ! aggregation type: SMOOTHED, NONSMOOTHED character(len=16) :: aggr_prol ! aggregation type: SMOOTHED, NONSMOOTHED
character(len=16) :: par_aggr_alg ! parallel aggregation algorithm: DEC, SYMDEC character(len=16) :: par_aggr_alg ! parallel aggregation algorithm: DEC, SYMDEC
character(len=16) :: aggr_type ! Type of aggregation SOC1, SOC2, MATCHBOXP character(len=16) :: aggr_type ! Type of aggregation SOC1, SOC2, MATCHBOXP
integer(psb_ipk_) :: aggr_size ! Requested size of the aggregates for MATCHBOXP integer(psb_ipk_) :: aggr_size ! Requested size of the aggregates for MATCHBOXP
character(len=16) :: aggr_ord ! ordering for aggregation: NATURAL, DEGREE character(len=16) :: aggr_ord ! ordering for aggregation: NATURAL, DEGREE
character(len=16) :: aggr_filter ! filtering: FILTER, NO_FILTER character(len=16) :: aggr_filter ! filtering: FILTER, NO_FILTER
real(psb_spk_) :: mncrratio ! minimum aggregation ratio real(psb_spk_) :: mncrratio ! minimum aggregation ratio
real(psb_spk_), allocatable :: athresv(:) ! smoothed aggregation threshold vector real(psb_spk_), allocatable :: athresv(:) ! smoothed aggregation threshold vector
integer(psb_ipk_) :: thrvsz ! size of threshold vector integer(psb_ipk_) :: thrvsz ! size of threshold vector
real(psb_spk_) :: athres ! smoothed aggregation threshold real(psb_spk_) :: athres ! smoothed aggregation threshold
integer(psb_ipk_) :: csizepp ! minimum size of coarsest matrix per process integer(psb_ipk_) :: csizepp ! minimum size of coarsest matrix per process
! AMG smoother or pre-smoother; also 1-lev preconditioner ! AMG smoother or pre-smoother; also 1-lev preconditioner
character(len=16) :: smther ! (pre-)smoother type: BJAC, AS character(len=16) :: smther ! (pre-)smoother type: BJAC, AS
integer(psb_ipk_) :: jsweeps ! (pre-)smoother / 1-lev prec. sweeps integer(psb_ipk_) :: jsweeps ! (pre-)smoother / 1-lev prec. sweeps
integer(psb_ipk_) :: novr ! number of overlap layers integer(psb_ipk_) :: novr ! number of overlap layers
character(len=16) :: restr ! restriction over application of AS character(len=16) :: restr ! restriction over application of AS
character(len=16) :: prol ! prolongation over application of AS character(len=16) :: prol ! prolongation over application of AS
character(len=16) :: solve ! local subsolver type: ILU, MILU, ILUT, character(len=16) :: solve ! local subsolver type: ILU, MILU, ILUT,
! UMF, MUMPS, SLU, FWGS, BWGS, JAC ! UMF, MUMPS, SLU, FWGS, BWGS, JAC
character(len=16) :: variant ! AINV variant: LLK, etc integer(psb_ipk_) :: ssweeps ! inner solver sweeps
integer(psb_ipk_) :: fill ! fill-in for incomplete LU factorization character(len=16) :: variant ! AINV variant: LLK, etc
integer(psb_ipk_) :: invfill ! Inverse fill-in for INVK integer(psb_ipk_) :: fill ! fill-in for incomplete LU factorization
real(psb_spk_) :: thr ! threshold for ILUT factorization integer(psb_ipk_) :: invfill ! Inverse fill-in for INVK
real(psb_spk_) :: thr ! threshold for ILUT factorization
! AMG post-smoother; ignored by 1-lev preconditioner ! AMG post-smoother; ignored by 1-lev preconditioner
character(len=16) :: smther2 ! post-smoother type: BJAC, AS character(len=16) :: smther2 ! post-smoother type: BJAC, AS
integer(psb_ipk_) :: jsweeps2 ! post-smoother sweeps integer(psb_ipk_) :: jsweeps2 ! post-smoother sweeps
integer(psb_ipk_) :: novr2 ! number of overlap layers integer(psb_ipk_) :: novr2 ! number of overlap layers
character(len=16) :: restr2 ! restriction over application of AS character(len=16) :: restr2 ! restriction over application of AS
character(len=16) :: prol2 ! prolongation over application of AS character(len=16) :: prol2 ! prolongation over application of AS
character(len=16) :: solve2 ! local subsolver type: ILU, MILU, ILUT, character(len=16) :: solve2 ! local subsolver type: ILU, MILU, ILUT,
! UMF, MUMPS, SLU, FWGS, BWGS, JAC ! UMF, MUMPS, SLU, FWGS, BWGS, JAC
character(len=16) :: variant2 ! AINV variant: LLK, etc integer(psb_ipk_) :: ssweeps2 ! inner solver sweeps
integer(psb_ipk_) :: fill2 ! fill-in for incomplete LU factorization character(len=16) :: variant2 ! AINV variant: LLK, etc
integer(psb_ipk_) :: invfill2 ! Inverse fill-in for INVK integer(psb_ipk_) :: fill2 ! fill-in for incomplete LU factorization
real(psb_spk_) :: thr2 ! threshold for ILUT factorization integer(psb_ipk_) :: invfill2 ! Inverse fill-in for INVK
real(psb_spk_) :: thr2 ! threshold for ILUT factorization
! coarsest-level solver ! coarsest-level solver
character(len=16) :: cmat ! coarsest matrix layout: REPL, DIST character(len=16) :: cmat ! coarsest matrix layout: REPL, DIST
character(len=16) :: csolve ! coarsest-lev solver: BJAC, SLUDIST (distr. character(len=16) :: csolve ! coarsest-lev solver: BJAC, SLUDIST (distr.
! mat.); UMF, MUMPS, SLU, ILU, ILUT, MILU ! mat.); UMF, MUMPS, SLU, ILU, ILUT, MILU
! (repl. mat.) ! (repl. mat.)
character(len=16) :: csbsolve ! coarsest-lev local subsolver: ILU, ILUT, character(len=16) :: csbsolve ! coarsest-lev local subsolver: ILU, ILUT,
! MILU, UMF, MUMPS, SLU ! MILU, UMF, MUMPS, SLU
integer(psb_ipk_) :: cfill ! fill-in for incomplete LU factorization integer(psb_ipk_) :: cfill ! fill-in for incomplete LU factorization
real(psb_spk_) :: cthres ! threshold for ILUT factorization real(psb_spk_) :: cthres ! threshold for ILUT factorization
integer(psb_ipk_) :: cjswp ! sweeps for GS or JAC coarsest-lev subsolver integer(psb_ipk_) :: cjswp ! sweeps for GS or JAC coarsest-lev subsolver
! Dump data ! Dump data
logical :: dump = .false. logical :: dump = .false.
integer(psb_ipk_) :: dlmin ! Minimum level to dump integer(psb_ipk_) :: dlmin ! Minimum level to dump
integer(psb_ipk_) :: dlmax ! Maximum level to dump integer(psb_ipk_) :: dlmax ! Maximum level to dump
logical :: dump_ac = .false. logical :: dump_ac = .false.
logical :: dump_rp = .false. logical :: dump_rp = .false.
logical :: dump_tprol = .false. logical :: dump_tprol = .false.
@ -286,6 +288,7 @@ program amg_s_pde3d
case ('BJAC') case ('BJAC')
call prec%set('smoother_sweeps', p_choice%jsweeps, info) call prec%set('smoother_sweeps', p_choice%jsweeps, info)
call prec%set('sub_solve', p_choice%solve, info) call prec%set('sub_solve', p_choice%solve, info)
call prec%set('solver_sweeps', p_choice%ssweeps, info)
if (psb_toupper(p_choice%solve)=='MUMPS') & if (psb_toupper(p_choice%solve)=='MUMPS') &
& call prec%set('mumps_loc_glob','local_solver',info) & call prec%set('mumps_loc_glob','local_solver',info)
call prec%set('sub_fillin', p_choice%fill, info) call prec%set('sub_fillin', p_choice%fill, info)
@ -297,6 +300,7 @@ program amg_s_pde3d
call prec%set('sub_restr', p_choice%restr, info) call prec%set('sub_restr', p_choice%restr, info)
call prec%set('sub_prol', p_choice%prol, info) call prec%set('sub_prol', p_choice%prol, info)
call prec%set('sub_solve', p_choice%solve, info) call prec%set('sub_solve', p_choice%solve, info)
call prec%set('solver_sweeps', p_choice%ssweeps, info)
if (psb_toupper(p_choice%solve)=='MUMPS') & if (psb_toupper(p_choice%solve)=='MUMPS') &
& call prec%set('mumps_loc_glob','local_solver',info) & call prec%set('mumps_loc_glob','local_solver',info)
call prec%set('sub_fillin', p_choice%fill, info) call prec%set('sub_fillin', p_choice%fill, info)
@ -353,7 +357,7 @@ program amg_s_pde3d
if (psb_toupper(p_choice%solve)=='MUMPS') & if (psb_toupper(p_choice%solve)=='MUMPS') &
& call prec%set('mumps_loc_glob','local_solver',info) & call prec%set('mumps_loc_glob','local_solver',info)
end select end select
call prec%set('solver_sweeps', p_choice%ssweeps, info)
call prec%set('sub_fillin', p_choice%fill, info) call prec%set('sub_fillin', p_choice%fill, info)
call prec%set('inv_fillin', p_choice%invfill, info) call prec%set('inv_fillin', p_choice%invfill, info)
call prec%set('sub_iluthrs', p_choice%thr, info) call prec%set('sub_iluthrs', p_choice%thr, info)
@ -382,7 +386,7 @@ program amg_s_pde3d
if (psb_toupper(p_choice%solve2)=='MUMPS') & if (psb_toupper(p_choice%solve2)=='MUMPS') &
& call prec%set('mumps_loc_glob','local_solver',info) & call prec%set('mumps_loc_glob','local_solver',info)
end select end select
call prec%set('solver_sweeps', p_choice%ssweeps2, info,pos='post')
call prec%set('sub_fillin', p_choice%fill2, info,pos='post') call prec%set('sub_fillin', p_choice%fill2, info,pos='post')
call prec%set('inv_fillin', p_choice%invfill2, info,pos='post') call prec%set('inv_fillin', p_choice%invfill2, info,pos='post')
call prec%set('sub_iluthrs', p_choice%thr2, info,pos='post') call prec%set('sub_iluthrs', p_choice%thr2, info,pos='post')
@ -581,6 +585,7 @@ contains
call read_data(prec%restr,inp_unit) ! restriction over application of AS call read_data(prec%restr,inp_unit) ! restriction over application of AS
call read_data(prec%prol,inp_unit) ! prolongation over application of AS call read_data(prec%prol,inp_unit) ! prolongation over application of AS
call read_data(prec%solve,inp_unit) ! local subsolver call read_data(prec%solve,inp_unit) ! local subsolver
call read_data(prec%ssweeps,inp_unit) ! inner solver sweeps
call read_data(prec%variant,inp_unit) ! AINV variant call read_data(prec%variant,inp_unit) ! AINV variant
call read_data(prec%fill,inp_unit) ! fill-in for incomplete LU call read_data(prec%fill,inp_unit) ! fill-in for incomplete LU
call read_data(prec%invfill,inp_unit) !Inverse fill-in for INVK call read_data(prec%invfill,inp_unit) !Inverse fill-in for INVK
@ -592,6 +597,7 @@ contains
call read_data(prec%restr2,inp_unit) ! restriction over application of AS call read_data(prec%restr2,inp_unit) ! restriction over application of AS
call read_data(prec%prol2,inp_unit) ! prolongation over application of AS call read_data(prec%prol2,inp_unit) ! prolongation over application of AS
call read_data(prec%solve2,inp_unit) ! local subsolver call read_data(prec%solve2,inp_unit) ! local subsolver
call read_data(prec%ssweeps2,inp_unit) ! inner solver sweeps
call read_data(prec%variant2,inp_unit) ! AINV variant call read_data(prec%variant2,inp_unit) ! AINV variant
call read_data(prec%fill2,inp_unit) ! fill-in for incomplete LU call read_data(prec%fill2,inp_unit) ! fill-in for incomplete LU
call read_data(prec%invfill2,inp_unit) !Inverse fill-in for INVK call read_data(prec%invfill2,inp_unit) !Inverse fill-in for INVK
@ -661,6 +667,7 @@ contains
call psb_bcast(ctxt,prec%restr) call psb_bcast(ctxt,prec%restr)
call psb_bcast(ctxt,prec%prol) call psb_bcast(ctxt,prec%prol)
call psb_bcast(ctxt,prec%solve) call psb_bcast(ctxt,prec%solve)
call psb_bcast(ctxt,prec%ssweeps)
call psb_bcast(ctxt,prec%variant) call psb_bcast(ctxt,prec%variant)
call psb_bcast(ctxt,prec%fill) call psb_bcast(ctxt,prec%fill)
call psb_bcast(ctxt,prec%invfill) call psb_bcast(ctxt,prec%invfill)
@ -672,6 +679,7 @@ contains
call psb_bcast(ctxt,prec%restr2) call psb_bcast(ctxt,prec%restr2)
call psb_bcast(ctxt,prec%prol2) call psb_bcast(ctxt,prec%prol2)
call psb_bcast(ctxt,prec%solve2) call psb_bcast(ctxt,prec%solve2)
call psb_bcast(ctxt,prec%ssweeps2)
call psb_bcast(ctxt,prec%variant2) call psb_bcast(ctxt,prec%variant2)
call psb_bcast(ctxt,prec%fill2) call psb_bcast(ctxt,prec%fill2)
call psb_bcast(ctxt,prec%invfill2) call psb_bcast(ctxt,prec%invfill2)

2
samples/advanced/pdegen/runs/amg_pde2d.inp
Unescape Escape View File

@ -18,6 +18,7 @@ BJAC ! Smoother type JACOBI FBGS GS BWGS BJAC AS. For 1-l
HALO ! AS restriction operator: NONE HALO HALO ! AS restriction operator: NONE HALO
NONE ! AS prolongation operator: NONE SUM AVG NONE ! AS prolongation operator: NONE SUM AVG
ILU ! Subdomain solver for BJAC/AS: JACOBI GS BGS ILU ILUT MILU MUMPS SLU UMF ILU ! Subdomain solver for BJAC/AS: JACOBI GS BGS ILU ILUT MILU MUMPS SLU UMF
8 ! Inner solver sweeps (GS and JACOBI)
LLK ! AINV variant, ignored otherwise LLK ! AINV variant, ignored otherwise
0 ! Fill level P for ILU(P) and ILU(T,P) 0 ! Fill level P for ILU(P) and ILU(T,P)
1 ! Inverse Fill level P for INVK 1 ! Inverse Fill level P for INVK
@ -29,6 +30,7 @@ NONE ! Second (post) smoother, ignored if NONE
HALO ! AS restriction operator: NONE HALO HALO ! AS restriction operator: NONE HALO
NONE ! AS prolongation operator: NONE SUM AVG NONE ! AS prolongation operator: NONE SUM AVG
ILU ! Subdomain solver for BJAC/AS: JACOBI GS BGS ILU ILUT MILU MUMPS SLU UMF ILU ! Subdomain solver for BJAC/AS: JACOBI GS BGS ILU ILUT MILU MUMPS SLU UMF
8 ! Inner solver sweeps (GS and JACOBI)
LLK ! AINV variant, ignored otherwise LLK ! AINV variant, ignored otherwise
0 ! Fill level P for ILU(P) and ILU(T,P) 0 ! Fill level P for ILU(P) and ILU(T,P)
8 ! Inverse Fill level P for INVK 8 ! Inverse Fill level P for INVK

2
samples/advanced/pdegen/runs/amg_pde3d.inp
Unescape Escape View File

@ -18,6 +18,7 @@ BJAC ! Smoother type JACOBI FBGS GS BWGS BJAC AS. For 1-l
HALO ! AS restriction operator: NONE HALO HALO ! AS restriction operator: NONE HALO
NONE ! AS prolongation operator: NONE SUM AVG NONE ! AS prolongation operator: NONE SUM AVG
JACOBI ! Subdomain solver for BJAC/AS: JACOBI GS BGS ILU ILUT MILU MUMPS SLU UMF JACOBI ! Subdomain solver for BJAC/AS: JACOBI GS BGS ILU ILUT MILU MUMPS SLU UMF
8 ! Inner solver sweeps (GS and JACOBI)
LLK ! AINV variant LLK ! AINV variant
0 ! Fill level P for ILU(P) and ILU(T,P) 0 ! Fill level P for ILU(P) and ILU(T,P)
1 ! Inverse Fill level P for INVK 1 ! Inverse Fill level P for INVK
@ -29,6 +30,7 @@ NONE ! Second (post) smoother, ignored if NONE
HALO ! AS restriction operator: NONE HALO HALO ! AS restriction operator: NONE HALO
NONE ! AS prolongation operator: NONE SUM AVG NONE ! AS prolongation operator: NONE SUM AVG
ILU ! Subdomain solver for BJAC/AS: JACOBI GS BGS ILU ILUT MILU MUMPS SLU UMF ILU ! Subdomain solver for BJAC/AS: JACOBI GS BGS ILU ILUT MILU MUMPS SLU UMF
8 ! Inner solver sweeps (GS and JACOBI)
LLK ! AINV variant LLK ! AINV variant
0 ! Fill level P for ILU(P) and ILU(T,P) 0 ! Fill level P for ILU(P) and ILU(T,P)
8 ! Inverse Fill level P for INVK 8 ! Inverse Fill level P for INVK

Write Preview
Loading…
Cancel
Save