Parallel iterative methods with factored preconditioning matrices for solving elliptic equations on triangular grid

New parallel analogs of the versions of incomplete Cholesky conjugate gradient method and modified incomplete Choletsky conjugate gradient method for solving elliptic equations on unstructed triangular grid on distributed-memory parallel computers are proposed. The construction of the parallel versions of the methods is based on the orderings of grid points depending on the decomposition of the computational domain. The rate of convergence of some proposed methods are investigated both theoretically and by means of calculations on the example of the model problems. The algorithms of realisation of proposed parallel methods are relatively simple.