Breakdown-free version of ILU factorization for nonsymmetric positive definite matrices

DOI10.1016/j.cam.2009.01.011zbMath1167.65357OpenAlexW1994991343MaRDI QIDQ2390015

Amin Rafiei, Faezeh Toutounian

Publication date: 20 July 2009

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cam.2009.01.011

zbMATH Keywords

numerical experimentsiterative methodslarge sparse linear systemsimplicit preconditionerbiorthogonalizationRIFRIF\(_p\)

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10)

Related Items (1)

Robust incomplete factorization for nonsymmetric matrices

Uses Software

• MatrixMarket
• SparseMatrix

Cites Work

• Unnamed Item
• Unnamed Item
• A new preconditioning technique for solving large sparse linear systems
• An ILU preconditioner for nonsymmetric positive definite matrices by using the conjugate Gram-Schmidt process
• New breakdown-free variant of AINV method for nonsymmetric positive definite matrices
• Iterative solution methods for certain sparse linear systems with a non- symmetric matrix arising from PDE-problems
• The incomplete Cholesky-conjugate gradient method for the iterative solution of systems of linear equations
• Robust Approximate Inverse Preconditioning for the Conjugate Gradient Method
• A robust incomplete Choleski-conjugate gradient algorithm
• An Incomplete Factorization Technique for Positive Definite Linear Systems
• A Sparse Approximate Inverse Preconditioner for Nonsymmetric Linear Systems
• Diagonally compensated reduction and related preconditioning methods
• A robust incomplete factorization preconditioner for positive definite matrices

This page was built for publication: Breakdown-free version of ILU factorization for nonsymmetric positive definite matrices