NORMALIZED CONVERGENCE-RATES FOR THE PSMG METHOD

作     者：FREDERICKSON, PO MCBRYAN, OA 

作者机构：UNIV COLORADODEPT COMP SCIBOULDERCO 80309 

出 版 物：《SIAM JOURNAL ON SCIENTIFIC AND STATISTICAL COMPUTING》 (工业与应用数学会科学计算杂志)

年 卷 期：1991年第12卷第1期

页      面：221-229页

核心收录：

学科分类：07[理学] 070104[理学-应用数学] 0701[理学-数学] 

主　　题：PARALLEL MULTIGRID PARALLEL MULTILEVEL MULTIGRID PARALLEL FAST SOLVER 

摘      要：In a previous paper [Parallel Superconvergent Multigrid, in Multigrid Methods, Marcel Dekker, New York, 1988] the authors introduced an efficient multiscale PDE solver for massively parallel architectures, which was called Parallel Superconvergent Multigrid, or PSMG. In this paper, sharp estimates are derived for the normalized work involved in PSMG solution-the number of parallel arithmetic and communication operations required per digit of error reduction. PSMG is shown to provide fourth-order accurate solutions of Poisson-type equations at convergence rates of .00165 per single relaxation iteration, and with parallel operation counts per grid level of 5.75 communications and 8.62 computations for each digit of error reduction. The authors show that PSMG requires less than one-half as many arithmetic and one-fifth as many communication operations, per digit of error reduction, as a parallel standard multigrid algorithm (RBTRB) presented recently by Decker [SIAM J. Sci. Statist. Comput., 12 (1991), pp. 208-220].