Compatible relaxation and coarsening in algebraic multigrid

James J. Brannick, Robert D. Falgout

Research output: Contribution to journalArticlepeer-review

36 Scopus citations


We introduce a coarsening algorithm for algebraic multigrid (AMG) based on the concept of compatible relaxation (CR). The algorithm is significantly different from standard methods, most notably because it does not rely on any notion of strength of connection. We study its behavior on a number of model problems and evaluate the performance of an AMG algorithm that incorporates the coarsening approach. Finally, we introduce a variant of CR that provides a sharper metric of coarse-grid quality and demonstrate its potential with two simple examples.

Original languageEnglish (US)
Pages (from-to)1393-1416
Number of pages24
JournalSIAM Journal on Scientific Computing
Issue number3
StatePublished - 2010

All Science Journal Classification (ASJC) codes

  • Computational Mathematics
  • Applied Mathematics


Dive into the research topics of 'Compatible relaxation and coarsening in algebraic multigrid'. Together they form a unique fingerprint.

Cite this