Grasedyck, LarsHackbusch, WolfgangKriemann, Ronald2018-10-012018-10-0120081609-4840https://depositonce.tu-berlin.de/handle/11303/8257http://dx.doi.org/10.14279/depositonce-7408In this paper we review the technique of hierarchical matrices and put it into the context of black-box solvers for large linear systems. Numerical examples for several classes of problems from medium- to large-scale illustrate the applicability and efficiency of this technique. We compare the results with those of several direct solvers (which typically scale quadratically in the matrix size) as well as an iterative solver (algebraic multigrid) which scales linearly (if it converges in O(1) steps).en510 Mathematikhierarchical matricesblack-box clusteringfinite-difference schemepreconditioningdirect solverArticle1609-9389