Robust incomplete factorization for nonsymmetric matrices

DOI10.1007/S00211-010-0336-1MaRDI QIDQ543347zbMATH OpenOpenAlexFDO

Authors Matthias Bollhöfer, Amin Rafiei

Publication date 17 June 2011

Published in Numerische Mathematik (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00211-010-0336-1

zbMATH Keywords

numerical experimentspositive definite matricesincomplete \(LU\) factorization preconditioner

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Preconditioners for iterative methods (65F08) Iterative numerical methods for linear systems (65F10)

Recommendations

• New breakdown-free variant of AINV method for nonsymmetric positive definite matrices
• An ILU preconditioner for nonsymmetric positive definite matrices by using the conjugate Gram-Schmidt process
• Breakdown-free version of ILU factorization for nonsymmetric positive definite matrices
• Balanced Incomplete Factorization
• Balanced incomplete factorization preconditioner with pivoting

Cites work

• scientific article; zbMATH DE number 51442 (Why is no real title available?)
• scientific article; zbMATH DE number 1953446 (Why is no real title available?)
• scientific article; zbMATH DE number 2098313 (Why is no real title available?)
• scientific article; zbMATH DE number 961607 (Why is no real title available?)
• A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
• A Robust and Efficient ILU that Incorporates the Growth of the Inverse Triangular Factors
• A Sparse Approximate Inverse Preconditioner for Nonsymmetric Linear Systems
• A Transpose-Free Quasi-Minimal Residual Algorithm for Non-Hermitian Linear Systems
• A robust ILU with pivoting based on monitoring the growth of the inverse factors
• A robust incomplete factorization preconditioner for positive definite matrices
• An Estimate for the Condition Number of a Matrix
• Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
• Breakdown-free version of ILU factorization for nonsymmetric positive definite matrices
• Crout Versions of ILU for General Sparse Matrices
• GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
• ILUT: A dual threshold incomplete LU factorization
• New breakdown-free variant of AINV method for nonsymmetric positive definite matrices
• On the Relations between ILUs and Factored Approximate Inverses
• Robust approximate inverse preconditioning for the conjugate gradient method
• Robust incomplete factorization for nonsymmetric matrices

Cited in

(9)

• Robust incomplete factorization for nonsymmetric matrices
• A block version of left-looking AINV preconditioner with one by one or two by two block pivots
• Complete pivoting strategy for the left-looking robust incomplete factorization preconditioner
• Left-looking version of AINV preconditioner with complete pivoting strategy
• Balanced incomplete factorization preconditioner with pivoting
• On the robustness of modified incomplete factorization methods
• Breakdown-free version of ILU factorization for nonsymmetric positive definite matrices
• An Analysis of the Robustness of Some Incomplete Factorizations
• Robust Approximate Cholesky Factorization of Rank-Structured Symmetric Positive Definite Matrices

Describes a project that uses

Uses Software

• Sparslab
• ILUT
• SPARSKIT
• SparseMatrix
• METIS

This page was built for publication: Robust incomplete factorization for nonsymmetric matrices

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