Some Parallel Iterative Methods for Solving Elliptical Equationson Tetrahedral Grids

摘要

Parallel versions of the modified incomplete Cholesky conjugate gradient method with regularized preconditioner are proposed for solving elliptic equations on tetrahedral grids on MIMD parallel computers. The constructed parallel method use special grid point orderings cor-related with domain decomposition. The convergence rates of the proposed parallel methods are examined both theoretically and numerically by analyzing a number of model problems. The com-parison of the convergence rates of the proposed method and some other well-known methods is performed.