Iterative representing set selection for nested cross approximation

Summary A new fast algebraic method for obtaining an -approximation of a matrix from its entries is presented. The main idea behind the method is based on the nested representation and the maximum volume principle to select submatrices in low-rank matrices. A special iterative approach for the computation of so-called representing sets is established. The main advantage of the method is that it uses only the hierarchical partitioning of the matrix and does not require special ‘proxy surfaces’ to be selected in advance. The numerical experiments for the electrostatic problem and for the boundary integral operator confirm the effectiveness and robustness of the approach. The complexity is linear in the matrix size and polynomial in the ranks. The algorithm is implemented as an open-source Python package that is available online. Copyright © 2015 John Wiley & Sons, Ltd.

[1]  HackbuschW..  A sparse matrix arithmetic based on H-matrices. Part I , 1999 .

[2]  D. Zorin,et al.  A kernel-independent adaptive fast multipole algorithm in two and three dimensions , 2004 .

[3]  Ronald Kriemann,et al.  Hierarchical Matrices Based on a Weak Admissibility Criterion , 2004, Computing.

[4]  S. Stavtsev.  Application of the method of incomplete cross approximation to a nonstationary problem of vortex rings dynamics , 2012 .

[5]  Eugene E. Tyrtyshnikov,et al.  Incomplete Cross Approximation in the Mosaic-Skeleton Method , 2000, Computing.

[6]  S. Goreinov,et al.  Pseudo-skeleton approximations by matrices of maximal volume , 1997 .

[7]  C. Cramer,et al.  Implicit Solvation Models: Equilibria, Structure, Spectra, and Dynamics. , 1999, Chemical reviews.

[8]  John R. Williams,et al.  Wavelet–Galerkin solutions for one‐dimensional partial differential equations , 1994 .

[9]  Leslie Greengard,et al.  A Fast Direct Solver for Structured Linear Systems by Recursive Skeletonization , 2012, SIAM J. Sci. Comput..

[10]  E. Tyrtyshnikov.  Mosaic-Skeleton approximations , 1996 .

[11]  Christian Lage,et al.  Wavelet Galerkin algorithms for boundary integral equations , 1997 .

[12]  S. Goreinov,et al.  The maximum-volume concept in approximation by low-rank matrices , 2001 .

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

[14]  E. Tyrtyshnikov,et al.  TT-cross approximation for multidimensional arrays , 2010 .

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

[16]  Piet Hut,et al.  A hierarchical O(N log N) force-calculation algorithm , 1986, Nature.

[17]  S. Goreinov,et al.  How to find a good submatrix , 2010 .

[18]  S. Chandrasekaran,et al.  Algorithms to solve hierarchically semi-separable systems , 2007 .

[19]  S. Goreinov,et al.  A Theory of Pseudoskeleton Approximations , 1997 .

[20]  Per-Gunnar Martinsson,et al.  A Fast Randomized Algorithm for Computing a Hierarchically Semiseparable Representation of a Matrix , 2011, SIAM J. Matrix Anal. Appl..

[21]  Jacopo Tomasi,et al.  Molecular Interactions in Solution: An Overview of Methods Based on Continuous Distributions of the Solvent , 1994 .

[22]  R Abagyan,et al.  Rapid boundary element solvation electrostatics calculations in folding simulations: successful folding of a 23-residue peptide. , 2001, Biopolymers.

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

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

[25]  Mario Bebendorf,et al.  Constructing nested bases approximations from the entries of non-local operators , 2012, Numerische Mathematik.

[26]  Dmitry V. Savostyanov,et al.  Quasioptimality of maximum-volume cross interpolation of tensors , 2013, 1305.1818.

[27]  W. Hackbusch,et al.  H 2 -matrix approximation of integral operators by interpolation , 2002 .

[28]  S. Börm.  Efficient Numerical Methods for Non-local Operators , 2010 .

[29]  Mario Bebendorf,et al.  Approximation of boundary element matrices , 2000, Numerische Mathematik.

[30]  Severnyi Kavkaz.  Pseudo-Skeleton Approximations by Matrices of Maximal Volume , 2022 .