Abstract
A class of matrices (ℋ2-matrices) has recently been introduced for storing discretisations of elliptic problems and integral operators from the BEM. These matrices have the following properties: (i) They are sparse in the sense that only few data are needed for their representation. (ii) The matrix-vector multiplication is of linear complexity. (iii) In general, sums and products of these matrices are no longer in the same set, but after truncation to the ℋ2-matrix format these operations are again of quasi-linear complexity.
We introduce the basic ideas of ℋ- and ℋ2-matrices and present an algorithm that adaptively computes approximations of general matrices in the latter format.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received April 17, 2002 Published online: July 26, 2002
Rights and permissions
About this article
Cite this article
Hackbusch, W., Börm, S. Data-sparse Approximation by Adaptive ℋ2-Matrices. Computing 69, 1–35 (2002). https://doi.org/10.1007/s00607-002-1450-4
Issue Date:
DOI: https://doi.org/10.1007/s00607-002-1450-4