Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1705.05443

SMASH: Structured matrix approximation by separation and hierarchy

Difeng Cai·Edmond Chow·Yousef Saad·Yuanzhe Xi
View original source ↗Read source document ↗Export metadata ↓

Abstract

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 and greatly improves the efficiency. The algorithm follows a bottom-up traversal of the tree and is able to perform the operations associated with each node on the same level in parallel. A strong rank-revealing factorization is applied to the initial analytic approximation in the separation regime so that a special structure is incorporated into the final nested bases. As a consequence, the storage is significantly reduced on one hand and a hierarchy of the original grid is constructed on the other hand. Due to this hierarchy, nested bases at upper levels can be computed in a similar way as the leaf level operations but on coarser grids. The main advantages of SMASH include its simplicity of implementation, its flexibility to construct various hierarchical rank structures and a low storage cost. Rigorous error analysis and complexity analysis are conducted to show that this scheme is fast and stable. The efficiency and robustness of SMASH are demonstrated through various test problems arising from integral equations, structured matrices, etc.

Explore related subjects

math.NAcs.NA

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Difeng Cai, Edmond Chow, Yousef Saad, Yuanzhe Xi. 2017-05-15. SMASH: Structured matrix approximation by separation and hierarchy. https://arxiv.org/abs/1705.05443

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Fully spectral scheme for the linear BGK equation on the whole space

In this article, we design a fully spectral method in both space and velocity for a linear inhomogeneous kinetic equation with mass, momentum and energy conservation. We focus on the linear BGK equation with a confinement potential $Φ$, even if the method could be applied to different collision operators. It is based upon the projection on Hermite polynomials in velocity and orthonormal polynomials with respect to the weight $e^{-$Φ$}$ in space. The potential $Φ$ is assumed to be a polynomial. It is, to the author's knowledge, the first scheme which preserves hypocoercive behavior in addition to the conservation laws. These different properties are illustrated numerically on both quadratic and double well potential.

math.NA↗
arXiv2026

Inverse inequalities for kernel-based approximation on bounded domains and Riemannian manifolds

This paper establishes inverse inequalities for kernel-based approximation spaces defined on bounded Lipschitz domains in $\mathbb{R}^d$ and compact Riemannian manifolds. While inverse inequalities are well-studied for polynomial spaces, their extension to kernel-based trial spaces poses significant challenges. For bounded Lipschitz domains, we extend prior Bernstein inequalities, which only apply to a limited range of Sobolev orders, to the full range of lower and upper orders, and derive Nikolskii inequalities that bound $L_\infty$ norms by $L_2$ norms. For compact Riemannian manifolds, we focus on restricted kernels, which are defined as the restriction of positive definite kernels from the ambient Euclidean space to the manifold, and prove their counterparts.

math.NA↗
arXiv2026

Error Estimates for Hyperbolic Scaling Limits of Linear Kinetic Models on Networks

This paper studies linear discrete kinetic models on networks and their asymptotic behavior in the small Knudsen number limit. For coupling conditions at an n-edge junction under a symmetric formulation, we introduce a change of variables that reformulates the system into n independent initial-boundary value problems. The asymptotic expansions are then constructed and rigorously justified by deriving an error estimate based on the energy method.

math.NA↗