Abstract
This paper considers parallelism of AINV (Approximate INVerse) preconditioning by means of grouping of factorized matrices. The AINV preconditioning consists of independent each other factorized matrice. Therefore, the AINV preconditioning can parallelize easily than the conventional preconditionings, e.g., ILU(0) and SSOR precoditionings. Through numerical experiments, we demonstrate high efficiency of the proposed AINV preconditioning for parallel computation.
