2000-02
en
research_article
https://scigraph.springernature.com/explorer/license/
2000-02-01
http://link.springer.com/10.1007%2FPL00021408
2019-04-10T13:18
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.
21-47
false
A Sparse ℋ-Matrix Arithmetic.
articles
1521-9615
1436-5057
Computing
Pure Mathematics
Springer Nature - SN SciGraph project
10.1007/pl00021408
doi
B. N.
Khoromskij
pub.1085169737
dimensions_id
W.
Hackbusch
Max Planck Society
Max-Planck-Institut Mathematik in den Naturwissenschaften Inselstr. 22-26 D-04103 Leipzig Germany email: bokh@mis.mpg.de, DE
Max-Planck-Institut Mathematik in den Naturwissenschaften Inselstr. 22-26 D-04103 Leipzig Germany email: wh@mis.mpg.de, DE
Mathematical Sciences
64
ea999d5204facf4ca6d62f1a306b2388fe54e0340ed36e22ec2b8ce4bf978fba
readcube_id
1