MiS Preprint Repository
We have decided to discontinue the publication of preprints on our preprint server end of 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.
Hierarchical Matrices based on a Weak Admissibility Criterion
Wolfgang Hackbusch, Boris N. Khoromskij and Ronald KriemannAbstract
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:
- 10.01.03
- Published:
- 10.01.03
- MSC Codes:
- 65F50, 65F30, 65F35, 65F10
- Keywords:
- integral equations, bem, hierarchical matrices, weak admissibility