Two explicit incomplete factorization methods

Two explicit incomplete factorization methods and their program implementation are presented for solution of linear algebraic systems with real symmetric positive definite (SPD) matrices. The algorithms are based on the efficient Eisenstat modification of preconditioning for the matrix row sparse format. The fast iterative convergence is provided by conjugate gradient approaches, relaxation, and compensation parameters.