License: Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/DagSemProc.09061.17
URN: urn:nbn:de:0030-drops-20946
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2009/2094/
Go to the corresponding Portal

Hülsemann, Frank

Stabilising aggregation AMG

pdf-format:
09061.HuelsemannFrank.ExtAbstract.2094.pdf (0.1 MB)

Abstract

When applied to linear systems arising from scalar elliptic partial differential equations, algebraic multigrid (AMG) schemes based on aggregation exhibit a mesh size dependent convergence behaviour. As the number of iterations increases with the number of unknowns in the linear system, the computational complexity of such a scheme is non-optimal. This contribution presents a stabilisation of the aggregation AMG algorithm which adds a number of subspace projection steps at different stages of the algorithm and
allows for variable cycling strategies. Numerical results illustrate the advantage of the stabilised algorithm over its original formulation.

BibTeX - Entry

@InProceedings{hulsemann:DagSemProc.09061.17,
  author =	{H\"{u}lsemann, Frank},
  title =	{{Stabilising aggregation AMG}},
  booktitle =	{Combinatorial Scientific Computing},
  pages =	{1--4},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2009},
  volume =	{9061},
  editor =	{Uwe Naumann and Olaf Schenk and Horst D. Simon and Sivan Toledo},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2009/2094},
  URN =		{urn:nbn:de:0030-drops-20946},
  doi =		{10.4230/DagSemProc.09061.17},
  annote =	{Keywords: Algebraic multigrid, aggregation, stabilisation}
}

Keywords: Algebraic multigrid, aggregation, stabilisation
Collection: 09061 - Combinatorial Scientific Computing
Issue Date: 2009
Date of publication: 24.07.2009

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI