A sparse H-matrix arithmetic. Part II: Application to multi-dimensional problems

Citation
W. Hackbusch et Bn. Khoromskij, A sparse H-matrix arithmetic. Part II: Application to multi-dimensional problems, COMPUTING, 64(1), 2000, pp. 21-47
Citations number
15
Categorie Soggetti
Computer Science & Engineering
Journal title
COMPUTING
ISSN journal
0010485X → ACNP
Volume
64
Issue
1
Year of publication
2000
Pages
21 - 47
Database
ISI
SICI code
0010-485X(2000)64:1<21:ASHAPI>2.0.ZU;2-7
Abstract
The preceding Part I of this paper has introduced a class of matrices (H-ma trices) which are data-sparse and allow an approximate matrix arithmetic of almost linear complexity. The matrices discussed in Part I are able to app roximate discrete integral operators in the case of one spatial dimension. In the present Part II, the construction of H-matrices is explained for FEM and BEM applications in two and three spatial dimensions. The orders of co mplexity of the various matrix operations are exactly the same as in Part I . In particular, it is shown that the applicability of H-matrices does not require a regular mesh. We discuss quasi-uniform unstructured meshes and th e case of composed surfaces as well. AMS Subject Classifications: 65F05, 65 F30, 65F50, 65N38, 68P05, 45B05, 35C20.