Some parallel iterative methods for solving elliptic equations on tetrahedral grids

Parallel versions of 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 methods use special grid points orderings correlated 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 comparison of convergence rates of prorosed method and some ather well-known methods is performed.