Abstract
The preceding Part I of this paper has introduced a class of matrices (ℋ-matrices) which are data-sparse and allow an approximate matrix arithmetic of almost linear complexity. The matrices discussed in Part I are able to approximate discrete integral operators in the case of one spatial dimension.
In the present Part II, the construction of ℋ-matrices is explained for FEM and BEM applications in two and three spatial dimensions. The orders of complexity of the various matrix operations are exactly the same as in Part I. In particular, it is shown that the applicability of ℋ-matrices does not require a regular mesh. We discuss quasi-uniform unstructured meshes and the case of composed surfaces as well.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received March 3, 1999
Rights and permissions
About this article
Cite this article
Hackbusch, W., Khoromskij, B. A Sparse ℋ-Matrix Arithmetic. . Computing 64, 21–47 (2000). https://doi.org/10.1007/PL00021408
Issue Date:
DOI: https://doi.org/10.1007/PL00021408