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

From MaRDI portal
Publication:3450033



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




Cites work









This page was built for publication: Existence of $\mathcal {H}$-matrix approximants to the inverses of BEM matrices: The simple-layer operator

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3450033)