A block version of left-looking AINV preconditioner with one by one or two by two block pivots

作者:

Highlights:

摘要

In this paper, we present a block format of left-looking AINV preconditioner for a nonsymmetric matrix. This preconditioner has block 1 × 1 or 2 × 2 pivot entries. It is introduced based on a block format of Gaussian Elimination process which has been studied in [14]. We have applied the multilevel nested dissection reordering as the preprocessing and have compared this block preconditioner by the plain left-looking AINV preconditioner. If we mix the multilevel nested dissection by the maximum weighted matching process, then the numerical experiments indicate that the number of 2 × 2 pivot entries in the block preconditioner will grow up. In this case, the block preconditioner makes GMRES method convergent in a smaller number of iterations. In the numerical section, we have also compared the ILUT and block left-looking AINV preconditioners.

论文关键词:Left-looking AINV,Maximum weighted matching,Multilevel nested dissection reordering,Block version of Gaussian Elimination process,ILUT preconditioner

论文评审过程:Available online 26 January 2019, Version of Record 26 January 2019.

论文官网地址:https://doi.org/10.1016/j.amc.2019.01.012