Delve into the future of research at MiS with our preprint repository. Our scientists are making groundbreaking discoveries and sharing their latest findings before they are published. Explore repository to stay up-to-date on the newest developments and breakthroughs.
MiS Preprint
103/2002
Construction and Arithmetics of $\mathcal{H}$-Matrices
Lars Grasedyck and Wolfgang Hackbusch
Abstract
In previous papers a class of H-matrices was introduced which are data-sparse and allow an approximate matrix arithmetic of nearly optimal complexity. In this paper we analyse the complexity (storage, addition, multiplication and inversion) of the H-matrix arithmetics. Two criteria, the sparsity and idempotency, are sufficient to give the desired bounds. For standard finite element and boundary element applications we present a construction of an H-matrix format for which we can give explicit bounds for the sparsity and idempotency.
