Existence of H\mathcal{H}-matrix approximants to the inverses of BEM matrices: the simple-layer operator

preprint2014arXivOpen access

Abstract

We consider the question of approximating the inverse W=V−1\mathbf W = \mathbf V^{-1} of the Galerkin stiffness matrix V\mathbf V obtained by discretizing the simple-layer operator VV with piecewise constant functions. The block partitioning of W\mathbf W is assumed to satisfy any of the standard admissibility criteria that are employed in connection with clustering algorithms to approximate the discrete BEM operator V\mathbf V. We show that W\mathbf W 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 V\mathbf V.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.