Performance Of H-Lu Preconditioning For Sparse Matrices

DOI10.2478/cmam-2008-0024zbMath1156.65042OpenAlexW2016858086MaRDI QIDQ3549585

Lars Grasedyck, Ronald Kriemann, Wolfgang Hackbusch

Publication date: 5 January 2009

Published in: Computational Methods in Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://depositonce.tu-berlin.de//handle/11303/8257

zbMATH Keywords

performancenumerical examplespreconditioningdirect solveralgebraic multigridLU-factorizationiterative solverH-matrixhierarchical matricesBlack-box clustering

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55) Numerical computation of matrix norms, conditioning, scaling (65F35) Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items

Survey on the technique of hierarchical matrices ⋮ ℋ︁-LU factorization in preconditioners for augmented Lagrangian and grad-div stabilized saddle point systems ⋮ Existence of $\mathcal {H}$-matrix approximants to the inverses of BEM matrices: The simple-layer operator ⋮ Domain decomposition based \({\mathcal H}\)-LU preconditioning ⋮ ``Compress and Eliminate” Solver for Symmetric Positive Definite Sparse Matrices ⋮ Rapid error reduction for block Gauss-Seidel based onp-hierarchical basis ⋮ \(\mathcal H\)-LU factorization on many-core systems ⋮ Second‐order accurate hierarchical approximate factorizations for solving sparse linear systems ⋮ \(\mathcal {H}\)-matrix approximability of the inverses of FEM matrices ⋮ Fast multipole preconditioners for sparse matrices arising from elliptic equations ⋮ Approximating inverse FEM matrices on non-uniform meshes with \(\mathcal{H}\)-matrices ⋮ \({\mathscr{H}} \)-matrix approximability of inverses of discretizations of the fractional Laplacian

Uses Software

• SPOOLES