cments
’MIN_COARSE_SIZE_PER_PROCESS’
Any number
> 0
200
Coarse size threshold per process. The -aggregation stops if the global number of -variables of the computed coarsest matrix -is lower than or equal to this threshold -multiplied by the number of processes -(see Note).
200
Coarse size threshold per process. The +aggregation stops if the global number +of variables of the computed coarsest +matrix is lower than or equal to this +threshold multiplied by the number of +processes (see Note).
Any number
> 0
-1
Coarse size threshold. The aggregation
-stops if the global number of variables
-of the computed coarsest matrix is lower
-than or equal
-to this threshold (see Note). If negative,
-it is ignored in favour of the default for
-’MIN_COARSE_SIZE_PER_PROCESS’.
-1
Coarse size threshold. The aggregation
+stops if the global number of variables
+of the computed coarsest matrix
+is lower than or equal to this
+threshold (see Note). If negative, it is
+ignored in favour of the default for
+’MIN_COARSE_SIZE_PER_PROCESS’.
Any number
> 1
1.5
Minimum coarsening -ratio. The aggregation stops if the ratio -between the global matrix dimensions at -two consecutive levels is lower than or -equal to this threshold (see Note).
1.5
Minimum coarsening ratio. The +aggregation stops if the ratio between +the global matrix dimensions at two +consecutive levels is lower than or +equal to this threshold (see Note).
Any integer
number > 1
20
Maximum number of levels. The -aggregation stops if the number of levels -reaches this value (see Note).
20
Maximum number of levels. The +aggregation stops if the number of +levels reaches this value (see Note).
’PAR_AGGR_ALG’
character(len=*)
’DEC’, +class="cmtt-10x-x-109">’DECOUPLED’, ’SYMDEC’, ’COUPLED’
’DEC’
Parallel aggregation algorithm. -
the SYMDEC option applies decoupled
-aggregation to the sparsity pattern of
+
the SYMDEC option applies decoupled
+aggregation to the sparsity pattern of
A + AT .
’SOC1’,
’SOC2’,
’MATCHBOXP’
’SOC1’
Type of aggregation algorithm: currently, -for the -decoupled aggregation we implement two -measures of strength of connection, the -one by Vaněk, Mandel and Brezina [35], -and the one by Gratton et al [24]. The -coupled aggregation is based on a parallel -version of the half-approximate matching -implemented in the MatchBox-P software -package [9].
’SOC1’
Type +of aggregation algorithm: currently, +for the decoupled aggregation we +implement two measures of strength +of connection, the one by Vaněk, +Mandel and Brezina [35], and the one +by Gratton et al [24]. The coupled +aggregation is based on a parallel +version of the half-approximate +matching implemented in the +MatchBox-P software package [9].
4
Maximum size of aggregates when the -coupled aggregation based on matching -is applied. For aggressive coarsening -with size of aggregate larger than 8 -we recommend the use of smoothed -prolongators. Used only with ’COUPLED’ -and ’MATCHBOXP’
4
Maximum size of aggregates when +the coupled aggregation based on +matching is applied. For aggressive +coarsening with size of aggregate +larger than 8 we recommend the use +of smoothed prolongators. Used only +with ’COUPLED’ and ’MATCHBOXP’
character(len=*)
’SMOOTHED’,
’UNSMOOTHED’
’SMOOTHED’
Prolongator used by the aggregation -algorithm: smoothed or unsmoothed (i.e., -tentative prolongator).
’SMOOTHED’
Prolongator used by the aggregation +algorithm: smoothed or unsmoothed +(i.e., tentative prolongator).
’COARSE_SUBSOLVE’
character(len=*)
’ILU’
-
’ILUT’
-
’MILU’
-
’MUMPS’
-
’SLU’
-
’UMF’
-
’INVT’
-
’INVK’
-
’AINV’
See Note.
Solver for the diagonal blocks of the coarsest +
’ILUT’
+
’MILU’
+
’MUMPS’
+
’SLU’
+
’SLUDIST’
+
’UMF’
+
’INVT’
+
’INVK’
+
’AINV’
See Note.
Solver for the diagonal blocks of the coarsest matrix, in case the block Jacobi solver is chosen as coarsest-level solver: ILU(p), ILU(ILU otherwise.
what
what
val
val
deault
cos
’COARSE_SWEEPS’
integer
Any +class="td11">
’COARSE_SWEEPS’
integer
Any integer -
number > 0
10
Number of sweeps when JACOBI, GS or BJAC is
+class="td11">
10
Number of sweeps when JACOBI, GS or BJAC is
chosen as coarsest-level solver.
’COARSE_FILLIN’
integer
Any +class="td11">
’COARSE_FILLIN’
integer
Any integer -
number ≥ 0
0
Fill-in level 0
Fill-in level p of the ILU factorizations and first fill-in for the approximate inverses.
’COARSE_ILUTHRS’
real(kind_parameter)
Any real -
number ’COARSE_ILUTHRS’
real(kind_parameter)
Any real +number ≥ 0
0
Drop tolerance 0
Drop tolerance t in the ILU(p,t) factorization and first drop-tolerance for the approximate inverses.
+
@@ -1352,7 +1354,7 @@ id="TBL-8-4"> deault cots character(len=*) Select whether to use a stopping criterion for
+class="td11"> character(len=*) Select whether to use a stopping criterion for
the Block-Jacobi method used as a coarse
solver. character(len=*) Select whether to print a trace for the
+class="td11"> character(len=*) Select whether to print a trace for the
calculated residual for the Block-Jacobi
method used as a coarse solver. integer Any integer
- integer Any integer
+ > 0 -1 Number of iterations after which a trace is to
+class="td11"> -1 Number of iterations after which a trace is to
be printed. integer Any integer
- integer Any integer
+ > 0 -1 Number of iterations after which a residual is
+class="td11"> -1 Number of iterations after which a residual is
to be calculated. real(kind_parameter) Any real
- real(kind_parameter) Any real
+ < 1 0 Tolerance for the stopping criterion on the
+class="td11"> 0 Tolerance for the stopping criterion on the
residual. character(len=*) A string that defines the iterative method to
+class="td11"> character(len=*) A string that defines the iterative method to
be used when employing a Krylov method
character(len=*) Table character(len=*) Table 1 The one-level
+class="td11"> The one-level
preconditioners from the Table 1 can be used
for the coarse Krylov solver. character(len=*) Table character(len=*) Table 5 Solver for the diagonal blocks of the coarsest
+class="td11"> Solver for the diagonal blocks of the coarsest
matrix preconditioner, in case the block Jacobi
solver is chosen
as character(len=*) character(len=*) Choose between a global Krylov solver, all
+class="td11"> Choose between a global Krylov solver, all
unknowns on a single node, or a distributed
one. The default choice is the distributed
solver. real(kind_parameter) Real real(kind_parameter) Real < 1 10 10-6 The stopping tolerance. The stopping tolerance.
integer Integer
- integer Integer
+ ≥ 1 30 An integer specifying the restart parameter.
+class="td11"> 30 An integer specifying the restart parameter.
This is employed for the BiCGSTABL or RGMRES
@@ -1558,12 +1560,12 @@ methods, otherwise it is ignored. integer Integers
+class="td11"> integer Integers
1,2,3 2 If 2 If 1 then the method uses the normwise
backward error in the infinity norm; if 2, the
@@ -1576,24 +1578,24 @@ for the details. integer Integer
- integer Integer
+ ≥ 1 40 The maximum number of iterations to
+class="td11"> 40 The maximum number of iterations to
perform. integer Integer
- integer Integer
+ ≥ 0 -1 If -1 If > 0 print out
an informational message about convergence
every integer Integer
- integer Integer
+ ≥ 0 0 Fill-in level 0 Fill-in level p of the ILU factorizations and
first fill-in for the approximate inverses.
+
what what dtype val val ’BJAC_STOP’ ’FALSE’
-’TRUE’ ’FALSE’ ’BJAC_STOP’ ’FALSE’
+’TRUE’ ’FALSE’ ’BJAC_TRACE’ ’FALSE’
-’TRUE’ ’FALSE’ ’BJAC_TRACE’ ’FALSE’
+’TRUE’ ’FALSE’ ’BJAC_ITRACE’ ’BJAC_ITRACE’ ’BJAC_RESCHECK’ ’BJAC_RESCHECK’ ’BJAC_STOPTOL’ ’BJAC_STOPTOL’ ’KRM_METHOD’ ’CG’
-’FCG’
-’CGS’
-’CGR’
-’BICG’
-’BICGSTAB’
-’BICGSTABL’
-’RGMRES’ ’FCG’ ’KRM_METHOD’ ’CG’
+’FCG’
+’CGS’
+’CGR’
+’BICG’
+’BICGSTAB’
+’BICGSTABL’
+’RGMRES’ ’FCG’ ’KRM’ as a coarse solver. CG the Conjugate
@@ -1480,24 +1482,24 @@ information. ’KRM_KPREC’ ’KRM_KPREC’ ’BJAC’ ’BJAC’ ’KRM_SUB_SOLVE’ ’KRM_SUB_SOLVE’ ’ILU’ ’ILU’ ’KRM_KPREC’: ILU(5 applies here. ’KRM_GLOBAL’ ’TRUE’,
+class="td11">’KRM_GLOBAL’ ’TRUE’,
’FALSE’ ’FALSE’ ’FALSE’ ’KRM_EPS’ ’KRM_EPS’ ’KRM_IRST’ ’KRM_IRST’ ’KRM_ISTOPC’ ’KRM_ISTOPC’ ’KRM_ITMAX’ ’KRM_ITMAX’ ’KRM_ITRACE’ ’KRM_ITRACE’ ’KRM_ITRACE’ iterations. If = 0 print a
@@ -1601,13 +1603,13 @@ message in case of convergence failure. ’KRM_FILLIN’ ’KRM_FILLIN’ Additional parameters defining the solver at the coarsest level.
-