Search

MiS Preprint Repository

We have decided to discontinue the publication of preprints on our preprint server as of 1 March 2024. The publication culture within mathematics has changed so much due to the rise of repositories such as ArXiV (www.arxiv.org) that we are encouraging all institute members to make their preprints available there. An institute's repository in its previous form is, therefore, unnecessary. The preprints published to date will remain available here, but we will not add any new preprints here.

MiS Preprint
106/2001

Adaptive refinement and clustering of -matrices

Lars Grasedyck, Wolfgang Hackbusch and Sabine Le Borne

Abstract

In previous papers, a class of (data-sparse) hierarchical matrices is introduced which allows an approximate matrix arithmetic of nearly optimal complexity. These so-called H-matrices were shown to be applicable in the boundary element as well as finite element context, again yielding nearly optimal complexity estimates for storage and work requirements of the respective stiffness matrices. The analyses were based on the assumption of the underlying cluster trees being balanced. This assumption might be violated in the case of adaptive mesh refinement. The present paper provides an extension of H-matrix techniques to (a sequence of) problems on adaptively refined meshes. A measure to monitor the actual storage and work complexities is introduced and employed to decide whether an adaptively refined (unbalanced) cluster tree is still acceptable or should be reconstructed in a balanced way.

Received:
19.12.01
Published:
19.12.01
MSC Codes:
65F05, 65F30, 65F50, 65N50
Keywords:
hierarchical matrices, data-sparse approximations, formatted matrix operations, fast solvers, adaptive mesh refinement

Related publications

Preprint
2001 Repository Open Access
Lars Grasedyck, Wolfgang Hackbusch and Sabine LeBorne

Adaptive refinement and clustering of \( \mathscr{H} \)-matrices