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
7/2003

${\mathcal H}^2$-matrices - Multilevel methods for the approximation of integral operators

Steffen Börm

Abstract

Multigrid methods are typically used to solve partial differential equations, i.e., they approximate the inverse of the corresponding partial differential operators. At least for elliptic PDEs, this inverse can be expressed in the form of an integral operator by Green's theorem.

This implies that multigrid methods approximate certain integral operators, so it is straightforward to look for variants of multigrid methods that can be used to approximate more general integral operators.

${\mathcal H}^2$-matrices combine a multigrid-like structure with ideas from panel clustering algorithms in order to provide a very efficient method for discretizing and evaluating the integral operators found, e.g., in boundary element applications.

Received:
31.01.03
Published:
31.01.03
MSC Codes:
65F30, 65N38
Keywords:
bem, data-sparse approximations, hierarchical matrices

Related publications

inJournal
2004 Repository Open Access
Steffen Börm

\(\mathscr {H}^2\)-matrices - multilevel methods for the approximation of integral operators

In: Computing and visualization in science, 7 (2004) 3/4, pp. 173-181