Geodesic
Optimization of the $\mathrm{ILU}(0)$ factorization algorithm with the use of compressed sparse row format
Zapiski Nauchnykh Seminarov POMI, Computational methods and algorithms. Part XXV, Tome 405 (2012), pp. 40-53 
R. R. Akhunov; S. P. Kuksenko; V. K. Salov; T. R. Gazizov. Optimization of the $\mathrm{ILU}(0)$ factorization algorithm with the use of compressed sparse row format. Zapiski Nauchnykh Seminarov POMI, Computational methods and algorithms. Part XXV, Tome 405 (2012), pp. 40-53. http://geodesic.mathdoc.fr/item/ZNSL_2012_405_a3/
@article{ZNSL_2012_405_a3,
     author = {R. R. Akhunov and S. P. Kuksenko and V. K. Salov and T. R. Gazizov},
     title = {Optimization of the $\mathrm{ILU}(0)$ factorization algorithm with the use of compressed sparse row format},
     journal = {Zapiski Nauchnykh Seminarov POMI},
     pages = {40--53},
     year = {2012},
     volume = {405},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/ZNSL_2012_405_a3/}
}
TY  - JOUR
AU  - R. R. Akhunov
AU  - S. P. Kuksenko
AU  - V. K. Salov
AU  - T. R. Gazizov
TI  - Optimization of the $\mathrm{ILU}(0)$ factorization algorithm with the use of compressed sparse row format
JO  - Zapiski Nauchnykh Seminarov POMI
PY  - 2012
SP  - 40
EP  - 53
VL  - 405
UR  - http://geodesic.mathdoc.fr/item/ZNSL_2012_405_a3/
LA  - ru
ID  - ZNSL_2012_405_a3
ER  - 
%0 Journal Article
%A R. R. Akhunov
%A S. P. Kuksenko
%A V. K. Salov
%A T. R. Gazizov
%T Optimization of the $\mathrm{ILU}(0)$ factorization algorithm with the use of compressed sparse row format
%J Zapiski Nauchnykh Seminarov POMI
%D 2012
%P 40-53
%V 405
%U http://geodesic.mathdoc.fr/item/ZNSL_2012_405_a3/
%G ru
%F ZNSL_2012_405_a3

Voir la notice du chapitre de livre provenant de la source Math-Net.Ru

Improvements to the $\mathrm{ILU}(0)$ factorization algorithm for preconditioning linear algebraic systems with dense matrices are suggested. The preconditioner is stored in compressed sparse row format. On the example of the problem of computing the electrical capacity of two stripes, it is demonstrated that the modifications proposed provide for a significant reduction of the time for computing the $\mathrm{ILU}(0)$ preconditioner (up to 4 times) and for solving the preconditioned linear system (up to 2.5 times).

[1] T. R. Gazizov, S. P. Kuksenko, “Optimizatsiya dopuska obnuleniya pri reshenii SLAU iteratsionnymi metodami s predobuslovlivaniem v zadachakh vychislitelnoi elektrodinamiki”, Elektromagn. volny elektronn. sist., 2004, no. 8, 26–28

[2] S. Pissanetski, Tekhnologiya razrezhennykh matrits, Mir, M., 1988 | MR

[3] R. R. Akhunov, S. P. Kuksenko, V. K. Salov, T. R. Gazizov, “Formaty khraneniya razrezhennykh matrits i uskorenie resheniya SLAU s plotnoi matritsei iteratsionnymi metodami”, Zap. nauchn. semin. POMI, 405, 2012, 24–39 | MR

[4] H. van der Vorst, “Bi-CGSTAB: a fast and smoothly converging variant of Bi-CG for solution of nonsymmetric linear systems”, SIAM J. Sci. Stat. Comput., 13 (1992), 631–644 | DOI | MR | Zbl

[5] S. P. Kuksenko, T. R. Gazizov, Iteratsionnye metody resheniya sistemy lineinykh algebraicheskikh uravnenii s plotnoi matritsei, Tomskii gosudarstvennyi universitet, Tomsk, 2007

[6] Y. Saad, Iterative Methods for Sparse Linear Systems, SIAM, 2003 | MR

[7] S. P. Kuksenko, T. R. Gazizov, “Sravnenie sposobov predfiltratsii pri reshenii SLAU s plotnoi matritsei iteratsionnymi metodami s predobuslovlivaniem”, Infokommunikats. tekhnol., 5:2 (2007), 14–18

[8] Gazizov T. R., Melkozerov A. O., Gazizov T. T., Kuksenko S. P., Zabolotskii A. M., Ashirbakiev R. I., Vershinin E. A., Salov V. K., Lezhnin E. V., Orlov P. E., Bevzenko I. G., Kalimulin I. F., Svidetelstvo o gosudarstvennoi registratsii programmy dlya EVM No 2012610712. TALGAT 2010, Zayavka No 2011617178. Data postupleniya 26 sentyabrya 2011 g. Zaregistrirovano v Reestre programm dlya EVM 13 yanvarya 2012 g.