Performance Of H-Lu Preconditioning For Sparse Matrices

Abstract In this paper we review the technique of hierarchical matrices and put it into the context of black-box solvers for large linear systems. Numerical examples for several classes of problems from medium- to large-scale illustrate the applicability and efficiency of this technique. We compare the results with those of several direct solvers (which typically scale quadratically in the matrix size) as well as an iterative solver (algebraic multigrid) which scales linearly (if it converges in O(1) steps).

[1]  Fang Yang,et al.  An Algebraic Approach for H-matrix Preconditioners ∗ Suely , 2006 .

[2]  Mario Bebendorf,et al.  Why Finite Element Discretizations Can Be Factored by Triangular Hierarchical Matrices , 2007, SIAM J. Numer. Anal..

[3]  Oliver Bröker,et al.  Robust parallel smoothing for multigrid via sparse approximate inverses , 2000 .

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

[5]  Wolfgang Hackbusch,et al.  A Sparse Matrix Arithmetic Based on H-Matrices. Part I: Introduction to H-Matrices , 1999, Computing.

[6]  Norman E. Gibbs,et al.  A Comparison of Several Bandwidth and Profile Reduction Algorithms , 1976, TOMS.

[7]  Ronald Kriemann,et al.  Parallel Black Box Domain Decomposition Based H-LU Preconditioning , 2005 .

[8]  Patrick R. Amestoy,et al.  Multifrontal parallel distributed symmetric and unsymmetric solvers , 2000 .

[9]  W. Hackbusch,et al.  Introduction to Hierarchical Matrices with Applications , 2003 .

[10]  Sabine Le Borne,et al.  H-matrix Preconditioners in Convection-Dominated Problems , 2005, SIAM J. Matrix Anal. Appl..

[11]  V. E. Henson,et al.  BoomerAMG: a parallel algebraic multigrid solver and preconditioner , 2002 .

[12]  Patrick Amestoy,et al.  Hybrid scheduling for the parallel solution of linear systems , 2006, Parallel Comput..

[13]  Wolfgang Fichtner,et al.  Efficient Sparse LU Factorization with Left-Right Looking Strategy on Shared Memory Multiprocessors , 2000 .

[14]  正人 木村.  Max-Planck-Institute for Mathematics in the Sciences(海外,ラボラトリーズ) , 2001 .

[15]  Olaf Schenk,et al.  Solving unsymmetric sparse systems of linear equations with PARDISO , 2002, Future Gener. Comput. Syst..

[16]  Cleve Ashcraft,et al.  SPOOLES: An Object-Oriented Sparse Matrix Library , 1999, PPSC.

[17]  Gundolf Haase,et al.  Parallel AMG on Distributed MemoryComputers 1 , 2000 .

[18]  Wolfgang Hackbusch,et al.  Construction and Arithmetics of H-Matrices , 2003, Computing.

[19]  O. Schenk,et al.  ON FAST FACTORIZATION PIVOTING METHODS FOR SPARSE SYMMETRI C INDEFINITE SYSTEMS , 2006 .

[20]  L. Grasedyck,et al.  Domain-decomposition Based ℌ-LU Preconditioners , 2007 .

[21]  Olaf Schenk,et al.  Solving unsymmetric sparse systems of linear equations with PARDISO , 2004, Future Gener. Comput. Syst..

[22]  M. Lintner.  The Eigenvalue Problem for the 2D Laplacian in ℋ-Matrix Arithmetic and Application to the Heat and Wave Equation , 2003, Computing.

[23]  Suely Oliveira,et al.  ℋ︁‐matrix preconditioners for symmetric saddle‐point systems from meshfree discretization , 2008, Numer. Linear Algebra Appl..

[24]  Patrick Amestoy,et al.  A Fully Asynchronous Multifrontal Solver Using Distributed Dynamic Scheduling , 2001, SIAM J. Matrix Anal. Appl..

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

[26]  Michael T. Heath,et al.  Parallel Algorithms for Sparse Linear Systems , 1991, SIAM Rev..

[27]  J. Ruge,et al.  Efficient solution of finite difference and finite element equations by algebraic multigrid (AMG) , 1984 .

[28]  Jorge J. Moré,et al.  Digital Object Identifier (DOI) 10.1007/s101070100263 , 2001 .

[29]  Ronald Kriemann,et al.  Parallel black box $$\mathcal {H}$$-LU preconditioning for elliptic boundary value problems , 2008 .

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