Parallel coarse-grid selection

David M. Alber, Luke N. Olson

Research output: Contribution to journalArticlepeer-review


Algebraic multigrid (AMG) is a powerful linear solver with attractive parallel properties. A parallel AMG method depends on efficient, parallel implementations of the coarse-grid selection algorithms and the restriction and prolongation operator construction algorithms. In the effort to effectively and quickly select the coarse grid, a number of parallel coarsening algorithms have been developed. This paper examines the behaviour of these algorithms in depth by studying the results of several numerical experiments. In addition, new parallel coarse-grid selection algorithms are introduced and tested.

Original languageEnglish (US)
Pages (from-to)611-643
Number of pages33
JournalNumerical Linear Algebra with Applications
Issue number8
StatePublished - Oct 2007


  • Algebraic multigrid
  • Coarsening
  • Parallel computing

ASJC Scopus subject areas

  • Algebra and Number Theory
  • Applied Mathematics


Dive into the research topics of 'Parallel coarse-grid selection'. Together they form a unique fingerprint.

Cite this