返回
MULTIGRID SMOOTHERS FOR ULTRAPARALLEL COMPUTING
DOI:10.1137/100798806.png)
摘要
En 中文
This paper investigates the properties of smoothers in the context of algebraic multigrid (AMG) running on parallel computers with potentially millions of processors. The development of multigrid smoothers in this case is challenging, because some of the best relaxation schemes, such as the Gauss-Seidel (GS) algorithm, are inherently sequential. Based on the sharp two-grid multigrid theory from [R.D. Falgout and P.S. Vassilevski, SIAM J. Numer. Anal., 42 (2004), pp. 1669-1693] and [R.D. Falgout, P.S. Vassilevski, and L.T. Zikatanov, Numer. Linear Algebra Appl., 12 (2005), pp. 471-494] we characterize the smoothing properties of a number of practical candidates for parallel smoothers, including several C-F, polynomial, and hybrid schemes. We show, in particular, that the popular hybrid GS algorithm has multigrid smoothing properties which are independent of the number of processors in many practical applications, provided that the problem size per processor is large enough. This is encouraging news for the scalability of AMG on ultraparallel computers. We also introduce the more robust l(1) smoothers, which are always convergent and have already proven essential for the parallel solution of some electromagnetic problems [T. Kolev and P. Vassilevski, J. Comput. Math., 27 (2009), pp. 604-623].
Keyword:
algebraic multigrid
smoothers
parallel computing
期刊
IF:
2.6
论文数:
5.1K
被引数:
1.8W
机构
引用论文
Occurrence of leaf spot of oat caused by Alternaria alternata in Multan, Punjab, Pakistan由Alternaria alternata引起的燕麦叶斑病在巴基斯坦旁遮普省木尔坦的发生
A Study on the Effect of Ambient Air Plasma Treatment on the Properties of Methylammonium Lead Halide Perovskite Films
Metals
IF0
Persistence to hypomethylating agents and clinical and economic outcomes among patients with myelodysplastic syndromes患者对去甲基化药物治疗的持续性与骨髓增生异常综合征患者的临床和经济结局
Hematology
IF0

