Abstract
Parallel versions of MICCG(0) are proposed for solving finite difference counterparts of 2D and 3D elliptic boundary value problems on distributed memory parallel computers. The unknowns reordering strategies are employed, and the preconditioner matrix is reconstructed. The convergence speed and efficiency of the proposed methods are examined.
Get full access to this article
View all access options for this article.
