Abstract
In preceding papers [8], [11], [12], [6], a class of matrices (-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 lower complexity of the -matrix arithmetic. On the other hand, it preserves the approximation power which is known in the case of the standard admissibility criterion. Furthermore, the new weak -matrix format allows to analyse the accuracy of the -matrix inversion and multiplication.
Similar content being viewed by others
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Hackbusch, W., Khoromskij, B. & Kriemann, R. Hierarchical Matrices Based on a Weak Admissibility Criterion. Computing 73, 207–243 (2004). https://doi.org/10.1007/s00607-004-0080-4
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00607-004-0080-4