New breakdown-free variant of AINV method for nonsymmetric positive definite matrices

DOI10.1016/j.cam.2007.07.003zbMath1152.65047OpenAlexW2145202880MaRDI QIDQ935767

Faezeh Toutounian, Amin Rafiei

Publication date: 8 August 2008

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

zbMATH Keywords

preconditioningsparse matricesKrylov subspace methodsfactored approximate inversesAINVSAINV and AINV-A methods

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35)

Related Items (3)

Breakdown-free version of ILU factorization for nonsymmetric positive definite matrices ⋮ Sparse approximate inverse preconditioners on high performance GPU platforms ⋮ Robust incomplete factorization for nonsymmetric matrices

Uses Software

• SparseMatrix

Cites Work

• Unnamed Item
• Unnamed Item
• Factorized sparse approximate inverse preconditionings. III: Iterative construction of preconditioners
• Robust Approximate Inverse Preconditioning for the Conjugate Gradient Method
• Factorized Sparse Approximate Inverse Preconditionings I. Theory
• A Sparse Approximate Inverse Preconditioner for Nonsymmetric Linear Systems
• A Sparse Approximate Inverse Preconditioner for the Conjugate Gradient Method

This page was built for publication: New breakdown-free variant of AINV method for nonsymmetric positive definite matrices