2LEV-D2P4: a package of high-performance preconditioners for scientific and engineering applications

We present a package of parallel preconditioners which implements one-level and two-level Domain Decomposition algorithms on the top of the PSBLAS library for sparse matrix computations. The package, named 2LEV-D2P4 (Two-LEVel Domain Decomposition Parallel Preconditioners Package based on PSBLAS), currently includes various versions of additive Schwarz preconditioners that are combined with a coarse-level correction to obtain two-level preconditioners. A pure algebraic formulation of the preconditioners is considered. 2LEV-D2P4 has been written in Fortran~95, exploiting features such as abstract data type creation, functional overloading and dynamic memory management, while providing a smooth path towards the integration in legacy application codes. The package, used with Krylov solvers implemented in PSBLAS, has been tested on large-scale linear systems arising from model problems and real applications, showing its effectiveness.

[1]  Daniela di Serafino,et al.  Extending PSBLAS to Build Parallel Schwarz Preconditioners , 2004, PARA.

[2]  Daniela di Serafino,et al.  On the development of PSBLAS-based parallel two-level Schwarz preconditioners , 2007 .

[3]  Gino Bella,et al.  A Simulation Model for Forest Fires , 2004, PARA.

[4]  Michele Colajanni,et al.  Using a Parallel Library of Sparse Linear Algebra in a Fluid Dynamics Application Code on Linux Clusters , 2002 .

[5]  Randolph E. Bank,et al.  Sparse matrix multiplication package (SMMP) , 1993, Adv. Comput. Math..

[6]  T. Chan,et al.  Domain decomposition algorithms , 1994, Acta Numerica.

[7]  R. C. Whaley,et al.  LAPACK Working Note 94: A User''s Guide to the BLACS v1.0 , 1995 .

[8]  Ray S. Tuminaro,et al.  Parallel Smoothed Aggregation Multigrid : Aggregation Strategies on Massively Parallel Machines , 2000, ACM/IEEE SC 2000 Conference (SC'00).

[9]  C. W. Hirt,et al.  An Arbitrary Lagrangian-Eulerian Computing Method for All Flow Speeds , 1997 .

[10]  Y. Saad,et al.  Overlapping Domain Decomposition Algorithms for General Sparse Matrices , 1996, Numer. Linear Algebra Appl..

[11]  Jack Dongarra,et al.  MPI - The Complete Reference: Volume 1, The MPI Core , 1998 .

[12]  Timothy A. Davis,et al.  Algorithm 832: UMFPACK V4.3---an unsymmetric-pattern multifrontal method , 2004, TOMS.

[13]  Barry F. Smith,et al.  Domain Decomposition: Parallel Multilevel Methods for Elliptic Partial Differential Equations , 1996 .

[14]  William Gropp,et al.  Domain Decomposition: Parallel Multilevel Algorithms for Elliptic Partial Di erential Equations , 1995 .

[15]  James Demmel,et al.  A Supernodal Approach to Sparse Partial Pivoting , 1999, SIAM J. Matrix Anal. Appl..

[16]  Marian Brezina,et al.  A Black-Box Iterative Solver Based on a Two-Level Schwarz Method , 1999, Computing.

[17]  Iain S. Duff,et al.  An overview of the sparse basic linear algebra subprograms: The new standard from the BLAS technical forum , 2002, TOMS.

[18]  Tamara G. Kolda,et al.  An overview of the Trilinos project , 2005, TOMS.

[19]  Olof B. Widlund,et al.  Domain Decomposition Algorithms for Indefinite Elliptic Problems , 2017, SIAM J. Sci. Comput..

[20]  Michele Colajanni,et al.  PSBLAS: a library for parallel linear algebra computation on sparse matrices , 2000, TOMS.

[21]  Marian Brezina,et al.  Algebraic multigrid by smoothed aggregation for second and fourth order elliptic problems , 2005, Computing.

[22]  Vipin Kumar,et al.  A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs , 1998, SIAM J. Sci. Comput..

[23]  James Demmel,et al.  SuperLU_DIST: A scalable distributed-memory sparse direct solver for unsymmetric linear systems , 2003, TOMS.

[24]  Xiao-Chuan Cai,et al.  A Restricted Additive Schwarz Preconditioner for General Sparse Linear Systems , 1999, SIAM J. Sci. Comput..

[25]  Iain S. Duff,et al.  Level 3 basic linear algebra subprograms for sparse matrices: a user-level interface , 1997, TOMS.