Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH scholarly article en Hülsemann, Frank License
when quoting this document, please refer to the following
URN: urn:nbn:de:0030-drops-20946

Stabilising aggregation AMG



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

  author =	{Frank H{\"u}lsemann},
  title =	{Stabilising aggregation AMG},
  booktitle =	{Combinatorial Scientific Computing},
  year =	{2009},
  editor =	{Uwe Naumann and Olaf Schenk and Horst D. Simon and Sivan Toledo},
  number =	{09061},
  series =	{Dagstuhl Seminar Proceedings},
  ISSN =	{1862-4405},
  publisher =	{Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany},
  address =	{Dagstuhl, Germany},
  URL =		{},
  annote =	{Keywords: Algebraic multigrid, aggregation, stabilisation}

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

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