Existence of -matrix approximants to the inverses of BEM matrices: the simple-layer operator
arXiv:1311.5028 · doi:10.1090/mcom/2990
Abstract
We consider the question of approximating the inverse of the Galerkin stiffness matrix obtained by discretizing the simple-layer operator with piecewise constant functions. The block partitioning of is assumed to satisfy any of the standard admissibility criteria that are employed in connection with clustering algorithms to approximate the discrete BEM operator . We show that can be approximated by blockwise low-rank matrices such that the error decays exponentially in the block rank employed. Similar exponential approximability results are shown for the Cholesky factorization of .
References in corpus (5)
- A fast direct solver for structured linear systems by recursive skeletonization
- An O(N) Direct Solver for Integral Equations on the Plane
- Hierarchical interpolative factorization for elliptic operators: integral equations
- Hierarchical interpolative factorization for elliptic operators: differential equations
- An O(N) algorithm for constructing the solution operator to 2D elliptic boundary value problems in the absence of body loads
Cited by in corpus (9)
- -matrix approximability of inverses of discretizations of the fractional Laplacian
- H-matrix approximability of the inverses of FEM matrices
- Existence of -matrix approximants to the inverse of BEM matrices: the hyper-singular integral operator
- Local convergence of the boundary element method on polyhedral domains
- Caccioppoli-type estimates and -Matrix approximations to inverses for FEM-BEM couplings
- Exponential meshes and -matrices
- -inverses for RBF interpolation
- Approximating inverse FEM matrices on non-uniform meshes with -matrices
- Complexity estimates for triangular hierarchical matrix algorithms