Hierarchical matrix techniques for a domain decomposition algorithm

Authors:
J. S. Ovall
Affiliations:
Max Planck Institute for Mathematics in the Sciences, Inselstrasse 22–26, Leipzig, Germany
Venue:
Computing
Year:
2007

Citing 10
Cited 0

A sparse matrix arithmetic based on H-matrices. Part I: introduction to H-matrices

Computing
A sparse H -matrix arithmetic. Part II: application to multi-dimensional problems

Computing
A sparse H -matrix arithmetic: general complexity estimates

Journal of Computational and Applied Mathematics - Special issue on numerical anaylsis 2000 Vol. VI: Ordinary differential equations and integral equations
A New Paradigm for Parallel Adaptive Meshing Algorithms

SIAM Journal on Scientific Computing
An Algebraic Multilevel Multigraph Algorithm

SIAM Journal on Scientific Computing
Nested-Dissection Orderings for Sparse LU with Partial Pivoting

SIAM Journal on Matrix Analysis and Applications
Construction and arithmetics of H-matrices

Computing
A Domain Decomposition Solver for a Parallel Adaptive Meshing Paradigm

SIAM Journal on Scientific Computing
Some variants of the Bank–Holst parallel adaptive meshing paradigm

Computing and Visualization in Science
Some variants of the Bank–Holst parallel adaptive meshing paradigm

Computing and Visualization in Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we investigate the effectiveness of hierarchical matrix techniques when used as the linear solver in a certain domain decomposition algorithm. In particular, we provide a direct performance comparison between an algebraic multigrid solver and a hierarchical matrix solver which is based on nested dissection clustering within the software package PLTMG.