Performance Of H-Lu Preconditioning For Sparse Matrices
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).
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Bibliographic citation
-
Performance Of H-Lu Preconditioning For Sparse Matrices ; volume:8 ; number:4 ; year:2008 ; pages:336-349
Computational methods in applied mathematics ; 8, Heft 4 (2008), 336-349
- Creator
-
GRASEDYCK, L.
HACKBUSCH, W.
KRIEMANN, R.
- DOI
-
10.2478/cmam-2008-0024
- URN
-
urn:nbn:de:101:1-2410261634147.414264890427
- Rights
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
15.08.2025, 7:32 AM CEST
Data provider
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- GRASEDYCK, L.
- HACKBUSCH, W.
- KRIEMANN, R.