Efficient relaxed-Jacobi smoothers for multigrid on parallel computers
详细信息 查看全文
- 作者：Xiang Yang ; xiangyang@jhu.edu ; Rajat Mittal
- 关键词：Multigrid ; Jacobi ; Over-relaxation ; Scheduled-relaxation ; Structured grid ; Unstructured grid ; Elliptic equations ; Smoothers
- 刊名：Journal of Computational Physics
- 出版年：2017
- 出版时间：1 March 2017
- 年：2017
- 卷：332
- 期：Complete
- 页码：135-142
- 全文大小：568 K
- 卷排序：332
文摘
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.