Fast algorithms for hierarchically semiseparable matrices

Semiseparable matrices and many other rank-structured matrices have been widely used in developing new fast matrix algorithms. In this paper, we generalize the hierarchically semiseparable (HSS) matrix representations and propose some fast algorithms for HSS matrices. We represent HSS matrices in terms of general binary HSS trees and use simplified postordering notation for HSS forms. Fast HSS algorithms including new HSS structure generation and HSS form Cholesky factorization are developed. Moreover, we provide a new linear complexity explicit ULV factorization algorithm for symmetric positive definite HSS matrices with a low-rank property. The corresponding factors can be used to solve the HSS systems also in linear complexity. Numerical examples demonstrate the efficiency of the algorithms. All these algorithms have nice data locality. They are useful in developing fast-structured numerical methods for large discretized PDEs (such as elliptic equations), integral equations, eigenvalue problems, etc. Some applications are shown. Copyright q 2009 John Wiley & Sons, Ltd.

[1]  Raf Vandebril,et al.  A note on the representation and definition of semiseparable matrices , 2005, Numer. Linear Algebra Appl..

[2]  Alle-Jan van der Veen,et al.  Some Fast Algorithms for Sequentially Semiseparable Representations , 2005, SIAM J. Matrix Anal. Appl..

[3]  Jianlin Xia,et al.  A Fast QR Algorithm for Companion Matrices , 2007 .

[4]  I. Gohberg,et al.  On a new class of structured matrices , 1999 .

[5]  V. Rokhlin,et al.  A fast direct solver for boundary integral equations in two dimensions , 2003 .

[6]  Joseph W. H. Liu,et al.  Elimination Structures for Unsymmetric Sparse $LU$ Factors , 1993, SIAM J. Matrix Anal. Appl..

[7]  Thomas Kailath,et al.  Linear complexity algorithms for semiseparable matrices , 1985 .

[8]  Shivkumar Chandrasekaran,et al.  On the Numerical Rank of the Off-Diagonal Blocks of Schur Complements of Discretized Elliptic PDEs , 2010, SIAM J. Matrix Anal. Appl..

[9]  S. Chandrasekaran,et al.  SUPERFAST MULTIFRONTAL METHOD FOR STRUCTURED LINEAR SYSTEMS OF EQUATIONS , 2007 .

[10]  S. Chandrasekaran,et al.  A fast adaptive solver for hierarchically semiseparable representations , 2005 .

[11]  Israel Koltracht,et al.  Linear complexity algorithm for semiseparable matrices , 1985 .

[12]  Joseph W. H. Liu,et al.  The Theory of Elimination Trees for Sparse Unsymmetric Matrices , 2005, SIAM J. Matrix Anal. Appl..

[13]  J. CARRIERt,et al.  A FAST ADAPTIVE MULTIPOLE ALGORITHM FOR PARTICLE SIMULATIONS * , 2022 .

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

[15]  James Demmel,et al.  Applied Numerical Linear Algebra , 1997 .

[16]  A. George.  Nested Dissection of a Regular Finite Element Mesh , 1973 .

[17]  Mario Bebendorf,et al.  Mathematik in den Naturwissenschaften Leipzig Existence of H-Matrix Approximants to the Inverse FE-Matrix of Elliptic Operators with L ∞-Coefficients , 2003 .

[18]  Jack Dongarra,et al.  LAPACK Users' Guide, 3rd ed. , 1999 .

[19]  Shivkumar Chandrasekaran,et al.  A Superfast Algorithm for Toeplitz Systems of Linear Equations , 2007, SIAM J. Matrix Anal. Appl..

[20]  W. Hackbusch,et al.  On H2-Matrices , 2000 .

[21]  Shivkumar Chandrasekaran,et al.  A Hierarchical Semi-separable Moore-Penrose Equation Solver , 2006 .

[22]  Jianlin Xia,et al.  Fast Condition Estimation for a Class of Structured Eigenvalue Problems , 2008, SIAM J. Matrix Anal. Appl..

[23]  Marc Van Barel,et al.  A QR-Based Solver for Rank Structured Matrices , 2008, SIAM J. Matrix Anal. Appl..

[24]  R. Vandebril,et al.  Rank structured matrix operations , 2006 .

[25]  Boris N. Khoromskij,et al.  A Sparse H-Matrix Arithmetic. Part II: Application to Multi-Dimensional Problems , 2000, Computing.

[26]  Michael J. Holst,et al.  Local multilevel preconditioners for elliptic equations with jump coefficients on bisection grids , 2010, Comput. Vis. Sci..

[27]  W. Hackbusch,et al.  An introduction to hierarchical matrices , 2001 .

[28]  Jianlin Xia,et al.  Superfast Multifrontal Method for Large Structured Linear Systems of Equations , 2009, SIAM J. Matrix Anal. Appl..

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

[30]  Gene H. Golub,et al.  Matrix computations , 1983 .

[31]  Joseph W. H. Liu,et al.  The Multifrontal Method for Sparse Matrix Solution: Theory and Practice , 1992, SIAM Rev..

[32]  Leslie Greengard,et al.  A fast algorithm for particle simulations , 1987 .

[33]  Stanley C. Eisenstat,et al.  A TREE-BASED DATAFLOW MODEL FOR THE UNSYMMETRIC MULTIFRONTAL METHOD , 2005 .

[34]  I. Gohberg,et al.  The QR iteration method for Hermitian quasiseparable matrices of an arbitrary order , 2005 .

[35]  Jianlin Xia,et al.  Statistical Condition Estimation for the Roots of Polynomials , 2008, SIAM J. Sci. Comput..

[36]  Patrick Dewilde,et al.  Iterative solution methods based on the Hierarchically Semi-Separable Representation , 2006 .

[37]  Per-Gunnar Martinsson,et al.  A Fast Direct Solver for a Class of Elliptic Partial Differential Equations , 2009, J. Sci. Comput..

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

[39]  S. CHANDRASEKARAN,et al.  SOME FAST ALGORITHMS FOR HIERARCHICALLY SEMISEPARABLE MATRICES , 2007 .

[40]  Victor Y. Pan,et al.  Fast and stable QR eigenvalue algorithms for generalized companion matrices and secular equations , 2005, Numerische Mathematik.

[41]  John K. Reid,et al.  The Multifrontal Solution of Indefinite Sparse Symmetric Linear , 1983, TOMS.

[42]  Shivkumar Chandrasekaran,et al.  A Fast ULV Decomposition Solver for Hierarchically Semiseparable Representations , 2006, SIAM J. Matrix Anal. Appl..

[43]  T. Pals,et al.  FAST MATRIX ALGORITHMS FOR HIERARCHICALLY SEMI-SEPARABLE REPRESENTATIONS , 2002 .

[44]  Steffen Börm,et al.  Data-sparse Approximation by Adaptive ℋ2-Matrices , 2002, Computing.

[45]  G. Golub,et al.  A bibliography on semiseparable matrices* , 2005 .

[46]  Joseph W. H. Liu.  The role of elimination trees in sparse factorization , 1990 .

[47]  Alle-Jan van der Veen,et al.  Fast Stable Solver for Sequentially Semi-separable Linear Systems of Equations , 2002, HiPC.

[48]  V. Rokhlin.  Rapid Solution of Integral Equations of Scattering Theory , 1990 .

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