Optimization of the $\mathrm{ILU}(0)$ factorization algorithm with the use of compressed sparse row format

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).