Comparison of geometrical and algebraic multigrid preconditioners for data-sparse boundary element matrices

Authors:
U. Langer;D. Pusch
Affiliations:
Institute of Computational Mathematics, Johannes Kepler University, Linz, Austria;Institute of Computational Mathematics, Johannes Kepler University, Linz, Austria
Venue:
LSSC'05 Proceedings of the 5th international conference on Large-Scale Scientific Computing
Year:
2005

Citing 5
Cited 0

The analysis of multigrid algorithms for pseudodifferential operators of order minus one

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

Computing
Wavelet Galerkin Algorithms for Boundary Integral Equations

SIAM Journal on Scientific Computing
Adaptive low-rank approximation of collocation matrices

Computing
Data-sparse algebraic multigrid methods for large scale boundary element equations

Applied Numerical Mathematics - Selected papers from the 16th Chemnitz finite element symposium 2003

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present geometric (GMG) and algebraic multigrid (AMG) preconditioners for data-sparse boundary element matrices. Data-sparse approximation schemes such as adaptive cross approximation (ACA) yield an almost linear behavior in Nh, where Nh is the number of (boundary) unknowns. The treated system matrix represents the discretized single layer potential operator (SLP) resulting from the interior Dirichlet boundary value problem for the Laplace equation. It is well known, that the SLP has converse spectral properties compared to usual finite element matrices. Therefore, multigrid components have to be adapted properly. In the case of GMG we present convergence rate estimates for the data-sparse ACA version. Again, uniform convergence can be shown for the V-cycle. Iterative solvers dramatically suffer from the ill-conditioness of the underlying system matrix for growing Nh. Our multigrid-preconditioners avoid the increase of the iteration numbers and result in almost optimal solvers with respect to the total complexity. The corresponding numerical 3D experiments are confirming the superior preconditioning properties for the GMG as well as for the AMG approach.