|
@@ -122,7 +122,7 @@ setup and application of the default multi-level preconditioner (example 1).
! using PSBLAS routines for sparse matrix / vector management
... ...
!
-! initialize the default multi-level preconditioner, i.e. V-cycle
+! 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
@@ -159,7 +159,7 @@ setup and application of the default multi-level preconditioner (example 1).
-Different versions of the multi-level preconditioner can be obtained by changing
+Different versions of the multilevel preconditioner can be obtained by changing
the default values of the preconditioner parameters. The code reported in
Figure 3 shows how to set a V-cycle preconditioner
which applies 1 block-Jacobi sweep as pre- and post-smoother,
@@ -197,7 +197,7 @@ boundary conditions are also available in the directory examples/pdegen
Figure 3:
-setup of a multi-level preconditioner
+setup of a multilevel preconditioner
|
@@ -230,7 +230,7 @@ setup of a multi-level preconditioner
Figure 4:
-setup of a multi-level preconditioner
+setup of a multilevel preconditioner
|
diff --git a/docs/html/node18.html b/docs/html/node18.html
index 8a65faa0..cec251b6 100644
--- a/docs/html/node18.html
+++ b/docs/html/node18.html
@@ -60,7 +60,7 @@ User Interface
routines init, set,
hierarchy_build, smoothers_build,
bld, and apply encapsulate all the
-functionalities for the setup and the application of any multi-level and one-level
+functionalities for the setup and the application of any multilevel and one-level
preconditioner implemented in the package.
The routine free deallocates the preconditioner data structure, while
descr prints a description of the preconditioner setup by the user.
diff --git a/docs/html/node20.html b/docs/html/node20.html
index 54203990..04151d3e 100644
--- a/docs/html/node20.html
+++ b/docs/html/node20.html
@@ -109,7 +109,7 @@ contained in val.
|
|
- For the multi-level preconditioner, the level at which the
+ | For the multilevel preconditioner, the level at which the
preconditioner parameter has to be set.
The levels are numbered in increasing
order starting from the finest one, i.e., level 1 is the finest level.
@@ -123,7 +123,7 @@ contained in val.
|
|
|
- For the multi-level preconditioner, when both
+ | For the multilevel preconditioner, when both
ilev and ilmax are present, the settings
are applied at all levels ilev:ilmax. When
ilev is present but ilmax is not, then
@@ -164,14 +164,14 @@ by a suitable setting of the preconditioner parameters. These parameters
can be logically divided into four groups, i.e., parameters defining
-- the type of multi-level cycle and how many cycles must be applied;
+
- the type of multilevel cycle and how many cycles must be applied;
- the aggregation algorithm;
-- the coarse-space correction at the coarsest level (for multi-level
+
- the coarse-space correction at the coarsest level (for multilevel
preconditioners only);
-- the smoother of the multi-level preconditioners, or the one-level
+
- the smoother of the multilevel preconditioners, or the one-level
preconditioner.
@@ -252,7 +252,7 @@ solver is changed to the default sequential solver.
Table 2:
-Parameters defining the multi-level cycle and the number of cycles to
+Parameters defining the multilevel cycle and the number of cycles to
be applied.
|
@@ -276,7 +276,7 @@ be applied.
'ADD' |
'VCYCLE' |
-Multi-level cycle: V-cycle, W-cycle, K-cycle, hybrid Multiplicative Schwarz,
+ | Multilevel cycle: V-cycle, W-cycle, K-cycle, hybrid Multiplicative Schwarz,
and Additive Schwarz.
Note that hybrid Multiplicative Schwarz is equivalent to V-cycle and
@@ -291,7 +291,7 @@ number  |
1 |
-Number of multi-level cycles. |
+Number of multilevel cycles. |
@@ -533,12 +533,11 @@ level.
Note that UMF and SLU require the coarsest
matrix to be replicated, SLUDIST, JACOBI,
GS and BJAC require it to be
- distributed, MUMPS can be used with either
+ distributed, and MUMPS can be used with either
a replicated or a distributed matrix. When any of the previous
- solvers is specified, the matrix layout is set to a default
- value
- which allows the use
- value UMFPACK and SuperLU_Dist
+ solvers is specified, the matrix layout is set to a default
+ value which allows the use of the solver (see Remark 3, p. 24).
+ Note also that UMFPACK and SuperLU_Dist
are available only in double precision. |
'COARSE_SUBSOLVE' |
@@ -690,7 +689,7 @@ Parameters defining the smoother or the details of the one-level preconditioner.
'FBGS'
|
- Type of smoother used in the multi-level preconditioner:
+ | Type of smoother used in the multilevel preconditioner:
point-Jacobi, hybrid (forward) Gauss-Seidel,
hybrid backward Gauss-Seidel, block-Jacobi, and
Additive Schwarz.
@@ -719,7 +718,7 @@ Parameters defining the smoother or the details of the one-level preconditioner.
'UMF'
|
GS and BGS for pre- and post-smoothers
- of multi-level preconditioners, respectively
+ of multilevel preconditioners, respectively
ILU for block-Jacobi and Additive Schwarz
one-level preconditioners
@@ -754,7 +753,7 @@ Parameters defining the smoother or the details of the one-level preconditioner.
| 1
|
Number of sweeps of the smoother or one-level preconditioner.
- In the multi-level case, no pre-smother or
+ In the multilevel case, no pre-smother or
post-smoother is used if this parameter is set to 0
together with pos='PRE' or pos='POST,
respectively. |
diff --git a/docs/html/node21.html b/docs/html/node21.html
index b998987f..83a9f502 100644
--- a/docs/html/node21.html
+++ b/docs/html/node21.html
@@ -63,7 +63,7 @@ Subroutine build
This routine builds the one-level preconditioner p according to the requirements
made by the user through the routines init and set
-(see Sections 6.4 and 6.5 for multi-level preconditioners).
+(see Sections 6.4 and 6.5 for multilevel preconditioners).
Arguments
@@ -111,7 +111,7 @@ as follows:
-In this case, the routine can be used to build multi-level preconditioners too.
+In this case, the routine can be used to build multilevel preconditioners too.
diff --git a/docs/html/node22.html b/docs/html/node22.html
index 344ae846..2ed059c8 100644
--- a/docs/html/node22.html
+++ b/docs/html/node22.html
@@ -62,7 +62,7 @@ Subroutine hierarchy_build
This routine builds the hierarchy of matrices and restriction/prolongation
-operators for the multi-level preconditioner p, according to the requirements
+operators for the multilevel preconditioner p, according to the requirements
made by the user through the routines init and set.
diff --git a/docs/html/node23.html b/docs/html/node23.html
index 44b9e1d5..94e2ce16 100644
--- a/docs/html/node23.html
+++ b/docs/html/node23.html
@@ -62,7 +62,7 @@ Subroutine smoothers_build
This routine builds the smoothers and the coarsest-level solvers for the
-multi-level preconditioner p, according to the requirements made by
+multilevel preconditioner p, according to the requirements made by
the user through the routines init and set, and based on the aggregation
hierarchy produced by a previous call to hierarchy_build
(see Section 6.4).
diff --git a/docs/html/node28.html b/docs/html/node28.html
index b7194cdb..d42a56e7 100644
--- a/docs/html/node28.html
+++ b/docs/html/node28.html
@@ -56,7 +56,7 @@ original version by: Nikos Drakos, CBLU, University of Leeds
Error Handling
-The error handling in MLD2P4 is based on the PSBLAS (version 2) error
+The error handling in MLD2P4 is based on the PSBLAS error
handling. Error conditions are signaled via an integer argument
info; whenever an error condition is detected, an error trace
stack is built by the library up to the top-level, user-callable
diff --git a/docs/html/node29.html b/docs/html/node29.html
index 0af35633..89ad8e9f 100644
--- a/docs/html/node29.html
+++ b/docs/html/node29.html
@@ -58,13 +58,12 @@ License
The MLD2P4 is freely distributable under the following copyright
terms:
-
MLD2P4 version 2.1
MultiLevel Domain Decomposition Parallel Preconditioners Package
- based on PSBLAS (Parallel Sparse BLAS version 3.4)
+ based on PSBLAS (Parallel Sparse BLAS version 3.5)
- (C) Copyright 2008, 2010, 2012, 2017
+ (C) Copyright 2008, 2010, 2012, 2015, 2017
Salvatore Filippone Cranfield University, Cranfield, UK
Pasqua D'Ambra IAC-CNR, Naples, IT
diff --git a/docs/html/node3.html b/docs/html/node3.html
index b8c2c7a7..47bb8156 100644
--- a/docs/html/node3.html
+++ b/docs/html/node3.html
@@ -56,7 +56,7 @@ original version by: Nikos Drakos, CBLU, University of Leeds
General Overview
-The MULTI-LEVEL DOMAIN DECOMPOSITION PARALLEL PRECONDITIONERS PACKAGE BASED ON
+The MULTILEVEL DOMAIN DECOMPOSITION PARALLEL PRECONDITIONERS PACKAGE BASED ON
PSBLAS (MLD2P4) provides parallel Algebraic MultiGrid (AMG) and Domain
Decomposition preconditioners (see, e.g., [3, is a square, real or complex, sparse matrix. The name of the package comes from its original implementation, containing
-multi-level additive and hybrid Schwarz preconditioners, as well as one-level additive
+multilevel additive and hybrid Schwarz preconditioners, as well as one-level additive
Schwarz preconditioners. The current version extends the original plan by including
-multi-level cycles and smoothers widely used in multigrid methods.
+multilevel cycles and smoothers widely used in multigrid methods.
-The multi-level preconditioners implemented in MLD2P4 are obtained by combining
+The multilevel preconditioners implemented in MLD2P4 are obtained by combining
AMG cycles with smoothers and coarsest-level solvers. The V-, W-, and
K-cycles [3,19] are available, which allow to define
-almost all the preconditioners in the package, including the multi-level hybrid
-Schwarz ones; a specific cycle is implemented to obtain multi-level additive
+almost all the preconditioners in the package, including the multilevel hybrid
+Schwarz ones; a specific cycle is implemented to obtain multilevel additive
Schwarz preconditioners. The Jacobi, hybridforward/backward Gauss-Seidel, block-Jacobi, and additive Schwarz methods
are available as smoothers. An algebraic approach is used to generate a hierarchy of
coarse-level matrices and operators, without explicitly using any information on the
@@ -154,7 +154,7 @@ Section 7).
We note that the user interface of MLD2P4 2.1 has been extended with respect to the
-previous versions in order to separate the construction of the multi-level hierarchy from
+previous versions in order to separate the construction of the multilevel hierarchy from
the construction of the smoothers and solvers, and to allow for more flexibility
at each level. The software architecture described in [8] has significantly
diff --git a/docs/html/node30.html b/docs/html/node30.html
index f599d623..70959564 100644
--- a/docs/html/node30.html
+++ b/docs/html/node30.html
@@ -56,121 +56,121 @@ Bibliography
1
-
-P. R. Amestoy, C. Ashcraft, O. Boiteau, A. Buttari, J. L'Excellent, C. Weisbecker,
-Improving multifrontal methods by means of block low-rank representations,
-SIAM Journal on Scientific Computing, volume 37 (3), 2015, A1452-A1474.
-See also http://mumps.enseeiht.fr.
2
-
-M. Brezina, P. Vanek,
-A Black-Box Iterative Solver Based on a Two-Level Schwarz Method,
-Computing, 63, 1999, 233-263.
3
-
-W. L. Briggs, V. E. Henson, S. F. McCormick,
-A Multigrid Tutorial, Second Edition,
-SIAM, 2000.
4
-
-A. Buttari, P. D'Ambra, D. di Serafino, S. Filippone,
-Extending PSBLAS to Build Parallel Schwarz Preconditioners,
-in J. Dongarra, K. Madsen, J. Wasniewski, editors,
-Proceedings of PARA 04 Workshop on State of the Art
-in Scientific Computing, Lecture Notes in Computer Science,
-Springer, 2005, 593-602.
5
-
-A. Buttari, P. D'Ambra, D. di Serafino, S. Filippone,
-2LEV-D2P4: a package of high-performance preconditioners
-for scientific and engineering applications,
-Applicable Algebra in Engineering, Communications and Computing,
-18 (3) 2007, 223-239.
6
-
-X. C. Cai, M. Sarkis,
-A Restricted Additive Schwarz Preconditioner for General Sparse Linear Systems,
-SIAM Journal on Scientific Computing, 21 (2), 1999, 792-797.
7
-
-P. D'Ambra, S. Filippone, D. di Serafino,
-On the Development of PSBLAS-based Parallel Two-level Schwarz Preconditioners,
-Applied Numerical Mathematics, Elsevier Science,
-57 (11-12), 2007, 1181-1196.
8
-
-P. D'Ambra, D. di Serafino, S. Filippone,
-MLD2P4: a Package of Parallel Multilevel
-Algebraic Domain Decomposition Preconditioners
-in Fortran 95, ACM Trans. Math. Softw., 37(3), 2010, art. 30.
9
-
-T. A. Davis,
-Algorithm 832: UMFPACK - an Unsymmetric-pattern Multifrontal
-Method with a Column Pre-ordering Strategy,
-ACM Transactions on Mathematical Software, 30, 2004, 196-199.
-(See also http://www.cise.ufl.edu/ davis/)
10
-
-J. W. Demmel, S. C. Eisenstat, J. R. Gilbert, X. S. Li, J. W. H. Liu,
-A supernodal approach to sparse partial pivoting,
-SIAM Journal on Matrix Analysis and Applications, 20 (3), 1999, 720-755.
11
-
-J. J. Dongarra, J. Du Croz, I. S. Duff, S. Hammarling,
-A set of Level 3 Basic Linear Algebra Subprograms,
-ACM Transactions on Mathematical Software, 16 (1) 1990, 1-17.
12
-
-J. J. Dongarra, J. Du Croz, S. Hammarling, R. J. Hanson,
-An extended set of FORTRAN Basic Linear Algebra Subprograms,
-ACM Transactions on Mathematical Software, 14 (1) 1988, 1-17.
13
-
-S. Filippone, A. Buttari,
-PSBLAS-3.0 User's Guide. A Reference Guide for the Parallel Sparse BLAS Library, 2012,
-available from http://www.ce.uniroma2.it/psblas/.
14
-
-S. Filippone, A. Buttari,
-Object-Oriented Techniques for Sparse Matrix Computations in Fortran 2003.
-ACM Transactions on on Mathematical Software, 38 (4), 2012, art. 23.
15
-
-S. Filippone, M. Colajanni,
-PSBLAS: A Library for Parallel Linear Algebra
-Computation on Sparse Matrices,
-ACM Transactions on Mathematical Software, 26 (4), 2000, 527-550.
16
-
-W. Gropp, S. Huss-Lederman, A. Lumsdaine, E. Lusk, B. Nitzberg, W. Saphir, M. Snir,
-MPI: The Complete Reference. Volume 2 - The MPI-2 Extensions,
-MIT Press, 1998.
17
-
-C. L. Lawson, R. J. Hanson, D. Kincaid, F. T. Krogh,
-Basic Linear Algebra Subprograms for FORTRAN usage,
-ACM Transactions on Mathematical Software, 5 (3), 1979, 308-323.
18
-
-X. S. Li, J. W. Demmel,
-SuperLU_DIST: A Scalable Distributed-memory
-Sparse Direct Solver for Unsymmetric Linear Systems,
-ACM Transactions on Mathematical Software, 29 (2), 2003, 110-140.
19
-
-Y. Notay, P. S. Vassilevski,
-Recursive Krylov-based multigrid cycles,
-Numerical Linear Algebra with Applications, 15 (5), 2008, 473-487.
20
-
-Y. Saad,
-Iterative methods for sparse linear systems, 2nd edition, SIAM, 2003.
21
-
-B. Smith, P. Bjorstad, W. Gropp,
-Domain Decomposition: Parallel Multilevel Methods for Elliptic
-Partial Differential Equations,
-Cambridge University Press, 1996.
22
-
-M. Snir, S. Otto, S. Huss-Lederman, D. Walker, J. Dongarra,
-MPI: The Complete Reference. Volume 1 - The MPI Core, second edition,
-MIT Press, 1998.
23
-
-K. Stüben,
-An Introduction to Algebraic Multigrid,
-in A. Schüller, U. Trottenberg, C. Oosterlee, Multigrid,
-Academic Press, 2001.
24
-
-R. S. Tuminaro, C. Tong,
-Parallel Smoothed Aggregation Multigrid: Aggregation Strategies on Massively Parallel Machines, in J. Donnelley, editor, Proceedings of SuperComputing 2000, Dallas, 2000.
25
-
-P. Vanek, J. Mandel, M. Brezina,
-Algebraic Multigrid by Smoothed Aggregation for Second and Fourth Order Elliptic Problems,
+
+P. R. Amestoy, C. Ashcraft, O. Boiteau, A. Buttari, J. L'Excellent, C. Weisbecker,
+Improving multifrontal methods by means of block low-rank representations,
+SIAM Journal on Scientific Computing, volume 37 (3), 2015, A1452-A1474.
+See also http://mumps.enseeiht.fr.2
+
+M. Brezina, P. Vanek,
+A Black-Box Iterative Solver Based on a Two-Level Schwarz Method,
+Computing, 63, 1999, 233-263.3
+
+W. L. Briggs, V. E. Henson, S. F. McCormick,
+A Multigrid Tutorial, Second Edition,
+SIAM, 2000.4
+
+A. Buttari, P. D'Ambra, D. di Serafino, S. Filippone,
+Extending PSBLAS to Build Parallel Schwarz Preconditioners,
+in J. Dongarra, K. Madsen, J. Wasniewski, editors,
+Proceedings of PARA 04 Workshop on State of the Art
+in Scientific Computing, Lecture Notes in Computer Science,
+Springer, 2005, 593-602.5
+
+A. Buttari, P. D'Ambra, D. di Serafino, S. Filippone,
+2LEV-D2P4: a package of high-performance preconditioners
+for scientific and engineering applications,
+Applicable Algebra in Engineering, Communications and Computing,
+18 (3) 2007, 223-239.6
+
+X. C. Cai, M. Sarkis,
+A Restricted Additive Schwarz Preconditioner for General Sparse Linear Systems,
+SIAM Journal on Scientific Computing, 21 (2), 1999, 792-797.7
+
+P. D'Ambra, S. Filippone, D. di Serafino,
+On the Development of PSBLAS-based Parallel Two-level Schwarz Preconditioners,
+Applied Numerical Mathematics, Elsevier Science,
+57 (11-12), 2007, 1181-1196.8
+
+P. D'Ambra, D. di Serafino, S. Filippone,
+MLD2P4: a Package of Parallel Multilevel
+Algebraic Domain Decomposition Preconditioners
+in Fortran 95, ACM Trans. Math. Softw., 37(3), 2010, art. 30.9
+
+T. A. Davis,
+Algorithm 832: UMFPACK - an Unsymmetric-pattern Multifrontal
+Method with a Column Pre-ordering Strategy,
+ACM Transactions on Mathematical Software, 30, 2004, 196-199.
+(See also http://www.cise.ufl.edu/~davis/)10
+
+J. W. Demmel, S. C. Eisenstat, J. R. Gilbert, X. S. Li, J. W. H. Liu,
+A supernodal approach to sparse partial pivoting,
+SIAM Journal on Matrix Analysis and Applications, 20 (3), 1999, 720-755.11
+
+J. J. Dongarra, J. Du Croz, I. S. Duff, S. Hammarling,
+A set of Level 3 Basic Linear Algebra Subprograms,
+ACM Transactions on Mathematical Software, 16 (1) 1990, 1-17.12
+
+J. J. Dongarra, J. Du Croz, S. Hammarling, R. J. Hanson,
+An extended set of FORTRAN Basic Linear Algebra Subprograms,
+ACM Transactions on Mathematical Software, 14 (1) 1988, 1-17.13
+
+S. Filippone, A. Buttari,
+PSBLAS 3.5.0 User's Guide. A Reference Guide for the Parallel Sparse BLAS Library, 2012,
+available from https://github.com/sfilippone/psblas3/tree/master/docs.14
+
+S. Filippone, A. Buttari,
+Object-Oriented Techniques for Sparse Matrix Computations in Fortran 2003.
+ACM Transactions on on Mathematical Software, 38 (4), 2012, art. 23.15
+
+S. Filippone, M. Colajanni,
+PSBLAS: A Library for Parallel Linear Algebra
+Computation on Sparse Matrices,
+ACM Transactions on Mathematical Software, 26 (4), 2000, 527-550.16
+
+W. Gropp, S. Huss-Lederman, A. Lumsdaine, E. Lusk, B. Nitzberg, W. Saphir, M. Snir,
+MPI: The Complete Reference. Volume 2 - The MPI-2 Extensions,
+MIT Press, 1998.17
+
+C. L. Lawson, R. J. Hanson, D. Kincaid, F. T. Krogh,
+Basic Linear Algebra Subprograms for FORTRAN usage,
+ACM Transactions on Mathematical Software, 5 (3), 1979, 308-323.18
+
+X. S. Li, J. W. Demmel,
+SuperLU_DIST: A Scalable Distributed-memory
+Sparse Direct Solver for Unsymmetric Linear Systems,
+ACM Transactions on Mathematical Software, 29 (2), 2003, 110-140.19
+
+Y. Notay, P. S. Vassilevski,
+Recursive Krylov-based multigrid cycles,
+Numerical Linear Algebra with Applications, 15 (5), 2008, 473-487. 20
+
+Y. Saad,
+Iterative methods for sparse linear systems, 2nd edition, SIAM, 2003.21
+
+B. Smith, P. Bjorstad, W. Gropp,
+Domain Decomposition: Parallel Multilevel Methods for Elliptic
+Partial Differential Equations,
+Cambridge University Press, 1996.22
+
+M. Snir, S. Otto, S. Huss-Lederman, D. Walker, J. Dongarra,
+MPI: The Complete Reference. Volume 1 - The MPI Core, second edition,
+MIT Press, 1998.23
+
+K. Stüben,
+An Introduction to Algebraic Multigrid,
+in A. Schüller, U. Trottenberg, C. Oosterlee, Multigrid,
+Academic Press, 2001.24
+
+R. S. Tuminaro, C. Tong,
+Parallel Smoothed Aggregation Multigrid: Aggregation Strategies on Massively Parallel Machines, in J. Donnelley, editor, Proceedings of SuperComputing 2000, Dallas, 2000.25
+
+P. Vanek, J. Mandel, M. Brezina,
+Algebraic Multigrid by Smoothed Aggregation for Second and Fourth Order Elliptic Problems,
Computing, 56 (3) 1996, 179-196.
-
+
diff --git a/docs/html/node31.html b/docs/html/node31.html
index 13a02ef9..b5ab483b 100644
--- a/docs/html/node31.html
+++ b/docs/html/node31.html
@@ -63,7 +63,7 @@ Mathematics Department, Macquarie University, Sydney.
The command line arguments were:
latex2html -local_icons -noaddress -dir ../../html userhtml.tex
-The translation was initiated by Salvatore Filippone on 2017-08-09
+The translation was initiated by Salvatore Filippone on 2017-09-15
| | |