Search

MiS Preprint Repository

We have decided to discontinue the publication of preprints on our preprint server as of 1 March 2024. The publication culture within mathematics has changed so much due to the rise of repositories such as ArXiV (www.arxiv.org) that we are encouraging all institute members to make their preprints available there. An institute's repository in its previous form is, therefore, unnecessary. The preprints published to date will remain available here, but we will not add any new preprints here.

MiS Preprint
25/2004

Direct Schur complement method by domain decomposition based on $\mathcal{H}$-matrix approximation

Wolfgang Hackbusch, Boris N. Khoromskij and Ronald Kriemann

Abstract

The goal of this paper is the construction of a data-sparse approximation to the Schur complement on the interface corresponding to FEM and BEM approximations of an elliptic equation by domain decomposition. Using the hierarchical ($\mathcal{H}$-matrix) formats we elaborate the approximate Schur complement inverse in an explicit form. The required cost $\mathcal{O}(N_{\Gamma}\log^{q}N_{\Gamma})$ is almost linear in $N_{\Gamma}$ -- the number of degrees of freedom on the interface. As input, we require the Schur complement matrices corresponding to subdomains and represented in the $\mathcal{H}$-matrix format. In the case of piecewise constant coefficients these matrices can be computed via the BEM representation with the cost $\mathcal{O}(N_{\Gamma}\log^{q}N_{\Gamma})$, while in the general case the FEM discretisation leads to the complexity $O(N_{\Omega}\log^{q}N_{\Omega})$, where $N_{\Omega} $ is the number of degrees of freedom in the domain.

Received:
28.04.04
Published:
28.04.04
MSC Codes:
65F30, 65F50, 65N35, 65F10
Keywords:
domain decomposition, schur complement, $\mathcal{h}$-matrix approximation

Related publications

inJournal
2005 Repository Open Access
Wolfgang Hackbusch, Boris N. Khoromskij and Ronald Kriemann

Direct Schur complement method by domain decomposition based on \( \mathscr{H} \)-matrix approximation

In: Computing and visualization in science, 8 (2005) 3/4, pp. 179-188