Adaptive Geometrically Balanced Clustering of H-Matrices

Authors:
L. Grasedyck;W. Hackbusch;S. Le Borne
Affiliations:
Inselstr, Max-Planck-Institute for Mathematics in the Sciences, 22-26, D-04103, Leipzig, Germany;Inselstr, Max-Planck-Institute for Mathematics in the Sciences, 22-26, D-04103, Leipzig, Germany;Tennessee Technological University, Sabine Le Borne Department of Mathematics, 22-26, TN 38505, Cookeville, USA
Venue:
Computing
Year:
2004

Citing 5
Cited 2

A sparse matrix arithmetic based on H-matrices. Part I: introduction to H-matrices

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

Computing
Incomplete cross approximation in the mosaic-skeleton method

Computing
Construction and arithmetics of H-matrices

Computing
Low-rank approximation of integral operators by interpolation

Computing

A fast direct solver for elliptic problems on general meshes in 2D

Journal of Computational Physics
A fast nested dissection solver for Cartesian 3D elliptic problems using hierarchical matrices

Journal of Computational Physics

Quantified Score

Hi-index	0.01

Visualization

Abstract

In [8], a class of (data-sparse) hierarchical (*-) matrices is introduced that can be used to efficiently assemble and store stiffness matrices arising in boundary element applications. In this paper, we develop and analyse modifications in the construction of an *-matrix that will allow an efficient application to problems involving adaptive mesh refinement. In particular, we present a new clustering algorithm such that, when an *-matrix has to be updated due to some adaptive grid refinement, the majority of the previously assembled matrix entries can be kept whereas only a few new entries resulting from the refinement have to be computed. We provide an efficient implementation of the necessary updates and prove for the resulting *-matrix that the storage requirements as well as the complexity of the matrix-vector multiplication are almost linear, i.e., *.