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

DOI10.1007/S10958-013-1297-6MaRDI QIDQ357311zbMATH OpenOpenAlexFDO

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

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)

Recommendations

• ILUS: An incomplete LU preconditioner in sparse skyline format
• scientific article; zbMATH DE number 1985696
• ILUT: A dual threshold incomplete LU factorization
• ILUM: A Multi-Elimination ILU Preconditioner for General Sparse Matrices
• Matrix Renumbering ILU: An Effective Algebraic Multilevel ILU Preconditioner for Sparse Matrices

Cites work

• scientific article; zbMATH DE number 1953444 (Why is no real title available?)
• Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
• Sparse matrix storage formats and acceleration of iterative solution of linear algebraic systems with dense matrices

Cited in

(1)

• scientific article; zbMATH DE number 1985696 (Why is no real title available?)

Describes a project that uses

Uses Software

• TALGAT

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q357311)