Thumbnail Image
🆕 Date Issued:
2008
🗄 In DepositOnce:2018-10-01
Published Version

Please use this identifier to cite or link to this item:

Performance Of H-Lu Preconditioning For Sparse Matrices

Grasedyck, Lars; Hackbusch, Wolfgang; Kriemann, Ronald

In 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).
hierarchical matricesblack-box clusteringfinite-difference schemepreconditioningdirect solver
Published in: Computational methods in applied mathematics, 10.2478/cmam-2008-0024, De Gruyter
Creative Commons Attribution NonCommercial NoDerivatives 4.0 (CC BY-NC-ND)Creative Commons Attribution NonCommercial NoDerivatives 4.0 (CC BY-NC-ND)Creative Commons Attribution NonCommercial NoDerivatives 4.0 (CC BY-NC-ND)Creative Commons Attribution NonCommercial NoDerivatives 4.0 (CC BY-NC-ND)
Full item page