Please use this identifier to cite or link to this item: http://dx.doi.org/10.14279/depositonce-7408
Main Title: Performance Of H-Lu Preconditioning For Sparse Matrices
Author(s): Grasedyck, Lars
Hackbusch, Wolfgang
Kriemann, Ronald
Type: Article
Language Code: en
Abstract: 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).
URI: https://depositonce.tu-berlin.de//handle/11303/8257
http://dx.doi.org/10.14279/depositonce-7408
Issue Date: 2008
Date Available: 1-Oct-2018
DDC Class: 510 Mathematik
Subject(s): hierarchical matrices
black-box clustering
finite-difference scheme
preconditioning
direct solver
License: https://creativecommons.org/licenses/by-nc-nd/4.0/
Journal Title: Computational methods in applied mathematics
Publisher: De Gruyter
Publisher Place: Berlin
Volume: 8
Issue: 4
Publisher DOI: 10.2478/cmam-2008-0024
Page Start: 336
Page End: 349
EISSN: 1609-9389
ISSN: 1609-4840
Appears in Collections:Inst. Mathematik » Publications

Files in This Item:
File Description SizeFormat 
grasedyck_etal_2008.pdf1.16 MBAdobe PDFThumbnail
View/Open


This item is licensed under a Creative Commons License Creative Commons