Search

MiS Preprint Repository

Delve into the future of research at MiS with our preprint repository. Our scientists are making groundbreaking discoveries and sharing their latest findings before they are published. Explore repository to stay up-to-date on the newest developments and breakthroughs.

MiS Preprint
2/2003

Hierarchical Matrices based on a Weak Admissibility Criterion

Wolfgang Hackbusch, Boris N. Khoromskij and Ronald Kriemann

Abstract

In preceding papers, a class of hierarchical matrices has been developed which are data-sparse and allow to approximate integral and more general nonlocal operators with almost linear complexity. In the present paper, a weaker admissibility condition is described which leads to a coarser partitioning of the hierarchical matrix format. A coarser format yields smaller constants in the work and storage estimates and thus leads to a cheaper hierarchical matrix arithmetic. On the other hand, in the case of boundary element problem for one-dimensional manifolds, the new approach preserves the approximation power which is known from the standard admissibility criterion. Furthermore, the weak hierarchical matrix format allows to analyse the accuracy of the hierarchical matrix inversion and multiplication.

Received:
Jan 10, 2003
Published:
Jan 10, 2003
MSC Codes:
65F50, 65F30, 65F35, 65F10
Keywords:
integral equations, bem, hierarchical matrices, weak admissibility

Related publications

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

Hierarchical matrices based on a weak admissibility criterion

In: Computing, 73 (2004) 3, pp. 207-243