Optimization of the ILU(0) factorization algorithm with the use of compressed sparse row format

DOI10.1007/s10958-013-1297-6zbMath1271.65050OpenAlexW2088720403MaRDI QIDQ357311

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

Publication date: 30 July 2013

Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10958-013-1297-6

zbMATH Keywords

numerical examplespreconditioningcompressed sparse row formatILU(0) factorization

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05) Preconditioners for iterative methods (65F08)

Uses Software

• TALGAT

Cites Work

• Sparse matrix storage formats and acceleration of iterative solution of linear algebraic systems with dense matrices
• Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
• Unnamed Item

This page was built for publication: Optimization of the ILU(0) factorization algorithm with the use of compressed sparse row format