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.

Lecture Note
21/2003

Hierarchical Matrices

Steffen Börm, Lars Grasedyck and Wolfgang Hackbusch

Abstract

These are the lecture notes for a winter school on the subject of hierarchical matrices. They give an introduction both to the basic theory of H-matrices, including complexity estimates and error estimates, and to the practice, i.e., the efficient implementation of the construction of cluster trees and block cluster trees, the approximation of finite element and boundary element matrices and the H-matrix arithmetic operations.

A program library containing all the routines from these notes and many extensions for more sophisticated applications can be obtained from the authors.

Received:
02.10.03
Published:
02.10.03
MSC Codes:
65F05, 65F30, 65N38
PACS:
02.30.Jr
Keywords:
hierarchical matrices, panel clustering, data-sparse approximation, bem