Lecture note 21/2003
Steffen Börm, Lars Grasedyck, and Wolfgang Hackbusch
Contact the author: Please use for correspondence this email.
Submission date: 02. Oct. 2003 (revised version: June 2006)
MSC-Numbers: 65F05, 65F30, 65N38
Keywords and phrases: hierarchical matrices, panel clustering, data-sparse approximation, bem
Download full preprint: PDF (1590 kB), PS ziped (849 kB)
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.