An algebraic approach for \({\mathcal{H}}\)-matrix preconditioners

DOI10.1007/s00607-007-0224-4zbMath1120.65041OpenAlexW2138810587MaRDI QIDQ2641924

Yanyan Li

Publication date: 17 August 2007

Published in: Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00607-007-0224-4

zbMATH Keywords

convergencecomparison of methodsnumerical resultsCholesky factorizationiterative methodsalgebraic multigridpreconditionersLU factorizationmultilevel methodsmatrix inversionhierarchical matricesJacobi overrelaxationmultilevel clustering methods

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35) Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items (2)

Construction of a discrete divergence-free basis through orthogonal factorization in \({\mathcal{H}}\)-arithmetic ⋮ ℋ︁‐matrix preconditioners for symmetric saddle‐point systems from meshfree discretization

Uses Software

• Meschach
• DistMesh

Cites Work

• A sparse matrix arithmetic based on \({\mathfrak H}\)-matrices. I: Introduction to \({\mathfrak H}\)-matrices
• Construction and arithmetics of \(\mathcal H\)-matrices
• Introduction to hierarchical matrices with applications.
• Domain decomposition based \({\mathcal H}\)-LU preconditioning
• Algebraic multigrid (AMG) for saddle point systems from meshfree discretizations
• A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
• A Simple Mesh Generator in MATLAB
• H-matrix Preconditioners in Convection-Dominated Problems

This page was built for publication: An algebraic approach for \({\mathcal{H}}\)-matrix preconditioners