Zapiski Nauchnykh Seminarov POMI
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Zap. Nauchn. Sem. POMI:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

Zapiski Nauchnykh Seminarov POMI, 2012, Volume 405, Pages 40–53 (Mi znsl5276)  
This article is cited in 6 scientific papers (total in 6 papers)

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

R. R. Akhunov, S. P. Kuksenko, V. K. Salov, T. R. Gazizov

Department of Television and Control, Tomsk State University of Control Systems and Radioelectronics, Tomsk, Russia
Full-text PDF (543 kB) Citations (6)
References:
PDF
HTML
Abstract: 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).
Key words and phrases: system of linear algebraic equations, sparse matrix, iterative methods, preconditioning, prefiltering.
Received: 02.05.2012
English version:
Journal of Mathematical Sciences (New York), 2013, Volume 191, Issue 1, Pages 19–27
DOI: https://doi.org/10.1007/s10958-013-1297-6
Bibliographic databases:
Document Type: Article
UDC: 519.612
Language: Russian
Citation: 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”, Computational methods and algorithms. Part XXV, Zap. Nauchn. Sem. POMI, 405, POMI, St. Petersburg, 2012, 40–53; J. Math. Sci. (N. Y.), 191:1 (2013), 19–27
Citation in format AMSBIB
\Bibitem{AkhKukSal12}
\by R.~R.~Akhunov, S.~P.~Kuksenko, V.~K.~Salov, T.~R.~Gazizov
\paper Optimization of the $\mathrm{ILU}(0)$ factorization algorithm with the use of compressed sparse row format
\inbook Computational methods and algorithms. Part~XXV
\serial Zap. Nauchn. Sem. POMI
\yr 2012
\vol 405
\pages 40--53
\publ POMI
\publaddr St.~Petersburg
\mathnet{http://mi.mathnet.ru/znsl5276}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=3029610}
\transl
\jour J. Math. Sci. (N. Y.)
\yr 2013
\vol 191
\issue 1
\pages 19--27
\crossref{https://doi.org/10.1007/s10958-013-1297-6}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-84884975104}
Linking options:
  • https://www.mathnet.ru/eng/znsl5276
  • https://www.mathnet.ru/eng/znsl/v405/p40
    • This publication is cited in the following 6 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Записки научных семинаров ПОМИ
    Statistics & downloads:
    Abstract page:415
    Full-text PDF :114
    References:42
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024