MLD2P4
AMG4PSBLAS
User’s and Reference Guide
A guide for the MultiLevel Domain Decomposition Parallel Preconditioners Package
-based on PSBLAS
A guide for the Algebraic MultiGrid Preconditioners Package based on PSBLAS
Pasqua D’Ambra
Abstract
-
Abstract
Contents
1 General Overview
2 Code Distribution
Contributors
3 Configuring and Building AMG4PSBLAS
3.1 Prerequisites
3.2 Optional third party libraries
3.3 Configuration options
3.4 Bug reporting
3.5 Example and test programs
4 Getting Started
4.1 Examples
5 User Interface
5.1 Method init
5.2 Method set
5.3 Method hierarchy_build
5.4 Method smoothers_build
5.5 Method build
5.6 Method apply
5.7 Method free
5.8 Method descr
5.9 Auxiliary Methods
6 Adding new smoother and solver objects to AMG4PSBLAS
7 Error Handling
A License
+
B Contributor Covenant Code of Conduct
References
-
References
@@ -185,6 +181,7 @@ class="cmr-12">References
+
diff --git a/docs/html/userhtml.css b/docs/html/userhtml.css
index add1eb7b..f8b025b4 100644
--- a/docs/html/userhtml.css
+++ b/docs/html/userhtml.css
@@ -16,24 +16,23 @@
.cmbx-12{ font-weight: bold;}
.cmbx-12{ font-weight: bold;}
.cmbx-12{ font-weight: bold;}
-.cmtt-12{font-size:109%;font-family: monospace,monospace;}
-.cmtt-12{font-family: monospace,monospace;}
-.cmtt-12{font-family: monospace,monospace;}
+.cmtt-12{font-size:109%;font-family: monospace;}
+.cmtt-12{font-family: monospace;}
+.cmtt-12{font-family: monospace;}
.cmcsc-10x-x-120{font-size:109%;}
.cmr-8{font-size:72%;}
.cmmi-12{font-size:109%;font-style: italic;}
.cmmi-8{font-size:72%;font-style: italic;}
.cmsy-8{font-size:72%;}
-.tctt-1200{font-size:109%;font-family: monospace,monospace;}
.cmmi-10x-x-109{font-style: italic;}
.cmsy-10x-x-109{}
-.cmtt-10x-x-109{font-family: monospace,monospace;}
-.cmtt-10x-x-109{font-family: monospace,monospace;}
-.cmtt-10x-x-109{font-family: monospace,monospace;}
+.cmtt-10x-x-109{font-family: monospace;}
+.cmtt-10x-x-109{font-family: monospace;}
+.cmtt-10x-x-109{font-family: monospace;}
.cmcsc-10x-x-109{}
-.cmtt-10{font-size:90%;font-family: monospace,monospace;}
-.cmtt-10{font-family: monospace,monospace;}
-.cmtt-10{font-family: monospace,monospace;}
+.cmtt-10{font-size:90%;font-family: monospace;}
+.cmtt-10{font-family: monospace;}
+.cmtt-10{font-family: monospace;}
.cmbx-10x-x-109{ font-weight: bold;}
.cmbx-10x-x-109{ font-weight: bold;}
.cmbx-10x-x-109{ font-weight: bold;}
@@ -45,11 +44,10 @@
.cmbx-10{ font-weight: bold;}
.cmti-10{font-size:90%; font-style: italic;}
.small-caps{font-variant: small-caps; }
-p{margin-top:0;margin-bottom:0}
-p.indent{text-indent:0;}
-p + p{margin-top:1em;}
-p + div, p + pre {margin-top:1em;}
-div + p, pre + p {margin-top:1em;}
+p.noindent { text-indent: 0em }
+td p.noindent { text-indent: 0em; margin-top:0em; }
+p.nopar { text-indent: 0em; }
+p.indent{ text-indent: 1.5em }
@media print {div.crosslinks {visibility:hidden;}}
a img { border-top: 0; border-left: 0; border-right: 0; }
center { margin-top:1em; margin-bottom:1em; }
@@ -72,7 +70,7 @@ div.obeylines-v p { margin-top:0; margin-bottom:0; }
td.displaylines {text-align:center; white-space:nowrap;}
.centerline {text-align:center;}
.rightline {text-align:right;}
-pre.verbatim {font-family: monospace,monospace; text-align:left; clear:both; }
+div.verbatim {font-family: monospace; white-space: nowrap; text-align:left; clear:both; }
.fbox {padding-left:3.0pt; padding-right:3.0pt; text-indent:0pt; border:solid black 0.4pt; }
div.fbox {display:table}
div.center div.fbox {text-align:center; clear:both; padding-left:3.0pt; padding-right:3.0pt; text-indent:0pt; border:solid black 0.4pt; }
@@ -105,16 +103,18 @@ td.td01{ padding-left:0pt; padding-right:5pt; }
td.td10{ padding-left:5pt; padding-right:0pt; }
td.td11{ padding-left:5pt; padding-right:5pt; }
table[rules] {border-left:solid black 0.4pt; border-right:solid black 0.4pt; }
-.hline hr, .cline hr{ height : 0px; margin:0px; }
-.hline td, .cline td{ padding: 0; }
-.hline hr, .cline hr{border:none;border-top:1px solid black;}
+.hline hr, .cline hr{ height : 1px; margin:0px; }
.tabbing-right {text-align:right;}
+span.TEX {letter-spacing: -0.125em; }
+span.TEX span.E{ position:relative;top:0.5ex;left:-0.0417em;}
+a span.TEX span.E {text-decoration: none; }
+span.LATEX span.A{ position:relative; top:-0.5ex; left:-0.4em; font-size:85%;}
+span.LATEX span.TEX{ position:relative; left: -0.4em; }
div.float, div.figure {margin-left: auto; margin-right: auto;}
div.float img {text-align:center;}
div.figure img {text-align:center;}
-.marginpar,.reversemarginpar {width:20%; float:right; text-align:left; margin-left:auto; margin-top:0.5em; font-size:85%; text-decoration:underline;}
-.marginpar p,.reversemarginpar p{margin-top:0.4em; margin-bottom:0.4em;}
-.reversemarginpar{float:left;}
+.marginpar {width:20%; float:right; text-align:left; margin-left:auto; margin-top:0.5em; font-size:85%; text-decoration:underline;}
+.marginpar p{margin-top:0.4em; margin-bottom:0.4em;}
table.equation {width:100%;}
.equation td{text-align:center; }
td.equation { margin-top:1em; margin-bottom:1em; }
@@ -157,10 +157,10 @@ div.abstract {width:100%;}
.Ovalbox-thick { padding-left:3pt; padding-right:3pt; border:solid thick; }
.shadowbox { padding-left:3pt; padding-right:3pt; border:solid thin; border-right:solid thick; border-bottom:solid thick; }
.doublebox { padding-left:3pt; padding-right:3pt; border-style:double; border:solid thick; }
-.rotatebox{display: inline-block;}
+.figure img.graphics {margin-left:10%;}
.lstlisting .label{margin-right:0.5em; }
-div.lstlisting{font-family: monospace,monospace; white-space: nowrap; margin-top:0.5em; margin-bottom:0.5em; }
-div.lstinputlisting{ font-family: monospace,monospace; white-space: nowrap; }
+div.lstlisting{font-family: monospace; white-space: nowrap; margin-top:0.5em; margin-bottom:0.5em; }
+div.lstinputlisting{ font-family: monospace; white-space: nowrap; }
.lstinputlisting .label{margin-right:0.5em;}
#TBL-1 colgroup{border-left: 1px solid black;border-right:1px solid black;}
#TBL-1{border-collapse:collapse;}
diff --git a/docs/html/userhtml.html b/docs/html/userhtml.html
index 118ee3a4..dd54bbfb 100644
--- a/docs/html/userhtml.html
+++ b/docs/html/userhtml.html
@@ -3,21 +3,19 @@
MLD2P4
AMG4PSBLAS
User’s and Reference Guide
A guide for the MultiLevel Domain Decomposition Parallel Preconditioners Package
-based on PSBLAS
A guide for the Algebraic MultiGrid Preconditioners Package based on PSBLAS
Pasqua D’Ambra
Abstract
-
Abstract
Contents
1 General Overview
2 Code Distribution
Contributors
3 Configuring and Building AMG4PSBLAS
3.1 Prerequisites
3.2 Optional third party libraries
3.3 Configuration options
3.4 Bug reporting
3.5 Example and test programs
4 Getting Started
4.1 Examples
5 User Interface
5.1 Method init
5.2 Method set
5.3 Method hierarchy_build
5.4 Method smoothers_build
5.5 Method build
5.6 Method apply
5.7 Method free
5.8 Method descr
5.9 Auxiliary Methods
6 Adding new smoother and solver objects to AMG4PSBLAS
7 Error Handling
A License
+
B Contributor Covenant Code of Conduct
References
-
References
@@ -185,6 +181,7 @@ class="cmr-12">References
+
diff --git a/docs/html/userhtml0x.png b/docs/html/userhtml0x.png
index f004430a..96c5cb9b 100644
Binary files a/docs/html/userhtml0x.png and b/docs/html/userhtml0x.png differ
diff --git a/docs/html/userhtml1x.png b/docs/html/userhtml1x.png
index 20f909a7..4c10c200 100644
Binary files a/docs/html/userhtml1x.png and b/docs/html/userhtml1x.png differ
diff --git a/docs/html/userhtmlli1.html b/docs/html/userhtmlli1.html
index 8f6a50a7..2549a048 100644
--- a/docs/html/userhtmlli1.html
+++ b/docs/html/userhtmlli1.html
@@ -3,8 +3,8 @@
AMG4PSBLAS (AlgPSCToolkit (Parallel Sparse Computation Toolkit) software framewo
class="cmr-12">of a software development project started in 2007, named MLD2P4, which originally
implemented a multilevel version of some domain decomposition preconditioners of
-
-
-
additive-Schwarz type and was based on a parallel decoupled version of the well known
smoothed aggregation method to generate the multilevel hierarchy of coarser
+
+
+
matrices. In the last years, within the context of the EU-H2020 EoCoE project
symmetric positive definite linear systems. Due to the significan
class="cmr-12">of changes and the increase in scope, we decided to rename the package as
AMG4PSBLAS.
- AMG4PSBLAS is designed to provide scalable and easy-to-use preconditioners in
the context of the PSBLAS (Parallel Sparse Basic Linear Algebra Subprograms)
@@ -120,7 +118,7 @@ class="cmr-12">to easily specify different features of an algebraic multilevel p
class="cmr-12">allowing to experiment with different preconditioners for the problem and parallel The package employs object-oriented design techniques in Fortran 2003, with
parallel implementation is based on a Single Program Multiple Dat
class="cmr-12">paradigm; the inter-process communication is based on MPI and is managed mainly
through PSBLAS.
- This guide provides a brief description of the functionalities and the user interface
of AMG4PSBLAS.
@@ -147,7 +145,7 @@ class="cmr-12">of AMG4PSBLAS.
-
diff --git a/docs/html/userhtmlli2.html b/docs/html/userhtmlli2.html
index 9095310a..eb3f6bd7 100644
--- a/docs/html/userhtmlli2.html
+++ b/docs/html/userhtmlli2.html
@@ -3,14 +3,14 @@
[next]
Pothen, Distributed-memory parallel algorithms for matching and
coloring, in PCO’11 New Trends in Parallel Computing and Optimization,
+class="cmr-12">, in PCO11 New Trends in Parallel Computing and Optimization,
IEEE International Symposium on Parallel and Distributed Processing
Transactions on Mathematical Software, 44, (2018) 39:1–39:2
-
-
diff --git a/docs/html/userhtmlse1.html b/docs/html/userhtmlse1.html
index 869475de..94d31d9f 100644
--- a/docs/html/userhtmlse1.html
+++ b/docs/html/userhtmlse1.html
@@ -3,8 +3,8 @@
string der ’NONE’ Considered to use the PSBLAS Krylov
solvers with no preconditioner. ’DIAG’L1-JACOBI’ Diagonal preconditioner. For any zero
diagonal entry of the matrix to be
preconditioned, the corresponding entry
@@ -308,7 +308,7 @@ of the preconditioner is set to 1. ’GS’L1-GS’ Hybrid Gauss-Seidel (forward), that is,
global block Jacobi with Gauss-Seidel as
local solver. ’FBGS’L1-FBGS’ Symmetrized hybrid Gauss-Seidel, that
is, forward Gauss-Seidel followed by
backward Gauss-Seidel. ’BJAC’L1-BJAC’ Block-Jacobi with ILU(0) on the local
blocks. ’AS’ Additive Schwarz (AS), with overlap 1
and ILU(0) on the local blocks. ’ML’ V-cycle with one hybrid
forward Gauss-Seidel (GS) sweep as
pre-smoother and one hybrid backward
diff --git a/docs/html/userhtmlse5.html b/docs/html/userhtmlse5.html
index 083b4230..778421ea 100644
--- a/docs/html/userhtmlse5.html
+++ b/docs/html/userhtmlse5.html
@@ -3,8 +3,8 @@
smoother class(amg_x_base_smoother_type) The user-defined new smoother to be employed in the
preconditioner. solver class(amg_x_base_solver_type) The user-defined new solver to be employed in the preconditioner. pass it as follows:
-
diff --git a/docs/html/userhtmlse7.html b/docs/html/userhtmlse7.html
index 468d1a2a..2f9a867e 100644
--- a/docs/html/userhtmlse7.html
+++ b/docs/html/userhtmlse7.html
@@ -3,8 +3,8 @@
+
diff --git a/docs/html/userhtmlse8.html b/docs/html/userhtmlse8.html
index a49b315c..e6355971 100644
--- a/docs/html/userhtmlse8.html
+++ b/docs/html/userhtmlse8.html
@@ -3,8 +3,8 @@
[next] [AMG4PSBLAS is freely distributable under the following copyright
-
@@ -78,37 +83,44 @@ class="cmr-12">abide by its terms:
@@ -116,19 +128,12 @@ class="cmr-12">abide by its terms:
-
-
-
-
-
-
-
-
-
diff --git a/docs/html/userhtmlse9.html b/docs/html/userhtmlse9.html
index 134dd966..94b92610 100644
--- a/docs/html/userhtmlse9.html
+++ b/docs/html/userhtmlse9.html
@@ -1,7 +1,7 @@
- AMG4PSBLAS is freely distributable under the following copyright terms:
-
-
-
-
-
-
-
- AMG4PSBLAS is an evolution of MLD2P4, whose license we reproduce here to
+class="cmr-12">B Contributor Covenant Code of Conduct
+ Our Pledge
+ We as members, contributors, and leaders pledge to make participation in
+our community a harassment-free experience for everyone, regardless of age,
+body size, visible or invisible disability, ethnicity, sex characteristics, gender
+identity and expression, level of experience, education, socio-economic status,
abide by its terms:
+class="cmr-12">nationality, personal appearance, race, caste, color, religion, or sexual identity and
+orientation. We pledge to act and interact in ways that contribute to an open,
+welcoming, diverse, inclusive, and healthy community. Our Standards Examples
+of behavior that contributes to a positive environment for our community
+include:
+ Examples of unacceptable behavior include:
+
+ Enforcement Responsibilities
+ Community leaders are responsible for clarifying and enforcing our standards of
+acceptable behavior and will take appropriate and fair corrective action in response to
+any behavior that they deem inappropriate, threatening, offensive, or harmful.
+Community leaders have the right and responsibility to remove, edit, or reject
+comments, commits, code, wiki edits, issues, and other contributions that are not
+aligned to this Code of Conduct, and will communicate reasons for moderation
+decisions when appropriate. Scope This Code of Conduct applies within all community
+spaces, and also applies when an individual is officially representing the community in
+public spaces. Examples of representing our community include using an official
+e-mail address, posting via an official social media account, or acting as an
+appointed representative at an online or offline event. Enforcement Instances of
+abusive, harassing, or otherwise unacceptable behavior may be reported to the
+community leaders responsible for enforcement at eocoe@na.iac.cnr.it. All
+complaints will be reviewed and investigated promptly and fairly. All community
+leaders are obligated to respect the privacy and security of the reporter of any
+incident.
+ Enforcement Guidelines
+ Community leaders will follow these Community Impact Guidelines in
+determining the consequences for any action they deem in violation of this Code of
+Conduct:
+ Community Impact: Use of inappropriate language or other behavior deemed
+ unprofessional or unwelcome in the community.
+ Consequence: A private, written warning from community leaders, providing
+ clarity around the nature of the violation and an explanation of why the
+ behavior was inappropriate. A public apology may be requested.
+ Community Impact: A violation through a single incident or series of actions.
+ Consequence: A warning with consequences for continued behavior. No
+ interaction with the people involved, including unsolicited interaction with
+ those enforcing the Code of Conduct, for a specified period of time. This
+ includes avoiding interactions in community spaces as well as external
+ channels like social media. Violating these terms may lead to a temporary
+ or permanent ban.
+ Community Impact: A serious violation of community standards, including
+ sustained inappropriate behavior.
+ Consequence: A temporary ban from any sort of interaction or public
+ communication with the community for a specified period of time. No
+ public or private interaction with the people involved, including unsolicited
+ interaction with those enforcing the Code of Conduct, is allowed during this
+ period. Violating these terms may lead to a permanent ban.
+ Community Impact: Demonstrating a pattern of violation of community
+ standards, including sustained inappropriate behavior, harassment of an
+ individual, or aggression toward or disparagement of classes of individuals.
+ Consequence: A permanent ban from any sort of public interaction within
+ the community. Attribution
+ This Code of Conduct is adapted from the Contributor Covenant, version 2.0,
+available at https://www.contributor-covenant.org/version/2/0/code_of_conduct
+.html. Community Impact Guidelines were inspired by Mozillas code of conduct
+enforcement ladder. For answers to common questions about this code of conduct, see
+the FAQ at https://www.contributor-covenant.org/faq. Translations are available at
+https://www.contributor-covenant.org/translations.
-
@@ -156,5 +276,5 @@ href="userhtml.html#userhtmlse9.html" >up
+ id="tailuserhtmlse9.html">
diff --git a/docs/html/userhtmlsu1.html b/docs/html/userhtmlsu1.html
index 9f80e354..a328f0b6 100644
--- a/docs/html/userhtmlsu1.html
+++ b/docs/html/userhtmlsu1.html
@@ -3,8 +3,8 @@
a type(in). The sparse matrix structure containing the local part of the matrix
17]. desc_a type(in). The communication descriptor of a17]. info integer,out). Error code. If no error, 0 is returned. See Section 7 for details. amold class( optional. The desired dynamic type for internal matrix components; this
17]. vmold class( optional. The desired dynamic type for internal vector components; this
allows e.g. running on GPUs. imold class( optional. The desired dynamic type for internal integer vector components;
this allows e.g. running on GPUs. a type(in). The sparse matrix structure containing the local part of the matrix
17]. desc_a type(in). The communication descriptor of a17]. info integer,out). Error code. If no error, 0 is returned. See Section 7 for details. amold class( optional. The desired dynamic type for internal matrix components; this
17]. vmold class( optional. The desired dynamic type for internal vector components; this
allows e.g. running on GPUs. imold class( optional. The desired dynamic type for internal integer vector components;
this allows e.g. running on GPUs. The method can be used to build multilevel preconditioners too.
diff --git a/docs/html/userhtmlsu12.html b/docs/html/userhtmlsu12.html
index ec2c0cd5..ff2b0d1e 100644
--- a/docs/html/userhtmlsu12.html
+++ b/docs/html/userhtmlsu12.html
@@ -3,8 +3,8 @@
x type(in). The local part of the vector x, single/double
precision version of AMG4PSBLAS under use. y type(out). The local part of the vector y, single/double
precision version of AMG4PSBLAS under use. desc_a type(in). The communication descriptor associated to the matrix to be
preconditioned. info integer,out). Error code. If no error, 0 is returned. See Section 7 for details. trans character((in). If trans -1). work type( target. Workspace. Its size should be at least 4,
single/double precision version of AMG4PSBLAS under use. info integer,out). Error code. If no error, 0 is returned. See Section for
details. info integer,out). Error code. If no error, 0 is returned. See Section 7 for details. iout integer, optional. The id of the file where the preconditioner description will be
printed; the default is the standard output. root integer, optional. The id of the process where the preconditioner description
will be printed; the default is psb_root_. verbosity integer, optional. The verbosity level of the description. Default value is 0. For
a distributed multilevel preconditioner the size of the coarsematrices on every process. info integer,out). Error code. If no error, 0 is returned. See Section 7 for details. amold class( optional. The desired dynamic type for internal matrix components; this
17].
pout type(out). The copy of the preconditioner data structure. Note that x , single/double precision
version of AMG4PSBLAS under use. info integer,out). Error code. If no error, 0 is returned. See Section 7 for details.
global logical, optional. Whether the global or local preconditioner size is desired. Default:
false.. info integer,out). Error code. If no error, 0 is returned. See Section 7 for details. vmold class( optional. The desired dynamic type for internal vector components; this
allows e.g. running on GPUs.
info integer,out). Error code. If no error, 0 is returned. See Section 7 for details. which assumes that the various MPI compilers and support libraries are available in
‘--prefix=$HOME$HOME’. Once the configure script has completed execution, it will have generated the file
To build the library the user will now enter
- followed (optionally) by
-
diff --git a/docs/html/userhtmlsu4.html b/docs/html/userhtmlsu4.html
index 3bb6153a..e5d1e06b 100644
--- a/docs/html/userhtmlsu4.html
+++ b/docs/html/userhtmlsu4.html
@@ -3,8 +3,8 @@
@@ -284,19 +285,19 @@ class="cmr-12">.
-
-
- contxt type(in). The communication context. ptype character(in) . The type of preconditioner. Its values are specified in Table 1. Note that strings are case insensitive. info integer,out). Error code. If no error, 0 is returned. See Section 7 for details. what character(len=*). The parameter to be set. It can be specified through its name; the
7. val integer or in). The value of the parameter to be set. The list of allowed values and
len=*), it is also treated as case insensitive. info integer,out). Error code. If no error, 0 is returned. See Section 7 for details. ilev integer,in). For the multilevel preconditioner, the level at which the
7). ilmax integer,in). For the multilevel preconditioner, when both ilev The levels are numbered in increasing order starting from the fin
one, i.e., level 1 is the finest level. pos character(in). Whether the other arguments apply only to the pre-smoother
not concern the smoothers,
class="cmtt-12">pos is ignored. idx integer,in). An auxiliary input argument that can be passed to the underlying
what val dfault cnts ’ML_CYCLE ’VCYCLE’
’ADD’ ’VCYCLE’ Multilevel cycle: V-cycle, W-cycle, K-cycle,
and additive composition. ’OUTER_SWEEPS’ integer Any integer
number ≥ 1 1 1 Number of multilevel cycles. what val dfault cnts ’MIN_COARSE_SIZE_PER_PROCESS’ integer Any number
> 0 200 200 Coarse size threshold per process. The
aggregation stops if the global number of
variables of the computed coarsest matrix
@@ -722,17 +722,17 @@ multiplied by the number of processes.
’MIN_COARSE_SIZE’ integer Any number
> 0 -1 -1 Coarse size threshold. The aggregation
stops if the global number of variables
of the computed coarsest matrix is lower
@@ -745,17 +745,17 @@ class="cmtt-10x-x-109">MIN_COARSE_SIZE_PER_PROCESS’. ’MIN_CR_RATIO’ real Any number
> 1 1.5 1.5 Minimum coarsening
ratio. The aggregation stops if the ratio
between the global matrix dimensions at
@@ -763,23 +763,23 @@ two consecutive levels is lower than or
equal to this threshold (see Note). ’MAX_LEVS’ integer Any integer
number > 1 20 20 Maximum number of levels. The
aggregation stops if the number of levels
reaches this value (see Note). ’PAR_AGGR_ALG ’DEC’,
’SYMDEC’,
’COUPLED’ ’DEC’ Parallel aggregation algorithm.
the SYMDEC option applies decoupled
@@ -807,7 +807,7 @@ class="cmmi-10x-x-109">AT . what val dfault cts ’AGGR_TYPE ’SOC1’ ’SOC1’,
’MATCHBOXP’ Type of aggregation algorithm: currently,
for the
decoupled aggregation we implement two
@@ -884,19 +884,19 @@ package [8]. ’AGGR_SIZE’ integer Any integer
number
power of 2
and > 2 4 4 Maximum size of aggregates when the
coupled aggregation based on matching
is applied. For aggressive coarsening
@@ -908,7 +908,7 @@ class="cmbx-10x-x-109">MODIFICARE
class="cmbx-10x-x-109">CODICE ’AGGR_PROL ’SMOOTHED’,
’UNSMOOTHED’ ’SMOOTHED’ Prolongator used by the aggregation
algorithm: smoothed or unsmoothed (i.e.,
tentative prolongator). what val dfault cnts ’AGGR_ORD ’NATURAL’
’DEGREE’ ’NATURAL’ Initial ordering of indices for
the decoupled aggregation algorithm:
either natural ordering or sorted by
@@ -1040,7 +1040,7 @@ descending degrees of the nodes in the
matrix graph. ’AGGR_THRESHreal( kind_parameter ) Any real
number ∈
[0,1] 0.01 0.01 The threshold θ in the decoupled
aggregation algorithm, see (??. See also the note at the
bottom of this table. ’AGGR_FILTER ’FILTER’
’NOFILTER’ ’NOFILTER’ Matrix used in computing the smoothed
prolongator: filtered or unfiltered
(see (??) in Section ??). what val dfault cnts ’COARSE_MAT ’DIST’
’REPL’ ’REPL’ Coarsest matrix layout: distributed among the
processes or replicated on each of them. ’COARSE_SOLVE ’MUMPS’
’RKR’ See Note. See Note. Solver used at the coarsest level: sequential LU
from MUMPS, UMFPACK, or SuperLU (plus
triangular solve); distributed LU from MUMPS or
@@ -1272,7 +1272,7 @@ UMFPACK and SuperLU_Dist are available only in
double precision. ’COARSE_SUBSOLVE ’ILU’
’AINV’ See Note. See Note. Solver for the diagonal blocks of the coarse matrix,
in case the block Jacobi solver is chosen as
coarsest-level solver: ILU(
what val dfault cts ’COARSE_SWEEPS’ integer Any
integer
number >
-0 10 10 Number of sweeps when JACOBI, GS or Aggiungere
class="cmbx-10x-x-109">criterio di arresto del PCG? ’COARSE_FILLIN’ integer Any
integer
number ≥
-0 0 0 Fill-in level p of the ILU factorizations. ’COARSE_ILUTHRSreal( kind_parameter ) Any real
number ≥
-0 0 0 Drop tolerance t in the ILU(p,t) factorization. what val dfault cnts ’SMOOTHER_TYPE ’JACOBI’
’AS’ ’FBGS’ Type of smoother used in the multilevel
and Additive Schwarz.
class="cmr-10">It is ignored by one-level preconditioners. ’SUB_SOLVE ’JACOBI’
’UMF’ GS and preconditioners
ℓ1-versions? The local solver to be used with the
or UMFPACK (plus triangular solve). See
class="cmr-10">Note for details on hybrid Gauss-Seidel. ’SMOOTHER_SWEEPS’ integer Any integer
number ≥ 0 1 Number of sweeps of the smoother or
,
class="cmr-10">respectively. ’SUB_OVR’ integer Any integer
number ≥ 0 1 Number of overlap layers, for Additive
Schwarz only. what val dfault cnts ’SUB_RESTR ’HALO’
’NONE’ ’HALO’ Type of restriction operator, for Additive
classical Addditive Schwarz smoother and
class="cmr-10">its RAS variant. ’SUB_PROL ’SUM’
’NONE’ ’NONE’ Type of prolongation operator, for Additive
’ for its RAS variant. ’SUB_FILLIN’ integer Any integer
number ≥ 0 0 Fill-in level p of the incomplete LU
class="cmr-10">factorizations. ’SUB_ILUTHRSreal( kind_parameter ) Any real
number ≥ 0 0 Drop tolerance t )
factorization. ’MUMPS_LOC_GLOB ’LOCAL_SOLVER’
’GLOBAL_SOLVER’ ’GLOBAL_SOLVER’ Whether MUMPS should be used as a
only on the part of the matrix local to each
process. ’MUMPS_IPAR_ENTRY’ integer Any integer
number 0 Set an entry in the MUMPS integer control
optional
argument. ’MUMPS_RPAR_ENTRY’ real Any real number 0 Set an entry in the MUMPS real control
optional
class="cmr-10">argument. a type(in). The sparse matrix structure containing the local part of the matrix
17]. desc_a type(in). The communication descriptor of a17]. info integer,out). Error code. If no error, 0 is returned. See Section 7 for details.
1 General Overview
@@ -135,32 +132,32 @@ class="cmr-12">Auxiliary Methods
class="cmr-12"> 5.9.1 Method: dump
5.9.2 Method: clone
5.9.3 Method: sizeof
5.9.4 Method: allocate_wrk
5.9.5 Method: free_wrk
Error Handling
class="cmr-12">A License
-
References
+
B Contributor Covenant Code of Conduct
References
e g No preconditioner No preconditioner ’ Diagonal Diagonal ’ Gauss-Seidel Gauss-Seidel ’ Symmetrized Gauss-Seidel Symmetrized Gauss-Seidel ’ Block Jacobi Block Jacobi ’ Additive Schwarz Additive Schwarz ’ Multilevel Multilevel ’ smoother solver
- ! sparse matrix and preconditioner
- type(psb_dspmat_type) :: a
- type(amg_dprec_type) :: prec
- type(amg_d_tlu_solver_type) :: tlusv
-......
- !
- ! prepare the preconditioner: an ML with defaults, but with TLU solver at
- ! intermediate levels. All other parameters are at default values.
- !
- call prec%init(’ML’, info)
- call prec%hierarchy_build(a,desc_a,info)
- nlv = prec%get_nlevs()
- call prec%set(tlusv, info,ilev=1,ilmax=max(1,nlv-1))
- call prec%smoothers_build(a,desc_a,info)
-
+
! sparse matrix and preconditioner
+
type(psb_dspmat_type) :: a
+
type(amg_dprec_type) :: prec
+
type(amg_d_tlu_solver_type) :: tlusv
+
+
......
+
!
+
! prepare the preconditioner: an ML with defaults, but with TLU solver at
+
! intermediate levels. All other parameters are at default values.
+
!
+
call prec%init(’ML’, info)
+
call prec%hierarchy_build(a,desc_a,info)
+
nlv = prec%get_nlevs()
+
call prec%set(tlusv, info,ilev=1,ilmax=max(1,nlv-1))
+
call prec%smoothers_build(a,desc_a,info)
+
+
- AMG4PSBLAS version 1.0
- Algebraic MultiGrid Preconditioners Package
- based on PSBLAS (Parallel Sparse BLAS version 3.7)
- (C) Copyright 2021
- Pasqua D’Ambra IAC-CNR, IT
- Fabio Durastante University of Pisa and IAC-CNR, IT
- Salvatore Filippone University of Rome Tor-Vergata and IAC-CNR, IT
- 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 MLD2P4 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 MLD2P4 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.
-
+
AMG4PSBLAS version 1.0
+
Algebraic MultiGrid Preconditioners Package
+
based on PSBLAS (Parallel Sparse BLAS version 3.7)
+
+
(C) Copyright 2021
+
+
Pasqua D’Ambra IAC-CNR, IT
+
Fabio Durastante University of Pisa and IAC-CNR, IT
+
Salvatore Filippone University of Rome Tor-Vergata and IAC-CNR, IT
+
+
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 MLD2P4 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 MLD2P4 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.
+
+
- MLD2P4 version 2.2
- MultiLevel Domain Decomposition Parallel Preconditioners Package
- based on PSBLAS (Parallel Sparse BLAS version 3.5)
- (C) Copyright 2008-2018
- Salvatore Filippone
- Pasqua D’Ambra
- Daniela di Serafino
- 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 MLD2P4 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 MLD2P4 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.
-
+
+
MLD2P4 version 2.2
+
MultiLevel Domain Decomposition Parallel Preconditioners Package
+
based on PSBLAS (Parallel Sparse BLAS version 3.5)
+
+
(C) Copyright 2008-2018
+
+
Salvatore Filippone
+
Pasqua D’Ambra
+
Daniela di Serafino
+
+
+
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 MLD2P4 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 MLD2P4 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.
+
+A License
-
AMG4PSBLAS version 1.0
-
Algebraic MultiGrid Preconditioners Package
-
based on PSBLAS (Parallel Sparse BLAS version 3.7)
-
-
(C) Copyright 2021
-
-
Pasqua D’Ambra IAC-CNR, IT
-
Fabio Durastante University of Pisa and IAC-CNR, IT
-
Salvatore Filippone University of Rome Tor-Vergata and IAC-CNR, IT
-
-
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 MLD2P4 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 MLD2P4 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.
-
-
+
+
+
+
-
MLD2P4 version 2.2
-
MultiLevel Domain Decomposition Parallel Preconditioners Package
-
based on PSBLAS (Parallel Sparse BLAS version 3.5)
-
-
(C) Copyright 2008-2018
-
-
Salvatore Filippone
-
Pasqua D’Ambra
-
Daniela di Serafino
-
-
-
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 MLD2P4 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 MLD2P4 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.
-
-
+
+a desc_a info amold vmold imold a desc_a info amold vmold imold x y desc_a info trans work info info iout root verbosity info amold pout info global info vmold info
+
might be configured with:
-
+
--with-umfpackincdir=/usr/include/suitesparse/
+
+
-
+
+
use amg_prec_mod
+
use psb_krylov_mod
+
... ...
+
!
+
! sparse matrix
+
type(psb_dspmat_type) :: A
+
! sparse matrix descriptor
+
type(psb_desc_type) :: desc_A
+
! preconditioner
+
type(amg_dprec_type) :: P
+
! right-hand side and solution vectors
+
type(psb_d_vect_type) :: b, x
+
... ...
+
!
+
! initialize the parallel environment
+
call psb_init(ctxt)
+
call psb_info(ctxt,iam,np)
+
... ...
+
!
+
! read and assemble the spd matrix A and the right-hand side b
+
! using PSBLAS routines for sparse matrix / vector management
+
... ...
+
!
+
! initialize the default multilevel preconditioner, i.e. V-cycle
+
! with basic smoothed aggregation, 1 hybrid forward/backward
+
! GS sweep as pre/post-smoother and UMFPACK as coarsest-level
+
! solver
+
call P%init(’ML’,info)
+
!
+
! build the preconditioner
+
call P%hierarchy_build(A,desc_A,info)
+
call P%smoothers_build(A,desc_A,info)
+
+
!
+
! set the solver parameters and the initial guess
+
... ...
+
!
+
! solve Ax=b with preconditioned CG
+
call psb_krylov(’CG’,A,P,b,x,tol,desc_A,info)
+
... ...
+
!
+
! deallocate the preconditioner
+
call P%free(info)
+
!
+
! deallocate other data structures
+
... ...
+
!
+
! exit the parallel environment
+
call psb_exit(ctxt)
+
stop
+
-... ...
-! build a V-cycle preconditioner with 1 block-Jacobi sweep (with
-! ILU(0) on the blocks) as pre- and post-smoother, and 8 block-Jacobi
-! sweeps (with ILU(0) on the blocks) as coarsest-level solver
- call P%init(’ML’,info)
- call P%set(’SMOOTHER_TYPE’,’BJAC’,info)
- call P%set(’COARSE_SOLVE’,’BJAC’,info)
- call P%set(’COARSE_SWEEPS’,8,info)
- call P%hierarchy_build(A,desc_A,info)
- call P%smoothers_build(A,desc_A,info)
+
! build a V-cycle preconditioner with 1 block-Jacobi sweep (with
+
! ILU(0) on the blocks) as pre- and post-smoother, and 8 block-Jacobi
+
! sweeps (with ILU(0) on the blocks) as coarsest-level solver
+
call P%init(’ML’,info)
+
call P%set(’SMOOTHER_TYPE’,’BJAC’,info)
+
call P%set(’COARSE_SOLVE’,’BJAC’,info)
+
call P%set(’COARSE_SWEEPS’,8,info)
+
call P%hierarchy_build(A,desc_A,info)
+
call P%smoothers_build(A,desc_A,info)
+
... ...
+
-... ...
-! build a W-cycle preconditioner with 2 hybrid Gauss-Seidel sweeps
-! as pre- and post-smoother, a distributed coarsest
-! matrix, and MUMPS as coarsest-level solver
- call P%init(’ML’,info)
- call P%set(’PAR_AGGR_ALG’,’COUPLED’,info)
- call P%set(’ML_CYCLE’,’WCYCLE’,info)
- call P%set(’SMOOTHER_TYPE’,’FBGS’,info)
- call P%set(’SMOOTHER_SWEEPS’,2,info)
- call P%set(’COARSE_SOLVE’,’MUMPS’,info)
- call P%set(’COARSE_MAT’,’DIST’,info)
- call P%hierarchy_build(A,desc_A,info)
- call P%smoothers_build(A,desc_A,info)
+
! build a W-cycle preconditioner with 2 hybrid Gauss-Seidel sweeps
+
! as pre- and post-smoother, a distributed coarsest
+
! matrix, and MUMPS as coarsest-level solver
+
call P%init(’ML’,info)
+
call P%set(’PAR_AGGR_ALG’,’COUPLED’,info)
+
call P%set(’ML_CYCLE’,’WCYCLE’,info)
+
call P%set(’SMOOTHER_TYPE’,’FBGS’,info)
+
call P%set(’SMOOTHER_SWEEPS’,2,info)
+
call P%set(’COARSE_SOLVE’,’MUMPS’,info)
+
call P%set(’COARSE_MAT’,’DIST’,info)
+
call P%hierarchy_build(A,desc_A,info)
+
call P%smoothers_build(A,desc_A,info)
+
... ...
+
+
! set RAS with overlap 2 and ILU(0) on the local blocks
+
call P%init(’AS’,info)
+
call P%set(’SUB_OVR’,2,info)
+
call P%bld(A,desc_A,info)
+
... ...
+
! solve Ax=b with preconditioned BiCGSTAB
+
call psb_krylov(’BICGSTAB’,A,P,b,x,tol,desc_A,info)
+
contxt ptype info what info ilev ilmax pos idx a type e val t character=*) ’ ’ integer ≥ 1
a type e val t integer > 0 integer > 0 real > 1 integer > 1 character=*) ’COUPLED’ ’DEC’ a type e val t character=*) ’ ’ integer > 2 character=*) ’ ’ a type e val t character=*) ’DEGREE’ ’NATURAL’ ) ,1] character=*) ’NOFILTER’ ’NOFILTER’
a type e val t character=*) ’ ’ character=*) ’ character=*) ’ a type e val t integer integer ) a type e val t character=*) ’ ’ character=*) ’ -versions? integer 0 1 integer 0 1
a type e val t character=*) ’ ’ character=*) ’ ’ integer 0 0 ) 0 0 character=*) ’ ’ integer number 0 real Any real number 0
a desc_a info