SMASH: Structured matrix approximation by separation and hierarchy

  title={SMASH: Structured matrix approximation by separation and hierarchy},
  author={Difeng Cai and E. Chow and Lucas Erlandson and Y. Saad and Yuanzhe Xi},
  journal={Numer. Linear Algebra Appl.},
  • Difeng Cai, E. Chow, +2 authors Yuanzhe Xi
  • Published 2018
  • Mathematics, Computer Science
  • Numer. Linear Algebra Appl.
  • This paper presents an efficient method to perform Structured Matrix Approximation by Separation and Hierarchy (SMASH), when the original dense matrix is associated with a kernel function. Given points in a domain, a tree structure is first constructed based on an adaptive partitioning of the computational domain to facilitate subsequent approximation procedures. In contrast to existing schemes based on either analytic or purely algebraic approximations, SMASH takes advantage of both approaches… CONTINUE READING
    13 Citations
    Accelerating Parallel Hierarchical Matrix-Vector Products via Data-Driven Sampling
    An efficient method for block low-rank approximations for kernel matrix systems
    • 4
    • PDF
    A power Schur complement Low-Rank correction preconditioner for general sparse linear systems
    Fast Computation of Spectral Densities for Generalized Eigenvalue Problems
    • 9
    • PDF
    H 2 Pack : High-Performance H 2 Matrix Package for Kernel Matrices Using the Proxy Point Method
    • 1
    • Highly Influenced
    • PDF
    MatRox: modular approach for improving data locality in hierarchical (Mat)rix App(Rox)imation
    Error analysis of an accelerated interpolative decomposition for 3D Laplace problems
    • 1
    • PDF
    A Low-Rank Technique for Computing the Quasi-Stationary Distribution of Subcritical Galton-Watson Processes


    Efficient Structured Multifrontal Factorization for General Large Sparse Matrices
    • J. Xia
    • Computer Science, Mathematics
    • SIAM J. Sci. Comput.
    • 2013
    • 78
    • PDF
    Construction of Data-Sparse H2-Matrices by Hierarchical Compression
    • S. Börm
    • Computer Science, Mathematics
    • SIAM J. Sci. Comput.
    • 2009
    • 36
    • PDF
    A Fast Direct Solver for Structured Linear Systems by Recursive Skeletonization
    • 149
    • PDF
    Data-sparse approximation of non-local operators by H2-matrices
    • 22
    • PDF
    A Fast Randomized Algorithm for Computing a Hierarchically Semiseparable Representation of a Matrix
    • P. Martinsson
    • Computer Science, Mathematics
    • SIAM J. Matrix Anal. Appl.
    • 2011
    • 107
    • PDF
    Hierarchical Interpolative Factorization for Elliptic Operators: Differential Equations
    • 53
    • PDF
    A Fast Randomized Eigensolver with Structured LDL Factorization Update
    • 18
    • PDF
    Finding Structure with Randomness: Probabilistic Algorithms for Constructing Approximate Matrix Decompositions
    • 2,486
    • PDF