Stabilising aggregation AMG

Author Frank Hülsemann

Thumbnail PDF


  • Filesize: 147 kB
  • 4 pages

Document Identifiers

Author Details

Frank Hülsemann

Cite AsGet BibTex

Frank Hülsemann. Stabilising aggregation AMG. In Combinatorial Scientific Computing. Dagstuhl Seminar Proceedings, Volume 9061, pp. 1-4, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)


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.
  • Algebraic multigrid
  • aggregation
  • stabilisation


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads