in this paper‎, ‎an efficient dropping criterion has been used to compute the iul factorization obtained from backward factored approximate inverse (bfapinv) and ilu factorization obtained from forward factored approximate inverse (ffapinv) algorithms‎. ‎we use different drop tolerance parameters to compute the preconditioners‎. ‎to study the effect of such a dropping on the quality of the ilu ...

The approximate inverse AINV and the factored approximate inverse FAPINV are two known algorithms in the field of preconditioning of linear systems of equations. Both of these algorithms compute a sparse approximate inverse of matrix A in the factored form and are based on computing two sets of vectors which are A-biconjugate. The AINV algorithm computes the inverse factors W and Z of a matrix ...

In this paper‎, ‎an efficient dropping criterion has been used to compute the IUL factorization obtained from Backward Factored APproximate INVerse (BFAPINV) and ILU factorization obtained from Forward Factored APproximate INVerse (FFAPINV) algorithms‎. ‎We use different drop tolerance parameters to compute the preconditioners‎. ‎To study the effect of such a dropping on the quality of the ILU ...

The paper briefly reviews the difficulties encountered in achieving further major improvement in some aspects of the software evolution process. This may, it is suggested, be due, in part, to the fact that the global process is a complex, multi loop multilevel feedback system. After summarising the results of a 1970s study and the laws of software evolution that arose from it, the paper introdu...