Flexible incomplete Cholesky factorization with multi‐parameters to control the number of nonzero elements in preconditioners

DOI10.1002/nla.784zbMath1274.65088OpenAlexW1968638683MaRDI QIDQ4922266

Yan-Fei Jing, Yong Zhang, Liang Li, Ting-Zhu Huang

Publication date: 29 May 2013

Published in: Numerical Linear Algebra with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nla.784

zbMATH Keywords

numerical resultsconjugate gradient methodsymmetric matrixfill-inincomplete Cholesky factorizationpreconditioner sparsity

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10) Preconditioners for iterative methods (65F08)

Related Items (1)

Efficient Preconditioned Iterative Linear Solvers for 3-D Magnetostatic Problems Using Edge Elements

Uses Software

• MatrixMarket
• ILUT

Cites Work

• Unnamed Item
• Modified Cholesky algorithms: A catalog with new approaches
• Numerical experiments with parallel orderings for ILU preconditioners
• Preconditioning techniques for large linear systems: A survey
• Orderings for Incomplete Factorization Preconditioning of Nonsymmetric Problems
• An improved incomplete Cholesky factorization
• Crout Versions of ILU for General Sparse Matrices
• Performance of Greedy Ordering Heuristics for Sparse Cholesky Factorization
• Incomplete Cholesky Factorizations with Limited Memory
• ILUT: A dual threshold incomplete LU factorization
• Alternative Weighted Dropping Strategies for ILUTP
• Effective Preconditioning through Ordering Interleaved with Incomplete Factorization
• A robust ILU with pivoting based on monitoring the growth of the inverse factors

This page was built for publication: Flexible incomplete Cholesky factorization with multi‐parameters to control the number of nonzero elements in preconditioners