Efficient relaxed-Jacobi smoothers for multigrid on parallel computers

Xiang Yang, Rajat Mittal

Research output: Contribution to journalArticlepeer-review

5 Scopus citations

Abstract

In this Technical Note, we present a family of Jacobi-based multigrid smoothers suitable for the solution of discretized elliptic equations. These smoothers are based on the idea of scheduled-relaxation Jacobi proposed recently by Yang & Mittal (2014) [18] and employ two or three successive relaxed Jacobi iterations with relaxation factors derived so as to maximize the smoothing property of these iterations. The performance of these new smoothers measured in terms of convergence acceleration and computational workload, is assessed for multi-domain implementations typical of parallelized solvers, and compared to the lexicographic point Gauss–Seidel smoother. The tests include the geometric multigrid method on structured grids as well as the algebraic grid method on unstructured grids. The tests demonstrate that unlike Gauss–Seidel, the convergence of these Jacobi-based smoothers is unaffected by domain decomposition, and furthermore, they outperform the lexicographic Gauss–Seidel by factors that increase with domain partition count.

Original languageEnglish (US)
Pages (from-to)135-142
Number of pages8
JournalJournal of Computational Physics
Volume332
DOIs
StatePublished - Mar 1 2017

All Science Journal Classification (ASJC) codes

  • Numerical Analysis
  • Modeling and Simulation
  • Physics and Astronomy (miscellaneous)
  • Physics and Astronomy(all)
  • Computer Science Applications
  • Computational Mathematics
  • Applied Mathematics

Fingerprint Dive into the research topics of 'Efficient relaxed-Jacobi smoothers for multigrid on parallel computers'. Together they form a unique fingerprint.

Cite this