Abstract
In previous papers hierarchical matrices were introduced which are data-sparse and allow an approximate matrix arithmetic of nearly optimal complexity. In this paper we analyse the complexity (storage, addition, multiplication and inversion) of the hierarchical matrix arithmetics. Two criteria, the sparsity and idempotency, are sufficient to give the desired bounds. For standard finite element and boundary element applications we present a construction of the hierarchical matrix format for which we can give explicit bounds for the sparsity and idempotency.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Grasedyck, L., Hackbusch, W. Construction and Arithmetics of H-Matrices. Computing 70, 295–334 (2003). https://doi.org/10.1007/s00607-003-0019-1
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00607-003-0019-1